./Ultimate.py --spec /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/properties/unreach-call.prp --file /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-a_file-13.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version a046e57d Calling Ultimate with: /root/.sdkman/candidates/java/current/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 /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-a_file-13.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 e6d92a25ae36f7e711770b5cc6315f0210bbc7c0c024aaddffcd3216b7942769 --- Real Ultimate output --- This is Ultimate 0.2.5-tmp.dk.eval-mul-div-a046e57-m [2024-10-13 05:54:24,168 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-10-13 05:54:24,234 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2024-10-13 05:54:24,241 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-10-13 05:54:24,241 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-10-13 05:54:24,264 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-10-13 05:54:24,266 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-10-13 05:54:24,266 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-10-13 05:54:24,267 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-10-13 05:54:24,267 INFO L153 SettingsManager]: * Use memory slicer=true [2024-10-13 05:54:24,267 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-10-13 05:54:24,267 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-10-13 05:54:24,268 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-10-13 05:54:24,268 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-10-13 05:54:24,268 INFO L153 SettingsManager]: * Use SBE=true [2024-10-13 05:54:24,269 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-10-13 05:54:24,269 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-10-13 05:54:24,272 INFO L153 SettingsManager]: * sizeof long=4 [2024-10-13 05:54:24,272 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-10-13 05:54:24,272 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-10-13 05:54:24,273 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-10-13 05:54:24,275 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-10-13 05:54:24,276 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-10-13 05:54:24,276 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-10-13 05:54:24,276 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-10-13 05:54:24,276 INFO L153 SettingsManager]: * sizeof long double=12 [2024-10-13 05:54:24,277 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-10-13 05:54:24,277 INFO L153 SettingsManager]: * Use constant arrays=true [2024-10-13 05:54:24,277 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-10-13 05:54:24,277 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-10-13 05:54:24,277 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-10-13 05:54:24,277 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-10-13 05:54:24,277 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-13 05:54:24,278 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-10-13 05:54:24,278 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-10-13 05:54:24,278 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-10-13 05:54:24,278 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-10-13 05:54:24,278 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-10-13 05:54:24,278 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-10-13 05:54:24,279 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-10-13 05:54:24,279 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-10-13 05:54:24,280 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-10-13 05:54:24,280 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 -> e6d92a25ae36f7e711770b5cc6315f0210bbc7c0c024aaddffcd3216b7942769 [2024-10-13 05:54:24,538 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-10-13 05:54:24,564 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-10-13 05:54:24,567 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-10-13 05:54:24,568 INFO L270 PluginConnector]: Initializing CDTParser... [2024-10-13 05:54:24,569 INFO L274 PluginConnector]: CDTParser initialized [2024-10-13 05:54:24,570 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-a_file-13.i [2024-10-13 05:54:25,887 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-10-13 05:54:26,072 INFO L384 CDTParser]: Found 1 translation units. [2024-10-13 05:54:26,073 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-a_file-13.i [2024-10-13 05:54:26,081 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/bf6ed4b04/fae0d5bcab66457ba520774cc5e77400/FLAGf81d45181 [2024-10-13 05:54:26,453 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/bf6ed4b04/fae0d5bcab66457ba520774cc5e77400 [2024-10-13 05:54:26,456 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-10-13 05:54:26,457 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-10-13 05:54:26,461 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-10-13 05:54:26,461 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-10-13 05:54:26,466 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-10-13 05:54:26,467 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 13.10 05:54:26" (1/1) ... [2024-10-13 05:54:26,469 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@3fabfa98 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 05:54:26, skipping insertion in model container [2024-10-13 05:54:26,469 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 13.10 05:54:26" (1/1) ... [2024-10-13 05:54:26,495 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-10-13 05:54:26,658 WARN L248 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-a_file-13.i[916,929] [2024-10-13 05:54:26,726 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-13 05:54:26,747 INFO L200 MainTranslator]: Completed pre-run [2024-10-13 05:54:26,757 WARN L248 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-a_file-13.i[916,929] [2024-10-13 05:54:26,805 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-13 05:54:26,831 INFO L204 MainTranslator]: Completed translation [2024-10-13 05:54:26,832 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 05:54:26 WrapperNode [2024-10-13 05:54:26,832 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-10-13 05:54:26,833 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-10-13 05:54:26,833 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-10-13 05:54:26,833 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-10-13 05:54:26,850 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 05:54:26" (1/1) ... [2024-10-13 05:54:26,867 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 05:54:26" (1/1) ... [2024-10-13 05:54:26,915 INFO L138 Inliner]: procedures = 29, calls = 146, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 475 [2024-10-13 05:54:26,918 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-10-13 05:54:26,919 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-10-13 05:54:26,919 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-10-13 05:54:26,920 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-10-13 05:54:26,932 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 05:54:26" (1/1) ... [2024-10-13 05:54:26,932 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 05:54:26" (1/1) ... [2024-10-13 05:54:26,942 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 05:54:26" (1/1) ... [2024-10-13 05:54:26,963 INFO L175 MemorySlicer]: Split 115 memory accesses to 6 slices as follows [2, 8, 34, 31, 23, 17]. 30 percent of accesses are in the largest equivalence class. The 15 initializations are split as follows [2, 1, 4, 4, 1, 3]. The 15 writes are split as follows [0, 1, 4, 5, 1, 4]. [2024-10-13 05:54:26,964 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 05:54:26" (1/1) ... [2024-10-13 05:54:26,964 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 05:54:26" (1/1) ... [2024-10-13 05:54:26,982 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 05:54:26" (1/1) ... [2024-10-13 05:54:26,990 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 05:54:26" (1/1) ... [2024-10-13 05:54:26,993 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 05:54:26" (1/1) ... [2024-10-13 05:54:26,995 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 05:54:26" (1/1) ... [2024-10-13 05:54:27,001 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-10-13 05:54:27,003 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-10-13 05:54:27,003 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-10-13 05:54:27,003 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-10-13 05:54:27,004 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 05:54:26" (1/1) ... [2024-10-13 05:54:27,009 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-13 05:54:27,019 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-13 05:54:27,039 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-10-13 05:54:27,042 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-10-13 05:54:27,086 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-10-13 05:54:27,086 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#0 [2024-10-13 05:54:27,087 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#1 [2024-10-13 05:54:27,087 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#2 [2024-10-13 05:54:27,087 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#3 [2024-10-13 05:54:27,088 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#4 [2024-10-13 05:54:27,088 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#5 [2024-10-13 05:54:27,089 INFO L130 BoogieDeclarations]: Found specification of procedure read~real#0 [2024-10-13 05:54:27,089 INFO L130 BoogieDeclarations]: Found specification of procedure read~real#1 [2024-10-13 05:54:27,089 INFO L130 BoogieDeclarations]: Found specification of procedure read~real#2 [2024-10-13 05:54:27,089 INFO L130 BoogieDeclarations]: Found specification of procedure read~real#3 [2024-10-13 05:54:27,090 INFO L130 BoogieDeclarations]: Found specification of procedure read~real#4 [2024-10-13 05:54:27,090 INFO L130 BoogieDeclarations]: Found specification of procedure read~real#5 [2024-10-13 05:54:27,090 INFO L130 BoogieDeclarations]: Found specification of procedure write~real#0 [2024-10-13 05:54:27,090 INFO L130 BoogieDeclarations]: Found specification of procedure write~real#1 [2024-10-13 05:54:27,090 INFO L130 BoogieDeclarations]: Found specification of procedure write~real#2 [2024-10-13 05:54:27,090 INFO L130 BoogieDeclarations]: Found specification of procedure write~real#3 [2024-10-13 05:54:27,090 INFO L130 BoogieDeclarations]: Found specification of procedure write~real#4 [2024-10-13 05:54:27,090 INFO L130 BoogieDeclarations]: Found specification of procedure write~real#5 [2024-10-13 05:54:27,090 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#0 [2024-10-13 05:54:27,091 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#1 [2024-10-13 05:54:27,091 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#2 [2024-10-13 05:54:27,091 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#3 [2024-10-13 05:54:27,091 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#4 [2024-10-13 05:54:27,091 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#5 [2024-10-13 05:54:27,091 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~real#0 [2024-10-13 05:54:27,091 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~real#1 [2024-10-13 05:54:27,091 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~real#2 [2024-10-13 05:54:27,091 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~real#3 [2024-10-13 05:54:27,091 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~real#4 [2024-10-13 05:54:27,092 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~real#5 [2024-10-13 05:54:27,092 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2024-10-13 05:54:27,092 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2024-10-13 05:54:27,092 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-10-13 05:54:27,092 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#1 [2024-10-13 05:54:27,092 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#2 [2024-10-13 05:54:27,092 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#3 [2024-10-13 05:54:27,092 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#4 [2024-10-13 05:54:27,092 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#5 [2024-10-13 05:54:27,092 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-10-13 05:54:27,092 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-10-13 05:54:27,295 INFO L238 CfgBuilder]: Building ICFG [2024-10-13 05:54:27,298 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-10-13 05:54:27,704 INFO L? ?]: Removed 126 outVars from TransFormulas that were not future-live. [2024-10-13 05:54:27,704 INFO L287 CfgBuilder]: Performing block encoding [2024-10-13 05:54:27,734 INFO L309 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-10-13 05:54:27,734 INFO L314 CfgBuilder]: Removed 1 assume(true) statements. [2024-10-13 05:54:27,735 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 13.10 05:54:27 BoogieIcfgContainer [2024-10-13 05:54:27,735 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-10-13 05:54:27,737 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-10-13 05:54:27,737 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-10-13 05:54:27,740 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-10-13 05:54:27,740 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 13.10 05:54:26" (1/3) ... [2024-10-13 05:54:27,741 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3b959261 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 13.10 05:54:27, skipping insertion in model container [2024-10-13 05:54:27,741 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 05:54:26" (2/3) ... [2024-10-13 05:54:27,741 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3b959261 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 13.10 05:54:27, skipping insertion in model container [2024-10-13 05:54:27,742 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 13.10 05:54:27" (3/3) ... [2024-10-13 05:54:27,743 INFO L112 eAbstractionObserver]: Analyzing ICFG hardness_variablewrapping_wrapper-a_file-13.i [2024-10-13 05:54:27,757 INFO L209 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-10-13 05:54:27,758 INFO L149 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-10-13 05:54:27,808 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-10-13 05:54:27,814 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;@35a80f3d, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-10-13 05:54:27,815 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-10-13 05:54:27,818 INFO L276 IsEmpty]: Start isEmpty. Operand has 105 states, 87 states have (on average 1.4827586206896552) internal successors, (129), 88 states have internal predecessors, (129), 15 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 15 states have call predecessors, (15), 15 states have call successors, (15) [2024-10-13 05:54:27,829 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 127 [2024-10-13 05:54:27,829 INFO L207 NwaCegarLoop]: Found error trace [2024-10-13 05:54:27,830 INFO L215 NwaCegarLoop]: trace histogram [15, 15, 15, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-13 05:54:27,831 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-13 05:54:27,835 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 05:54:27,835 INFO L85 PathProgramCache]: Analyzing trace with hash 1643118379, now seen corresponding path program 1 times [2024-10-13 05:54:27,842 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-13 05:54:27,842 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1770496648] [2024-10-13 05:54:27,842 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 05:54:27,843 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-13 05:54:27,955 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 05:54:28,084 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-13 05:54:28,088 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 05:54:28,092 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2024-10-13 05:54:28,094 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 05:54:28,097 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-10-13 05:54:28,099 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 05:54:28,101 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2024-10-13 05:54:28,102 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 05:54:28,104 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2024-10-13 05:54:28,108 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 05:54:28,110 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2024-10-13 05:54:28,112 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 05:54:28,115 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2024-10-13 05:54:28,116 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 05:54:28,121 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2024-10-13 05:54:28,127 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 05:54:28,129 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2024-10-13 05:54:28,131 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 05:54:28,138 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2024-10-13 05:54:28,140 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 05:54:28,142 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2024-10-13 05:54:28,144 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 05:54:28,146 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 80 [2024-10-13 05:54:28,147 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 05:54:28,149 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 86 [2024-10-13 05:54:28,151 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 05:54:28,153 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 92 [2024-10-13 05:54:28,157 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 05:54:28,159 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 98 [2024-10-13 05:54:28,162 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 05:54:28,168 INFO L134 CoverageAnalysis]: Checked inductivity of 420 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 420 trivial. 0 not checked. [2024-10-13 05:54:28,168 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-13 05:54:28,169 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1770496648] [2024-10-13 05:54:28,171 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1770496648] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-13 05:54:28,171 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-13 05:54:28,171 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-13 05:54:28,173 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [363836999] [2024-10-13 05:54:28,173 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-13 05:54:28,179 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-10-13 05:54:28,179 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-13 05:54:28,204 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-10-13 05:54:28,206 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-10-13 05:54:28,209 INFO L87 Difference]: Start difference. First operand has 105 states, 87 states have (on average 1.4827586206896552) internal successors, (129), 88 states have internal predecessors, (129), 15 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 15 states have call predecessors, (15), 15 states have call successors, (15) Second operand has 2 states, 2 states have (on average 27.0) internal successors, (54), 2 states have internal predecessors, (54), 2 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 2 states have call successors, (15) [2024-10-13 05:54:28,250 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-13 05:54:28,251 INFO L93 Difference]: Finished difference Result 207 states and 331 transitions. [2024-10-13 05:54:28,253 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-10-13 05:54:28,255 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 27.0) internal successors, (54), 2 states have internal predecessors, (54), 2 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 2 states have call successors, (15) Word has length 126 [2024-10-13 05:54:28,255 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-13 05:54:28,261 INFO L225 Difference]: With dead ends: 207 [2024-10-13 05:54:28,262 INFO L226 Difference]: Without dead ends: 103 [2024-10-13 05:54:28,265 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 47 GetRequests, 47 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-10-13 05:54:28,269 INFO L432 NwaCegarLoop]: 150 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 4 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 150 SdHoareTripleChecker+Invalid, 4 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 4 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-13 05:54:28,271 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 150 Invalid, 4 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 4 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-13 05:54:28,296 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 103 states. [2024-10-13 05:54:28,327 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 103 to 103. [2024-10-13 05:54:28,328 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 103 states, 86 states have (on average 1.441860465116279) internal successors, (124), 86 states have internal predecessors, (124), 15 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 15 states have call predecessors, (15), 15 states have call successors, (15) [2024-10-13 05:54:28,329 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 103 states to 103 states and 154 transitions. [2024-10-13 05:54:28,331 INFO L78 Accepts]: Start accepts. Automaton has 103 states and 154 transitions. Word has length 126 [2024-10-13 05:54:28,332 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-13 05:54:28,332 INFO L471 AbstractCegarLoop]: Abstraction has 103 states and 154 transitions. [2024-10-13 05:54:28,332 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 27.0) internal successors, (54), 2 states have internal predecessors, (54), 2 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 2 states have call successors, (15) [2024-10-13 05:54:28,332 INFO L276 IsEmpty]: Start isEmpty. Operand 103 states and 154 transitions. [2024-10-13 05:54:28,335 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 127 [2024-10-13 05:54:28,335 INFO L207 NwaCegarLoop]: Found error trace [2024-10-13 05:54:28,335 INFO L215 NwaCegarLoop]: trace histogram [15, 15, 15, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-13 05:54:28,335 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-10-13 05:54:28,335 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-13 05:54:28,336 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 05:54:28,336 INFO L85 PathProgramCache]: Analyzing trace with hash 1226582997, now seen corresponding path program 1 times [2024-10-13 05:54:28,336 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-13 05:54:28,336 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1463808928] [2024-10-13 05:54:28,337 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 05:54:28,337 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-13 05:54:28,415 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 05:54:28,648 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-13 05:54:28,650 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 05:54:28,654 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2024-10-13 05:54:28,657 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 05:54:28,660 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-10-13 05:54:28,663 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 05:54:28,666 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2024-10-13 05:54:28,669 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 05:54:28,671 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2024-10-13 05:54:28,673 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 05:54:28,676 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2024-10-13 05:54:28,680 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 05:54:28,684 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2024-10-13 05:54:28,687 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 05:54:28,689 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2024-10-13 05:54:28,691 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 05:54:28,693 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2024-10-13 05:54:28,697 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 05:54:28,700 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2024-10-13 05:54:28,701 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 05:54:28,703 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2024-10-13 05:54:28,704 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 05:54:28,707 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 80 [2024-10-13 05:54:28,708 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 05:54:28,710 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 86 [2024-10-13 05:54:28,711 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 05:54:28,713 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 92 [2024-10-13 05:54:28,714 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 05:54:28,716 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 98 [2024-10-13 05:54:28,717 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 05:54:28,724 INFO L134 CoverageAnalysis]: Checked inductivity of 420 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 420 trivial. 0 not checked. [2024-10-13 05:54:28,725 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-13 05:54:28,725 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1463808928] [2024-10-13 05:54:28,725 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1463808928] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-13 05:54:28,725 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-13 05:54:28,725 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-10-13 05:54:28,726 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1266514870] [2024-10-13 05:54:28,726 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-13 05:54:28,727 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-10-13 05:54:28,728 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-13 05:54:28,728 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-10-13 05:54:28,728 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-10-13 05:54:28,729 INFO L87 Difference]: Start difference. First operand 103 states and 154 transitions. Second operand has 4 states, 4 states have (on average 13.5) internal successors, (54), 4 states have internal predecessors, (54), 2 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 2 states have call predecessors, (15), 2 states have call successors, (15) [2024-10-13 05:54:28,774 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-13 05:54:28,774 INFO L93 Difference]: Finished difference Result 207 states and 310 transitions. [2024-10-13 05:54:28,775 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-10-13 05:54:28,775 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 13.5) internal successors, (54), 4 states have internal predecessors, (54), 2 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 2 states have call predecessors, (15), 2 states have call successors, (15) Word has length 126 [2024-10-13 05:54:28,775 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-13 05:54:28,777 INFO L225 Difference]: With dead ends: 207 [2024-10-13 05:54:28,777 INFO L226 Difference]: Without dead ends: 105 [2024-10-13 05:54:28,778 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 34 GetRequests, 32 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-10-13 05:54:28,781 INFO L432 NwaCegarLoop]: 148 mSDtfsCounter, 0 mSDsluCounter, 289 mSDsCounter, 0 mSdLazyCounter, 24 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 437 SdHoareTripleChecker+Invalid, 24 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 24 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-13 05:54:28,781 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 437 Invalid, 24 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 24 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-13 05:54:28,782 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 105 states. [2024-10-13 05:54:28,792 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 105 to 105. [2024-10-13 05:54:28,792 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 105 states, 88 states have (on average 1.4318181818181819) internal successors, (126), 88 states have internal predecessors, (126), 15 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 15 states have call predecessors, (15), 15 states have call successors, (15) [2024-10-13 05:54:28,793 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 105 states to 105 states and 156 transitions. [2024-10-13 05:54:28,794 INFO L78 Accepts]: Start accepts. Automaton has 105 states and 156 transitions. Word has length 126 [2024-10-13 05:54:28,795 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-13 05:54:28,795 INFO L471 AbstractCegarLoop]: Abstraction has 105 states and 156 transitions. [2024-10-13 05:54:28,795 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 13.5) internal successors, (54), 4 states have internal predecessors, (54), 2 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 2 states have call predecessors, (15), 2 states have call successors, (15) [2024-10-13 05:54:28,795 INFO L276 IsEmpty]: Start isEmpty. Operand 105 states and 156 transitions. [2024-10-13 05:54:28,796 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 127 [2024-10-13 05:54:28,796 INFO L207 NwaCegarLoop]: Found error trace [2024-10-13 05:54:28,798 INFO L215 NwaCegarLoop]: trace histogram [15, 15, 15, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-13 05:54:28,798 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-10-13 05:54:28,799 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-13 05:54:28,799 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 05:54:28,799 INFO L85 PathProgramCache]: Analyzing trace with hash 755226647, now seen corresponding path program 1 times [2024-10-13 05:54:28,800 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-13 05:54:28,800 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [145359136] [2024-10-13 05:54:28,800 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 05:54:28,800 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-13 05:54:28,856 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 05:54:29,072 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-13 05:54:29,074 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 05:54:29,077 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2024-10-13 05:54:29,079 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 05:54:29,084 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-10-13 05:54:29,085 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 05:54:29,088 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2024-10-13 05:54:29,090 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 05:54:29,093 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2024-10-13 05:54:29,095 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 05:54:29,097 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2024-10-13 05:54:29,098 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 05:54:29,100 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2024-10-13 05:54:29,101 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 05:54:29,104 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2024-10-13 05:54:29,105 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 05:54:29,107 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2024-10-13 05:54:29,109 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 05:54:29,111 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2024-10-13 05:54:29,112 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 05:54:29,114 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2024-10-13 05:54:29,116 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 05:54:29,118 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 80 [2024-10-13 05:54:29,119 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 05:54:29,121 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 86 [2024-10-13 05:54:29,123 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 05:54:29,125 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 92 [2024-10-13 05:54:29,126 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 05:54:29,128 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 98 [2024-10-13 05:54:29,130 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 05:54:29,132 INFO L134 CoverageAnalysis]: Checked inductivity of 420 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 420 trivial. 0 not checked. [2024-10-13 05:54:29,133 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-13 05:54:29,133 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [145359136] [2024-10-13 05:54:29,133 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [145359136] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-13 05:54:29,133 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-13 05:54:29,133 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-10-13 05:54:29,134 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1480509643] [2024-10-13 05:54:29,134 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-13 05:54:29,134 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-10-13 05:54:29,135 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-13 05:54:29,135 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-10-13 05:54:29,136 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-10-13 05:54:29,136 INFO L87 Difference]: Start difference. First operand 105 states and 156 transitions. Second operand has 4 states, 4 states have (on average 13.5) internal successors, (54), 4 states have internal predecessors, (54), 1 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 1 states have call successors, (15) [2024-10-13 05:54:29,170 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-13 05:54:29,170 INFO L93 Difference]: Finished difference Result 211 states and 314 transitions. [2024-10-13 05:54:29,171 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-10-13 05:54:29,171 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 13.5) internal successors, (54), 4 states have internal predecessors, (54), 1 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 1 states have call successors, (15) Word has length 126 [2024-10-13 05:54:29,171 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-13 05:54:29,172 INFO L225 Difference]: With dead ends: 211 [2024-10-13 05:54:29,172 INFO L226 Difference]: Without dead ends: 107 [2024-10-13 05:54:29,173 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 35 GetRequests, 33 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-10-13 05:54:29,174 INFO L432 NwaCegarLoop]: 148 mSDtfsCounter, 0 mSDsluCounter, 289 mSDsCounter, 0 mSdLazyCounter, 24 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 437 SdHoareTripleChecker+Invalid, 24 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 24 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-13 05:54:29,174 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 437 Invalid, 24 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 24 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-13 05:54:29,175 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 107 states. [2024-10-13 05:54:29,184 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 107 to 107. [2024-10-13 05:54:29,184 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 107 states, 90 states have (on average 1.4222222222222223) internal successors, (128), 90 states have internal predecessors, (128), 15 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 15 states have call predecessors, (15), 15 states have call successors, (15) [2024-10-13 05:54:29,185 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 107 states to 107 states and 158 transitions. [2024-10-13 05:54:29,186 INFO L78 Accepts]: Start accepts. Automaton has 107 states and 158 transitions. Word has length 126 [2024-10-13 05:54:29,186 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-13 05:54:29,186 INFO L471 AbstractCegarLoop]: Abstraction has 107 states and 158 transitions. [2024-10-13 05:54:29,186 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 13.5) internal successors, (54), 4 states have internal predecessors, (54), 1 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 1 states have call successors, (15) [2024-10-13 05:54:29,186 INFO L276 IsEmpty]: Start isEmpty. Operand 107 states and 158 transitions. [2024-10-13 05:54:29,188 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 129 [2024-10-13 05:54:29,188 INFO L207 NwaCegarLoop]: Found error trace [2024-10-13 05:54:29,188 INFO L215 NwaCegarLoop]: trace histogram [15, 15, 15, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-13 05:54:29,188 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-10-13 05:54:29,188 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-13 05:54:29,188 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 05:54:29,188 INFO L85 PathProgramCache]: Analyzing trace with hash 961133180, now seen corresponding path program 1 times [2024-10-13 05:54:29,189 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-13 05:54:29,189 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [606052895] [2024-10-13 05:54:29,189 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 05:54:29,189 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-13 05:54:29,246 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 05:54:29,472 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-13 05:54:29,474 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 05:54:29,476 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2024-10-13 05:54:29,478 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 05:54:29,481 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-10-13 05:54:29,483 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 05:54:29,485 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2024-10-13 05:54:29,487 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 05:54:29,489 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2024-10-13 05:54:29,490 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 05:54:29,493 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2024-10-13 05:54:29,495 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 05:54:29,498 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2024-10-13 05:54:29,499 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 05:54:29,501 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2024-10-13 05:54:29,504 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 05:54:29,506 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2024-10-13 05:54:29,509 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 05:54:29,511 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2024-10-13 05:54:29,513 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 05:54:29,515 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2024-10-13 05:54:29,516 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 05:54:29,520 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 80 [2024-10-13 05:54:29,521 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 05:54:29,523 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 86 [2024-10-13 05:54:29,526 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 05:54:29,529 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 92 [2024-10-13 05:54:29,530 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 05:54:29,532 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 98 [2024-10-13 05:54:29,536 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 05:54:29,539 INFO L134 CoverageAnalysis]: Checked inductivity of 420 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 420 trivial. 0 not checked. [2024-10-13 05:54:29,540 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-13 05:54:29,540 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [606052895] [2024-10-13 05:54:29,540 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [606052895] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-13 05:54:29,540 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-13 05:54:29,540 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-10-13 05:54:29,540 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [35929341] [2024-10-13 05:54:29,541 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-13 05:54:29,542 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-10-13 05:54:29,542 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-13 05:54:29,542 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-10-13 05:54:29,542 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-10-13 05:54:29,543 INFO L87 Difference]: Start difference. First operand 107 states and 158 transitions. Second operand has 4 states, 4 states have (on average 14.0) internal successors, (56), 4 states have internal predecessors, (56), 1 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 1 states have call successors, (15) [2024-10-13 05:54:29,637 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-13 05:54:29,637 INFO L93 Difference]: Finished difference Result 319 states and 472 transitions. [2024-10-13 05:54:29,638 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-10-13 05:54:29,638 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 14.0) internal successors, (56), 4 states have internal predecessors, (56), 1 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 1 states have call successors, (15) Word has length 128 [2024-10-13 05:54:29,638 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-13 05:54:29,640 INFO L225 Difference]: With dead ends: 319 [2024-10-13 05:54:29,640 INFO L226 Difference]: Without dead ends: 213 [2024-10-13 05:54:29,640 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 35 GetRequests, 32 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-10-13 05:54:29,645 INFO L432 NwaCegarLoop]: 137 mSDtfsCounter, 102 mSDsluCounter, 270 mSDsCounter, 0 mSdLazyCounter, 54 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 102 SdHoareTripleChecker+Valid, 407 SdHoareTripleChecker+Invalid, 56 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 54 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-13 05:54:29,645 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [102 Valid, 407 Invalid, 56 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 54 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-13 05:54:29,646 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 213 states. [2024-10-13 05:54:29,662 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 213 to 209. [2024-10-13 05:54:29,663 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 209 states, 176 states have (on average 1.4204545454545454) internal successors, (250), 176 states have internal predecessors, (250), 30 states have call successors, (30), 2 states have call predecessors, (30), 2 states have return successors, (30), 30 states have call predecessors, (30), 30 states have call successors, (30) [2024-10-13 05:54:29,664 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 209 states to 209 states and 310 transitions. [2024-10-13 05:54:29,665 INFO L78 Accepts]: Start accepts. Automaton has 209 states and 310 transitions. Word has length 128 [2024-10-13 05:54:29,665 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-13 05:54:29,665 INFO L471 AbstractCegarLoop]: Abstraction has 209 states and 310 transitions. [2024-10-13 05:54:29,666 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 14.0) internal successors, (56), 4 states have internal predecessors, (56), 1 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 1 states have call successors, (15) [2024-10-13 05:54:29,666 INFO L276 IsEmpty]: Start isEmpty. Operand 209 states and 310 transitions. [2024-10-13 05:54:29,667 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 129 [2024-10-13 05:54:29,667 INFO L207 NwaCegarLoop]: Found error trace [2024-10-13 05:54:29,667 INFO L215 NwaCegarLoop]: trace histogram [15, 15, 15, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-13 05:54:29,667 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2024-10-13 05:54:29,668 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-13 05:54:29,668 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 05:54:29,668 INFO L85 PathProgramCache]: Analyzing trace with hash -727810562, now seen corresponding path program 1 times [2024-10-13 05:54:29,668 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-13 05:54:29,668 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [581403806] [2024-10-13 05:54:29,669 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 05:54:29,669 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-13 05:54:29,713 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 05:54:29,915 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-13 05:54:29,916 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 05:54:29,918 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2024-10-13 05:54:29,918 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 05:54:29,920 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-10-13 05:54:29,921 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 05:54:29,922 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2024-10-13 05:54:29,923 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 05:54:29,924 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2024-10-13 05:54:29,925 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 05:54:29,927 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2024-10-13 05:54:29,928 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 05:54:29,930 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2024-10-13 05:54:29,932 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 05:54:29,935 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2024-10-13 05:54:29,936 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 05:54:29,938 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2024-10-13 05:54:29,939 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 05:54:29,940 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2024-10-13 05:54:29,941 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 05:54:29,946 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2024-10-13 05:54:29,947 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 05:54:29,949 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 80 [2024-10-13 05:54:29,950 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 05:54:29,952 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 86 [2024-10-13 05:54:29,954 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 05:54:29,955 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 92 [2024-10-13 05:54:29,957 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 05:54:29,958 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 98 [2024-10-13 05:54:29,959 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 05:54:29,961 INFO L134 CoverageAnalysis]: Checked inductivity of 420 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 420 trivial. 0 not checked. [2024-10-13 05:54:29,961 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-13 05:54:29,962 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [581403806] [2024-10-13 05:54:29,965 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [581403806] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-13 05:54:29,965 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-13 05:54:29,965 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-13 05:54:29,965 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [626221421] [2024-10-13 05:54:29,965 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-13 05:54:29,966 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-13 05:54:29,966 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-13 05:54:29,966 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-13 05:54:29,966 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-13 05:54:29,967 INFO L87 Difference]: Start difference. First operand 209 states and 310 transitions. Second operand has 3 states, 3 states have (on average 18.666666666666668) internal successors, (56), 3 states have internal predecessors, (56), 1 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 1 states have call successors, (15) [2024-10-13 05:54:29,995 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-13 05:54:29,999 INFO L93 Difference]: Finished difference Result 417 states and 619 transitions. [2024-10-13 05:54:30,000 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-13 05:54:30,000 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 18.666666666666668) internal successors, (56), 3 states have internal predecessors, (56), 1 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 1 states have call successors, (15) Word has length 128 [2024-10-13 05:54:30,001 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-13 05:54:30,002 INFO L225 Difference]: With dead ends: 417 [2024-10-13 05:54:30,002 INFO L226 Difference]: Without dead ends: 209 [2024-10-13 05:54:30,003 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 34 GetRequests, 33 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-10-13 05:54:30,006 INFO L432 NwaCegarLoop]: 148 mSDtfsCounter, 0 mSDsluCounter, 146 mSDsCounter, 0 mSdLazyCounter, 11 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 294 SdHoareTripleChecker+Invalid, 11 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 11 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-13 05:54:30,007 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 294 Invalid, 11 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 11 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-13 05:54:30,008 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 209 states. [2024-10-13 05:54:30,022 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 209 to 209. [2024-10-13 05:54:30,023 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 209 states, 176 states have (on average 1.4090909090909092) internal successors, (248), 176 states have internal predecessors, (248), 30 states have call successors, (30), 2 states have call predecessors, (30), 2 states have return successors, (30), 30 states have call predecessors, (30), 30 states have call successors, (30) [2024-10-13 05:54:30,024 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 209 states to 209 states and 308 transitions. [2024-10-13 05:54:30,024 INFO L78 Accepts]: Start accepts. Automaton has 209 states and 308 transitions. Word has length 128 [2024-10-13 05:54:30,025 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-13 05:54:30,025 INFO L471 AbstractCegarLoop]: Abstraction has 209 states and 308 transitions. [2024-10-13 05:54:30,025 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 18.666666666666668) internal successors, (56), 3 states have internal predecessors, (56), 1 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 1 states have call successors, (15) [2024-10-13 05:54:30,025 INFO L276 IsEmpty]: Start isEmpty. Operand 209 states and 308 transitions. [2024-10-13 05:54:30,026 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 129 [2024-10-13 05:54:30,026 INFO L207 NwaCegarLoop]: Found error trace [2024-10-13 05:54:30,027 INFO L215 NwaCegarLoop]: trace histogram [15, 15, 15, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-13 05:54:30,027 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2024-10-13 05:54:30,027 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-13 05:54:30,027 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 05:54:30,027 INFO L85 PathProgramCache]: Analyzing trace with hash -26745984, now seen corresponding path program 1 times [2024-10-13 05:54:30,028 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-13 05:54:30,028 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [517656968] [2024-10-13 05:54:30,028 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 05:54:30,028 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-13 05:54:30,088 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 05:54:30,513 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-13 05:54:30,514 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 05:54:30,515 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2024-10-13 05:54:30,516 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 05:54:30,519 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-10-13 05:54:30,520 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 05:54:30,521 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2024-10-13 05:54:30,522 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 05:54:30,524 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2024-10-13 05:54:30,527 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 05:54:30,528 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2024-10-13 05:54:30,529 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 05:54:30,530 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2024-10-13 05:54:30,532 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 05:54:30,534 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2024-10-13 05:54:30,535 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 05:54:30,536 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2024-10-13 05:54:30,537 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 05:54:30,538 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2024-10-13 05:54:30,539 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 05:54:30,540 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2024-10-13 05:54:30,541 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 05:54:30,542 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 80 [2024-10-13 05:54:30,543 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 05:54:30,545 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 86 [2024-10-13 05:54:30,545 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 05:54:30,546 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 92 [2024-10-13 05:54:30,547 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 05:54:30,548 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 98 [2024-10-13 05:54:30,549 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 05:54:30,550 INFO L134 CoverageAnalysis]: Checked inductivity of 420 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 420 trivial. 0 not checked. [2024-10-13 05:54:30,550 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-13 05:54:30,550 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [517656968] [2024-10-13 05:54:30,551 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [517656968] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-13 05:54:30,551 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-13 05:54:30,551 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-10-13 05:54:30,551 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [4227805] [2024-10-13 05:54:30,552 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-13 05:54:30,552 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-10-13 05:54:30,553 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-13 05:54:30,553 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-10-13 05:54:30,553 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2024-10-13 05:54:30,554 INFO L87 Difference]: Start difference. First operand 209 states and 308 transitions. Second operand has 6 states, 5 states have (on average 11.2) internal successors, (56), 6 states have internal predecessors, (56), 2 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 2 states have call successors, (15) [2024-10-13 05:54:30,619 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-13 05:54:30,619 INFO L93 Difference]: Finished difference Result 462 states and 680 transitions. [2024-10-13 05:54:30,620 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-10-13 05:54:30,620 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 11.2) internal successors, (56), 6 states have internal predecessors, (56), 2 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 2 states have call successors, (15) Word has length 128 [2024-10-13 05:54:30,620 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-13 05:54:30,621 INFO L225 Difference]: With dead ends: 462 [2024-10-13 05:54:30,621 INFO L226 Difference]: Without dead ends: 254 [2024-10-13 05:54:30,622 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 38 GetRequests, 33 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-10-13 05:54:30,623 INFO L432 NwaCegarLoop]: 144 mSDtfsCounter, 57 mSDsluCounter, 560 mSDsCounter, 0 mSdLazyCounter, 64 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 58 SdHoareTripleChecker+Valid, 704 SdHoareTripleChecker+Invalid, 64 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 64 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-13 05:54:30,623 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [58 Valid, 704 Invalid, 64 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 64 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-13 05:54:30,624 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 254 states. [2024-10-13 05:54:30,631 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 254 to 214. [2024-10-13 05:54:30,632 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 214 states, 181 states have (on average 1.4033149171270718) internal successors, (254), 181 states have internal predecessors, (254), 30 states have call successors, (30), 2 states have call predecessors, (30), 2 states have return successors, (30), 30 states have call predecessors, (30), 30 states have call successors, (30) [2024-10-13 05:54:30,632 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 214 states to 214 states and 314 transitions. [2024-10-13 05:54:30,633 INFO L78 Accepts]: Start accepts. Automaton has 214 states and 314 transitions. Word has length 128 [2024-10-13 05:54:30,633 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-13 05:54:30,633 INFO L471 AbstractCegarLoop]: Abstraction has 214 states and 314 transitions. [2024-10-13 05:54:30,633 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 11.2) internal successors, (56), 6 states have internal predecessors, (56), 2 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 2 states have call successors, (15) [2024-10-13 05:54:30,633 INFO L276 IsEmpty]: Start isEmpty. Operand 214 states and 314 transitions. [2024-10-13 05:54:30,634 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 129 [2024-10-13 05:54:30,634 INFO L207 NwaCegarLoop]: Found error trace [2024-10-13 05:54:30,634 INFO L215 NwaCegarLoop]: trace histogram [15, 15, 15, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-13 05:54:30,635 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2024-10-13 05:54:30,635 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-13 05:54:30,635 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 05:54:30,635 INFO L85 PathProgramCache]: Analyzing trace with hash -1047814338, now seen corresponding path program 1 times [2024-10-13 05:54:30,635 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-13 05:54:30,635 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [41392866] [2024-10-13 05:54:30,635 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 05:54:30,636 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-13 05:54:30,672 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 05:54:30,964 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-13 05:54:30,966 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 05:54:30,968 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2024-10-13 05:54:30,969 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 05:54:30,970 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-10-13 05:54:30,970 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 05:54:30,971 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2024-10-13 05:54:30,972 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 05:54:30,973 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2024-10-13 05:54:30,973 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 05:54:30,974 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2024-10-13 05:54:30,975 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 05:54:30,976 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2024-10-13 05:54:30,978 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 05:54:30,980 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2024-10-13 05:54:30,981 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 05:54:30,983 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2024-10-13 05:54:30,984 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 05:54:30,985 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2024-10-13 05:54:30,985 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 05:54:30,986 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2024-10-13 05:54:30,988 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 05:54:30,990 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 80 [2024-10-13 05:54:30,993 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 05:54:30,995 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 86 [2024-10-13 05:54:30,996 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 05:54:30,997 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 92 [2024-10-13 05:54:30,999 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 05:54:31,001 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 98 [2024-10-13 05:54:31,002 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 05:54:31,004 INFO L134 CoverageAnalysis]: Checked inductivity of 420 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 420 trivial. 0 not checked. [2024-10-13 05:54:31,005 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-13 05:54:31,005 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [41392866] [2024-10-13 05:54:31,005 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [41392866] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-13 05:54:31,005 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-13 05:54:31,005 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-10-13 05:54:31,005 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [812994703] [2024-10-13 05:54:31,005 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-13 05:54:31,006 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-10-13 05:54:31,006 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-13 05:54:31,006 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-10-13 05:54:31,006 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2024-10-13 05:54:31,007 INFO L87 Difference]: Start difference. First operand 214 states and 314 transitions. Second operand has 6 states, 5 states have (on average 11.2) internal successors, (56), 6 states have internal predecessors, (56), 2 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 2 states have call successors, (15) [2024-10-13 05:54:31,064 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-13 05:54:31,065 INFO L93 Difference]: Finished difference Result 459 states and 674 transitions. [2024-10-13 05:54:31,066 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-10-13 05:54:31,067 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 11.2) internal successors, (56), 6 states have internal predecessors, (56), 2 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 2 states have call successors, (15) Word has length 128 [2024-10-13 05:54:31,067 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-13 05:54:31,069 INFO L225 Difference]: With dead ends: 459 [2024-10-13 05:54:31,069 INFO L226 Difference]: Without dead ends: 246 [2024-10-13 05:54:31,070 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 38 GetRequests, 33 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-10-13 05:54:31,070 INFO L432 NwaCegarLoop]: 144 mSDtfsCounter, 98 mSDsluCounter, 422 mSDsCounter, 0 mSdLazyCounter, 50 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 99 SdHoareTripleChecker+Valid, 566 SdHoareTripleChecker+Invalid, 50 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 50 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-13 05:54:31,070 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [99 Valid, 566 Invalid, 50 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 50 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-13 05:54:31,071 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 246 states. [2024-10-13 05:54:31,083 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 246 to 218. [2024-10-13 05:54:31,084 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 218 states, 185 states have (on average 1.4054054054054055) internal successors, (260), 185 states have internal predecessors, (260), 30 states have call successors, (30), 2 states have call predecessors, (30), 2 states have return successors, (30), 30 states have call predecessors, (30), 30 states have call successors, (30) [2024-10-13 05:54:31,086 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 218 states to 218 states and 320 transitions. [2024-10-13 05:54:31,086 INFO L78 Accepts]: Start accepts. Automaton has 218 states and 320 transitions. Word has length 128 [2024-10-13 05:54:31,086 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-13 05:54:31,087 INFO L471 AbstractCegarLoop]: Abstraction has 218 states and 320 transitions. [2024-10-13 05:54:31,087 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 11.2) internal successors, (56), 6 states have internal predecessors, (56), 2 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 2 states have call successors, (15) [2024-10-13 05:54:31,087 INFO L276 IsEmpty]: Start isEmpty. Operand 218 states and 320 transitions. [2024-10-13 05:54:31,088 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 130 [2024-10-13 05:54:31,089 INFO L207 NwaCegarLoop]: Found error trace [2024-10-13 05:54:31,089 INFO L215 NwaCegarLoop]: trace histogram [15, 15, 15, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-13 05:54:31,090 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2024-10-13 05:54:31,090 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-13 05:54:31,090 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 05:54:31,090 INFO L85 PathProgramCache]: Analyzing trace with hash -1611336372, now seen corresponding path program 1 times [2024-10-13 05:54:31,090 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-13 05:54:31,091 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1858789556] [2024-10-13 05:54:31,091 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 05:54:31,091 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-13 05:54:31,118 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 05:54:31,465 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-13 05:54:31,466 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 05:54:31,467 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2024-10-13 05:54:31,468 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 05:54:31,469 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-10-13 05:54:31,470 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 05:54:31,471 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2024-10-13 05:54:31,472 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 05:54:31,474 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2024-10-13 05:54:31,475 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 05:54:31,476 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2024-10-13 05:54:31,477 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 05:54:31,479 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2024-10-13 05:54:31,479 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 05:54:31,483 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2024-10-13 05:54:31,484 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 05:54:31,486 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2024-10-13 05:54:31,488 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 05:54:31,489 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2024-10-13 05:54:31,490 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 05:54:31,491 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2024-10-13 05:54:31,492 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 05:54:31,493 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 80 [2024-10-13 05:54:31,494 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 05:54:31,495 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 86 [2024-10-13 05:54:31,496 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 05:54:31,497 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 92 [2024-10-13 05:54:31,498 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 05:54:31,499 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 98 [2024-10-13 05:54:31,500 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 05:54:31,503 INFO L134 CoverageAnalysis]: Checked inductivity of 420 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 420 trivial. 0 not checked. [2024-10-13 05:54:31,503 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-13 05:54:31,503 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1858789556] [2024-10-13 05:54:31,503 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1858789556] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-13 05:54:31,503 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-13 05:54:31,503 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-10-13 05:54:31,504 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1678062475] [2024-10-13 05:54:31,504 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-13 05:54:31,504 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-10-13 05:54:31,504 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-13 05:54:31,504 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-10-13 05:54:31,505 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2024-10-13 05:54:31,505 INFO L87 Difference]: Start difference. First operand 218 states and 320 transitions. Second operand has 6 states, 6 states have (on average 9.5) internal successors, (57), 6 states have internal predecessors, (57), 1 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 1 states have call successors, (15) [2024-10-13 05:54:31,639 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-13 05:54:31,640 INFO L93 Difference]: Finished difference Result 619 states and 905 transitions. [2024-10-13 05:54:31,640 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-10-13 05:54:31,640 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 9.5) internal successors, (57), 6 states have internal predecessors, (57), 1 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 1 states have call successors, (15) Word has length 129 [2024-10-13 05:54:31,641 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-13 05:54:31,643 INFO L225 Difference]: With dead ends: 619 [2024-10-13 05:54:31,643 INFO L226 Difference]: Without dead ends: 402 [2024-10-13 05:54:31,643 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 40 GetRequests, 33 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=21, Invalid=51, Unknown=0, NotChecked=0, Total=72 [2024-10-13 05:54:31,644 INFO L432 NwaCegarLoop]: 194 mSDtfsCounter, 113 mSDsluCounter, 702 mSDsCounter, 0 mSdLazyCounter, 133 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 113 SdHoareTripleChecker+Valid, 896 SdHoareTripleChecker+Invalid, 135 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 133 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-13 05:54:31,644 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [113 Valid, 896 Invalid, 135 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 133 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-13 05:54:31,645 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 402 states. [2024-10-13 05:54:31,658 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 402 to 398. [2024-10-13 05:54:31,659 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 398 states, 343 states have (on average 1.402332361516035) internal successors, (481), 345 states have internal predecessors, (481), 50 states have call successors, (50), 4 states have call predecessors, (50), 4 states have return successors, (50), 48 states have call predecessors, (50), 50 states have call successors, (50) [2024-10-13 05:54:31,661 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 398 states to 398 states and 581 transitions. [2024-10-13 05:54:31,661 INFO L78 Accepts]: Start accepts. Automaton has 398 states and 581 transitions. Word has length 129 [2024-10-13 05:54:31,662 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-13 05:54:31,662 INFO L471 AbstractCegarLoop]: Abstraction has 398 states and 581 transitions. [2024-10-13 05:54:31,662 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 9.5) internal successors, (57), 6 states have internal predecessors, (57), 1 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 1 states have call successors, (15) [2024-10-13 05:54:31,662 INFO L276 IsEmpty]: Start isEmpty. Operand 398 states and 581 transitions. [2024-10-13 05:54:31,663 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 130 [2024-10-13 05:54:31,663 INFO L207 NwaCegarLoop]: Found error trace [2024-10-13 05:54:31,663 INFO L215 NwaCegarLoop]: trace histogram [15, 15, 15, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-13 05:54:31,663 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2024-10-13 05:54:31,664 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-13 05:54:31,664 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 05:54:31,664 INFO L85 PathProgramCache]: Analyzing trace with hash -931278002, now seen corresponding path program 1 times [2024-10-13 05:54:31,664 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-13 05:54:31,664 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1998532418] [2024-10-13 05:54:31,664 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 05:54:31,664 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-13 05:54:31,690 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 05:54:31,723 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-13 05:54:31,724 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 05:54:31,725 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2024-10-13 05:54:31,726 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 05:54:31,727 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-10-13 05:54:31,728 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 05:54:31,729 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2024-10-13 05:54:31,730 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 05:54:31,731 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2024-10-13 05:54:31,732 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 05:54:31,732 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2024-10-13 05:54:31,733 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 05:54:31,734 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2024-10-13 05:54:31,735 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 05:54:31,736 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2024-10-13 05:54:31,737 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 05:54:31,739 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2024-10-13 05:54:31,740 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 05:54:31,741 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2024-10-13 05:54:31,742 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 05:54:31,743 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2024-10-13 05:54:31,744 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 05:54:31,745 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 80 [2024-10-13 05:54:31,746 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 05:54:31,747 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 86 [2024-10-13 05:54:31,748 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 05:54:31,749 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 92 [2024-10-13 05:54:31,750 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 05:54:31,751 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 98 [2024-10-13 05:54:31,752 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 05:54:31,754 INFO L134 CoverageAnalysis]: Checked inductivity of 420 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 420 trivial. 0 not checked. [2024-10-13 05:54:31,754 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-13 05:54:31,754 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1998532418] [2024-10-13 05:54:31,754 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1998532418] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-13 05:54:31,754 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-13 05:54:31,754 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-13 05:54:31,754 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2110724151] [2024-10-13 05:54:31,754 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-13 05:54:31,755 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-13 05:54:31,755 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-13 05:54:31,755 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-13 05:54:31,755 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-13 05:54:31,756 INFO L87 Difference]: Start difference. First operand 398 states and 581 transitions. Second operand has 3 states, 3 states have (on average 19.0) internal successors, (57), 3 states have internal predecessors, (57), 1 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 1 states have call successors, (15) [2024-10-13 05:54:31,784 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-13 05:54:31,785 INFO L93 Difference]: Finished difference Result 799 states and 1169 transitions. [2024-10-13 05:54:31,785 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-13 05:54:31,785 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 19.0) internal successors, (57), 3 states have internal predecessors, (57), 1 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 1 states have call successors, (15) Word has length 129 [2024-10-13 05:54:31,786 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-13 05:54:31,789 INFO L225 Difference]: With dead ends: 799 [2024-10-13 05:54:31,789 INFO L226 Difference]: Without dead ends: 402 [2024-10-13 05:54:31,790 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 33 GetRequests, 32 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-10-13 05:54:31,790 INFO L432 NwaCegarLoop]: 148 mSDtfsCounter, 0 mSDsluCounter, 143 mSDsCounter, 0 mSdLazyCounter, 14 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 291 SdHoareTripleChecker+Invalid, 14 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 14 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-13 05:54:31,791 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 291 Invalid, 14 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 14 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-13 05:54:31,791 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 402 states. [2024-10-13 05:54:31,805 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 402 to 402. [2024-10-13 05:54:31,806 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 402 states, 347 states have (on average 1.3976945244956773) internal successors, (485), 349 states have internal predecessors, (485), 50 states have call successors, (50), 4 states have call predecessors, (50), 4 states have return successors, (50), 48 states have call predecessors, (50), 50 states have call successors, (50) [2024-10-13 05:54:31,808 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 402 states to 402 states and 585 transitions. [2024-10-13 05:54:31,809 INFO L78 Accepts]: Start accepts. Automaton has 402 states and 585 transitions. Word has length 129 [2024-10-13 05:54:31,809 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-13 05:54:31,809 INFO L471 AbstractCegarLoop]: Abstraction has 402 states and 585 transitions. [2024-10-13 05:54:31,809 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 19.0) internal successors, (57), 3 states have internal predecessors, (57), 1 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 1 states have call successors, (15) [2024-10-13 05:54:31,810 INFO L276 IsEmpty]: Start isEmpty. Operand 402 states and 585 transitions. [2024-10-13 05:54:31,811 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 130 [2024-10-13 05:54:31,811 INFO L207 NwaCegarLoop]: Found error trace [2024-10-13 05:54:31,811 INFO L215 NwaCegarLoop]: trace histogram [15, 15, 15, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-13 05:54:31,811 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2024-10-13 05:54:31,811 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-13 05:54:31,812 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 05:54:31,812 INFO L85 PathProgramCache]: Analyzing trace with hash -1324305012, now seen corresponding path program 1 times [2024-10-13 05:54:31,812 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-13 05:54:31,812 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [402791591] [2024-10-13 05:54:31,812 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 05:54:31,812 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-13 05:54:31,909 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 05:54:32,474 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-13 05:54:32,475 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 05:54:32,476 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2024-10-13 05:54:32,477 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 05:54:32,478 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-10-13 05:54:32,480 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 05:54:32,482 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2024-10-13 05:54:32,482 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 05:54:32,483 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2024-10-13 05:54:32,484 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 05:54:32,485 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2024-10-13 05:54:32,485 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 05:54:32,486 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2024-10-13 05:54:32,487 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 05:54:32,488 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2024-10-13 05:54:32,489 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 05:54:32,491 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2024-10-13 05:54:32,492 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 05:54:32,493 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2024-10-13 05:54:32,494 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 05:54:32,496 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2024-10-13 05:54:32,497 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 05:54:32,498 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 80 [2024-10-13 05:54:32,499 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 05:54:32,502 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 86 [2024-10-13 05:54:32,503 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 05:54:32,505 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 92 [2024-10-13 05:54:32,506 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 05:54:32,507 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 98 [2024-10-13 05:54:32,507 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 05:54:32,509 INFO L134 CoverageAnalysis]: Checked inductivity of 420 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 420 trivial. 0 not checked. [2024-10-13 05:54:32,509 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-13 05:54:32,509 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [402791591] [2024-10-13 05:54:32,509 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [402791591] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-13 05:54:32,509 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-13 05:54:32,509 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-10-13 05:54:32,509 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [989934236] [2024-10-13 05:54:32,509 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-13 05:54:32,510 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-10-13 05:54:32,510 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-13 05:54:32,511 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-10-13 05:54:32,511 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2024-10-13 05:54:32,511 INFO L87 Difference]: Start difference. First operand 402 states and 585 transitions. Second operand has 6 states, 5 states have (on average 11.4) internal successors, (57), 6 states have internal predecessors, (57), 2 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 2 states have call successors, (15) [2024-10-13 05:54:32,803 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-13 05:54:32,803 INFO L93 Difference]: Finished difference Result 919 states and 1331 transitions. [2024-10-13 05:54:32,804 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-10-13 05:54:32,804 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 11.4) internal successors, (57), 6 states have internal predecessors, (57), 2 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 2 states have call successors, (15) Word has length 129 [2024-10-13 05:54:32,804 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-13 05:54:32,806 INFO L225 Difference]: With dead ends: 919 [2024-10-13 05:54:32,806 INFO L226 Difference]: Without dead ends: 518 [2024-10-13 05:54:32,809 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 38 GetRequests, 33 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-10-13 05:54:32,810 INFO L432 NwaCegarLoop]: 218 mSDtfsCounter, 116 mSDsluCounter, 635 mSDsCounter, 0 mSdLazyCounter, 183 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 117 SdHoareTripleChecker+Valid, 853 SdHoareTripleChecker+Invalid, 187 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 183 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-10-13 05:54:32,811 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [117 Valid, 853 Invalid, 187 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 183 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-10-13 05:54:32,812 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 518 states. [2024-10-13 05:54:32,838 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 518 to 512. [2024-10-13 05:54:32,839 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 512 states, 440 states have (on average 1.3909090909090909) internal successors, (612), 443 states have internal predecessors, (612), 64 states have call successors, (64), 7 states have call predecessors, (64), 7 states have return successors, (64), 61 states have call predecessors, (64), 64 states have call successors, (64) [2024-10-13 05:54:32,840 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 512 states to 512 states and 740 transitions. [2024-10-13 05:54:32,841 INFO L78 Accepts]: Start accepts. Automaton has 512 states and 740 transitions. Word has length 129 [2024-10-13 05:54:32,841 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-13 05:54:32,841 INFO L471 AbstractCegarLoop]: Abstraction has 512 states and 740 transitions. [2024-10-13 05:54:32,842 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 11.4) internal successors, (57), 6 states have internal predecessors, (57), 2 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 2 states have call successors, (15) [2024-10-13 05:54:32,842 INFO L276 IsEmpty]: Start isEmpty. Operand 512 states and 740 transitions. [2024-10-13 05:54:32,843 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 130 [2024-10-13 05:54:32,843 INFO L207 NwaCegarLoop]: Found error trace [2024-10-13 05:54:32,843 INFO L215 NwaCegarLoop]: trace histogram [15, 15, 15, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-13 05:54:32,843 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2024-10-13 05:54:32,844 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-13 05:54:32,844 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 05:54:32,845 INFO L85 PathProgramCache]: Analyzing trace with hash 994687182, now seen corresponding path program 1 times [2024-10-13 05:54:32,846 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-13 05:54:32,846 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [255867018] [2024-10-13 05:54:32,846 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 05:54:32,846 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-13 05:54:32,880 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 05:54:33,081 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-13 05:54:33,083 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 05:54:33,084 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2024-10-13 05:54:33,085 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 05:54:33,086 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-10-13 05:54:33,087 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 05:54:33,089 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2024-10-13 05:54:33,090 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 05:54:33,092 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2024-10-13 05:54:33,093 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 05:54:33,094 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2024-10-13 05:54:33,095 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 05:54:33,096 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2024-10-13 05:54:33,096 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 05:54:33,098 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2024-10-13 05:54:33,099 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 05:54:33,100 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2024-10-13 05:54:33,101 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 05:54:33,102 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2024-10-13 05:54:33,102 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 05:54:33,104 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2024-10-13 05:54:33,105 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 05:54:33,106 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 80 [2024-10-13 05:54:33,107 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 05:54:33,108 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 86 [2024-10-13 05:54:33,108 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 05:54:33,109 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 92 [2024-10-13 05:54:33,110 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 05:54:33,111 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 98 [2024-10-13 05:54:33,112 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 05:54:33,114 INFO L134 CoverageAnalysis]: Checked inductivity of 420 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 420 trivial. 0 not checked. [2024-10-13 05:54:33,114 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-13 05:54:33,114 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [255867018] [2024-10-13 05:54:33,114 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [255867018] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-13 05:54:33,114 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-13 05:54:33,114 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-10-13 05:54:33,114 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [570291816] [2024-10-13 05:54:33,114 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-13 05:54:33,115 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-10-13 05:54:33,115 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-13 05:54:33,115 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-10-13 05:54:33,115 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-10-13 05:54:33,116 INFO L87 Difference]: Start difference. First operand 512 states and 740 transitions. Second operand has 4 states, 4 states have (on average 14.25) internal successors, (57), 4 states have internal predecessors, (57), 1 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 1 states have call successors, (15) [2024-10-13 05:54:33,214 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-13 05:54:33,214 INFO L93 Difference]: Finished difference Result 1026 states and 1482 transitions. [2024-10-13 05:54:33,215 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-10-13 05:54:33,215 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 14.25) internal successors, (57), 4 states have internal predecessors, (57), 1 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 1 states have call successors, (15) Word has length 129 [2024-10-13 05:54:33,215 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-13 05:54:33,218 INFO L225 Difference]: With dead ends: 1026 [2024-10-13 05:54:33,218 INFO L226 Difference]: Without dead ends: 515 [2024-10-13 05:54:33,219 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 36 GetRequests, 33 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-10-13 05:54:33,220 INFO L432 NwaCegarLoop]: 137 mSDtfsCounter, 85 mSDsluCounter, 269 mSDsCounter, 0 mSdLazyCounter, 52 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 85 SdHoareTripleChecker+Valid, 406 SdHoareTripleChecker+Invalid, 54 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 52 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-13 05:54:33,221 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [85 Valid, 406 Invalid, 54 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 52 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-13 05:54:33,221 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 515 states. [2024-10-13 05:54:33,249 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 515 to 511. [2024-10-13 05:54:33,250 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 511 states, 439 states have (on average 1.387243735763098) internal successors, (609), 442 states have internal predecessors, (609), 64 states have call successors, (64), 7 states have call predecessors, (64), 7 states have return successors, (64), 61 states have call predecessors, (64), 64 states have call successors, (64) [2024-10-13 05:54:33,252 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 511 states to 511 states and 737 transitions. [2024-10-13 05:54:33,253 INFO L78 Accepts]: Start accepts. Automaton has 511 states and 737 transitions. Word has length 129 [2024-10-13 05:54:33,253 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-13 05:54:33,253 INFO L471 AbstractCegarLoop]: Abstraction has 511 states and 737 transitions. [2024-10-13 05:54:33,254 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 14.25) internal successors, (57), 4 states have internal predecessors, (57), 1 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 1 states have call successors, (15) [2024-10-13 05:54:33,254 INFO L276 IsEmpty]: Start isEmpty. Operand 511 states and 737 transitions. [2024-10-13 05:54:33,255 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 130 [2024-10-13 05:54:33,255 INFO L207 NwaCegarLoop]: Found error trace [2024-10-13 05:54:33,256 INFO L215 NwaCegarLoop]: trace histogram [15, 15, 15, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-13 05:54:33,256 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2024-10-13 05:54:33,256 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-13 05:54:33,256 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 05:54:33,256 INFO L85 PathProgramCache]: Analyzing trace with hash 601660172, now seen corresponding path program 1 times [2024-10-13 05:54:33,257 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-13 05:54:33,257 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1874762881] [2024-10-13 05:54:33,257 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 05:54:33,257 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-13 05:54:33,333 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 05:54:33,771 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-13 05:54:33,772 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 05:54:33,773 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2024-10-13 05:54:33,773 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 05:54:33,774 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-10-13 05:54:33,775 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 05:54:33,776 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2024-10-13 05:54:33,776 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 05:54:33,777 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2024-10-13 05:54:33,778 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 05:54:33,778 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2024-10-13 05:54:33,779 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 05:54:33,780 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2024-10-13 05:54:33,780 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 05:54:33,781 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2024-10-13 05:54:33,782 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 05:54:33,783 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2024-10-13 05:54:33,783 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 05:54:33,784 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2024-10-13 05:54:33,785 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 05:54:33,786 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2024-10-13 05:54:33,786 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 05:54:33,787 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 80 [2024-10-13 05:54:33,787 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 05:54:33,788 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 86 [2024-10-13 05:54:33,789 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 05:54:33,789 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 92 [2024-10-13 05:54:33,790 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 05:54:33,791 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 98 [2024-10-13 05:54:33,791 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 05:54:33,793 INFO L134 CoverageAnalysis]: Checked inductivity of 420 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 420 trivial. 0 not checked. [2024-10-13 05:54:33,793 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-13 05:54:33,793 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1874762881] [2024-10-13 05:54:33,793 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1874762881] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-13 05:54:33,794 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-13 05:54:33,794 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-10-13 05:54:33,794 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1727198285] [2024-10-13 05:54:33,794 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-13 05:54:33,794 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-10-13 05:54:33,794 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-13 05:54:33,795 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-10-13 05:54:33,795 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2024-10-13 05:54:33,795 INFO L87 Difference]: Start difference. First operand 511 states and 737 transitions. Second operand has 6 states, 5 states have (on average 11.4) internal successors, (57), 6 states have internal predecessors, (57), 2 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 2 states have call successors, (15) [2024-10-13 05:54:34,106 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-13 05:54:34,106 INFO L93 Difference]: Finished difference Result 1037 states and 1488 transitions. [2024-10-13 05:54:34,106 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-10-13 05:54:34,107 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 11.4) internal successors, (57), 6 states have internal predecessors, (57), 2 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 2 states have call successors, (15) Word has length 129 [2024-10-13 05:54:34,109 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-13 05:54:34,111 INFO L225 Difference]: With dead ends: 1037 [2024-10-13 05:54:34,111 INFO L226 Difference]: Without dead ends: 527 [2024-10-13 05:54:34,112 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 38 GetRequests, 33 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-10-13 05:54:34,113 INFO L432 NwaCegarLoop]: 170 mSDtfsCounter, 210 mSDsluCounter, 412 mSDsCounter, 0 mSdLazyCounter, 148 mSolverCounterSat, 31 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 211 SdHoareTripleChecker+Valid, 582 SdHoareTripleChecker+Invalid, 179 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 31 IncrementalHoareTripleChecker+Valid, 148 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2024-10-13 05:54:34,113 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [211 Valid, 582 Invalid, 179 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [31 Valid, 148 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2024-10-13 05:54:34,114 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 527 states. [2024-10-13 05:54:34,163 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 527 to 523. [2024-10-13 05:54:34,165 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 523 states, 447 states have (on average 1.3758389261744965) internal successors, (615), 450 states have internal predecessors, (615), 66 states have call successors, (66), 9 states have call predecessors, (66), 9 states have return successors, (66), 63 states have call predecessors, (66), 66 states have call successors, (66) [2024-10-13 05:54:34,167 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 523 states to 523 states and 747 transitions. [2024-10-13 05:54:34,167 INFO L78 Accepts]: Start accepts. Automaton has 523 states and 747 transitions. Word has length 129 [2024-10-13 05:54:34,167 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-13 05:54:34,168 INFO L471 AbstractCegarLoop]: Abstraction has 523 states and 747 transitions. [2024-10-13 05:54:34,168 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 11.4) internal successors, (57), 6 states have internal predecessors, (57), 2 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 2 states have call successors, (15) [2024-10-13 05:54:34,168 INFO L276 IsEmpty]: Start isEmpty. Operand 523 states and 747 transitions. [2024-10-13 05:54:34,169 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 130 [2024-10-13 05:54:34,169 INFO L207 NwaCegarLoop]: Found error trace [2024-10-13 05:54:34,169 INFO L215 NwaCegarLoop]: trace histogram [15, 15, 15, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-13 05:54:34,169 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2024-10-13 05:54:34,169 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-13 05:54:34,170 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 05:54:34,170 INFO L85 PathProgramCache]: Analyzing trace with hash 1281718542, now seen corresponding path program 1 times [2024-10-13 05:54:34,170 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-13 05:54:34,170 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1465068609] [2024-10-13 05:54:34,170 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 05:54:34,170 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-13 05:54:34,200 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 05:54:34,394 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-13 05:54:34,395 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 05:54:34,396 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2024-10-13 05:54:34,397 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 05:54:34,398 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-10-13 05:54:34,398 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 05:54:34,399 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2024-10-13 05:54:34,400 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 05:54:34,400 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2024-10-13 05:54:34,401 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 05:54:34,401 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2024-10-13 05:54:34,402 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 05:54:34,403 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2024-10-13 05:54:34,403 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 05:54:34,404 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2024-10-13 05:54:34,405 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 05:54:34,405 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2024-10-13 05:54:34,406 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 05:54:34,407 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2024-10-13 05:54:34,407 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 05:54:34,408 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2024-10-13 05:54:34,408 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 05:54:34,409 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 80 [2024-10-13 05:54:34,410 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 05:54:34,411 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 86 [2024-10-13 05:54:34,411 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 05:54:34,412 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 92 [2024-10-13 05:54:34,413 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 05:54:34,413 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 98 [2024-10-13 05:54:34,414 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 05:54:34,415 INFO L134 CoverageAnalysis]: Checked inductivity of 420 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 420 trivial. 0 not checked. [2024-10-13 05:54:34,415 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-13 05:54:34,415 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1465068609] [2024-10-13 05:54:34,415 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1465068609] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-13 05:54:34,415 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-13 05:54:34,415 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-10-13 05:54:34,416 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1573059967] [2024-10-13 05:54:34,416 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-13 05:54:34,416 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-10-13 05:54:34,416 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-13 05:54:34,416 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-10-13 05:54:34,416 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2024-10-13 05:54:34,417 INFO L87 Difference]: Start difference. First operand 523 states and 747 transitions. Second operand has 6 states, 6 states have (on average 9.5) internal successors, (57), 6 states have internal predecessors, (57), 1 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 1 states have call successors, (15) [2024-10-13 05:54:34,593 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-13 05:54:34,593 INFO L93 Difference]: Finished difference Result 1143 states and 1632 transitions. [2024-10-13 05:54:34,593 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-10-13 05:54:34,593 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 9.5) internal successors, (57), 6 states have internal predecessors, (57), 1 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 1 states have call successors, (15) Word has length 129 [2024-10-13 05:54:34,594 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-13 05:54:34,597 INFO L225 Difference]: With dead ends: 1143 [2024-10-13 05:54:34,597 INFO L226 Difference]: Without dead ends: 621 [2024-10-13 05:54:34,598 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 39 GetRequests, 32 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=21, Invalid=51, Unknown=0, NotChecked=0, Total=72 [2024-10-13 05:54:34,599 INFO L432 NwaCegarLoop]: 274 mSDtfsCounter, 141 mSDsluCounter, 927 mSDsCounter, 0 mSdLazyCounter, 168 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 141 SdHoareTripleChecker+Valid, 1201 SdHoareTripleChecker+Invalid, 171 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 168 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-13 05:54:34,599 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [141 Valid, 1201 Invalid, 171 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 168 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-13 05:54:34,600 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 621 states. [2024-10-13 05:54:34,627 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 621 to 536. [2024-10-13 05:54:34,629 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 536 states, 456 states have (on average 1.3662280701754386) internal successors, (623), 459 states have internal predecessors, (623), 69 states have call successors, (69), 10 states have call predecessors, (69), 10 states have return successors, (69), 66 states have call predecessors, (69), 69 states have call successors, (69) [2024-10-13 05:54:34,630 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 536 states to 536 states and 761 transitions. [2024-10-13 05:54:34,631 INFO L78 Accepts]: Start accepts. Automaton has 536 states and 761 transitions. Word has length 129 [2024-10-13 05:54:34,631 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-13 05:54:34,631 INFO L471 AbstractCegarLoop]: Abstraction has 536 states and 761 transitions. [2024-10-13 05:54:34,631 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 9.5) internal successors, (57), 6 states have internal predecessors, (57), 1 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 1 states have call successors, (15) [2024-10-13 05:54:34,631 INFO L276 IsEmpty]: Start isEmpty. Operand 536 states and 761 transitions. [2024-10-13 05:54:34,632 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 131 [2024-10-13 05:54:34,632 INFO L207 NwaCegarLoop]: Found error trace [2024-10-13 05:54:34,632 INFO L215 NwaCegarLoop]: trace histogram [15, 15, 15, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-13 05:54:34,632 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2024-10-13 05:54:34,633 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-13 05:54:34,633 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 05:54:34,633 INFO L85 PathProgramCache]: Analyzing trace with hash -578848199, now seen corresponding path program 1 times [2024-10-13 05:54:34,633 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-13 05:54:34,633 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2137203094] [2024-10-13 05:54:34,633 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 05:54:34,633 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-13 05:54:34,661 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 05:54:34,925 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-13 05:54:34,926 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 05:54:34,927 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2024-10-13 05:54:34,928 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 05:54:34,928 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-10-13 05:54:34,929 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 05:54:34,930 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2024-10-13 05:54:34,930 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 05:54:34,931 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2024-10-13 05:54:34,932 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 05:54:34,932 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2024-10-13 05:54:34,933 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 05:54:34,934 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2024-10-13 05:54:34,934 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 05:54:34,935 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2024-10-13 05:54:34,936 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 05:54:34,936 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2024-10-13 05:54:34,937 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 05:54:34,938 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2024-10-13 05:54:34,938 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 05:54:34,939 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2024-10-13 05:54:34,940 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 05:54:34,940 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 80 [2024-10-13 05:54:34,941 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 05:54:34,942 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 86 [2024-10-13 05:54:34,942 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 05:54:34,943 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 92 [2024-10-13 05:54:34,944 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 05:54:34,944 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 98 [2024-10-13 05:54:34,945 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 05:54:34,946 INFO L134 CoverageAnalysis]: Checked inductivity of 420 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 420 trivial. 0 not checked. [2024-10-13 05:54:34,946 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-13 05:54:34,946 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2137203094] [2024-10-13 05:54:34,946 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2137203094] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-13 05:54:34,946 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-13 05:54:34,946 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-10-13 05:54:34,946 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [450524525] [2024-10-13 05:54:34,947 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-13 05:54:34,947 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-10-13 05:54:34,947 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-13 05:54:34,947 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-10-13 05:54:34,947 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2024-10-13 05:54:34,947 INFO L87 Difference]: Start difference. First operand 536 states and 761 transitions. Second operand has 7 states, 7 states have (on average 8.285714285714286) internal successors, (58), 7 states have internal predecessors, (58), 1 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 1 states have call successors, (15) [2024-10-13 05:54:35,318 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-13 05:54:35,319 INFO L93 Difference]: Finished difference Result 1609 states and 2282 transitions. [2024-10-13 05:54:35,319 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-10-13 05:54:35,319 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 8.285714285714286) internal successors, (58), 7 states have internal predecessors, (58), 1 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 1 states have call successors, (15) Word has length 130 [2024-10-13 05:54:35,319 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-13 05:54:35,327 INFO L225 Difference]: With dead ends: 1609 [2024-10-13 05:54:35,327 INFO L226 Difference]: Without dead ends: 1264 [2024-10-13 05:54:35,328 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 43 GetRequests, 33 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=39, Invalid=93, Unknown=0, NotChecked=0, Total=132 [2024-10-13 05:54:35,329 INFO L432 NwaCegarLoop]: 239 mSDtfsCounter, 335 mSDsluCounter, 1024 mSDsCounter, 0 mSdLazyCounter, 279 mSolverCounterSat, 64 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 335 SdHoareTripleChecker+Valid, 1263 SdHoareTripleChecker+Invalid, 343 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 64 IncrementalHoareTripleChecker+Valid, 279 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-10-13 05:54:35,329 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [335 Valid, 1263 Invalid, 343 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [64 Valid, 279 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-10-13 05:54:35,330 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1264 states. [2024-10-13 05:54:35,415 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1264 to 1248. [2024-10-13 05:54:35,417 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1248 states, 1058 states have (on average 1.3610586011342154) internal successors, (1440), 1065 states have internal predecessors, (1440), 165 states have call successors, (165), 24 states have call predecessors, (165), 24 states have return successors, (165), 158 states have call predecessors, (165), 165 states have call successors, (165) [2024-10-13 05:54:35,424 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1248 states to 1248 states and 1770 transitions. [2024-10-13 05:54:35,425 INFO L78 Accepts]: Start accepts. Automaton has 1248 states and 1770 transitions. Word has length 130 [2024-10-13 05:54:35,425 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-13 05:54:35,425 INFO L471 AbstractCegarLoop]: Abstraction has 1248 states and 1770 transitions. [2024-10-13 05:54:35,426 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 8.285714285714286) internal successors, (58), 7 states have internal predecessors, (58), 1 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 1 states have call successors, (15) [2024-10-13 05:54:35,426 INFO L276 IsEmpty]: Start isEmpty. Operand 1248 states and 1770 transitions. [2024-10-13 05:54:35,427 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 131 [2024-10-13 05:54:35,427 INFO L207 NwaCegarLoop]: Found error trace [2024-10-13 05:54:35,428 INFO L215 NwaCegarLoop]: trace histogram [15, 15, 15, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-13 05:54:35,428 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2024-10-13 05:54:35,428 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-13 05:54:35,428 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 05:54:35,428 INFO L85 PathProgramCache]: Analyzing trace with hash 2027175355, now seen corresponding path program 1 times [2024-10-13 05:54:35,428 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-13 05:54:35,429 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [609651684] [2024-10-13 05:54:35,429 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 05:54:35,429 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-13 05:54:35,459 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 05:54:35,522 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-13 05:54:35,523 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 05:54:35,524 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2024-10-13 05:54:35,524 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 05:54:35,525 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-10-13 05:54:35,526 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 05:54:35,526 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2024-10-13 05:54:35,527 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 05:54:35,528 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2024-10-13 05:54:35,529 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 05:54:35,529 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2024-10-13 05:54:35,530 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 05:54:35,530 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2024-10-13 05:54:35,531 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 05:54:35,532 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2024-10-13 05:54:35,532 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 05:54:35,533 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2024-10-13 05:54:35,533 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 05:54:35,534 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2024-10-13 05:54:35,534 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 05:54:35,535 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2024-10-13 05:54:35,535 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 05:54:35,536 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 80 [2024-10-13 05:54:35,537 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 05:54:35,537 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 86 [2024-10-13 05:54:35,538 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 05:54:35,538 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 92 [2024-10-13 05:54:35,539 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 05:54:35,539 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 98 [2024-10-13 05:54:35,540 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 05:54:35,541 INFO L134 CoverageAnalysis]: Checked inductivity of 420 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 420 trivial. 0 not checked. [2024-10-13 05:54:35,541 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-13 05:54:35,541 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [609651684] [2024-10-13 05:54:35,541 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [609651684] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-13 05:54:35,541 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-13 05:54:35,541 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-13 05:54:35,541 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [638261892] [2024-10-13 05:54:35,541 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-13 05:54:35,542 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-13 05:54:35,542 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-13 05:54:35,542 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-13 05:54:35,542 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-13 05:54:35,542 INFO L87 Difference]: Start difference. First operand 1248 states and 1770 transitions. Second operand has 3 states, 3 states have (on average 19.333333333333332) internal successors, (58), 3 states have internal predecessors, (58), 1 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 1 states have call successors, (15) [2024-10-13 05:54:35,608 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-13 05:54:35,608 INFO L93 Difference]: Finished difference Result 2115 states and 3005 transitions. [2024-10-13 05:54:35,608 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-13 05:54:35,609 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 19.333333333333332) internal successors, (58), 3 states have internal predecessors, (58), 1 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 1 states have call successors, (15) Word has length 130 [2024-10-13 05:54:35,609 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-13 05:54:35,613 INFO L225 Difference]: With dead ends: 2115 [2024-10-13 05:54:35,614 INFO L226 Difference]: Without dead ends: 1248 [2024-10-13 05:54:35,616 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 33 GetRequests, 32 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-10-13 05:54:35,616 INFO L432 NwaCegarLoop]: 147 mSDtfsCounter, 0 mSDsluCounter, 144 mSDsCounter, 0 mSdLazyCounter, 12 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 291 SdHoareTripleChecker+Invalid, 12 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 12 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-13 05:54:35,616 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 291 Invalid, 12 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 12 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-13 05:54:35,617 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1248 states. [2024-10-13 05:54:35,675 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1248 to 1248. [2024-10-13 05:54:35,677 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1248 states, 1058 states have (on average 1.3591682419659736) internal successors, (1438), 1065 states have internal predecessors, (1438), 165 states have call successors, (165), 24 states have call predecessors, (165), 24 states have return successors, (165), 158 states have call predecessors, (165), 165 states have call successors, (165) [2024-10-13 05:54:35,681 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1248 states to 1248 states and 1768 transitions. [2024-10-13 05:54:35,682 INFO L78 Accepts]: Start accepts. Automaton has 1248 states and 1768 transitions. Word has length 130 [2024-10-13 05:54:35,682 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-13 05:54:35,682 INFO L471 AbstractCegarLoop]: Abstraction has 1248 states and 1768 transitions. [2024-10-13 05:54:35,682 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 19.333333333333332) internal successors, (58), 3 states have internal predecessors, (58), 1 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 1 states have call successors, (15) [2024-10-13 05:54:35,682 INFO L276 IsEmpty]: Start isEmpty. Operand 1248 states and 1768 transitions. [2024-10-13 05:54:35,683 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 131 [2024-10-13 05:54:35,683 INFO L207 NwaCegarLoop]: Found error trace [2024-10-13 05:54:35,683 INFO L215 NwaCegarLoop]: trace histogram [15, 15, 15, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-13 05:54:35,684 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2024-10-13 05:54:35,684 INFO L396 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-13 05:54:35,684 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 05:54:35,684 INFO L85 PathProgramCache]: Analyzing trace with hash -2048937223, now seen corresponding path program 1 times [2024-10-13 05:54:35,684 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-13 05:54:35,684 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [237875562] [2024-10-13 05:54:35,684 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 05:54:35,684 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-13 05:54:35,719 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 05:54:36,305 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-13 05:54:36,307 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 05:54:36,308 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2024-10-13 05:54:36,309 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 05:54:36,310 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-10-13 05:54:36,311 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 05:54:36,312 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2024-10-13 05:54:36,313 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 05:54:36,314 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2024-10-13 05:54:36,314 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 05:54:36,315 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2024-10-13 05:54:36,316 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 05:54:36,316 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2024-10-13 05:54:36,317 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 05:54:36,318 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2024-10-13 05:54:36,319 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 05:54:36,320 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2024-10-13 05:54:36,320 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 05:54:36,321 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2024-10-13 05:54:36,322 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 05:54:36,322 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2024-10-13 05:54:36,323 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 05:54:36,324 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 80 [2024-10-13 05:54:36,325 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 05:54:36,325 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 86 [2024-10-13 05:54:36,326 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 05:54:36,327 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 92 [2024-10-13 05:54:36,327 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 05:54:36,328 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 98 [2024-10-13 05:54:36,329 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 05:54:36,330 INFO L134 CoverageAnalysis]: Checked inductivity of 420 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 420 trivial. 0 not checked. [2024-10-13 05:54:36,330 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-13 05:54:36,331 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [237875562] [2024-10-13 05:54:36,331 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [237875562] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-13 05:54:36,331 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-13 05:54:36,331 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2024-10-13 05:54:36,331 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [721682158] [2024-10-13 05:54:36,331 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-13 05:54:36,331 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-10-13 05:54:36,332 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-13 05:54:36,332 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-10-13 05:54:36,332 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=69, Unknown=0, NotChecked=0, Total=90 [2024-10-13 05:54:36,332 INFO L87 Difference]: Start difference. First operand 1248 states and 1768 transitions. Second operand has 10 states, 10 states have (on average 5.8) internal successors, (58), 10 states have internal predecessors, (58), 1 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 1 states have call successors, (15) [2024-10-13 05:54:36,911 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-13 05:54:36,911 INFO L93 Difference]: Finished difference Result 1483 states and 2095 transitions. [2024-10-13 05:54:36,912 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2024-10-13 05:54:36,912 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 5.8) internal successors, (58), 10 states have internal predecessors, (58), 1 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 1 states have call successors, (15) Word has length 130 [2024-10-13 05:54:36,913 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-13 05:54:36,918 INFO L225 Difference]: With dead ends: 1483 [2024-10-13 05:54:36,918 INFO L226 Difference]: Without dead ends: 1252 [2024-10-13 05:54:36,920 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 48 GetRequests, 32 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 37 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=63, Invalid=243, Unknown=0, NotChecked=0, Total=306 [2024-10-13 05:54:36,920 INFO L432 NwaCegarLoop]: 264 mSDtfsCounter, 278 mSDsluCounter, 1469 mSDsCounter, 0 mSdLazyCounter, 564 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 278 SdHoareTripleChecker+Valid, 1733 SdHoareTripleChecker+Invalid, 570 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 564 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2024-10-13 05:54:36,920 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [278 Valid, 1733 Invalid, 570 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 564 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2024-10-13 05:54:36,922 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1252 states. [2024-10-13 05:54:36,973 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1252 to 1242. [2024-10-13 05:54:36,975 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1242 states, 1052 states have (on average 1.358365019011407) internal successors, (1429), 1059 states have internal predecessors, (1429), 165 states have call successors, (165), 24 states have call predecessors, (165), 24 states have return successors, (165), 158 states have call predecessors, (165), 165 states have call successors, (165) [2024-10-13 05:54:36,978 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1242 states to 1242 states and 1759 transitions. [2024-10-13 05:54:36,979 INFO L78 Accepts]: Start accepts. Automaton has 1242 states and 1759 transitions. Word has length 130 [2024-10-13 05:54:36,980 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-13 05:54:36,980 INFO L471 AbstractCegarLoop]: Abstraction has 1242 states and 1759 transitions. [2024-10-13 05:54:36,980 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 5.8) internal successors, (58), 10 states have internal predecessors, (58), 1 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 1 states have call successors, (15) [2024-10-13 05:54:36,980 INFO L276 IsEmpty]: Start isEmpty. Operand 1242 states and 1759 transitions. [2024-10-13 05:54:36,981 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 131 [2024-10-13 05:54:36,981 INFO L207 NwaCegarLoop]: Found error trace [2024-10-13 05:54:36,981 INFO L215 NwaCegarLoop]: trace histogram [15, 15, 15, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-13 05:54:36,981 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2024-10-13 05:54:36,982 INFO L396 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-13 05:54:36,982 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 05:54:36,982 INFO L85 PathProgramCache]: Analyzing trace with hash -219444871, now seen corresponding path program 1 times [2024-10-13 05:54:36,982 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-13 05:54:36,982 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [408546260] [2024-10-13 05:54:36,982 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 05:54:36,982 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-13 05:54:37,009 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 05:54:37,300 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-13 05:54:37,301 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 05:54:37,303 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2024-10-13 05:54:37,303 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 05:54:37,305 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-10-13 05:54:37,305 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 05:54:37,306 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2024-10-13 05:54:37,307 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 05:54:37,308 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2024-10-13 05:54:37,309 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 05:54:37,310 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2024-10-13 05:54:37,310 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 05:54:37,312 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2024-10-13 05:54:37,312 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 05:54:37,313 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2024-10-13 05:54:37,314 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 05:54:37,315 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2024-10-13 05:54:37,316 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 05:54:37,317 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2024-10-13 05:54:37,318 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 05:54:37,320 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2024-10-13 05:54:37,320 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 05:54:37,322 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 80 [2024-10-13 05:54:37,322 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 05:54:37,323 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 86 [2024-10-13 05:54:37,324 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 05:54:37,325 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 92 [2024-10-13 05:54:37,326 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 05:54:37,327 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 98 [2024-10-13 05:54:37,328 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 05:54:37,329 INFO L134 CoverageAnalysis]: Checked inductivity of 420 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 420 trivial. 0 not checked. [2024-10-13 05:54:37,329 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-13 05:54:37,330 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [408546260] [2024-10-13 05:54:37,330 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [408546260] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-13 05:54:37,330 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-13 05:54:37,330 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2024-10-13 05:54:37,330 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1202799956] [2024-10-13 05:54:37,330 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-13 05:54:37,330 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-10-13 05:54:37,330 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-13 05:54:37,331 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-10-13 05:54:37,331 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=54, Unknown=0, NotChecked=0, Total=72 [2024-10-13 05:54:37,331 INFO L87 Difference]: Start difference. First operand 1242 states and 1759 transitions. Second operand has 9 states, 9 states have (on average 6.444444444444445) internal successors, (58), 9 states have internal predecessors, (58), 1 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 1 states have call successors, (15) [2024-10-13 05:54:37,867 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-13 05:54:37,868 INFO L93 Difference]: Finished difference Result 2331 states and 3299 transitions. [2024-10-13 05:54:37,868 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2024-10-13 05:54:37,868 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 6.444444444444445) internal successors, (58), 9 states have internal predecessors, (58), 1 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 1 states have call successors, (15) Word has length 130 [2024-10-13 05:54:37,869 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-13 05:54:37,875 INFO L225 Difference]: With dead ends: 2331 [2024-10-13 05:54:37,875 INFO L226 Difference]: Without dead ends: 1470 [2024-10-13 05:54:37,878 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 45 GetRequests, 31 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 23 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=63, Invalid=177, Unknown=0, NotChecked=0, Total=240 [2024-10-13 05:54:37,879 INFO L432 NwaCegarLoop]: 294 mSDtfsCounter, 241 mSDsluCounter, 1407 mSDsCounter, 0 mSdLazyCounter, 536 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 241 SdHoareTripleChecker+Valid, 1701 SdHoareTripleChecker+Invalid, 540 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 536 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2024-10-13 05:54:37,879 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [241 Valid, 1701 Invalid, 540 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 536 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2024-10-13 05:54:37,880 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1470 states. [2024-10-13 05:54:37,966 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1470 to 1446. [2024-10-13 05:54:37,969 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1446 states, 1225 states have (on average 1.3591836734693878) internal successors, (1665), 1233 states have internal predecessors, (1665), 192 states have call successors, (192), 28 states have call predecessors, (192), 28 states have return successors, (192), 184 states have call predecessors, (192), 192 states have call successors, (192) [2024-10-13 05:54:37,975 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1446 states to 1446 states and 2049 transitions. [2024-10-13 05:54:37,976 INFO L78 Accepts]: Start accepts. Automaton has 1446 states and 2049 transitions. Word has length 130 [2024-10-13 05:54:37,976 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-13 05:54:37,976 INFO L471 AbstractCegarLoop]: Abstraction has 1446 states and 2049 transitions. [2024-10-13 05:54:37,977 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 6.444444444444445) internal successors, (58), 9 states have internal predecessors, (58), 1 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 1 states have call successors, (15) [2024-10-13 05:54:37,977 INFO L276 IsEmpty]: Start isEmpty. Operand 1446 states and 2049 transitions. [2024-10-13 05:54:37,978 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 131 [2024-10-13 05:54:37,978 INFO L207 NwaCegarLoop]: Found error trace [2024-10-13 05:54:37,978 INFO L215 NwaCegarLoop]: trace histogram [15, 15, 15, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-13 05:54:37,978 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2024-10-13 05:54:37,978 INFO L396 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-13 05:54:37,979 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 05:54:37,979 INFO L85 PathProgramCache]: Analyzing trace with hash -1908388613, now seen corresponding path program 1 times [2024-10-13 05:54:37,979 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-13 05:54:37,979 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [328019392] [2024-10-13 05:54:37,979 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 05:54:37,979 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-13 05:54:38,012 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 05:54:38,270 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-13 05:54:38,273 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 05:54:38,275 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2024-10-13 05:54:38,278 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 05:54:38,279 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-10-13 05:54:38,280 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 05:54:38,284 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2024-10-13 05:54:38,284 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 05:54:38,285 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2024-10-13 05:54:38,286 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 05:54:38,287 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2024-10-13 05:54:38,288 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 05:54:38,289 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2024-10-13 05:54:38,290 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 05:54:38,291 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2024-10-13 05:54:38,292 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 05:54:38,293 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2024-10-13 05:54:38,294 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 05:54:38,295 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2024-10-13 05:54:38,296 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 05:54:38,297 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2024-10-13 05:54:38,299 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 05:54:38,300 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 80 [2024-10-13 05:54:38,301 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 05:54:38,302 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 86 [2024-10-13 05:54:38,302 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 05:54:38,303 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 92 [2024-10-13 05:54:38,304 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 05:54:38,306 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 98 [2024-10-13 05:54:38,307 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 05:54:38,308 INFO L134 CoverageAnalysis]: Checked inductivity of 420 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 420 trivial. 0 not checked. [2024-10-13 05:54:38,309 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-13 05:54:38,309 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [328019392] [2024-10-13 05:54:38,309 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [328019392] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-13 05:54:38,309 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-13 05:54:38,309 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-10-13 05:54:38,309 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [240333836] [2024-10-13 05:54:38,310 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-13 05:54:38,310 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-10-13 05:54:38,310 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-13 05:54:38,310 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-10-13 05:54:38,310 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2024-10-13 05:54:38,311 INFO L87 Difference]: Start difference. First operand 1446 states and 2049 transitions. Second operand has 6 states, 6 states have (on average 9.666666666666666) internal successors, (58), 6 states have internal predecessors, (58), 1 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 1 states have call successors, (15) [2024-10-13 05:54:38,687 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-13 05:54:38,687 INFO L93 Difference]: Finished difference Result 1910 states and 2702 transitions. [2024-10-13 05:54:38,688 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-10-13 05:54:38,688 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 9.666666666666666) internal successors, (58), 6 states have internal predecessors, (58), 1 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 1 states have call successors, (15) Word has length 130 [2024-10-13 05:54:38,688 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-13 05:54:38,691 INFO L225 Difference]: With dead ends: 1910 [2024-10-13 05:54:38,692 INFO L226 Difference]: Without dead ends: 845 [2024-10-13 05:54:38,693 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 41 GetRequests, 32 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=35, Invalid=75, Unknown=0, NotChecked=0, Total=110 [2024-10-13 05:54:38,694 INFO L432 NwaCegarLoop]: 300 mSDtfsCounter, 367 mSDsluCounter, 1001 mSDsCounter, 0 mSdLazyCounter, 240 mSolverCounterSat, 38 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 367 SdHoareTripleChecker+Valid, 1301 SdHoareTripleChecker+Invalid, 278 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 38 IncrementalHoareTripleChecker+Valid, 240 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-10-13 05:54:38,694 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [367 Valid, 1301 Invalid, 278 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [38 Valid, 240 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-10-13 05:54:38,695 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 845 states. [2024-10-13 05:54:38,734 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 845 to 835. [2024-10-13 05:54:38,735 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 835 states, 707 states have (on average 1.347949080622348) internal successors, (953), 710 states have internal predecessors, (953), 111 states have call successors, (111), 16 states have call predecessors, (111), 16 states have return successors, (111), 108 states have call predecessors, (111), 111 states have call successors, (111) [2024-10-13 05:54:38,737 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 835 states to 835 states and 1175 transitions. [2024-10-13 05:54:38,738 INFO L78 Accepts]: Start accepts. Automaton has 835 states and 1175 transitions. Word has length 130 [2024-10-13 05:54:38,738 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-13 05:54:38,738 INFO L471 AbstractCegarLoop]: Abstraction has 835 states and 1175 transitions. [2024-10-13 05:54:38,738 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 9.666666666666666) internal successors, (58), 6 states have internal predecessors, (58), 1 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 1 states have call successors, (15) [2024-10-13 05:54:38,738 INFO L276 IsEmpty]: Start isEmpty. Operand 835 states and 1175 transitions. [2024-10-13 05:54:38,739 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 132 [2024-10-13 05:54:38,739 INFO L207 NwaCegarLoop]: Found error trace [2024-10-13 05:54:38,740 INFO L215 NwaCegarLoop]: trace histogram [15, 15, 15, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-13 05:54:38,740 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2024-10-13 05:54:38,740 INFO L396 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-13 05:54:38,740 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 05:54:38,740 INFO L85 PathProgramCache]: Analyzing trace with hash 24648819, now seen corresponding path program 1 times [2024-10-13 05:54:38,740 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-13 05:54:38,741 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1699373582] [2024-10-13 05:54:38,741 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 05:54:38,741 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-13 05:54:38,764 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 05:54:39,006 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-13 05:54:39,007 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 05:54:39,007 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2024-10-13 05:54:39,008 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 05:54:39,009 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-10-13 05:54:39,009 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 05:54:39,010 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2024-10-13 05:54:39,010 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 05:54:39,011 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2024-10-13 05:54:39,011 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 05:54:39,012 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2024-10-13 05:54:39,012 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 05:54:39,013 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2024-10-13 05:54:39,013 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 05:54:39,014 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2024-10-13 05:54:39,014 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 05:54:39,015 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2024-10-13 05:54:39,015 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 05:54:39,015 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2024-10-13 05:54:39,017 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 05:54:39,017 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2024-10-13 05:54:39,018 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 05:54:39,018 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 80 [2024-10-13 05:54:39,019 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 05:54:39,019 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 86 [2024-10-13 05:54:39,020 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 05:54:39,020 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 92 [2024-10-13 05:54:39,021 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 05:54:39,021 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 98 [2024-10-13 05:54:39,022 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 05:54:39,023 INFO L134 CoverageAnalysis]: Checked inductivity of 420 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 420 trivial. 0 not checked. [2024-10-13 05:54:39,023 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-13 05:54:39,023 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1699373582] [2024-10-13 05:54:39,023 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1699373582] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-13 05:54:39,023 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-13 05:54:39,023 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-10-13 05:54:39,023 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [388681768] [2024-10-13 05:54:39,023 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-13 05:54:39,024 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-10-13 05:54:39,024 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-13 05:54:39,025 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-10-13 05:54:39,025 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2024-10-13 05:54:39,025 INFO L87 Difference]: Start difference. First operand 835 states and 1175 transitions. Second operand has 7 states, 7 states have (on average 8.428571428571429) internal successors, (59), 7 states have internal predecessors, (59), 1 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 1 states have call successors, (15) [2024-10-13 05:54:39,391 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-13 05:54:39,392 INFO L93 Difference]: Finished difference Result 1062 states and 1491 transitions. [2024-10-13 05:54:39,392 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-10-13 05:54:39,393 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 8.428571428571429) internal successors, (59), 7 states have internal predecessors, (59), 1 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 1 states have call successors, (15) Word has length 131 [2024-10-13 05:54:39,393 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-13 05:54:39,396 INFO L225 Difference]: With dead ends: 1062 [2024-10-13 05:54:39,397 INFO L226 Difference]: Without dead ends: 837 [2024-10-13 05:54:39,398 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 43 GetRequests, 33 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=39, Invalid=93, Unknown=0, NotChecked=0, Total=132 [2024-10-13 05:54:39,398 INFO L432 NwaCegarLoop]: 345 mSDtfsCounter, 250 mSDsluCounter, 1309 mSDsCounter, 0 mSdLazyCounter, 325 mSolverCounterSat, 33 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 250 SdHoareTripleChecker+Valid, 1654 SdHoareTripleChecker+Invalid, 358 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 33 IncrementalHoareTripleChecker+Valid, 325 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2024-10-13 05:54:39,399 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [250 Valid, 1654 Invalid, 358 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [33 Valid, 325 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2024-10-13 05:54:39,400 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 837 states. [2024-10-13 05:54:39,451 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 837 to 641. [2024-10-13 05:54:39,452 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 641 states, 544 states have (on average 1.3474264705882353) internal successors, (733), 546 states have internal predecessors, (733), 84 states have call successors, (84), 12 states have call predecessors, (84), 12 states have return successors, (84), 82 states have call predecessors, (84), 84 states have call successors, (84) [2024-10-13 05:54:39,454 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 641 states to 641 states and 901 transitions. [2024-10-13 05:54:39,455 INFO L78 Accepts]: Start accepts. Automaton has 641 states and 901 transitions. Word has length 131 [2024-10-13 05:54:39,456 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-13 05:54:39,456 INFO L471 AbstractCegarLoop]: Abstraction has 641 states and 901 transitions. [2024-10-13 05:54:39,457 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 8.428571428571429) internal successors, (59), 7 states have internal predecessors, (59), 1 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 1 states have call successors, (15) [2024-10-13 05:54:39,457 INFO L276 IsEmpty]: Start isEmpty. Operand 641 states and 901 transitions. [2024-10-13 05:54:39,458 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 132 [2024-10-13 05:54:39,458 INFO L207 NwaCegarLoop]: Found error trace [2024-10-13 05:54:39,459 INFO L215 NwaCegarLoop]: trace histogram [15, 15, 15, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-13 05:54:39,459 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2024-10-13 05:54:39,459 INFO L396 AbstractCegarLoop]: === Iteration 20 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-13 05:54:39,459 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 05:54:39,459 INFO L85 PathProgramCache]: Analyzing trace with hash -1414655311, now seen corresponding path program 1 times [2024-10-13 05:54:39,460 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-13 05:54:39,460 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1801066957] [2024-10-13 05:54:39,460 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 05:54:39,460 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-13 05:54:39,490 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 05:54:39,697 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-13 05:54:39,697 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 05:54:39,698 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2024-10-13 05:54:39,699 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 05:54:39,700 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-10-13 05:54:39,700 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 05:54:39,701 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2024-10-13 05:54:39,701 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 05:54:39,702 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2024-10-13 05:54:39,702 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 05:54:39,703 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2024-10-13 05:54:39,703 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 05:54:39,704 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2024-10-13 05:54:39,704 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 05:54:39,705 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2024-10-13 05:54:39,705 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 05:54:39,706 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2024-10-13 05:54:39,706 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 05:54:39,707 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2024-10-13 05:54:39,707 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 05:54:39,707 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2024-10-13 05:54:39,708 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 05:54:39,708 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 80 [2024-10-13 05:54:39,709 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 05:54:39,709 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 86 [2024-10-13 05:54:39,710 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 05:54:39,710 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 92 [2024-10-13 05:54:39,711 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 05:54:39,711 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 98 [2024-10-13 05:54:39,712 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 05:54:39,713 INFO L134 CoverageAnalysis]: Checked inductivity of 420 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 420 trivial. 0 not checked. [2024-10-13 05:54:39,713 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-13 05:54:39,713 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1801066957] [2024-10-13 05:54:39,713 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1801066957] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-13 05:54:39,713 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-13 05:54:39,713 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-10-13 05:54:39,713 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1003682078] [2024-10-13 05:54:39,713 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-13 05:54:39,714 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-10-13 05:54:39,714 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-13 05:54:39,714 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-10-13 05:54:39,714 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2024-10-13 05:54:39,715 INFO L87 Difference]: Start difference. First operand 641 states and 901 transitions. Second operand has 6 states, 5 states have (on average 11.8) internal successors, (59), 6 states have internal predecessors, (59), 2 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 2 states have call successors, (15) [2024-10-13 05:54:39,798 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-13 05:54:39,799 INFO L93 Difference]: Finished difference Result 1173 states and 1645 transitions. [2024-10-13 05:54:39,799 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-10-13 05:54:39,799 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 11.8) internal successors, (59), 6 states have internal predecessors, (59), 2 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 2 states have call successors, (15) Word has length 131 [2024-10-13 05:54:39,799 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-13 05:54:39,802 INFO L225 Difference]: With dead ends: 1173 [2024-10-13 05:54:39,802 INFO L226 Difference]: Without dead ends: 723 [2024-10-13 05:54:39,803 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 38 GetRequests, 33 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-10-13 05:54:39,804 INFO L432 NwaCegarLoop]: 180 mSDtfsCounter, 52 mSDsluCounter, 655 mSDsCounter, 0 mSdLazyCounter, 64 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 53 SdHoareTripleChecker+Valid, 835 SdHoareTripleChecker+Invalid, 65 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 64 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-13 05:54:39,804 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [53 Valid, 835 Invalid, 65 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 64 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-13 05:54:39,805 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 723 states. [2024-10-13 05:54:39,838 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 723 to 641. [2024-10-13 05:54:39,840 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 641 states, 544 states have (on average 1.3419117647058822) internal successors, (730), 546 states have internal predecessors, (730), 84 states have call successors, (84), 12 states have call predecessors, (84), 12 states have return successors, (84), 82 states have call predecessors, (84), 84 states have call successors, (84) [2024-10-13 05:54:39,842 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 641 states to 641 states and 898 transitions. [2024-10-13 05:54:39,843 INFO L78 Accepts]: Start accepts. Automaton has 641 states and 898 transitions. Word has length 131 [2024-10-13 05:54:39,843 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-13 05:54:39,843 INFO L471 AbstractCegarLoop]: Abstraction has 641 states and 898 transitions. [2024-10-13 05:54:39,843 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 11.8) internal successors, (59), 6 states have internal predecessors, (59), 2 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 2 states have call successors, (15) [2024-10-13 05:54:39,843 INFO L276 IsEmpty]: Start isEmpty. Operand 641 states and 898 transitions. [2024-10-13 05:54:39,844 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 134 [2024-10-13 05:54:39,844 INFO L207 NwaCegarLoop]: Found error trace [2024-10-13 05:54:39,844 INFO L215 NwaCegarLoop]: trace histogram [15, 15, 15, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-13 05:54:39,845 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19 [2024-10-13 05:54:39,845 INFO L396 AbstractCegarLoop]: === Iteration 21 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-13 05:54:39,845 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 05:54:39,845 INFO L85 PathProgramCache]: Analyzing trace with hash -1378580438, now seen corresponding path program 1 times [2024-10-13 05:54:39,846 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-13 05:54:39,846 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [293728580] [2024-10-13 05:54:39,846 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 05:54:39,846 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-13 05:54:39,874 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 05:54:40,039 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-13 05:54:40,040 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 05:54:40,040 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2024-10-13 05:54:40,041 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 05:54:40,042 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-10-13 05:54:40,042 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 05:54:40,042 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2024-10-13 05:54:40,043 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 05:54:40,043 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2024-10-13 05:54:40,044 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 05:54:40,044 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2024-10-13 05:54:40,045 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 05:54:40,045 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2024-10-13 05:54:40,046 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 05:54:40,046 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2024-10-13 05:54:40,047 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 05:54:40,048 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2024-10-13 05:54:40,049 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 05:54:40,050 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2024-10-13 05:54:40,050 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 05:54:40,051 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2024-10-13 05:54:40,051 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 05:54:40,052 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 80 [2024-10-13 05:54:40,052 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 05:54:40,053 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 86 [2024-10-13 05:54:40,053 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 05:54:40,054 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 92 [2024-10-13 05:54:40,054 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 05:54:40,055 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 98 [2024-10-13 05:54:40,055 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 05:54:40,056 INFO L134 CoverageAnalysis]: Checked inductivity of 420 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 420 trivial. 0 not checked. [2024-10-13 05:54:40,057 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-13 05:54:40,057 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [293728580] [2024-10-13 05:54:40,057 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [293728580] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-13 05:54:40,057 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-13 05:54:40,057 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-10-13 05:54:40,057 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [182001103] [2024-10-13 05:54:40,057 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-13 05:54:40,058 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-10-13 05:54:40,059 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-13 05:54:40,059 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-10-13 05:54:40,059 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2024-10-13 05:54:40,060 INFO L87 Difference]: Start difference. First operand 641 states and 898 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, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 1 states have call successors, (15) [2024-10-13 05:54:40,150 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-13 05:54:40,150 INFO L93 Difference]: Finished difference Result 1089 states and 1521 transitions. [2024-10-13 05:54:40,150 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-10-13 05:54:40,151 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, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 1 states have call successors, (15) Word has length 133 [2024-10-13 05:54:40,151 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-13 05:54:40,153 INFO L225 Difference]: With dead ends: 1089 [2024-10-13 05:54:40,154 INFO L226 Difference]: Without dead ends: 639 [2024-10-13 05:54:40,155 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 36 GetRequests, 32 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2024-10-13 05:54:40,155 INFO L432 NwaCegarLoop]: 272 mSDtfsCounter, 131 mSDsluCounter, 525 mSDsCounter, 0 mSdLazyCounter, 86 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 131 SdHoareTripleChecker+Valid, 797 SdHoareTripleChecker+Invalid, 89 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 86 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-13 05:54:40,155 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [131 Valid, 797 Invalid, 89 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 86 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-13 05:54:40,156 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 639 states. [2024-10-13 05:54:40,186 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 639 to 633. [2024-10-13 05:54:40,188 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 633 states, 536 states have (on average 1.335820895522388) internal successors, (716), 538 states have internal predecessors, (716), 84 states have call successors, (84), 12 states have call predecessors, (84), 12 states have return successors, (84), 82 states have call predecessors, (84), 84 states have call successors, (84) [2024-10-13 05:54:40,190 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 633 states to 633 states and 884 transitions. [2024-10-13 05:54:40,191 INFO L78 Accepts]: Start accepts. Automaton has 633 states and 884 transitions. Word has length 133 [2024-10-13 05:54:40,191 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-13 05:54:40,191 INFO L471 AbstractCegarLoop]: Abstraction has 633 states and 884 transitions. [2024-10-13 05:54:40,191 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, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 1 states have call successors, (15) [2024-10-13 05:54:40,191 INFO L276 IsEmpty]: Start isEmpty. Operand 633 states and 884 transitions. [2024-10-13 05:54:40,192 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 135 [2024-10-13 05:54:40,192 INFO L207 NwaCegarLoop]: Found error trace [2024-10-13 05:54:40,192 INFO L215 NwaCegarLoop]: trace histogram [15, 15, 15, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-13 05:54:40,193 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20 [2024-10-13 05:54:40,193 INFO L396 AbstractCegarLoop]: === Iteration 22 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-13 05:54:40,193 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 05:54:40,193 INFO L85 PathProgramCache]: Analyzing trace with hash 77086091, now seen corresponding path program 1 times [2024-10-13 05:54:40,193 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-13 05:54:40,193 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1318109154] [2024-10-13 05:54:40,193 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 05:54:40,194 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-13 05:54:40,213 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 05:54:40,305 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-13 05:54:40,305 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 05:54:40,306 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2024-10-13 05:54:40,307 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 05:54:40,308 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-10-13 05:54:40,308 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 05:54:40,309 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2024-10-13 05:54:40,309 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 05:54:40,310 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2024-10-13 05:54:40,310 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 05:54:40,313 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2024-10-13 05:54:40,314 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 05:54:40,315 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2024-10-13 05:54:40,315 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 05:54:40,316 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2024-10-13 05:54:40,319 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 05:54:40,320 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2024-10-13 05:54:40,321 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 05:54:40,322 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2024-10-13 05:54:40,322 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 05:54:40,323 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2024-10-13 05:54:40,323 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 05:54:40,324 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 80 [2024-10-13 05:54:40,324 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 05:54:40,325 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 86 [2024-10-13 05:54:40,326 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 05:54:40,326 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 92 [2024-10-13 05:54:40,326 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 05:54:40,327 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 98 [2024-10-13 05:54:40,328 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 05:54:40,329 INFO L134 CoverageAnalysis]: Checked inductivity of 420 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 420 trivial. 0 not checked. [2024-10-13 05:54:40,329 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-13 05:54:40,329 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1318109154] [2024-10-13 05:54:40,330 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1318109154] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-13 05:54:40,330 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-13 05:54:40,330 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-10-13 05:54:40,330 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [683841141] [2024-10-13 05:54:40,330 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-13 05:54:40,330 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-10-13 05:54:40,330 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-13 05:54:40,331 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-10-13 05:54:40,331 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2024-10-13 05:54:40,331 INFO L87 Difference]: Start difference. First operand 633 states and 884 transitions. Second operand has 6 states, 6 states have (on average 10.333333333333334) internal successors, (62), 6 states have internal predecessors, (62), 1 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 1 states have call successors, (15) [2024-10-13 05:54:40,396 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-13 05:54:40,397 INFO L93 Difference]: Finished difference Result 1289 states and 1797 transitions. [2024-10-13 05:54:40,397 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-10-13 05:54:40,397 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 10.333333333333334) internal successors, (62), 6 states have internal predecessors, (62), 1 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 1 states have call successors, (15) Word has length 134 [2024-10-13 05:54:40,397 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-13 05:54:40,400 INFO L225 Difference]: With dead ends: 1289 [2024-10-13 05:54:40,400 INFO L226 Difference]: Without dead ends: 657 [2024-10-13 05:54:40,402 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 37 GetRequests, 33 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2024-10-13 05:54:40,403 INFO L432 NwaCegarLoop]: 142 mSDtfsCounter, 0 mSDsluCounter, 557 mSDsCounter, 0 mSdLazyCounter, 50 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 699 SdHoareTripleChecker+Invalid, 50 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 50 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-13 05:54:40,403 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 699 Invalid, 50 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 50 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-13 05:54:40,404 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 657 states. [2024-10-13 05:54:40,432 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 657 to 657. [2024-10-13 05:54:40,434 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 657 states, 560 states have (on average 1.3214285714285714) internal successors, (740), 562 states have internal predecessors, (740), 84 states have call successors, (84), 12 states have call predecessors, (84), 12 states have return successors, (84), 82 states have call predecessors, (84), 84 states have call successors, (84) [2024-10-13 05:54:40,435 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 657 states to 657 states and 908 transitions. [2024-10-13 05:54:40,436 INFO L78 Accepts]: Start accepts. Automaton has 657 states and 908 transitions. Word has length 134 [2024-10-13 05:54:40,436 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-13 05:54:40,436 INFO L471 AbstractCegarLoop]: Abstraction has 657 states and 908 transitions. [2024-10-13 05:54:40,437 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 10.333333333333334) internal successors, (62), 6 states have internal predecessors, (62), 1 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 1 states have call successors, (15) [2024-10-13 05:54:40,437 INFO L276 IsEmpty]: Start isEmpty. Operand 657 states and 908 transitions. [2024-10-13 05:54:40,438 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 135 [2024-10-13 05:54:40,438 INFO L207 NwaCegarLoop]: Found error trace [2024-10-13 05:54:40,438 INFO L215 NwaCegarLoop]: trace histogram [15, 15, 15, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-13 05:54:40,438 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable21 [2024-10-13 05:54:40,438 INFO L396 AbstractCegarLoop]: === Iteration 23 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-13 05:54:40,438 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 05:54:40,438 INFO L85 PathProgramCache]: Analyzing trace with hash -65045251, now seen corresponding path program 1 times [2024-10-13 05:54:40,438 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-13 05:54:40,438 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1127480435] [2024-10-13 05:54:40,439 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 05:54:40,439 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-13 05:54:40,461 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 05:54:40,482 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-13 05:54:40,483 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 05:54:40,484 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2024-10-13 05:54:40,484 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 05:54:40,485 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-10-13 05:54:40,485 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 05:54:40,486 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2024-10-13 05:54:40,486 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 05:54:40,487 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2024-10-13 05:54:40,487 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 05:54:40,488 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2024-10-13 05:54:40,488 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 05:54:40,489 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2024-10-13 05:54:40,489 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 05:54:40,489 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2024-10-13 05:54:40,490 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 05:54:40,493 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2024-10-13 05:54:40,493 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 05:54:40,494 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2024-10-13 05:54:40,494 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 05:54:40,495 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2024-10-13 05:54:40,498 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 05:54:40,498 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 80 [2024-10-13 05:54:40,499 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 05:54:40,499 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 86 [2024-10-13 05:54:40,500 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 05:54:40,500 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 92 [2024-10-13 05:54:40,501 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 05:54:40,501 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 98 [2024-10-13 05:54:40,502 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 05:54:40,503 INFO L134 CoverageAnalysis]: Checked inductivity of 420 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 420 trivial. 0 not checked. [2024-10-13 05:54:40,503 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-13 05:54:40,503 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1127480435] [2024-10-13 05:54:40,503 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1127480435] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-13 05:54:40,503 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-13 05:54:40,503 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-13 05:54:40,504 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [442390565] [2024-10-13 05:54:40,504 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-13 05:54:40,504 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-13 05:54:40,504 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-13 05:54:40,504 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-13 05:54:40,506 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-13 05:54:40,507 INFO L87 Difference]: Start difference. First operand 657 states and 908 transitions. Second operand has 3 states, 3 states have (on average 20.666666666666668) internal successors, (62), 3 states have internal predecessors, (62), 1 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 1 states have call successors, (15) [2024-10-13 05:54:40,544 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-13 05:54:40,545 INFO L93 Difference]: Finished difference Result 1301 states and 1797 transitions. [2024-10-13 05:54:40,545 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-13 05:54:40,545 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 20.666666666666668) internal successors, (62), 3 states have internal predecessors, (62), 1 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 1 states have call successors, (15) Word has length 134 [2024-10-13 05:54:40,546 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-13 05:54:40,549 INFO L225 Difference]: With dead ends: 1301 [2024-10-13 05:54:40,550 INFO L226 Difference]: Without dead ends: 645 [2024-10-13 05:54:40,551 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 33 GetRequests, 32 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-10-13 05:54:40,552 INFO L432 NwaCegarLoop]: 141 mSDtfsCounter, 0 mSDsluCounter, 137 mSDsCounter, 0 mSdLazyCounter, 12 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 278 SdHoareTripleChecker+Invalid, 13 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 12 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-13 05:54:40,552 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 278 Invalid, 13 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 12 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-13 05:54:40,553 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 645 states. [2024-10-13 05:54:40,601 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 645 to 645. [2024-10-13 05:54:40,603 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 645 states, 548 states have (on average 1.3065693430656935) internal successors, (716), 550 states have internal predecessors, (716), 84 states have call successors, (84), 12 states have call predecessors, (84), 12 states have return successors, (84), 82 states have call predecessors, (84), 84 states have call successors, (84) [2024-10-13 05:54:40,605 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 645 states to 645 states and 884 transitions. [2024-10-13 05:54:40,606 INFO L78 Accepts]: Start accepts. Automaton has 645 states and 884 transitions. Word has length 134 [2024-10-13 05:54:40,606 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-13 05:54:40,606 INFO L471 AbstractCegarLoop]: Abstraction has 645 states and 884 transitions. [2024-10-13 05:54:40,606 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 20.666666666666668) internal successors, (62), 3 states have internal predecessors, (62), 1 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 1 states have call successors, (15) [2024-10-13 05:54:40,606 INFO L276 IsEmpty]: Start isEmpty. Operand 645 states and 884 transitions. [2024-10-13 05:54:40,607 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 137 [2024-10-13 05:54:40,607 INFO L207 NwaCegarLoop]: Found error trace [2024-10-13 05:54:40,607 INFO L215 NwaCegarLoop]: trace histogram [15, 15, 15, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-13 05:54:40,608 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable22 [2024-10-13 05:54:40,608 INFO L396 AbstractCegarLoop]: === Iteration 24 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-13 05:54:40,608 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 05:54:40,608 INFO L85 PathProgramCache]: Analyzing trace with hash -1383739920, now seen corresponding path program 1 times [2024-10-13 05:54:40,608 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-13 05:54:40,608 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [877078413] [2024-10-13 05:54:40,608 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 05:54:40,609 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-13 05:54:40,635 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 05:54:40,835 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-13 05:54:40,836 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 05:54:40,837 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2024-10-13 05:54:40,837 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 05:54:40,838 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-10-13 05:54:40,838 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 05:54:40,839 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2024-10-13 05:54:40,839 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 05:54:40,840 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2024-10-13 05:54:40,840 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 05:54:40,841 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2024-10-13 05:54:40,841 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 05:54:40,843 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2024-10-13 05:54:40,843 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 05:54:40,844 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2024-10-13 05:54:40,845 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 05:54:40,845 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2024-10-13 05:54:40,847 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 05:54:40,847 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2024-10-13 05:54:40,848 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 05:54:40,848 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2024-10-13 05:54:40,849 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 05:54:40,849 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 80 [2024-10-13 05:54:40,850 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 05:54:40,850 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 86 [2024-10-13 05:54:40,851 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 05:54:40,851 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 92 [2024-10-13 05:54:40,852 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 05:54:40,853 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 98 [2024-10-13 05:54:40,855 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 05:54:40,857 INFO L134 CoverageAnalysis]: Checked inductivity of 420 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 420 trivial. 0 not checked. [2024-10-13 05:54:40,858 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-13 05:54:40,858 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [877078413] [2024-10-13 05:54:40,858 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [877078413] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-13 05:54:40,858 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-13 05:54:40,858 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-10-13 05:54:40,858 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1761823212] [2024-10-13 05:54:40,858 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-13 05:54:40,858 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-10-13 05:54:40,858 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-13 05:54:40,859 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-10-13 05:54:40,859 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2024-10-13 05:54:40,859 INFO L87 Difference]: Start difference. First operand 645 states and 884 transitions. Second operand has 6 states, 5 states have (on average 12.8) internal successors, (64), 6 states have internal predecessors, (64), 2 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 2 states have call successors, (15) [2024-10-13 05:54:40,930 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-13 05:54:40,931 INFO L93 Difference]: Finished difference Result 1373 states and 1871 transitions. [2024-10-13 05:54:40,931 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-10-13 05:54:40,931 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 12.8) internal successors, (64), 6 states have internal predecessors, (64), 2 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 2 states have call successors, (15) Word has length 136 [2024-10-13 05:54:40,932 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-13 05:54:40,935 INFO L225 Difference]: With dead ends: 1373 [2024-10-13 05:54:40,935 INFO L226 Difference]: Without dead ends: 729 [2024-10-13 05:54:40,937 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 38 GetRequests, 33 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-10-13 05:54:40,937 INFO L432 NwaCegarLoop]: 138 mSDtfsCounter, 70 mSDsluCounter, 401 mSDsCounter, 0 mSdLazyCounter, 51 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 71 SdHoareTripleChecker+Valid, 539 SdHoareTripleChecker+Invalid, 51 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 51 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-13 05:54:40,937 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [71 Valid, 539 Invalid, 51 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 51 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-13 05:54:40,938 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 729 states. [2024-10-13 05:54:40,970 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 729 to 669. [2024-10-13 05:54:40,971 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 669 states, 572 states have (on average 1.2884615384615385) internal successors, (737), 574 states have internal predecessors, (737), 84 states have call successors, (84), 12 states have call predecessors, (84), 12 states have return successors, (84), 82 states have call predecessors, (84), 84 states have call successors, (84) [2024-10-13 05:54:40,973 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 669 states to 669 states and 905 transitions. [2024-10-13 05:54:40,974 INFO L78 Accepts]: Start accepts. Automaton has 669 states and 905 transitions. Word has length 136 [2024-10-13 05:54:40,974 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-13 05:54:40,974 INFO L471 AbstractCegarLoop]: Abstraction has 669 states and 905 transitions. [2024-10-13 05:54:40,974 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 12.8) internal successors, (64), 6 states have internal predecessors, (64), 2 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 2 states have call successors, (15) [2024-10-13 05:54:40,974 INFO L276 IsEmpty]: Start isEmpty. Operand 669 states and 905 transitions. [2024-10-13 05:54:40,975 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 137 [2024-10-13 05:54:40,976 INFO L207 NwaCegarLoop]: Found error trace [2024-10-13 05:54:40,976 INFO L215 NwaCegarLoop]: trace histogram [15, 15, 15, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-13 05:54:40,976 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable23 [2024-10-13 05:54:40,976 INFO L396 AbstractCegarLoop]: === Iteration 25 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-13 05:54:40,977 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 05:54:40,977 INFO L85 PathProgramCache]: Analyzing trace with hash -1125574482, now seen corresponding path program 1 times [2024-10-13 05:54:40,977 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-13 05:54:40,978 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1112227281] [2024-10-13 05:54:40,978 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 05:54:40,978 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-13 05:54:41,004 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 05:54:41,296 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-13 05:54:41,297 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 05:54:41,297 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2024-10-13 05:54:41,298 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 05:54:41,298 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-10-13 05:54:41,299 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 05:54:41,299 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2024-10-13 05:54:41,300 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 05:54:41,300 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2024-10-13 05:54:41,301 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 05:54:41,301 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2024-10-13 05:54:41,302 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 05:54:41,302 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2024-10-13 05:54:41,304 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 05:54:41,304 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2024-10-13 05:54:41,305 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 05:54:41,305 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2024-10-13 05:54:41,306 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 05:54:41,306 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2024-10-13 05:54:41,308 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 05:54:41,308 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2024-10-13 05:54:41,308 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 05:54:41,309 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 80 [2024-10-13 05:54:41,309 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 05:54:41,310 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 86 [2024-10-13 05:54:41,310 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 05:54:41,310 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 92 [2024-10-13 05:54:41,311 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 05:54:41,312 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 98 [2024-10-13 05:54:41,313 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 05:54:41,314 INFO L134 CoverageAnalysis]: Checked inductivity of 420 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 420 trivial. 0 not checked. [2024-10-13 05:54:41,314 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-13 05:54:41,314 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1112227281] [2024-10-13 05:54:41,314 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1112227281] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-13 05:54:41,314 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-13 05:54:41,314 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-10-13 05:54:41,314 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1159849887] [2024-10-13 05:54:41,314 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-13 05:54:41,315 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-10-13 05:54:41,315 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-13 05:54:41,315 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-10-13 05:54:41,315 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2024-10-13 05:54:41,316 INFO L87 Difference]: Start difference. First operand 669 states and 905 transitions. Second operand has 7 states, 7 states have (on average 9.142857142857142) internal successors, (64), 7 states have internal predecessors, (64), 1 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 1 states have call successors, (15) [2024-10-13 05:54:41,611 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-13 05:54:41,611 INFO L93 Difference]: Finished difference Result 1230 states and 1650 transitions. [2024-10-13 05:54:41,612 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-10-13 05:54:41,612 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 9.142857142857142) internal successors, (64), 7 states have internal predecessors, (64), 1 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 1 states have call successors, (15) Word has length 136 [2024-10-13 05:54:41,612 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-13 05:54:41,615 INFO L225 Difference]: With dead ends: 1230 [2024-10-13 05:54:41,616 INFO L226 Difference]: Without dead ends: 885 [2024-10-13 05:54:41,617 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 43 GetRequests, 34 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=32, Invalid=78, Unknown=0, NotChecked=0, Total=110 [2024-10-13 05:54:41,617 INFO L432 NwaCegarLoop]: 274 mSDtfsCounter, 235 mSDsluCounter, 814 mSDsCounter, 0 mSdLazyCounter, 244 mSolverCounterSat, 12 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 235 SdHoareTripleChecker+Valid, 1088 SdHoareTripleChecker+Invalid, 256 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 12 IncrementalHoareTripleChecker+Valid, 244 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-10-13 05:54:41,619 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [235 Valid, 1088 Invalid, 256 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [12 Valid, 244 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-10-13 05:54:41,620 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 885 states. [2024-10-13 05:54:41,659 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 885 to 873. [2024-10-13 05:54:41,660 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 873 states, 755 states have (on average 1.280794701986755) internal successors, (967), 760 states have internal predecessors, (967), 102 states have call successors, (102), 15 states have call predecessors, (102), 15 states have return successors, (102), 97 states have call predecessors, (102), 102 states have call successors, (102) [2024-10-13 05:54:41,663 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 873 states to 873 states and 1171 transitions. [2024-10-13 05:54:41,665 INFO L78 Accepts]: Start accepts. Automaton has 873 states and 1171 transitions. Word has length 136 [2024-10-13 05:54:41,665 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-13 05:54:41,665 INFO L471 AbstractCegarLoop]: Abstraction has 873 states and 1171 transitions. [2024-10-13 05:54:41,666 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 9.142857142857142) internal successors, (64), 7 states have internal predecessors, (64), 1 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 1 states have call successors, (15) [2024-10-13 05:54:41,666 INFO L276 IsEmpty]: Start isEmpty. Operand 873 states and 1171 transitions. [2024-10-13 05:54:41,667 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 137 [2024-10-13 05:54:41,667 INFO L207 NwaCegarLoop]: Found error trace [2024-10-13 05:54:41,667 INFO L215 NwaCegarLoop]: trace histogram [15, 15, 15, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-13 05:54:41,667 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable24 [2024-10-13 05:54:41,668 INFO L396 AbstractCegarLoop]: === Iteration 26 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-13 05:54:41,668 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 05:54:41,668 INFO L85 PathProgramCache]: Analyzing trace with hash -423974608, now seen corresponding path program 1 times [2024-10-13 05:54:41,668 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-13 05:54:41,668 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1253109042] [2024-10-13 05:54:41,668 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 05:54:41,669 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-13 05:54:41,693 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 05:54:41,916 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-13 05:54:41,918 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 05:54:41,919 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2024-10-13 05:54:41,920 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 05:54:41,921 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-10-13 05:54:41,922 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 05:54:41,923 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2024-10-13 05:54:41,924 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 05:54:41,925 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2024-10-13 05:54:41,926 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 05:54:41,927 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2024-10-13 05:54:41,928 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 05:54:41,929 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2024-10-13 05:54:41,930 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 05:54:41,932 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2024-10-13 05:54:41,933 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 05:54:41,934 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2024-10-13 05:54:41,936 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 05:54:41,937 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2024-10-13 05:54:41,938 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 05:54:41,940 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2024-10-13 05:54:41,940 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 05:54:41,942 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 80 [2024-10-13 05:54:41,943 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 05:54:41,944 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 86 [2024-10-13 05:54:41,945 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 05:54:41,946 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 92 [2024-10-13 05:54:41,947 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 05:54:41,947 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 98 [2024-10-13 05:54:41,948 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 05:54:41,950 INFO L134 CoverageAnalysis]: Checked inductivity of 420 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 420 trivial. 0 not checked. [2024-10-13 05:54:41,950 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-13 05:54:41,951 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1253109042] [2024-10-13 05:54:41,951 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1253109042] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-13 05:54:41,951 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-13 05:54:41,951 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-10-13 05:54:41,951 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1078774272] [2024-10-13 05:54:41,951 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-13 05:54:41,952 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-10-13 05:54:41,952 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-13 05:54:41,953 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-10-13 05:54:41,953 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2024-10-13 05:54:41,953 INFO L87 Difference]: Start difference. First operand 873 states and 1171 transitions. Second operand has 7 states, 7 states have (on average 9.142857142857142) internal successors, (64), 7 states have internal predecessors, (64), 1 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 1 states have call successors, (15) [2024-10-13 05:54:42,244 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-13 05:54:42,244 INFO L93 Difference]: Finished difference Result 1948 states and 2606 transitions. [2024-10-13 05:54:42,244 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-10-13 05:54:42,245 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 9.142857142857142) internal successors, (64), 7 states have internal predecessors, (64), 1 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 1 states have call successors, (15) Word has length 136 [2024-10-13 05:54:42,245 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-13 05:54:42,250 INFO L225 Difference]: With dead ends: 1948 [2024-10-13 05:54:42,251 INFO L226 Difference]: Without dead ends: 1076 [2024-10-13 05:54:42,253 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 37 GetRequests, 31 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=20, Invalid=36, Unknown=0, NotChecked=0, Total=56 [2024-10-13 05:54:42,253 INFO L432 NwaCegarLoop]: 237 mSDtfsCounter, 166 mSDsluCounter, 648 mSDsCounter, 0 mSdLazyCounter, 255 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 166 SdHoareTripleChecker+Valid, 885 SdHoareTripleChecker+Invalid, 255 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 255 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-10-13 05:54:42,255 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [166 Valid, 885 Invalid, 255 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 255 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-10-13 05:54:42,256 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1076 states. [2024-10-13 05:54:42,314 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1076 to 1065. [2024-10-13 05:54:42,315 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1065 states, 926 states have (on average 1.2786177105831533) internal successors, (1184), 934 states have internal predecessors, (1184), 120 states have call successors, (120), 18 states have call predecessors, (120), 18 states have return successors, (120), 112 states have call predecessors, (120), 120 states have call successors, (120) [2024-10-13 05:54:42,317 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1065 states to 1065 states and 1424 transitions. [2024-10-13 05:54:42,320 INFO L78 Accepts]: Start accepts. Automaton has 1065 states and 1424 transitions. Word has length 136 [2024-10-13 05:54:42,321 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-13 05:54:42,321 INFO L471 AbstractCegarLoop]: Abstraction has 1065 states and 1424 transitions. [2024-10-13 05:54:42,321 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 9.142857142857142) internal successors, (64), 7 states have internal predecessors, (64), 1 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 1 states have call successors, (15) [2024-10-13 05:54:42,321 INFO L276 IsEmpty]: Start isEmpty. Operand 1065 states and 1424 transitions. [2024-10-13 05:54:42,322 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 138 [2024-10-13 05:54:42,322 INFO L207 NwaCegarLoop]: Found error trace [2024-10-13 05:54:42,322 INFO L215 NwaCegarLoop]: trace histogram [15, 15, 15, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-13 05:54:42,322 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable25 [2024-10-13 05:54:42,322 INFO L396 AbstractCegarLoop]: === Iteration 27 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-13 05:54:42,322 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 05:54:42,323 INFO L85 PathProgramCache]: Analyzing trace with hash 921524391, now seen corresponding path program 1 times [2024-10-13 05:54:42,323 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-13 05:54:42,323 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [206810475] [2024-10-13 05:54:42,323 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 05:54:42,323 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-13 05:54:42,350 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 05:54:42,550 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-13 05:54:42,551 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 05:54:42,551 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2024-10-13 05:54:42,552 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 05:54:42,552 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-10-13 05:54:42,553 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 05:54:42,553 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2024-10-13 05:54:42,554 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 05:54:42,554 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2024-10-13 05:54:42,555 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 05:54:42,555 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2024-10-13 05:54:42,556 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 05:54:42,556 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2024-10-13 05:54:42,556 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 05:54:42,557 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2024-10-13 05:54:42,557 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 05:54:42,558 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2024-10-13 05:54:42,558 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 05:54:42,559 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2024-10-13 05:54:42,559 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 05:54:42,559 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2024-10-13 05:54:42,560 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 05:54:42,560 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 80 [2024-10-13 05:54:42,561 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 05:54:42,561 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 86 [2024-10-13 05:54:42,561 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 05:54:42,562 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 92 [2024-10-13 05:54:42,562 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 05:54:42,563 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 98 [2024-10-13 05:54:42,563 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 05:54:42,564 INFO L134 CoverageAnalysis]: Checked inductivity of 420 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 420 trivial. 0 not checked. [2024-10-13 05:54:42,564 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-13 05:54:42,564 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [206810475] [2024-10-13 05:54:42,565 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [206810475] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-13 05:54:42,565 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-13 05:54:42,565 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-10-13 05:54:42,565 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [5912725] [2024-10-13 05:54:42,565 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-13 05:54:42,565 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-10-13 05:54:42,565 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-13 05:54:42,566 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-10-13 05:54:42,566 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2024-10-13 05:54:42,566 INFO L87 Difference]: Start difference. First operand 1065 states and 1424 transitions. Second operand has 7 states, 7 states have (on average 9.285714285714286) internal successors, (65), 7 states have internal predecessors, (65), 1 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 1 states have call successors, (15) [2024-10-13 05:54:42,813 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-13 05:54:42,814 INFO L93 Difference]: Finished difference Result 1848 states and 2459 transitions. [2024-10-13 05:54:42,814 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-10-13 05:54:42,814 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 9.285714285714286) internal successors, (65), 7 states have internal predecessors, (65), 1 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 1 states have call successors, (15) Word has length 137 [2024-10-13 05:54:42,814 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-13 05:54:42,819 INFO L225 Difference]: With dead ends: 1848 [2024-10-13 05:54:42,819 INFO L226 Difference]: Without dead ends: 1299 [2024-10-13 05:54:42,820 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 43 GetRequests, 34 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=31, Invalid=79, Unknown=0, NotChecked=0, Total=110 [2024-10-13 05:54:42,821 INFO L432 NwaCegarLoop]: 227 mSDtfsCounter, 256 mSDsluCounter, 929 mSDsCounter, 0 mSdLazyCounter, 261 mSolverCounterSat, 24 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 256 SdHoareTripleChecker+Valid, 1156 SdHoareTripleChecker+Invalid, 285 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 24 IncrementalHoareTripleChecker+Valid, 261 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-10-13 05:54:42,821 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [256 Valid, 1156 Invalid, 285 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [24 Valid, 261 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-10-13 05:54:42,822 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1299 states. [2024-10-13 05:54:42,893 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1299 to 1148. [2024-10-13 05:54:42,894 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1148 states, 1009 states have (on average 1.263627353815659) internal successors, (1275), 1017 states have internal predecessors, (1275), 120 states have call successors, (120), 18 states have call predecessors, (120), 18 states have return successors, (120), 112 states have call predecessors, (120), 120 states have call successors, (120) [2024-10-13 05:54:42,896 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1148 states to 1148 states and 1515 transitions. [2024-10-13 05:54:42,897 INFO L78 Accepts]: Start accepts. Automaton has 1148 states and 1515 transitions. Word has length 137 [2024-10-13 05:54:42,897 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-13 05:54:42,898 INFO L471 AbstractCegarLoop]: Abstraction has 1148 states and 1515 transitions. [2024-10-13 05:54:42,898 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 9.285714285714286) internal successors, (65), 7 states have internal predecessors, (65), 1 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 1 states have call successors, (15) [2024-10-13 05:54:42,898 INFO L276 IsEmpty]: Start isEmpty. Operand 1148 states and 1515 transitions. [2024-10-13 05:54:42,899 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 138 [2024-10-13 05:54:42,899 INFO L207 NwaCegarLoop]: Found error trace [2024-10-13 05:54:42,899 INFO L215 NwaCegarLoop]: trace histogram [15, 15, 15, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-13 05:54:42,899 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable26 [2024-10-13 05:54:42,899 INFO L396 AbstractCegarLoop]: === Iteration 28 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-13 05:54:42,899 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 05:54:42,900 INFO L85 PathProgramCache]: Analyzing trace with hash 1601582761, now seen corresponding path program 1 times [2024-10-13 05:54:42,900 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-13 05:54:42,900 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1953641767] [2024-10-13 05:54:42,900 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 05:54:42,900 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-13 05:54:42,924 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 05:54:43,021 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-13 05:54:43,023 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 05:54:43,025 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2024-10-13 05:54:43,027 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 05:54:43,028 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-10-13 05:54:43,028 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 05:54:43,029 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2024-10-13 05:54:43,029 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 05:54:43,030 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2024-10-13 05:54:43,030 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 05:54:43,031 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2024-10-13 05:54:43,031 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 05:54:43,032 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2024-10-13 05:54:43,032 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 05:54:43,033 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2024-10-13 05:54:43,033 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 05:54:43,034 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2024-10-13 05:54:43,034 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 05:54:43,035 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2024-10-13 05:54:43,036 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 05:54:43,036 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2024-10-13 05:54:43,036 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 05:54:43,037 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 80 [2024-10-13 05:54:43,037 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 05:54:43,038 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 86 [2024-10-13 05:54:43,038 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 05:54:43,039 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 92 [2024-10-13 05:54:43,039 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 05:54:43,040 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 98 [2024-10-13 05:54:43,040 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 05:54:43,041 INFO L134 CoverageAnalysis]: Checked inductivity of 420 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 420 trivial. 0 not checked. [2024-10-13 05:54:43,041 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-13 05:54:43,041 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1953641767] [2024-10-13 05:54:43,041 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1953641767] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-13 05:54:43,041 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-13 05:54:43,041 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-13 05:54:43,042 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [452943040] [2024-10-13 05:54:43,042 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-13 05:54:43,042 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-13 05:54:43,042 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-13 05:54:43,042 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-13 05:54:43,043 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-13 05:54:43,043 INFO L87 Difference]: Start difference. First operand 1148 states and 1515 transitions. Second operand has 3 states, 3 states have (on average 21.666666666666668) internal successors, (65), 3 states have internal predecessors, (65), 1 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 1 states have call successors, (15) [2024-10-13 05:54:43,095 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-13 05:54:43,095 INFO L93 Difference]: Finished difference Result 2194 states and 2911 transitions. [2024-10-13 05:54:43,096 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-13 05:54:43,096 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 21.666666666666668) internal successors, (65), 3 states have internal predecessors, (65), 1 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 1 states have call successors, (15) Word has length 137 [2024-10-13 05:54:43,096 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-13 05:54:43,100 INFO L225 Difference]: With dead ends: 2194 [2024-10-13 05:54:43,100 INFO L226 Difference]: Without dead ends: 1047 [2024-10-13 05:54:43,103 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 34 GetRequests, 33 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-10-13 05:54:43,103 INFO L432 NwaCegarLoop]: 137 mSDtfsCounter, 0 mSDsluCounter, 133 mSDsCounter, 0 mSdLazyCounter, 12 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 270 SdHoareTripleChecker+Invalid, 13 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 12 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-13 05:54:43,103 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 270 Invalid, 13 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 12 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-13 05:54:43,104 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1047 states. [2024-10-13 05:54:43,153 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1047 to 1047. [2024-10-13 05:54:43,154 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1047 states, 908 states have (on average 1.2643171806167401) internal successors, (1148), 916 states have internal predecessors, (1148), 120 states have call successors, (120), 18 states have call predecessors, (120), 18 states have return successors, (120), 112 states have call predecessors, (120), 120 states have call successors, (120) [2024-10-13 05:54:43,156 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1047 states to 1047 states and 1388 transitions. [2024-10-13 05:54:43,157 INFO L78 Accepts]: Start accepts. Automaton has 1047 states and 1388 transitions. Word has length 137 [2024-10-13 05:54:43,157 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-13 05:54:43,157 INFO L471 AbstractCegarLoop]: Abstraction has 1047 states and 1388 transitions. [2024-10-13 05:54:43,158 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 21.666666666666668) internal successors, (65), 3 states have internal predecessors, (65), 1 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 1 states have call successors, (15) [2024-10-13 05:54:43,158 INFO L276 IsEmpty]: Start isEmpty. Operand 1047 states and 1388 transitions. [2024-10-13 05:54:43,159 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 138 [2024-10-13 05:54:43,159 INFO L207 NwaCegarLoop]: Found error trace [2024-10-13 05:54:43,159 INFO L215 NwaCegarLoop]: trace histogram [15, 15, 15, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-13 05:54:43,159 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable27 [2024-10-13 05:54:43,160 INFO L396 AbstractCegarLoop]: === Iteration 29 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-13 05:54:43,160 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 05:54:43,160 INFO L85 PathProgramCache]: Analyzing trace with hash 14606959, now seen corresponding path program 1 times [2024-10-13 05:54:43,160 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-13 05:54:43,160 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [880066213] [2024-10-13 05:54:43,160 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 05:54:43,161 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-13 05:54:43,187 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 05:54:43,421 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-13 05:54:43,422 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 05:54:43,423 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2024-10-13 05:54:43,423 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 05:54:43,424 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-10-13 05:54:43,424 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 05:54:43,425 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2024-10-13 05:54:43,425 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 05:54:43,426 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2024-10-13 05:54:43,426 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 05:54:43,427 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2024-10-13 05:54:43,427 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 05:54:43,428 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2024-10-13 05:54:43,428 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 05:54:43,428 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2024-10-13 05:54:43,429 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 05:54:43,429 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2024-10-13 05:54:43,430 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 05:54:43,430 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2024-10-13 05:54:43,430 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 05:54:43,431 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2024-10-13 05:54:43,431 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 05:54:43,432 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 80 [2024-10-13 05:54:43,432 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 05:54:43,433 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 86 [2024-10-13 05:54:43,433 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 05:54:43,434 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 92 [2024-10-13 05:54:43,434 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 05:54:43,434 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 98 [2024-10-13 05:54:43,435 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 05:54:43,436 INFO L134 CoverageAnalysis]: Checked inductivity of 420 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 420 trivial. 0 not checked. [2024-10-13 05:54:43,436 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-13 05:54:43,436 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [880066213] [2024-10-13 05:54:43,436 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [880066213] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-13 05:54:43,436 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-13 05:54:43,436 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-10-13 05:54:43,436 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1385662455] [2024-10-13 05:54:43,437 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-13 05:54:43,437 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-10-13 05:54:43,437 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-13 05:54:43,438 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-10-13 05:54:43,438 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2024-10-13 05:54:43,438 INFO L87 Difference]: Start difference. First operand 1047 states and 1388 transitions. Second operand has 6 states, 6 states have (on average 10.833333333333334) internal successors, (65), 6 states have internal predecessors, (65), 1 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 1 states have call successors, (15) [2024-10-13 05:54:43,574 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-13 05:54:43,574 INFO L93 Difference]: Finished difference Result 1075 states and 1423 transitions. [2024-10-13 05:54:43,575 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-10-13 05:54:43,575 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 10.833333333333334) internal successors, (65), 6 states have internal predecessors, (65), 1 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 1 states have call successors, (15) Word has length 137 [2024-10-13 05:54:43,575 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-13 05:54:43,579 INFO L225 Difference]: With dead ends: 1075 [2024-10-13 05:54:43,580 INFO L226 Difference]: Without dead ends: 1073 [2024-10-13 05:54:43,580 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 40 GetRequests, 33 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=21, Invalid=51, Unknown=0, NotChecked=0, Total=72 [2024-10-13 05:54:43,581 INFO L432 NwaCegarLoop]: 211 mSDtfsCounter, 116 mSDsluCounter, 750 mSDsCounter, 0 mSdLazyCounter, 107 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 116 SdHoareTripleChecker+Valid, 961 SdHoareTripleChecker+Invalid, 109 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 107 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-13 05:54:43,581 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [116 Valid, 961 Invalid, 109 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 107 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-13 05:54:43,585 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1073 states. [2024-10-13 05:54:43,628 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1073 to 1071. [2024-10-13 05:54:43,633 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1071 states, 932 states have (on average 1.2542918454935623) internal successors, (1169), 940 states have internal predecessors, (1169), 120 states have call successors, (120), 18 states have call predecessors, (120), 18 states have return successors, (120), 112 states have call predecessors, (120), 120 states have call successors, (120) [2024-10-13 05:54:43,636 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1071 states to 1071 states and 1409 transitions. [2024-10-13 05:54:43,637 INFO L78 Accepts]: Start accepts. Automaton has 1071 states and 1409 transitions. Word has length 137 [2024-10-13 05:54:43,638 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-13 05:54:43,638 INFO L471 AbstractCegarLoop]: Abstraction has 1071 states and 1409 transitions. [2024-10-13 05:54:43,638 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 10.833333333333334) internal successors, (65), 6 states have internal predecessors, (65), 1 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 1 states have call successors, (15) [2024-10-13 05:54:43,638 INFO L276 IsEmpty]: Start isEmpty. Operand 1071 states and 1409 transitions. [2024-10-13 05:54:43,639 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 138 [2024-10-13 05:54:43,639 INFO L207 NwaCegarLoop]: Found error trace [2024-10-13 05:54:43,639 INFO L215 NwaCegarLoop]: trace histogram [15, 15, 15, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-13 05:54:43,640 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable28 [2024-10-13 05:54:43,640 INFO L396 AbstractCegarLoop]: === Iteration 30 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-13 05:54:43,640 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 05:54:43,640 INFO L85 PathProgramCache]: Analyzing trace with hash 289366573, now seen corresponding path program 1 times [2024-10-13 05:54:43,640 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-13 05:54:43,640 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [479423588] [2024-10-13 05:54:43,640 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 05:54:43,640 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-13 05:54:43,703 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unknown [2024-10-13 05:54:43,706 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [327643799] [2024-10-13 05:54:43,706 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 05:54:43,706 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-13 05:54:43,706 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-13 05:54:43,708 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-10-13 05:54:43,709 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-10-13 05:54:43,963 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 05:54:43,970 INFO L255 TraceCheckSpWp]: Trace formula consists of 471 conjuncts, 53 conjuncts are in the unsatisfiable core [2024-10-13 05:54:43,987 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-13 05:54:44,180 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 27 treesize of output 11 [2024-10-13 05:54:44,259 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-10-13 05:54:44,259 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 36 treesize of output 23 [2024-10-13 05:54:44,598 INFO L134 CoverageAnalysis]: Checked inductivity of 420 backedges. 267 proven. 21 refuted. 0 times theorem prover too weak. 132 trivial. 0 not checked. [2024-10-13 05:54:44,599 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-13 05:54:45,291 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 33 treesize of output 21 [2024-10-13 05:54:45,409 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-13 05:54:45,410 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [479423588] [2024-10-13 05:54:45,410 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2024-10-13 05:54:45,410 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [327643799] [2024-10-13 05:54:45,410 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [327643799] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-13 05:54:45,410 INFO L185 FreeRefinementEngine]: Found 0 perfect and 1 imperfect interpolant sequences. [2024-10-13 05:54:45,411 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12] total 12 [2024-10-13 05:54:45,411 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1938439259] [2024-10-13 05:54:45,411 INFO L85 oduleStraightlineAll]: Using 1 imperfect interpolants to construct interpolant automaton [2024-10-13 05:54:45,411 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2024-10-13 05:54:45,412 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-13 05:54:45,412 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2024-10-13 05:54:45,412 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=142, Invalid=665, Unknown=5, NotChecked=0, Total=812 [2024-10-13 05:54:45,412 INFO L87 Difference]: Start difference. First operand 1071 states and 1409 transitions. Second operand has 13 states, 11 states have (on average 7.0) internal successors, (77), 12 states have internal predecessors, (77), 5 states have call successors, (15), 3 states have call predecessors, (15), 5 states have return successors, (15), 4 states have call predecessors, (15), 5 states have call successors, (15) [2024-10-13 05:54:46,078 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-13 05:54:46,078 INFO L93 Difference]: Finished difference Result 2025 states and 2644 transitions. [2024-10-13 05:54:46,078 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2024-10-13 05:54:46,078 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 11 states have (on average 7.0) internal successors, (77), 12 states have internal predecessors, (77), 5 states have call successors, (15), 3 states have call predecessors, (15), 5 states have return successors, (15), 4 states have call predecessors, (15), 5 states have call successors, (15) Word has length 137 [2024-10-13 05:54:46,079 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-13 05:54:46,083 INFO L225 Difference]: With dead ends: 2025 [2024-10-13 05:54:46,083 INFO L226 Difference]: Without dead ends: 955 [2024-10-13 05:54:46,085 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 197 GetRequests, 162 SyntacticMatches, 0 SemanticMatches, 35 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 248 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=247, Invalid=1080, Unknown=5, NotChecked=0, Total=1332 [2024-10-13 05:54:46,085 INFO L432 NwaCegarLoop]: 141 mSDtfsCounter, 278 mSDsluCounter, 820 mSDsCounter, 0 mSdLazyCounter, 596 mSolverCounterSat, 36 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 286 SdHoareTripleChecker+Valid, 961 SdHoareTripleChecker+Invalid, 632 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 36 IncrementalHoareTripleChecker+Valid, 596 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2024-10-13 05:54:46,086 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [286 Valid, 961 Invalid, 632 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [36 Valid, 596 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2024-10-13 05:54:46,087 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 955 states. [2024-10-13 05:54:46,127 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 955 to 839. [2024-10-13 05:54:46,128 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 839 states, 729 states have (on average 1.2345679012345678) internal successors, (900), 733 states have internal predecessors, (900), 90 states have call successors, (90), 19 states have call predecessors, (90), 19 states have return successors, (90), 86 states have call predecessors, (90), 90 states have call successors, (90) [2024-10-13 05:54:46,130 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 839 states to 839 states and 1080 transitions. [2024-10-13 05:54:46,131 INFO L78 Accepts]: Start accepts. Automaton has 839 states and 1080 transitions. Word has length 137 [2024-10-13 05:54:46,132 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-13 05:54:46,132 INFO L471 AbstractCegarLoop]: Abstraction has 839 states and 1080 transitions. [2024-10-13 05:54:46,132 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 11 states have (on average 7.0) internal successors, (77), 12 states have internal predecessors, (77), 5 states have call successors, (15), 3 states have call predecessors, (15), 5 states have return successors, (15), 4 states have call predecessors, (15), 5 states have call successors, (15) [2024-10-13 05:54:46,132 INFO L276 IsEmpty]: Start isEmpty. Operand 839 states and 1080 transitions. [2024-10-13 05:54:46,133 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 138 [2024-10-13 05:54:46,134 INFO L207 NwaCegarLoop]: Found error trace [2024-10-13 05:54:46,134 INFO L215 NwaCegarLoop]: trace histogram [15, 15, 15, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-13 05:54:46,151 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2024-10-13 05:54:46,334 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable29,2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-13 05:54:46,335 INFO L396 AbstractCegarLoop]: === Iteration 31 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-13 05:54:46,335 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 05:54:46,335 INFO L85 PathProgramCache]: Analyzing trace with hash 624246705, now seen corresponding path program 1 times [2024-10-13 05:54:46,336 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-13 05:54:46,336 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1155499407] [2024-10-13 05:54:46,336 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 05:54:46,336 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-13 05:54:46,380 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unknown [2024-10-13 05:54:46,382 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [287762257] [2024-10-13 05:54:46,382 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 05:54:46,382 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-13 05:54:46,383 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-13 05:54:46,384 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-10-13 05:54:46,386 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-10-13 05:54:46,690 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-13 05:54:46,690 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-10-13 05:54:46,799 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-13 05:54:46,901 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-10-13 05:54:46,901 INFO L325 BasicCegarLoop]: Counterexample is feasible [2024-10-13 05:54:46,902 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2024-10-13 05:54:46,920 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Ended with exit code 0 [2024-10-13 05:54:47,103 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable30 [2024-10-13 05:54:47,107 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-13 05:54:47,194 INFO L165 ceAbstractionStarter]: Computing trace abstraction results [2024-10-13 05:54:47,196 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 13.10 05:54:47 BoogieIcfgContainer [2024-10-13 05:54:47,196 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2024-10-13 05:54:47,196 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2024-10-13 05:54:47,196 INFO L270 PluginConnector]: Initializing Witness Printer... [2024-10-13 05:54:47,197 INFO L274 PluginConnector]: Witness Printer initialized [2024-10-13 05:54:47,199 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 13.10 05:54:27" (3/4) ... [2024-10-13 05:54:47,201 INFO L142 WitnessPrinter]: No result that supports witness generation found [2024-10-13 05:54:47,202 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2024-10-13 05:54:47,203 INFO L158 Benchmark]: Toolchain (without parser) took 20745.57ms. Allocated memory was 151.0MB in the beginning and 620.8MB in the end (delta: 469.8MB). Free memory was 99.8MB in the beginning and 377.1MB in the end (delta: -277.3MB). Peak memory consumption was 192.4MB. Max. memory is 16.1GB. [2024-10-13 05:54:47,204 INFO L158 Benchmark]: CDTParser took 0.12ms. Allocated memory is still 96.5MB. Free memory was 59.4MB in the beginning and 59.4MB in the end (delta: 76.9kB). There was no memory consumed. Max. memory is 16.1GB. [2024-10-13 05:54:47,204 INFO L158 Benchmark]: CACSL2BoogieTranslator took 371.67ms. Allocated memory is still 151.0MB. Free memory was 99.8MB in the beginning and 83.4MB in the end (delta: 16.4MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. [2024-10-13 05:54:47,204 INFO L158 Benchmark]: Boogie Procedure Inliner took 85.57ms. Allocated memory is still 151.0MB. Free memory was 83.4MB in the beginning and 119.1MB in the end (delta: -35.7MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. [2024-10-13 05:54:47,204 INFO L158 Benchmark]: Boogie Preprocessor took 82.18ms. Allocated memory is still 151.0MB. Free memory was 119.0MB in the beginning and 113.8MB in the end (delta: 5.2MB). Peak memory consumption was 6.3MB. Max. memory is 16.1GB. [2024-10-13 05:54:47,204 INFO L158 Benchmark]: RCFGBuilder took 732.17ms. Allocated memory is still 151.0MB. Free memory was 113.8MB in the beginning and 88.7MB in the end (delta: 25.1MB). Peak memory consumption was 23.1MB. Max. memory is 16.1GB. [2024-10-13 05:54:47,205 INFO L158 Benchmark]: TraceAbstraction took 19458.75ms. Allocated memory was 151.0MB in the beginning and 620.8MB in the end (delta: 469.8MB). Free memory was 88.6MB in the beginning and 377.1MB in the end (delta: -288.6MB). Peak memory consumption was 183.3MB. Max. memory is 16.1GB. [2024-10-13 05:54:47,207 INFO L158 Benchmark]: Witness Printer took 5.89ms. Allocated memory is still 620.8MB. Free memory is still 377.1MB. There was no memory consumed. Max. memory is 16.1GB. [2024-10-13 05:54:47,207 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.12ms. Allocated memory is still 96.5MB. Free memory was 59.4MB in the beginning and 59.4MB in the end (delta: 76.9kB). There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 371.67ms. Allocated memory is still 151.0MB. Free memory was 99.8MB in the beginning and 83.4MB in the end (delta: 16.4MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 85.57ms. Allocated memory is still 151.0MB. Free memory was 83.4MB in the beginning and 119.1MB in the end (delta: -35.7MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. * Boogie Preprocessor took 82.18ms. Allocated memory is still 151.0MB. Free memory was 119.0MB in the beginning and 113.8MB in the end (delta: 5.2MB). Peak memory consumption was 6.3MB. Max. memory is 16.1GB. * RCFGBuilder took 732.17ms. Allocated memory is still 151.0MB. Free memory was 113.8MB in the beginning and 88.7MB in the end (delta: 25.1MB). Peak memory consumption was 23.1MB. Max. memory is 16.1GB. * TraceAbstraction took 19458.75ms. Allocated memory was 151.0MB in the beginning and 620.8MB in the end (delta: 469.8MB). Free memory was 88.6MB in the beginning and 377.1MB in the end (delta: -288.6MB). Peak memory consumption was 183.3MB. Max. memory is 16.1GB. * Witness Printer took 5.89ms. Allocated memory is still 620.8MB. Free memory is still 377.1MB. 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 90. Possible FailurePath: [L21] unsigned char isInitial = 0; [L22-L24] unsigned char BOOL_unsigned_char_Array_0[1] = { 1 }; [L22-L24] unsigned char BOOL_unsigned_char_Array_0[1] = { 1 }; [L25-L27] double double_Array_0[2][2] = { {128.4, 3.8}, {50.2, 25.1} }; [L25-L27] double double_Array_0[2][2] = { {128.4, 3.8}, {50.2, 25.1} }; [L25-L27] double double_Array_0[2][2] = { {128.4, 3.8}, {50.2, 25.1} }; [L25-L27] double double_Array_0[2][2] = { {128.4, 3.8}, {50.2, 25.1} }; [L25-L27] double double_Array_0[2][2] = { {128.4, 3.8}, {50.2, 25.1} }; [L28-L30] signed char signed_char_Array_0[2][2] = { {64, 4}, {0, 16} }; [L28-L30] signed char signed_char_Array_0[2][2] = { {64, 4}, {0, 16} }; [L28-L30] signed char signed_char_Array_0[2][2] = { {64, 4}, {0, 16} }; [L28-L30] signed char signed_char_Array_0[2][2] = { {64, 4}, {0, 16} }; [L28-L30] signed char signed_char_Array_0[2][2] = { {64, 4}, {0, 16} }; [L31-L33] unsigned char unsigned_char_Array_0[1] = { 16 }; [L31-L33] unsigned char unsigned_char_Array_0[1] = { 16 }; [L34-L36] unsigned short int unsigned_short_int_Array_0[3] = { 2, 16, 25 }; [L34-L36] unsigned short int unsigned_short_int_Array_0[3] = { 2, 16, 25 }; [L34-L36] unsigned short int unsigned_short_int_Array_0[3] = { 2, 16, 25 }; [L34-L36] unsigned short int unsigned_short_int_Array_0[3] = { 2, 16, 25 }; [L94] isInitial = 1 [L95] FCALL initially() [L96] COND TRUE 1 [L97] FCALL updateLastVariables() [L98] CALL updateVariables() [L62] BOOL_unsigned_char_Array_0[0] = __VERIFIER_nondet_uchar() [L63] EXPR BOOL_unsigned_char_Array_0[0] VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, isInitial=1, signed_char_Array_0={6:0}, unsigned_char_Array_0={7:0}, unsigned_short_int_Array_0={8:0}] [L63] CALL assume_abort_if_not(BOOL_unsigned_char_Array_0[0] >= 0) VAL [BOOL_unsigned_char_Array_0={4:0}, \old(cond)=1, double_Array_0={5:0}, isInitial=1, signed_char_Array_0={6:0}, unsigned_char_Array_0={7:0}, unsigned_short_int_Array_0={8:0}] [L20] COND FALSE !(!cond) VAL [BOOL_unsigned_char_Array_0={4:0}, \old(cond)=1, double_Array_0={5:0}, isInitial=1, signed_char_Array_0={6:0}, unsigned_char_Array_0={7:0}, unsigned_short_int_Array_0={8:0}] [L63] RET assume_abort_if_not(BOOL_unsigned_char_Array_0[0] >= 0) VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, isInitial=1, signed_char_Array_0={6:0}, unsigned_char_Array_0={7:0}, unsigned_short_int_Array_0={8:0}] [L64] EXPR BOOL_unsigned_char_Array_0[0] VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, isInitial=1, signed_char_Array_0={6:0}, unsigned_char_Array_0={7:0}, unsigned_short_int_Array_0={8:0}] [L64] CALL assume_abort_if_not(BOOL_unsigned_char_Array_0[0] <= 1) VAL [BOOL_unsigned_char_Array_0={4:0}, \old(cond)=1, double_Array_0={5:0}, isInitial=1, signed_char_Array_0={6:0}, unsigned_char_Array_0={7:0}, unsigned_short_int_Array_0={8:0}] [L20] COND FALSE !(!cond) VAL [BOOL_unsigned_char_Array_0={4:0}, \old(cond)=1, double_Array_0={5:0}, isInitial=1, signed_char_Array_0={6:0}, unsigned_char_Array_0={7:0}, unsigned_short_int_Array_0={8:0}] [L64] RET assume_abort_if_not(BOOL_unsigned_char_Array_0[0] <= 1) VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, isInitial=1, signed_char_Array_0={6:0}, unsigned_char_Array_0={7:0}, unsigned_short_int_Array_0={8:0}] [L65] double_Array_0[0][0] = __VERIFIER_nondet_double() [L66] EXPR double_Array_0[0][0] [L66] EXPR double_Array_0[0][0] >= 0.0F && double_Array_0[0][0] <= -1.0e-20F VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, isInitial=1, signed_char_Array_0={6:0}, unsigned_char_Array_0={7:0}, unsigned_short_int_Array_0={8:0}] [L66] EXPR double_Array_0[0][0] >= 0.0F && double_Array_0[0][0] <= -1.0e-20F [L66] EXPR double_Array_0[0][0] [L66] EXPR double_Array_0[0][0] >= 0.0F && double_Array_0[0][0] <= -1.0e-20F VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, isInitial=1, signed_char_Array_0={6:0}, unsigned_char_Array_0={7:0}, unsigned_short_int_Array_0={8:0}] [L66] EXPR (double_Array_0[0][0] >= 0.0F && double_Array_0[0][0] <= -1.0e-20F) || (double_Array_0[0][0] <= 9223372.036854776000e+12F && double_Array_0[0][0] >= 1.0e-20F ) VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, isInitial=1, signed_char_Array_0={6:0}, unsigned_char_Array_0={7:0}, unsigned_short_int_Array_0={8:0}] [L66] EXPR (double_Array_0[0][0] >= 0.0F && double_Array_0[0][0] <= -1.0e-20F) || (double_Array_0[0][0] <= 9223372.036854776000e+12F && double_Array_0[0][0] >= 1.0e-20F ) VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, isInitial=1, signed_char_Array_0={6:0}, unsigned_char_Array_0={7:0}, unsigned_short_int_Array_0={8:0}] [L66] CALL assume_abort_if_not((double_Array_0[0][0] >= 0.0F && double_Array_0[0][0] <= -1.0e-20F) || (double_Array_0[0][0] <= 9223372.036854776000e+12F && double_Array_0[0][0] >= 1.0e-20F )) VAL [BOOL_unsigned_char_Array_0={4:0}, \old(cond)=1, double_Array_0={5:0}, isInitial=1, signed_char_Array_0={6:0}, unsigned_char_Array_0={7:0}, unsigned_short_int_Array_0={8:0}] [L20] COND FALSE !(!cond) VAL [BOOL_unsigned_char_Array_0={4:0}, \old(cond)=1, double_Array_0={5:0}, isInitial=1, signed_char_Array_0={6:0}, unsigned_char_Array_0={7:0}, unsigned_short_int_Array_0={8:0}] [L66] RET assume_abort_if_not((double_Array_0[0][0] >= 0.0F && double_Array_0[0][0] <= -1.0e-20F) || (double_Array_0[0][0] <= 9223372.036854776000e+12F && double_Array_0[0][0] >= 1.0e-20F )) VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, isInitial=1, signed_char_Array_0={6:0}, unsigned_char_Array_0={7:0}, unsigned_short_int_Array_0={8:0}] [L67] double_Array_0[1][0] = __VERIFIER_nondet_double() [L68] EXPR double_Array_0[1][0] [L68] EXPR double_Array_0[1][0] >= 0.0F && double_Array_0[1][0] <= -1.0e-20F VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, isInitial=1, signed_char_Array_0={6:0}, unsigned_char_Array_0={7:0}, unsigned_short_int_Array_0={8:0}] [L68] EXPR double_Array_0[1][0] >= 0.0F && double_Array_0[1][0] <= -1.0e-20F [L68] EXPR double_Array_0[1][0] [L68] EXPR double_Array_0[1][0] >= 0.0F && double_Array_0[1][0] <= -1.0e-20F VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, isInitial=1, signed_char_Array_0={6:0}, unsigned_char_Array_0={7:0}, unsigned_short_int_Array_0={8:0}] [L68] EXPR (double_Array_0[1][0] >= 0.0F && double_Array_0[1][0] <= -1.0e-20F) || (double_Array_0[1][0] <= 9223372.036854776000e+12F && double_Array_0[1][0] >= 1.0e-20F ) VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, isInitial=1, signed_char_Array_0={6:0}, unsigned_char_Array_0={7:0}, unsigned_short_int_Array_0={8:0}] [L68] EXPR (double_Array_0[1][0] >= 0.0F && double_Array_0[1][0] <= -1.0e-20F) || (double_Array_0[1][0] <= 9223372.036854776000e+12F && double_Array_0[1][0] >= 1.0e-20F ) VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, isInitial=1, signed_char_Array_0={6:0}, unsigned_char_Array_0={7:0}, unsigned_short_int_Array_0={8:0}] [L68] CALL assume_abort_if_not((double_Array_0[1][0] >= 0.0F && double_Array_0[1][0] <= -1.0e-20F) || (double_Array_0[1][0] <= 9223372.036854776000e+12F && double_Array_0[1][0] >= 1.0e-20F )) VAL [BOOL_unsigned_char_Array_0={4:0}, \old(cond)=1, double_Array_0={5:0}, isInitial=1, signed_char_Array_0={6:0}, unsigned_char_Array_0={7:0}, unsigned_short_int_Array_0={8:0}] [L20] COND FALSE !(!cond) VAL [BOOL_unsigned_char_Array_0={4:0}, \old(cond)=1, double_Array_0={5:0}, isInitial=1, signed_char_Array_0={6:0}, unsigned_char_Array_0={7:0}, unsigned_short_int_Array_0={8:0}] [L68] RET assume_abort_if_not((double_Array_0[1][0] >= 0.0F && double_Array_0[1][0] <= -1.0e-20F) || (double_Array_0[1][0] <= 9223372.036854776000e+12F && double_Array_0[1][0] >= 1.0e-20F )) VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, isInitial=1, signed_char_Array_0={6:0}, unsigned_char_Array_0={7:0}, unsigned_short_int_Array_0={8:0}] [L69] double_Array_0[0][1] = __VERIFIER_nondet_double() [L70] EXPR double_Array_0[0][1] [L70] EXPR double_Array_0[0][1] >= -922337.2036854776000e+13F && double_Array_0[0][1] <= -1.0e-20F VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, isInitial=1, signed_char_Array_0={6:0}, unsigned_char_Array_0={7:0}, unsigned_short_int_Array_0={8:0}] [L70] EXPR double_Array_0[0][1] >= -922337.2036854776000e+13F && double_Array_0[0][1] <= -1.0e-20F [L70] EXPR double_Array_0[0][1] [L70] EXPR double_Array_0[0][1] >= -922337.2036854776000e+13F && double_Array_0[0][1] <= -1.0e-20F VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, isInitial=1, signed_char_Array_0={6:0}, unsigned_char_Array_0={7:0}, unsigned_short_int_Array_0={8:0}] [L70] EXPR (double_Array_0[0][1] >= -922337.2036854776000e+13F && double_Array_0[0][1] <= -1.0e-20F) || (double_Array_0[0][1] <= 9223372.036854776000e+12F && double_Array_0[0][1] >= 1.0e-20F ) VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, isInitial=1, signed_char_Array_0={6:0}, unsigned_char_Array_0={7:0}, unsigned_short_int_Array_0={8:0}] [L70] EXPR (double_Array_0[0][1] >= -922337.2036854776000e+13F && double_Array_0[0][1] <= -1.0e-20F) || (double_Array_0[0][1] <= 9223372.036854776000e+12F && double_Array_0[0][1] >= 1.0e-20F ) VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, isInitial=1, signed_char_Array_0={6:0}, unsigned_char_Array_0={7:0}, unsigned_short_int_Array_0={8:0}] [L70] CALL assume_abort_if_not((double_Array_0[0][1] >= -922337.2036854776000e+13F && double_Array_0[0][1] <= -1.0e-20F) || (double_Array_0[0][1] <= 9223372.036854776000e+12F && double_Array_0[0][1] >= 1.0e-20F )) VAL [BOOL_unsigned_char_Array_0={4:0}, \old(cond)=1, double_Array_0={5:0}, isInitial=1, signed_char_Array_0={6:0}, unsigned_char_Array_0={7:0}, unsigned_short_int_Array_0={8:0}] [L20] COND FALSE !(!cond) VAL [BOOL_unsigned_char_Array_0={4:0}, \old(cond)=1, double_Array_0={5:0}, isInitial=1, signed_char_Array_0={6:0}, unsigned_char_Array_0={7:0}, unsigned_short_int_Array_0={8:0}] [L70] RET assume_abort_if_not((double_Array_0[0][1] >= -922337.2036854776000e+13F && double_Array_0[0][1] <= -1.0e-20F) || (double_Array_0[0][1] <= 9223372.036854776000e+12F && double_Array_0[0][1] >= 1.0e-20F )) VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, isInitial=1, signed_char_Array_0={6:0}, unsigned_char_Array_0={7:0}, unsigned_short_int_Array_0={8:0}] [L71] double_Array_0[1][1] = __VERIFIER_nondet_double() [L72] EXPR double_Array_0[1][1] [L72] EXPR double_Array_0[1][1] >= -922337.2036854776000e+13F && double_Array_0[1][1] <= -1.0e-20F VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, isInitial=1, signed_char_Array_0={6:0}, unsigned_char_Array_0={7:0}, unsigned_short_int_Array_0={8:0}] [L72] EXPR double_Array_0[1][1] >= -922337.2036854776000e+13F && double_Array_0[1][1] <= -1.0e-20F [L72] EXPR double_Array_0[1][1] [L72] EXPR double_Array_0[1][1] >= -922337.2036854776000e+13F && double_Array_0[1][1] <= -1.0e-20F VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, isInitial=1, signed_char_Array_0={6:0}, unsigned_char_Array_0={7:0}, unsigned_short_int_Array_0={8:0}] [L72] EXPR (double_Array_0[1][1] >= -922337.2036854776000e+13F && double_Array_0[1][1] <= -1.0e-20F) || (double_Array_0[1][1] <= 9223372.036854776000e+12F && double_Array_0[1][1] >= 1.0e-20F ) VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, isInitial=1, signed_char_Array_0={6:0}, unsigned_char_Array_0={7:0}, unsigned_short_int_Array_0={8:0}] [L72] EXPR (double_Array_0[1][1] >= -922337.2036854776000e+13F && double_Array_0[1][1] <= -1.0e-20F) || (double_Array_0[1][1] <= 9223372.036854776000e+12F && double_Array_0[1][1] >= 1.0e-20F ) VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, isInitial=1, signed_char_Array_0={6:0}, unsigned_char_Array_0={7:0}, unsigned_short_int_Array_0={8:0}] [L72] CALL assume_abort_if_not((double_Array_0[1][1] >= -922337.2036854776000e+13F && double_Array_0[1][1] <= -1.0e-20F) || (double_Array_0[1][1] <= 9223372.036854776000e+12F && double_Array_0[1][1] >= 1.0e-20F )) VAL [BOOL_unsigned_char_Array_0={4:0}, \old(cond)=1, double_Array_0={5:0}, isInitial=1, signed_char_Array_0={6:0}, unsigned_char_Array_0={7:0}, unsigned_short_int_Array_0={8:0}] [L20] COND FALSE !(!cond) VAL [BOOL_unsigned_char_Array_0={4:0}, \old(cond)=1, double_Array_0={5:0}, isInitial=1, signed_char_Array_0={6:0}, unsigned_char_Array_0={7:0}, unsigned_short_int_Array_0={8:0}] [L72] RET assume_abort_if_not((double_Array_0[1][1] >= -922337.2036854776000e+13F && double_Array_0[1][1] <= -1.0e-20F) || (double_Array_0[1][1] <= 9223372.036854776000e+12F && double_Array_0[1][1] >= 1.0e-20F )) VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, isInitial=1, signed_char_Array_0={6:0}, unsigned_char_Array_0={7:0}, unsigned_short_int_Array_0={8:0}] [L73] signed_char_Array_0[0][0] = __VERIFIER_nondet_char() [L74] EXPR signed_char_Array_0[0][0] VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, isInitial=1, signed_char_Array_0={6:0}, unsigned_char_Array_0={7:0}, unsigned_short_int_Array_0={8:0}] [L74] CALL assume_abort_if_not(signed_char_Array_0[0][0] >= 63) VAL [BOOL_unsigned_char_Array_0={4:0}, \old(cond)=1, double_Array_0={5:0}, isInitial=1, signed_char_Array_0={6:0}, unsigned_char_Array_0={7:0}, unsigned_short_int_Array_0={8:0}] [L20] COND FALSE !(!cond) VAL [BOOL_unsigned_char_Array_0={4:0}, \old(cond)=1, double_Array_0={5:0}, isInitial=1, signed_char_Array_0={6:0}, unsigned_char_Array_0={7:0}, unsigned_short_int_Array_0={8:0}] [L74] RET assume_abort_if_not(signed_char_Array_0[0][0] >= 63) VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, isInitial=1, signed_char_Array_0={6:0}, unsigned_char_Array_0={7:0}, unsigned_short_int_Array_0={8:0}] [L75] EXPR signed_char_Array_0[0][0] VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, isInitial=1, signed_char_Array_0={6:0}, unsigned_char_Array_0={7:0}, unsigned_short_int_Array_0={8:0}] [L75] 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}, isInitial=1, signed_char_Array_0={6:0}, unsigned_char_Array_0={7:0}, unsigned_short_int_Array_0={8:0}] [L20] COND FALSE !(!cond) VAL [BOOL_unsigned_char_Array_0={4:0}, \old(cond)=1, double_Array_0={5:0}, isInitial=1, signed_char_Array_0={6:0}, unsigned_char_Array_0={7:0}, unsigned_short_int_Array_0={8:0}] [L75] 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}, isInitial=1, signed_char_Array_0={6:0}, unsigned_char_Array_0={7:0}, unsigned_short_int_Array_0={8:0}] [L76] signed_char_Array_0[1][0] = __VERIFIER_nondet_char() [L77] EXPR signed_char_Array_0[1][0] VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, isInitial=1, signed_char_Array_0={6:0}, unsigned_char_Array_0={7:0}, unsigned_short_int_Array_0={8:0}] [L77] CALL assume_abort_if_not(signed_char_Array_0[1][0] >= 0) VAL [BOOL_unsigned_char_Array_0={4:0}, \old(cond)=1, double_Array_0={5:0}, isInitial=1, signed_char_Array_0={6:0}, unsigned_char_Array_0={7:0}, unsigned_short_int_Array_0={8:0}] [L20] COND FALSE !(!cond) VAL [BOOL_unsigned_char_Array_0={4:0}, \old(cond)=1, double_Array_0={5:0}, isInitial=1, signed_char_Array_0={6:0}, unsigned_char_Array_0={7:0}, unsigned_short_int_Array_0={8:0}] [L77] RET assume_abort_if_not(signed_char_Array_0[1][0] >= 0) VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, isInitial=1, signed_char_Array_0={6:0}, unsigned_char_Array_0={7:0}, unsigned_short_int_Array_0={8:0}] [L78] EXPR signed_char_Array_0[1][0] VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, isInitial=1, signed_char_Array_0={6:0}, unsigned_char_Array_0={7:0}, unsigned_short_int_Array_0={8:0}] [L78] CALL assume_abort_if_not(signed_char_Array_0[1][0] <= 64) VAL [BOOL_unsigned_char_Array_0={4:0}, \old(cond)=1, double_Array_0={5:0}, isInitial=1, signed_char_Array_0={6:0}, unsigned_char_Array_0={7:0}, unsigned_short_int_Array_0={8:0}] [L20] COND FALSE !(!cond) VAL [BOOL_unsigned_char_Array_0={4:0}, \old(cond)=1, double_Array_0={5:0}, isInitial=1, signed_char_Array_0={6:0}, unsigned_char_Array_0={7:0}, unsigned_short_int_Array_0={8:0}] [L78] RET assume_abort_if_not(signed_char_Array_0[1][0] <= 64) VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, isInitial=1, signed_char_Array_0={6:0}, unsigned_char_Array_0={7:0}, unsigned_short_int_Array_0={8:0}] [L79] signed_char_Array_0[0][1] = __VERIFIER_nondet_char() [L80] EXPR signed_char_Array_0[0][1] VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, isInitial=1, signed_char_Array_0={6:0}, unsigned_char_Array_0={7:0}, unsigned_short_int_Array_0={8:0}] [L80] 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}, isInitial=1, signed_char_Array_0={6:0}, unsigned_char_Array_0={7:0}, unsigned_short_int_Array_0={8:0}] [L20] COND FALSE !(!cond) VAL [BOOL_unsigned_char_Array_0={4:0}, \old(cond)=1, double_Array_0={5:0}, isInitial=1, signed_char_Array_0={6:0}, unsigned_char_Array_0={7:0}, unsigned_short_int_Array_0={8:0}] [L80] 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}, isInitial=1, signed_char_Array_0={6:0}, unsigned_char_Array_0={7:0}, unsigned_short_int_Array_0={8:0}] [L81] EXPR signed_char_Array_0[0][1] VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, isInitial=1, signed_char_Array_0={6:0}, unsigned_char_Array_0={7:0}, unsigned_short_int_Array_0={8:0}] [L81] CALL assume_abort_if_not(signed_char_Array_0[0][1] <= 126) VAL [BOOL_unsigned_char_Array_0={4:0}, \old(cond)=1, double_Array_0={5:0}, isInitial=1, signed_char_Array_0={6:0}, unsigned_char_Array_0={7:0}, unsigned_short_int_Array_0={8:0}] [L20] COND FALSE !(!cond) VAL [BOOL_unsigned_char_Array_0={4:0}, \old(cond)=1, double_Array_0={5:0}, isInitial=1, signed_char_Array_0={6:0}, unsigned_char_Array_0={7:0}, unsigned_short_int_Array_0={8:0}] [L81] RET assume_abort_if_not(signed_char_Array_0[0][1] <= 126) VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, isInitial=1, signed_char_Array_0={6:0}, unsigned_char_Array_0={7:0}, unsigned_short_int_Array_0={8:0}] [L82] unsigned_short_int_Array_0[1] = __VERIFIER_nondet_ushort() [L83] EXPR unsigned_short_int_Array_0[1] VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, isInitial=1, signed_char_Array_0={6:0}, unsigned_char_Array_0={7:0}, unsigned_short_int_Array_0={8:0}] [L83] CALL assume_abort_if_not(unsigned_short_int_Array_0[1] >= 0) VAL [BOOL_unsigned_char_Array_0={4:0}, \old(cond)=1, double_Array_0={5:0}, isInitial=1, signed_char_Array_0={6:0}, unsigned_char_Array_0={7:0}, unsigned_short_int_Array_0={8:0}] [L20] COND FALSE !(!cond) VAL [BOOL_unsigned_char_Array_0={4:0}, \old(cond)=1, double_Array_0={5:0}, isInitial=1, signed_char_Array_0={6:0}, unsigned_char_Array_0={7:0}, unsigned_short_int_Array_0={8:0}] [L83] RET assume_abort_if_not(unsigned_short_int_Array_0[1] >= 0) VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, isInitial=1, signed_char_Array_0={6:0}, unsigned_char_Array_0={7:0}, unsigned_short_int_Array_0={8:0}] [L84] EXPR unsigned_short_int_Array_0[1] VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, isInitial=1, signed_char_Array_0={6:0}, unsigned_char_Array_0={7:0}, unsigned_short_int_Array_0={8:0}] [L84] CALL assume_abort_if_not(unsigned_short_int_Array_0[1] <= 65535) VAL [BOOL_unsigned_char_Array_0={4:0}, \old(cond)=1, double_Array_0={5:0}, isInitial=1, signed_char_Array_0={6:0}, unsigned_char_Array_0={7:0}, unsigned_short_int_Array_0={8:0}] [L20] COND FALSE !(!cond) VAL [BOOL_unsigned_char_Array_0={4:0}, \old(cond)=1, double_Array_0={5:0}, isInitial=1, signed_char_Array_0={6:0}, unsigned_char_Array_0={7:0}, unsigned_short_int_Array_0={8:0}] [L84] RET assume_abort_if_not(unsigned_short_int_Array_0[1] <= 65535) VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, isInitial=1, signed_char_Array_0={6:0}, unsigned_char_Array_0={7:0}, unsigned_short_int_Array_0={8:0}] [L85] EXPR unsigned_short_int_Array_0[1] VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, isInitial=1, signed_char_Array_0={6:0}, unsigned_char_Array_0={7:0}, unsigned_short_int_Array_0={8:0}] [L85] CALL assume_abort_if_not(unsigned_short_int_Array_0[1] != 0) VAL [BOOL_unsigned_char_Array_0={4:0}, \old(cond)=1, double_Array_0={5:0}, isInitial=1, signed_char_Array_0={6:0}, unsigned_char_Array_0={7:0}, unsigned_short_int_Array_0={8:0}] [L20] COND FALSE !(!cond) VAL [BOOL_unsigned_char_Array_0={4:0}, \old(cond)=1, double_Array_0={5:0}, isInitial=1, signed_char_Array_0={6:0}, unsigned_char_Array_0={7:0}, unsigned_short_int_Array_0={8:0}] [L85] RET assume_abort_if_not(unsigned_short_int_Array_0[1] != 0) VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, isInitial=1, signed_char_Array_0={6:0}, unsigned_char_Array_0={7:0}, unsigned_short_int_Array_0={8:0}] [L98] RET updateVariables() [L99] CALL step() [L40] EXPR double_Array_0[0][0] [L40] EXPR double_Array_0[1][0] [L40] EXPR double_Array_0[0][1] [L40] EXPR double_Array_0[1][1] VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, isInitial=1, signed_char_Array_0={6:0}, unsigned_char_Array_0={7:0}, unsigned_short_int_Array_0={8:0}] [L40] EXPR ((1.875) > (double_Array_0[1][1])) ? (1.875) : (double_Array_0[1][1]) [L40] EXPR ((1.875) > (double_Array_0[1][1])) ? (1.875) : (double_Array_0[1][1]) VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, isInitial=1, signed_char_Array_0={6:0}, unsigned_char_Array_0={7:0}, unsigned_short_int_Array_0={8:0}] [L40] COND FALSE !(((double_Array_0[0][0] - double_Array_0[1][0]) + double_Array_0[0][1]) <= (256.625 * ((((1.875) > (double_Array_0[1][1])) ? (1.875) : (double_Array_0[1][1]))))) [L43] BOOL_unsigned_char_Array_0[0] VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, isInitial=1, signed_char_Array_0={6:0}, unsigned_char_Array_0={7:0}, unsigned_short_int_Array_0={8:0}] [L43] COND FALSE !(BOOL_unsigned_char_Array_0[0]) [L46] EXPR unsigned_short_int_Array_0[2] [L46] (unsigned_short_int_Array_0[2] == 16) || (unsigned_char_Array_0[0] < (10 / unsigned_short_int_Array_0[1])) VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, isInitial=1, signed_char_Array_0={6:0}, unsigned_char_Array_0={7:0}, unsigned_short_int_Array_0={8:0}] [L46] (unsigned_short_int_Array_0[2] == 16) || (unsigned_char_Array_0[0] < (10 / unsigned_short_int_Array_0[1])) [L46] EXPR unsigned_char_Array_0[0] [L46] EXPR unsigned_short_int_Array_0[1] [L46] (unsigned_short_int_Array_0[2] == 16) || (unsigned_char_Array_0[0] < (10 / unsigned_short_int_Array_0[1])) VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, isInitial=1, signed_char_Array_0={6:0}, unsigned_char_Array_0={7:0}, unsigned_short_int_Array_0={8:0}] [L46] COND FALSE !((unsigned_short_int_Array_0[2] == 16) || (unsigned_char_Array_0[0] < (10 / unsigned_short_int_Array_0[1]))) [L49] signed_char_Array_0[1][1] = 5 VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, isInitial=1, signed_char_Array_0={6:0}, unsigned_char_Array_0={7:0}, unsigned_short_int_Array_0={8:0}] [L51] EXPR unsigned_char_Array_0[0] [L51] unsigned char stepLocal_1 = unsigned_char_Array_0[0]; [L52] EXPR BOOL_unsigned_char_Array_0[0] [L52] unsigned char stepLocal_0 = BOOL_unsigned_char_Array_0[0]; [L53] stepLocal_0 || (unsigned_char_Array_0[0] >= unsigned_char_Array_0[0]) VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, isInitial=1, signed_char_Array_0={6:0}, stepLocal_1=16, unsigned_char_Array_0={7:0}, unsigned_short_int_Array_0={8:0}] [L53] stepLocal_0 || (unsigned_char_Array_0[0] >= unsigned_char_Array_0[0]) [L53] EXPR unsigned_char_Array_0[0] [L53] EXPR unsigned_char_Array_0[0] [L53] stepLocal_0 || (unsigned_char_Array_0[0] >= unsigned_char_Array_0[0]) VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, isInitial=1, signed_char_Array_0={6:0}, stepLocal_1=16, unsigned_char_Array_0={7:0}, unsigned_short_int_Array_0={8:0}] [L53] COND TRUE stepLocal_0 || (unsigned_char_Array_0[0] >= unsigned_char_Array_0[0]) [L54] EXPR signed_char_Array_0[0][0] [L54] EXPR signed_char_Array_0[1][0] VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, isInitial=1, signed_char_Array_0={6:0}, unsigned_char_Array_0={7:0}, unsigned_short_int_Array_0={8:0}] [L54] COND FALSE !(stepLocal_1 < ((signed_char_Array_0[0][0] - signed_char_Array_0[1][0]) - 16)) [L99] RET step() [L100] CALL, EXPR property() [L90] EXPR BOOL_unsigned_char_Array_0[0] VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, isInitial=1, signed_char_Array_0={6:0}, unsigned_char_Array_0={7:0}, unsigned_short_int_Array_0={8:0}] [L90] EXPR BOOL_unsigned_char_Array_0[0] ? (unsigned_short_int_Array_0[2] == ((unsigned short int) ((((unsigned_char_Array_0[0]) > (unsigned_char_Array_0[0])) ? (unsigned_char_Array_0[0]) : (unsigned_char_Array_0[0]))))) : 1 [L90] EXPR BOOL_unsigned_char_Array_0[0] ? (unsigned_short_int_Array_0[2] == ((unsigned short int) ((((unsigned_char_Array_0[0]) > (unsigned_char_Array_0[0])) ? (unsigned_char_Array_0[0]) : (unsigned_char_Array_0[0]))))) : 1 VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, isInitial=1, signed_char_Array_0={6:0}, unsigned_char_Array_0={7:0}, unsigned_short_int_Array_0={8:0}] [L90] EXPR (BOOL_unsigned_char_Array_0[0] ? (unsigned_short_int_Array_0[2] == ((unsigned short int) ((((unsigned_char_Array_0[0]) > (unsigned_char_Array_0[0])) ? (unsigned_char_Array_0[0]) : (unsigned_char_Array_0[0]))))) : 1) && (((unsigned_short_int_Array_0[2] == 16) || (unsigned_char_Array_0[0] < (10 / unsigned_short_int_Array_0[1]))) ? (signed_char_Array_0[1][1] == ((signed char) signed_char_Array_0[0][1])) : (signed_char_Array_0[1][1] == ((signed char) 5))) VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, isInitial=1, signed_char_Array_0={6:0}, unsigned_char_Array_0={7:0}, unsigned_short_int_Array_0={8:0}] [L90] EXPR (BOOL_unsigned_char_Array_0[0] ? (unsigned_short_int_Array_0[2] == ((unsigned short int) ((((unsigned_char_Array_0[0]) > (unsigned_char_Array_0[0])) ? (unsigned_char_Array_0[0]) : (unsigned_char_Array_0[0]))))) : 1) && (((unsigned_short_int_Array_0[2] == 16) || (unsigned_char_Array_0[0] < (10 / unsigned_short_int_Array_0[1]))) ? (signed_char_Array_0[1][1] == ((signed char) signed_char_Array_0[0][1])) : (signed_char_Array_0[1][1] == ((signed char) 5))) [L90] EXPR unsigned_short_int_Array_0[2] [L90] EXPR (unsigned_short_int_Array_0[2] == 16) || (unsigned_char_Array_0[0] < (10 / unsigned_short_int_Array_0[1])) VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, isInitial=1, signed_char_Array_0={6:0}, unsigned_char_Array_0={7:0}, unsigned_short_int_Array_0={8:0}] [L90] EXPR (unsigned_short_int_Array_0[2] == 16) || (unsigned_char_Array_0[0] < (10 / unsigned_short_int_Array_0[1])) [L90] EXPR unsigned_char_Array_0[0] [L90] EXPR unsigned_short_int_Array_0[1] [L90] EXPR (unsigned_short_int_Array_0[2] == 16) || (unsigned_char_Array_0[0] < (10 / unsigned_short_int_Array_0[1])) VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, isInitial=1, signed_char_Array_0={6:0}, unsigned_char_Array_0={7:0}, unsigned_short_int_Array_0={8:0}] [L90] EXPR ((unsigned_short_int_Array_0[2] == 16) || (unsigned_char_Array_0[0] < (10 / unsigned_short_int_Array_0[1]))) ? (signed_char_Array_0[1][1] == ((signed char) signed_char_Array_0[0][1])) : (signed_char_Array_0[1][1] == ((signed char) 5)) [L90] EXPR signed_char_Array_0[1][1] [L90] EXPR ((unsigned_short_int_Array_0[2] == 16) || (unsigned_char_Array_0[0] < (10 / unsigned_short_int_Array_0[1]))) ? (signed_char_Array_0[1][1] == ((signed char) signed_char_Array_0[0][1])) : (signed_char_Array_0[1][1] == ((signed char) 5)) VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, isInitial=1, signed_char_Array_0={6:0}, unsigned_char_Array_0={7:0}, unsigned_short_int_Array_0={8:0}] [L90] EXPR (BOOL_unsigned_char_Array_0[0] ? (unsigned_short_int_Array_0[2] == ((unsigned short int) ((((unsigned_char_Array_0[0]) > (unsigned_char_Array_0[0])) ? (unsigned_char_Array_0[0]) : (unsigned_char_Array_0[0]))))) : 1) && (((unsigned_short_int_Array_0[2] == 16) || (unsigned_char_Array_0[0] < (10 / unsigned_short_int_Array_0[1]))) ? (signed_char_Array_0[1][1] == ((signed char) signed_char_Array_0[0][1])) : (signed_char_Array_0[1][1] == ((signed char) 5))) VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, isInitial=1, signed_char_Array_0={6:0}, unsigned_char_Array_0={7:0}, unsigned_short_int_Array_0={8:0}] [L90] EXPR ((BOOL_unsigned_char_Array_0[0] ? (unsigned_short_int_Array_0[2] == ((unsigned short int) ((((unsigned_char_Array_0[0]) > (unsigned_char_Array_0[0])) ? (unsigned_char_Array_0[0]) : (unsigned_char_Array_0[0]))))) : 1) && (((unsigned_short_int_Array_0[2] == 16) || (unsigned_char_Array_0[0] < (10 / unsigned_short_int_Array_0[1]))) ? (signed_char_Array_0[1][1] == ((signed char) signed_char_Array_0[0][1])) : (signed_char_Array_0[1][1] == ((signed char) 5)))) && ((BOOL_unsigned_char_Array_0[0] || (unsigned_char_Array_0[0] >= unsigned_char_Array_0[0])) ? ((unsigned_char_Array_0[0] < ((signed_char_Array_0[0][0] - signed_char_Array_0[1][0]) - 16)) ? (unsigned_short_int_Array_0[0] == ((unsigned short int) ((((signed_char_Array_0[1][0]) > (32)) ? (signed_char_Array_0[1][0]) : (32))))) : 1) : (unsigned_short_int_Array_0[0] == ((unsigned short int) ((((signed_char_Array_0[0][0]) < (unsigned_char_Array_0[0])) ? (signed_char_Array_0[0][0]) : (unsigned_char_Array_0[0])))))) VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, isInitial=1, signed_char_Array_0={6:0}, unsigned_char_Array_0={7:0}, unsigned_short_int_Array_0={8:0}] [L90] EXPR ((BOOL_unsigned_char_Array_0[0] ? (unsigned_short_int_Array_0[2] == ((unsigned short int) ((((unsigned_char_Array_0[0]) > (unsigned_char_Array_0[0])) ? (unsigned_char_Array_0[0]) : (unsigned_char_Array_0[0]))))) : 1) && (((unsigned_short_int_Array_0[2] == 16) || (unsigned_char_Array_0[0] < (10 / unsigned_short_int_Array_0[1]))) ? (signed_char_Array_0[1][1] == ((signed char) signed_char_Array_0[0][1])) : (signed_char_Array_0[1][1] == ((signed char) 5)))) && ((BOOL_unsigned_char_Array_0[0] || (unsigned_char_Array_0[0] >= unsigned_char_Array_0[0])) ? ((unsigned_char_Array_0[0] < ((signed_char_Array_0[0][0] - signed_char_Array_0[1][0]) - 16)) ? (unsigned_short_int_Array_0[0] == ((unsigned short int) ((((signed_char_Array_0[1][0]) > (32)) ? (signed_char_Array_0[1][0]) : (32))))) : 1) : (unsigned_short_int_Array_0[0] == ((unsigned short int) ((((signed_char_Array_0[0][0]) < (unsigned_char_Array_0[0])) ? (signed_char_Array_0[0][0]) : (unsigned_char_Array_0[0])))))) [L90] EXPR BOOL_unsigned_char_Array_0[0] [L90] EXPR BOOL_unsigned_char_Array_0[0] || (unsigned_char_Array_0[0] >= unsigned_char_Array_0[0]) VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, isInitial=1, signed_char_Array_0={6:0}, unsigned_char_Array_0={7:0}, unsigned_short_int_Array_0={8:0}] [L90] EXPR BOOL_unsigned_char_Array_0[0] || (unsigned_char_Array_0[0] >= unsigned_char_Array_0[0]) [L90] EXPR unsigned_char_Array_0[0] [L90] EXPR unsigned_char_Array_0[0] [L90] EXPR BOOL_unsigned_char_Array_0[0] || (unsigned_char_Array_0[0] >= unsigned_char_Array_0[0]) VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, isInitial=1, signed_char_Array_0={6:0}, unsigned_char_Array_0={7:0}, unsigned_short_int_Array_0={8:0}] [L90] EXPR (BOOL_unsigned_char_Array_0[0] || (unsigned_char_Array_0[0] >= unsigned_char_Array_0[0])) ? ((unsigned_char_Array_0[0] < ((signed_char_Array_0[0][0] - signed_char_Array_0[1][0]) - 16)) ? (unsigned_short_int_Array_0[0] == ((unsigned short int) ((((signed_char_Array_0[1][0]) > (32)) ? (signed_char_Array_0[1][0]) : (32))))) : 1) : (unsigned_short_int_Array_0[0] == ((unsigned short int) ((((signed_char_Array_0[0][0]) < (unsigned_char_Array_0[0])) ? (signed_char_Array_0[0][0]) : (unsigned_char_Array_0[0]))))) [L90] EXPR unsigned_char_Array_0[0] [L90] EXPR signed_char_Array_0[0][0] [L90] EXPR signed_char_Array_0[1][0] VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, isInitial=1, signed_char_Array_0={6:0}, unsigned_char_Array_0={7:0}, unsigned_short_int_Array_0={8:0}] [L90] EXPR (unsigned_char_Array_0[0] < ((signed_char_Array_0[0][0] - signed_char_Array_0[1][0]) - 16)) ? (unsigned_short_int_Array_0[0] == ((unsigned short int) ((((signed_char_Array_0[1][0]) > (32)) ? (signed_char_Array_0[1][0]) : (32))))) : 1 [L90] EXPR (unsigned_char_Array_0[0] < ((signed_char_Array_0[0][0] - signed_char_Array_0[1][0]) - 16)) ? (unsigned_short_int_Array_0[0] == ((unsigned short int) ((((signed_char_Array_0[1][0]) > (32)) ? (signed_char_Array_0[1][0]) : (32))))) : 1 VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, isInitial=1, signed_char_Array_0={6:0}, unsigned_char_Array_0={7:0}, unsigned_short_int_Array_0={8:0}] [L90] EXPR (BOOL_unsigned_char_Array_0[0] || (unsigned_char_Array_0[0] >= unsigned_char_Array_0[0])) ? ((unsigned_char_Array_0[0] < ((signed_char_Array_0[0][0] - signed_char_Array_0[1][0]) - 16)) ? (unsigned_short_int_Array_0[0] == ((unsigned short int) ((((signed_char_Array_0[1][0]) > (32)) ? (signed_char_Array_0[1][0]) : (32))))) : 1) : (unsigned_short_int_Array_0[0] == ((unsigned short int) ((((signed_char_Array_0[0][0]) < (unsigned_char_Array_0[0])) ? (signed_char_Array_0[0][0]) : (unsigned_char_Array_0[0]))))) VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, isInitial=1, signed_char_Array_0={6:0}, unsigned_char_Array_0={7:0}, unsigned_short_int_Array_0={8:0}] [L90] EXPR ((BOOL_unsigned_char_Array_0[0] ? (unsigned_short_int_Array_0[2] == ((unsigned short int) ((((unsigned_char_Array_0[0]) > (unsigned_char_Array_0[0])) ? (unsigned_char_Array_0[0]) : (unsigned_char_Array_0[0]))))) : 1) && (((unsigned_short_int_Array_0[2] == 16) || (unsigned_char_Array_0[0] < (10 / unsigned_short_int_Array_0[1]))) ? (signed_char_Array_0[1][1] == ((signed char) signed_char_Array_0[0][1])) : (signed_char_Array_0[1][1] == ((signed char) 5)))) && ((BOOL_unsigned_char_Array_0[0] || (unsigned_char_Array_0[0] >= unsigned_char_Array_0[0])) ? ((unsigned_char_Array_0[0] < ((signed_char_Array_0[0][0] - signed_char_Array_0[1][0]) - 16)) ? (unsigned_short_int_Array_0[0] == ((unsigned short int) ((((signed_char_Array_0[1][0]) > (32)) ? (signed_char_Array_0[1][0]) : (32))))) : 1) : (unsigned_short_int_Array_0[0] == ((unsigned short int) ((((signed_char_Array_0[0][0]) < (unsigned_char_Array_0[0])) ? (signed_char_Array_0[0][0]) : (unsigned_char_Array_0[0])))))) VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, isInitial=1, signed_char_Array_0={6:0}, unsigned_char_Array_0={7:0}, unsigned_short_int_Array_0={8:0}] [L90] EXPR (((BOOL_unsigned_char_Array_0[0] ? (unsigned_short_int_Array_0[2] == ((unsigned short int) ((((unsigned_char_Array_0[0]) > (unsigned_char_Array_0[0])) ? (unsigned_char_Array_0[0]) : (unsigned_char_Array_0[0]))))) : 1) && (((unsigned_short_int_Array_0[2] == 16) || (unsigned_char_Array_0[0] < (10 / unsigned_short_int_Array_0[1]))) ? (signed_char_Array_0[1][1] == ((signed char) signed_char_Array_0[0][1])) : (signed_char_Array_0[1][1] == ((signed char) 5)))) && ((BOOL_unsigned_char_Array_0[0] || (unsigned_char_Array_0[0] >= unsigned_char_Array_0[0])) ? ((unsigned_char_Array_0[0] < ((signed_char_Array_0[0][0] - signed_char_Array_0[1][0]) - 16)) ? (unsigned_short_int_Array_0[0] == ((unsigned short int) ((((signed_char_Array_0[1][0]) > (32)) ? (signed_char_Array_0[1][0]) : (32))))) : 1) : (unsigned_short_int_Array_0[0] == ((unsigned short int) ((((signed_char_Array_0[0][0]) < (unsigned_char_Array_0[0])) ? (signed_char_Array_0[0][0]) : (unsigned_char_Array_0[0]))))))) && ((((double_Array_0[0][0] - double_Array_0[1][0]) + double_Array_0[0][1]) <= (256.625 * ((((1.875) > (double_Array_0[1][1])) ? (1.875) : (double_Array_0[1][1]))))) ? (unsigned_char_Array_0[0] == ((unsigned char) (((((5) < 0 ) ? -(5) : (5))) + 5))) : 1) VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, isInitial=1, signed_char_Array_0={6:0}, unsigned_char_Array_0={7:0}, unsigned_short_int_Array_0={8:0}] [L90] EXPR (((BOOL_unsigned_char_Array_0[0] ? (unsigned_short_int_Array_0[2] == ((unsigned short int) ((((unsigned_char_Array_0[0]) > (unsigned_char_Array_0[0])) ? (unsigned_char_Array_0[0]) : (unsigned_char_Array_0[0]))))) : 1) && (((unsigned_short_int_Array_0[2] == 16) || (unsigned_char_Array_0[0] < (10 / unsigned_short_int_Array_0[1]))) ? (signed_char_Array_0[1][1] == ((signed char) signed_char_Array_0[0][1])) : (signed_char_Array_0[1][1] == ((signed char) 5)))) && ((BOOL_unsigned_char_Array_0[0] || (unsigned_char_Array_0[0] >= unsigned_char_Array_0[0])) ? ((unsigned_char_Array_0[0] < ((signed_char_Array_0[0][0] - signed_char_Array_0[1][0]) - 16)) ? (unsigned_short_int_Array_0[0] == ((unsigned short int) ((((signed_char_Array_0[1][0]) > (32)) ? (signed_char_Array_0[1][0]) : (32))))) : 1) : (unsigned_short_int_Array_0[0] == ((unsigned short int) ((((signed_char_Array_0[0][0]) < (unsigned_char_Array_0[0])) ? (signed_char_Array_0[0][0]) : (unsigned_char_Array_0[0]))))))) && ((((double_Array_0[0][0] - double_Array_0[1][0]) + double_Array_0[0][1]) <= (256.625 * ((((1.875) > (double_Array_0[1][1])) ? (1.875) : (double_Array_0[1][1]))))) ? (unsigned_char_Array_0[0] == ((unsigned char) (((((5) < 0 ) ? -(5) : (5))) + 5))) : 1) [L90] EXPR double_Array_0[0][0] [L90] EXPR double_Array_0[1][0] [L90] EXPR double_Array_0[0][1] [L90] EXPR double_Array_0[1][1] VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, isInitial=1, signed_char_Array_0={6:0}, unsigned_char_Array_0={7:0}, unsigned_short_int_Array_0={8:0}] [L90] EXPR ((1.875) > (double_Array_0[1][1])) ? (1.875) : (double_Array_0[1][1]) [L90] EXPR ((1.875) > (double_Array_0[1][1])) ? (1.875) : (double_Array_0[1][1]) VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, isInitial=1, signed_char_Array_0={6:0}, unsigned_char_Array_0={7:0}, unsigned_short_int_Array_0={8:0}] [L90] EXPR (((double_Array_0[0][0] - double_Array_0[1][0]) + double_Array_0[0][1]) <= (256.625 * ((((1.875) > (double_Array_0[1][1])) ? (1.875) : (double_Array_0[1][1]))))) ? (unsigned_char_Array_0[0] == ((unsigned char) (((((5) < 0 ) ? -(5) : (5))) + 5))) : 1 [L90] EXPR unsigned_char_Array_0[0] [L90] EXPR (((double_Array_0[0][0] - double_Array_0[1][0]) + double_Array_0[0][1]) <= (256.625 * ((((1.875) > (double_Array_0[1][1])) ? (1.875) : (double_Array_0[1][1]))))) ? (unsigned_char_Array_0[0] == ((unsigned char) (((((5) < 0 ) ? -(5) : (5))) + 5))) : 1 VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, isInitial=1, signed_char_Array_0={6:0}, unsigned_char_Array_0={7:0}, unsigned_short_int_Array_0={8:0}] [L90] EXPR (((BOOL_unsigned_char_Array_0[0] ? (unsigned_short_int_Array_0[2] == ((unsigned short int) ((((unsigned_char_Array_0[0]) > (unsigned_char_Array_0[0])) ? (unsigned_char_Array_0[0]) : (unsigned_char_Array_0[0]))))) : 1) && (((unsigned_short_int_Array_0[2] == 16) || (unsigned_char_Array_0[0] < (10 / unsigned_short_int_Array_0[1]))) ? (signed_char_Array_0[1][1] == ((signed char) signed_char_Array_0[0][1])) : (signed_char_Array_0[1][1] == ((signed char) 5)))) && ((BOOL_unsigned_char_Array_0[0] || (unsigned_char_Array_0[0] >= unsigned_char_Array_0[0])) ? ((unsigned_char_Array_0[0] < ((signed_char_Array_0[0][0] - signed_char_Array_0[1][0]) - 16)) ? (unsigned_short_int_Array_0[0] == ((unsigned short int) ((((signed_char_Array_0[1][0]) > (32)) ? (signed_char_Array_0[1][0]) : (32))))) : 1) : (unsigned_short_int_Array_0[0] == ((unsigned short int) ((((signed_char_Array_0[0][0]) < (unsigned_char_Array_0[0])) ? (signed_char_Array_0[0][0]) : (unsigned_char_Array_0[0]))))))) && ((((double_Array_0[0][0] - double_Array_0[1][0]) + double_Array_0[0][1]) <= (256.625 * ((((1.875) > (double_Array_0[1][1])) ? (1.875) : (double_Array_0[1][1]))))) ? (unsigned_char_Array_0[0] == ((unsigned char) (((((5) < 0 ) ? -(5) : (5))) + 5))) : 1) VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, isInitial=1, signed_char_Array_0={6:0}, unsigned_char_Array_0={7:0}, unsigned_short_int_Array_0={8:0}] [L90-L91] return (((BOOL_unsigned_char_Array_0[0] ? (unsigned_short_int_Array_0[2] == ((unsigned short int) ((((unsigned_char_Array_0[0]) > (unsigned_char_Array_0[0])) ? (unsigned_char_Array_0[0]) : (unsigned_char_Array_0[0]))))) : 1) && (((unsigned_short_int_Array_0[2] == 16) || (unsigned_char_Array_0[0] < (10 / unsigned_short_int_Array_0[1]))) ? (signed_char_Array_0[1][1] == ((signed char) signed_char_Array_0[0][1])) : (signed_char_Array_0[1][1] == ((signed char) 5)))) && ((BOOL_unsigned_char_Array_0[0] || (unsigned_char_Array_0[0] >= unsigned_char_Array_0[0])) ? ((unsigned_char_Array_0[0] < ((signed_char_Array_0[0][0] - signed_char_Array_0[1][0]) - 16)) ? (unsigned_short_int_Array_0[0] == ((unsigned short int) ((((signed_char_Array_0[1][0]) > (32)) ? (signed_char_Array_0[1][0]) : (32))))) : 1) : (unsigned_short_int_Array_0[0] == ((unsigned short int) ((((signed_char_Array_0[0][0]) < (unsigned_char_Array_0[0])) ? (signed_char_Array_0[0][0]) : (unsigned_char_Array_0[0]))))))) && ((((double_Array_0[0][0] - double_Array_0[1][0]) + double_Array_0[0][1]) <= (256.625 * ((((1.875) > (double_Array_0[1][1])) ? (1.875) : (double_Array_0[1][1]))))) ? (unsigned_char_Array_0[0] == ((unsigned char) (((((5) < 0 ) ? -(5) : (5))) + 5))) : 1) ; [L100] RET, EXPR property() [L100] CALL __VERIFIER_assert(property()) [L19] COND TRUE !(cond) VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, isInitial=1, signed_char_Array_0={6:0}, unsigned_char_Array_0={7:0}, unsigned_short_int_Array_0={8:0}] [L19] reach_error() VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, isInitial=1, signed_char_Array_0={6:0}, unsigned_char_Array_0={7:0}, unsigned_short_int_Array_0={8:0}] - StatisticsResult: Ultimate Automizer benchmark data CFG has 2 procedures, 105 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 19.3s, OverallIterations: 31, TraceHistogramMax: 15, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.1s, AutomataDifference: 6.0s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 3711 SdHoareTripleChecker+Valid, 3.8s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 3697 mSDsluCounter, 23636 SdHoareTripleChecker+Invalid, 3.2s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 17787 mSDsCounter, 269 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 4623 IncrementalHoareTripleChecker+Invalid, 4892 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 269 mSolverCounterUnsat, 5849 mSDtfsCounter, 4623 mSolverCounterSat, 0.1s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 1314 GetRequests, 1122 SyntacticMatches, 0 SemanticMatches, 192 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 365 ImplicationChecksByTransitivity, 1.7s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=1446occurred in iteration=17, InterpolantAutomatonStates: 200, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 1.2s AutomataMinimizationTime, 30 MinimizatonAttempts, 871 StatesRemovedByMinimization, 21 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.2s SsaConstructionTime, 0.9s SatisfiabilityAnalysisTime, 9.3s InterpolantComputationTime, 4344 NumberOfCodeBlocks, 4344 NumberOfCodeBlocksAsserted, 33 NumberOfCheckSat, 3903 ConstructedInterpolants, 0 QuantifiedInterpolants, 10879 SizeOfPredicates, 4 NumberOfNonLiveVariables, 471 ConjunctsInSsa, 53 ConjunctsInUnsatCore, 30 InterpolantComputations, 29 PerfectInterpolantSequences, 12579/12600 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-10-13 05:54:47,255 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/current/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 /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-a_file-13.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 e6d92a25ae36f7e711770b5cc6315f0210bbc7c0c024aaddffcd3216b7942769 --- Real Ultimate output --- This is Ultimate 0.2.5-tmp.dk.eval-mul-div-a046e57-m [2024-10-13 05:54:49,282 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-10-13 05:54:49,347 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Bitvector.epf [2024-10-13 05:54:49,351 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-10-13 05:54:49,351 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-10-13 05:54:49,381 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-10-13 05:54:49,381 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-10-13 05:54:49,382 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-10-13 05:54:49,382 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-10-13 05:54:49,383 INFO L153 SettingsManager]: * Use memory slicer=true [2024-10-13 05:54:49,383 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-10-13 05:54:49,384 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-10-13 05:54:49,384 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-10-13 05:54:49,384 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-10-13 05:54:49,385 INFO L153 SettingsManager]: * Use SBE=true [2024-10-13 05:54:49,385 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-10-13 05:54:49,385 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-10-13 05:54:49,385 INFO L153 SettingsManager]: * sizeof long=4 [2024-10-13 05:54:49,385 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-10-13 05:54:49,386 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-10-13 05:54:49,386 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-10-13 05:54:49,390 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-10-13 05:54:49,390 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-10-13 05:54:49,390 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2024-10-13 05:54:49,390 INFO L153 SettingsManager]: * Use bitvectors instead of ints=true [2024-10-13 05:54:49,390 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-10-13 05:54:49,390 INFO L153 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2024-10-13 05:54:49,391 INFO L153 SettingsManager]: * sizeof long double=12 [2024-10-13 05:54:49,391 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-10-13 05:54:49,391 INFO L153 SettingsManager]: * Use constant arrays=true [2024-10-13 05:54:49,391 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-10-13 05:54:49,391 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-10-13 05:54:49,391 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-10-13 05:54:49,392 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-10-13 05:54:49,392 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-13 05:54:49,392 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-10-13 05:54:49,392 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-10-13 05:54:49,392 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-10-13 05:54:49,392 INFO L153 SettingsManager]: * Trace refinement strategy=WOLF [2024-10-13 05:54:49,392 INFO L153 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2024-10-13 05:54:49,392 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-10-13 05:54:49,395 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-10-13 05:54:49,395 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-10-13 05:54:49,395 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-10-13 05:54:49,395 INFO L153 SettingsManager]: * Logic for external solver=AUFBV [2024-10-13 05:54:49,396 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 -> e6d92a25ae36f7e711770b5cc6315f0210bbc7c0c024aaddffcd3216b7942769 [2024-10-13 05:54:49,679 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-10-13 05:54:49,697 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-10-13 05:54:49,703 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-10-13 05:54:49,704 INFO L270 PluginConnector]: Initializing CDTParser... [2024-10-13 05:54:49,705 INFO L274 PluginConnector]: CDTParser initialized [2024-10-13 05:54:49,706 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-a_file-13.i [2024-10-13 05:54:51,065 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-10-13 05:54:51,251 INFO L384 CDTParser]: Found 1 translation units. [2024-10-13 05:54:51,252 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-a_file-13.i [2024-10-13 05:54:51,259 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/c323a8bbb/9cbd66c3f8b8426d8d02431bdf901b4a/FLAG8d732c23f [2024-10-13 05:54:51,274 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/c323a8bbb/9cbd66c3f8b8426d8d02431bdf901b4a [2024-10-13 05:54:51,276 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-10-13 05:54:51,278 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-10-13 05:54:51,278 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-10-13 05:54:51,279 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-10-13 05:54:51,283 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-10-13 05:54:51,284 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 13.10 05:54:51" (1/1) ... [2024-10-13 05:54:51,285 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@2eec33ab and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 05:54:51, skipping insertion in model container [2024-10-13 05:54:51,285 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 13.10 05:54:51" (1/1) ... [2024-10-13 05:54:51,307 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-10-13 05:54:51,478 WARN L248 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-a_file-13.i[916,929] [2024-10-13 05:54:51,554 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-13 05:54:51,573 INFO L200 MainTranslator]: Completed pre-run [2024-10-13 05:54:51,584 WARN L248 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-a_file-13.i[916,929] [2024-10-13 05:54:51,626 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-13 05:54:51,651 INFO L204 MainTranslator]: Completed translation [2024-10-13 05:54:51,651 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 05:54:51 WrapperNode [2024-10-13 05:54:51,651 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-10-13 05:54:51,652 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-10-13 05:54:51,653 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-10-13 05:54:51,653 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-10-13 05:54:51,659 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 05:54:51" (1/1) ... [2024-10-13 05:54:51,674 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 05:54:51" (1/1) ... [2024-10-13 05:54:51,721 INFO L138 Inliner]: procedures = 33, calls = 146, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 472 [2024-10-13 05:54:51,723 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-10-13 05:54:51,724 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-10-13 05:54:51,724 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-10-13 05:54:51,724 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-10-13 05:54:51,734 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 05:54:51" (1/1) ... [2024-10-13 05:54:51,734 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 05:54:51" (1/1) ... [2024-10-13 05:54:51,746 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 05:54:51" (1/1) ... [2024-10-13 05:54:51,783 INFO L175 MemorySlicer]: Split 115 memory accesses to 6 slices as follows [2, 8, 34, 31, 23, 17]. 30 percent of accesses are in the largest equivalence class. The 15 initializations are split as follows [2, 1, 4, 4, 1, 3]. The 15 writes are split as follows [0, 1, 4, 5, 1, 4]. [2024-10-13 05:54:51,783 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 05:54:51" (1/1) ... [2024-10-13 05:54:51,783 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 05:54:51" (1/1) ... [2024-10-13 05:54:51,804 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 05:54:51" (1/1) ... [2024-10-13 05:54:51,810 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 05:54:51" (1/1) ... [2024-10-13 05:54:51,826 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 05:54:51" (1/1) ... [2024-10-13 05:54:51,832 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 05:54:51" (1/1) ... [2024-10-13 05:54:51,843 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-10-13 05:54:51,848 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-10-13 05:54:51,848 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-10-13 05:54:51,848 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-10-13 05:54:51,849 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 05:54:51" (1/1) ... [2024-10-13 05:54:51,856 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-13 05:54:51,871 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-13 05:54:51,893 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-10-13 05:54:51,903 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-10-13 05:54:51,945 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-10-13 05:54:51,946 INFO L130 BoogieDeclarations]: Found specification of procedure read~intFLOATTYPE8#0 [2024-10-13 05:54:51,946 INFO L130 BoogieDeclarations]: Found specification of procedure read~intFLOATTYPE8#1 [2024-10-13 05:54:51,946 INFO L130 BoogieDeclarations]: Found specification of procedure read~intFLOATTYPE8#2 [2024-10-13 05:54:51,947 INFO L130 BoogieDeclarations]: Found specification of procedure read~intFLOATTYPE8#3 [2024-10-13 05:54:51,947 INFO L130 BoogieDeclarations]: Found specification of procedure read~intFLOATTYPE8#4 [2024-10-13 05:54:51,948 INFO L130 BoogieDeclarations]: Found specification of procedure read~intFLOATTYPE8#5 [2024-10-13 05:54:51,948 INFO L130 BoogieDeclarations]: Found specification of procedure write~intFLOATTYPE8#0 [2024-10-13 05:54:51,948 INFO L130 BoogieDeclarations]: Found specification of procedure write~intFLOATTYPE8#1 [2024-10-13 05:54:51,948 INFO L130 BoogieDeclarations]: Found specification of procedure write~intFLOATTYPE8#2 [2024-10-13 05:54:51,949 INFO L130 BoogieDeclarations]: Found specification of procedure write~intFLOATTYPE8#3 [2024-10-13 05:54:51,949 INFO L130 BoogieDeclarations]: Found specification of procedure write~intFLOATTYPE8#4 [2024-10-13 05:54:51,949 INFO L130 BoogieDeclarations]: Found specification of procedure write~intFLOATTYPE8#5 [2024-10-13 05:54:51,949 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE1#0 [2024-10-13 05:54:51,949 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE1#1 [2024-10-13 05:54:51,949 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE1#2 [2024-10-13 05:54:51,949 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE1#3 [2024-10-13 05:54:51,949 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE1#4 [2024-10-13 05:54:51,950 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE1#5 [2024-10-13 05:54:51,950 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE2#0 [2024-10-13 05:54:51,951 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE2#1 [2024-10-13 05:54:51,951 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE2#2 [2024-10-13 05:54:51,951 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE2#3 [2024-10-13 05:54:51,951 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE2#4 [2024-10-13 05:54:51,951 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE2#5 [2024-10-13 05:54:51,952 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#0 [2024-10-13 05:54:51,952 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#1 [2024-10-13 05:54:51,953 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#2 [2024-10-13 05:54:51,953 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#3 [2024-10-13 05:54:51,953 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#4 [2024-10-13 05:54:51,953 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#5 [2024-10-13 05:54:51,953 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intFLOATTYPE8#0 [2024-10-13 05:54:51,953 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intFLOATTYPE8#1 [2024-10-13 05:54:51,954 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intFLOATTYPE8#2 [2024-10-13 05:54:51,954 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intFLOATTYPE8#3 [2024-10-13 05:54:51,954 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intFLOATTYPE8#4 [2024-10-13 05:54:51,954 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intFLOATTYPE8#5 [2024-10-13 05:54:51,954 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE2#0 [2024-10-13 05:54:51,954 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE2#1 [2024-10-13 05:54:51,954 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE2#2 [2024-10-13 05:54:51,954 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE2#3 [2024-10-13 05:54:51,954 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE2#4 [2024-10-13 05:54:51,954 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE2#5 [2024-10-13 05:54:51,954 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2024-10-13 05:54:51,955 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2024-10-13 05:54:51,955 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-10-13 05:54:51,955 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-10-13 05:54:51,955 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE1#0 [2024-10-13 05:54:51,955 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE1#1 [2024-10-13 05:54:51,955 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE1#2 [2024-10-13 05:54:51,955 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE1#3 [2024-10-13 05:54:51,955 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE1#4 [2024-10-13 05:54:51,955 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE1#5 [2024-10-13 05:54:51,955 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE2#0 [2024-10-13 05:54:51,955 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE2#1 [2024-10-13 05:54:51,956 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE2#2 [2024-10-13 05:54:51,956 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE2#3 [2024-10-13 05:54:51,956 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE2#4 [2024-10-13 05:54:51,956 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE2#5 [2024-10-13 05:54:52,127 INFO L238 CfgBuilder]: Building ICFG [2024-10-13 05:54:52,129 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-10-13 05:55:00,714 INFO L? ?]: Removed 126 outVars from TransFormulas that were not future-live. [2024-10-13 05:55:00,715 INFO L287 CfgBuilder]: Performing block encoding [2024-10-13 05:55:00,748 INFO L309 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-10-13 05:55:00,749 INFO L314 CfgBuilder]: Removed 1 assume(true) statements. [2024-10-13 05:55:00,749 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 13.10 05:55:00 BoogieIcfgContainer [2024-10-13 05:55:00,750 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-10-13 05:55:00,752 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-10-13 05:55:00,752 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-10-13 05:55:00,755 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-10-13 05:55:00,756 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 13.10 05:54:51" (1/3) ... [2024-10-13 05:55:00,756 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2c1396f8 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 13.10 05:55:00, skipping insertion in model container [2024-10-13 05:55:00,757 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 05:54:51" (2/3) ... [2024-10-13 05:55:00,757 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2c1396f8 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 13.10 05:55:00, skipping insertion in model container [2024-10-13 05:55:00,758 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 13.10 05:55:00" (3/3) ... [2024-10-13 05:55:00,759 INFO L112 eAbstractionObserver]: Analyzing ICFG hardness_variablewrapping_wrapper-a_file-13.i [2024-10-13 05:55:00,772 INFO L209 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-10-13 05:55:00,772 INFO L149 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-10-13 05:55:00,821 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-10-13 05:55:00,828 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;@6117f5fe, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-10-13 05:55:00,828 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-10-13 05:55:00,835 INFO L276 IsEmpty]: Start isEmpty. Operand has 105 states, 87 states have (on average 1.4827586206896552) internal successors, (129), 88 states have internal predecessors, (129), 15 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 15 states have call predecessors, (15), 15 states have call successors, (15) [2024-10-13 05:55:00,845 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 127 [2024-10-13 05:55:00,847 INFO L207 NwaCegarLoop]: Found error trace [2024-10-13 05:55:00,848 INFO L215 NwaCegarLoop]: trace histogram [15, 15, 15, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-13 05:55:00,848 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-13 05:55:00,852 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 05:55:00,853 INFO L85 PathProgramCache]: Analyzing trace with hash 1643118379, now seen corresponding path program 1 times [2024-10-13 05:55:00,863 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-13 05:55:00,863 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [281418247] [2024-10-13 05:55:00,863 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 05:55:00,864 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-10-13 05:55:00,864 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-13 05:55:00,865 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-10-13 05:55:00,866 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-10-13 05:55:01,315 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 05:55:01,330 INFO L255 TraceCheckSpWp]: Trace formula consists of 271 conjuncts, 1 conjuncts are in the unsatisfiable core [2024-10-13 05:55:01,336 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-13 05:55:01,374 INFO L134 CoverageAnalysis]: Checked inductivity of 420 backedges. 208 proven. 0 refuted. 0 times theorem prover too weak. 212 trivial. 0 not checked. [2024-10-13 05:55:01,374 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-13 05:55:01,375 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-13 05:55:01,375 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [281418247] [2024-10-13 05:55:01,375 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [281418247] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-13 05:55:01,375 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-13 05:55:01,376 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-13 05:55:01,377 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1476039863] [2024-10-13 05:55:01,378 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-13 05:55:01,385 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-10-13 05:55:01,385 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-13 05:55:01,403 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-10-13 05:55:01,403 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-10-13 05:55:01,405 INFO L87 Difference]: Start difference. First operand has 105 states, 87 states have (on average 1.4827586206896552) internal successors, (129), 88 states have internal predecessors, (129), 15 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 15 states have call predecessors, (15), 15 states have call successors, (15) Second operand has 2 states, 2 states have (on average 29.0) internal successors, (58), 2 states have internal predecessors, (58), 2 states have call successors, (15), 2 states have call predecessors, (15), 2 states have return successors, (15), 2 states have call predecessors, (15), 2 states have call successors, (15) [2024-10-13 05:55:01,468 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-13 05:55:01,468 INFO L93 Difference]: Finished difference Result 207 states and 331 transitions. [2024-10-13 05:55:01,470 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-10-13 05:55:01,471 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 29.0) internal successors, (58), 2 states have internal predecessors, (58), 2 states have call successors, (15), 2 states have call predecessors, (15), 2 states have return successors, (15), 2 states have call predecessors, (15), 2 states have call successors, (15) Word has length 126 [2024-10-13 05:55:01,471 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-13 05:55:01,477 INFO L225 Difference]: With dead ends: 207 [2024-10-13 05:55:01,478 INFO L226 Difference]: Without dead ends: 103 [2024-10-13 05:55:01,482 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 125 GetRequests, 125 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-10-13 05:55:01,486 INFO L432 NwaCegarLoop]: 150 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 4 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 150 SdHoareTripleChecker+Invalid, 4 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 4 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-13 05:55:01,487 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 150 Invalid, 4 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 4 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-13 05:55:01,513 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 103 states. [2024-10-13 05:55:01,538 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 103 to 103. [2024-10-13 05:55:01,542 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 103 states, 86 states have (on average 1.441860465116279) internal successors, (124), 86 states have internal predecessors, (124), 15 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 15 states have call predecessors, (15), 15 states have call successors, (15) [2024-10-13 05:55:01,545 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 103 states to 103 states and 154 transitions. [2024-10-13 05:55:01,548 INFO L78 Accepts]: Start accepts. Automaton has 103 states and 154 transitions. Word has length 126 [2024-10-13 05:55:01,549 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-13 05:55:01,549 INFO L471 AbstractCegarLoop]: Abstraction has 103 states and 154 transitions. [2024-10-13 05:55:01,550 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 29.0) internal successors, (58), 2 states have internal predecessors, (58), 2 states have call successors, (15), 2 states have call predecessors, (15), 2 states have return successors, (15), 2 states have call predecessors, (15), 2 states have call successors, (15) [2024-10-13 05:55:01,550 INFO L276 IsEmpty]: Start isEmpty. Operand 103 states and 154 transitions. [2024-10-13 05:55:01,552 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 127 [2024-10-13 05:55:01,554 INFO L207 NwaCegarLoop]: Found error trace [2024-10-13 05:55:01,554 INFO L215 NwaCegarLoop]: trace histogram [15, 15, 15, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-13 05:55:01,570 INFO L540 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)] Forceful destruction successful, exit code 0 [2024-10-13 05:55:01,755 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-10-13 05:55:01,756 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-13 05:55:01,756 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 05:55:01,756 INFO L85 PathProgramCache]: Analyzing trace with hash 1226582997, now seen corresponding path program 1 times [2024-10-13 05:55:01,757 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-13 05:55:01,757 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1712135832] [2024-10-13 05:55:01,757 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 05:55:01,758 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-10-13 05:55:01,758 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-13 05:55:01,760 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-10-13 05:55:01,762 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-10-13 05:55:02,156 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 05:55:02,171 INFO L255 TraceCheckSpWp]: Trace formula consists of 271 conjuncts, 3 conjuncts are in the unsatisfiable core [2024-10-13 05:55:02,174 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-13 05:55:02,251 INFO L134 CoverageAnalysis]: Checked inductivity of 420 backedges. 104 proven. 0 refuted. 0 times theorem prover too weak. 316 trivial. 0 not checked. [2024-10-13 05:55:02,254 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-13 05:55:02,254 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-13 05:55:02,254 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1712135832] [2024-10-13 05:55:02,255 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1712135832] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-13 05:55:02,255 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-13 05:55:02,255 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-10-13 05:55:02,255 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [734941810] [2024-10-13 05:55:02,255 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-13 05:55:02,256 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-10-13 05:55:02,256 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-13 05:55:02,257 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-10-13 05:55:02,257 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-10-13 05:55:02,257 INFO L87 Difference]: Start difference. First operand 103 states and 154 transitions. Second operand has 4 states, 4 states have (on average 14.25) internal successors, (57), 4 states have internal predecessors, (57), 2 states have call successors, (15), 2 states have call predecessors, (15), 2 states have return successors, (15), 2 states have call predecessors, (15), 2 states have call successors, (15) [2024-10-13 05:55:02,365 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-13 05:55:02,365 INFO L93 Difference]: Finished difference Result 207 states and 310 transitions. [2024-10-13 05:55:02,366 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-10-13 05:55:02,367 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 14.25) internal successors, (57), 4 states have internal predecessors, (57), 2 states have call successors, (15), 2 states have call predecessors, (15), 2 states have return successors, (15), 2 states have call predecessors, (15), 2 states have call successors, (15) Word has length 126 [2024-10-13 05:55:02,367 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-13 05:55:02,368 INFO L225 Difference]: With dead ends: 207 [2024-10-13 05:55:02,369 INFO L226 Difference]: Without dead ends: 105 [2024-10-13 05:55:02,370 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 125 GetRequests, 123 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-10-13 05:55:02,370 INFO L432 NwaCegarLoop]: 148 mSDtfsCounter, 0 mSDsluCounter, 289 mSDsCounter, 0 mSdLazyCounter, 24 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 437 SdHoareTripleChecker+Invalid, 24 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 24 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-13 05:55:02,371 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 437 Invalid, 24 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 24 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-13 05:55:02,371 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 105 states. [2024-10-13 05:55:02,378 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 105 to 105. [2024-10-13 05:55:02,378 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 105 states, 88 states have (on average 1.4318181818181819) internal successors, (126), 88 states have internal predecessors, (126), 15 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 15 states have call predecessors, (15), 15 states have call successors, (15) [2024-10-13 05:55:02,379 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 105 states to 105 states and 156 transitions. [2024-10-13 05:55:02,380 INFO L78 Accepts]: Start accepts. Automaton has 105 states and 156 transitions. Word has length 126 [2024-10-13 05:55:02,381 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-13 05:55:02,381 INFO L471 AbstractCegarLoop]: Abstraction has 105 states and 156 transitions. [2024-10-13 05:55:02,381 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 14.25) internal successors, (57), 4 states have internal predecessors, (57), 2 states have call successors, (15), 2 states have call predecessors, (15), 2 states have return successors, (15), 2 states have call predecessors, (15), 2 states have call successors, (15) [2024-10-13 05:55:02,381 INFO L276 IsEmpty]: Start isEmpty. Operand 105 states and 156 transitions. [2024-10-13 05:55:02,383 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 127 [2024-10-13 05:55:02,383 INFO L207 NwaCegarLoop]: Found error trace [2024-10-13 05:55:02,383 INFO L215 NwaCegarLoop]: trace histogram [15, 15, 15, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-13 05:55:02,396 INFO L540 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)] Forceful destruction successful, exit code 0 [2024-10-13 05:55:02,584 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-10-13 05:55:02,584 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-13 05:55:02,584 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 05:55:02,585 INFO L85 PathProgramCache]: Analyzing trace with hash 755226647, now seen corresponding path program 1 times [2024-10-13 05:55:02,585 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-13 05:55:02,585 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [53246484] [2024-10-13 05:55:02,585 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 05:55:02,585 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-10-13 05:55:02,586 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-13 05:55:02,587 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-10-13 05:55:02,591 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-10-13 05:55:03,015 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 05:55:03,031 INFO L255 TraceCheckSpWp]: Trace formula consists of 273 conjuncts, 9 conjuncts are in the unsatisfiable core [2024-10-13 05:55:03,037 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-13 05:55:04,020 INFO L134 CoverageAnalysis]: Checked inductivity of 420 backedges. 68 proven. 39 refuted. 0 times theorem prover too weak. 313 trivial. 0 not checked. [2024-10-13 05:55:04,021 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-13 05:55:04,303 INFO L134 CoverageAnalysis]: Checked inductivity of 420 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 420 trivial. 0 not checked. [2024-10-13 05:55:04,303 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-13 05:55:04,303 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [53246484] [2024-10-13 05:55:04,304 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [53246484] provided 1 perfect and 1 imperfect interpolant sequences [2024-10-13 05:55:04,304 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-10-13 05:55:04,304 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [9] total 10 [2024-10-13 05:55:04,304 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1747178987] [2024-10-13 05:55:04,304 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-13 05:55:04,306 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-10-13 05:55:04,308 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-13 05:55:04,309 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-10-13 05:55:04,309 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=69, Unknown=0, NotChecked=0, Total=90 [2024-10-13 05:55:04,309 INFO L87 Difference]: Start difference. First operand 105 states and 156 transitions. Second operand has 5 states, 5 states have (on average 10.8) internal successors, (54), 5 states have internal predecessors, (54), 1 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 1 states have call successors, (15) [2024-10-13 05:55:04,484 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-13 05:55:04,485 INFO L93 Difference]: Finished difference Result 251 states and 374 transitions. [2024-10-13 05:55:04,487 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-10-13 05:55:04,488 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 10.8) internal successors, (54), 5 states have internal predecessors, (54), 1 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 1 states have call successors, (15) Word has length 126 [2024-10-13 05:55:04,488 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-13 05:55:04,489 INFO L225 Difference]: With dead ends: 251 [2024-10-13 05:55:04,489 INFO L226 Difference]: Without dead ends: 147 [2024-10-13 05:55:04,490 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 251 GetRequests, 242 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=27, Invalid=83, Unknown=0, NotChecked=0, Total=110 [2024-10-13 05:55:04,491 INFO L432 NwaCegarLoop]: 144 mSDtfsCounter, 116 mSDsluCounter, 284 mSDsCounter, 0 mSdLazyCounter, 36 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 116 SdHoareTripleChecker+Valid, 428 SdHoareTripleChecker+Invalid, 37 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 36 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-13 05:55:04,495 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [116 Valid, 428 Invalid, 37 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 36 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-13 05:55:04,496 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 147 states. [2024-10-13 05:55:04,513 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 147 to 110. [2024-10-13 05:55:04,515 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 110 states, 93 states have (on average 1.4301075268817205) internal successors, (133), 93 states have internal predecessors, (133), 15 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 15 states have call predecessors, (15), 15 states have call successors, (15) [2024-10-13 05:55:04,517 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 110 states to 110 states and 163 transitions. [2024-10-13 05:55:04,519 INFO L78 Accepts]: Start accepts. Automaton has 110 states and 163 transitions. Word has length 126 [2024-10-13 05:55:04,520 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-13 05:55:04,520 INFO L471 AbstractCegarLoop]: Abstraction has 110 states and 163 transitions. [2024-10-13 05:55:04,520 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 10.8) internal successors, (54), 5 states have internal predecessors, (54), 1 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 1 states have call successors, (15) [2024-10-13 05:55:04,521 INFO L276 IsEmpty]: Start isEmpty. Operand 110 states and 163 transitions. [2024-10-13 05:55:04,522 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 127 [2024-10-13 05:55:04,524 INFO L207 NwaCegarLoop]: Found error trace [2024-10-13 05:55:04,524 INFO L215 NwaCegarLoop]: trace histogram [15, 15, 15, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-13 05:55:04,541 INFO L540 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)] Forceful destruction successful, exit code 0 [2024-10-13 05:55:04,725 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-10-13 05:55:04,725 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-13 05:55:04,726 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 05:55:04,726 INFO L85 PathProgramCache]: Analyzing trace with hash -255890603, now seen corresponding path program 1 times [2024-10-13 05:55:04,727 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-13 05:55:04,727 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [737150629] [2024-10-13 05:55:04,727 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 05:55:04,727 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-10-13 05:55:04,727 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-13 05:55:04,728 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-10-13 05:55:04,730 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-10-13 05:55:05,135 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 05:55:05,150 INFO L255 TraceCheckSpWp]: Trace formula consists of 276 conjuncts, 3 conjuncts are in the unsatisfiable core [2024-10-13 05:55:05,153 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-13 05:55:05,204 INFO L134 CoverageAnalysis]: Checked inductivity of 420 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 420 trivial. 0 not checked. [2024-10-13 05:55:05,204 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-13 05:55:05,204 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-13 05:55:05,204 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [737150629] [2024-10-13 05:55:05,204 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [737150629] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-13 05:55:05,205 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-13 05:55:05,205 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-10-13 05:55:05,205 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1638618111] [2024-10-13 05:55:05,205 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-13 05:55:05,205 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-10-13 05:55:05,205 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-13 05:55:05,206 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-10-13 05:55:05,206 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-10-13 05:55:05,206 INFO L87 Difference]: Start difference. First operand 110 states and 163 transitions. Second operand has 4 states, 4 states have (on average 13.5) internal successors, (54), 4 states have internal predecessors, (54), 1 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 1 states have call successors, (15) [2024-10-13 05:55:05,290 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-13 05:55:05,290 INFO L93 Difference]: Finished difference Result 221 states and 328 transitions. [2024-10-13 05:55:05,291 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-10-13 05:55:05,291 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 13.5) internal successors, (54), 4 states have internal predecessors, (54), 1 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 1 states have call successors, (15) Word has length 126 [2024-10-13 05:55:05,291 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-13 05:55:05,292 INFO L225 Difference]: With dead ends: 221 [2024-10-13 05:55:05,292 INFO L226 Difference]: Without dead ends: 112 [2024-10-13 05:55:05,293 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 125 GetRequests, 123 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-10-13 05:55:05,293 INFO L432 NwaCegarLoop]: 148 mSDtfsCounter, 0 mSDsluCounter, 289 mSDsCounter, 0 mSdLazyCounter, 24 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 437 SdHoareTripleChecker+Invalid, 24 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 24 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-13 05:55:05,294 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 437 Invalid, 24 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 24 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-13 05:55:05,294 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 112 states. [2024-10-13 05:55:05,298 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 112 to 112. [2024-10-13 05:55:05,299 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 112 states, 95 states have (on average 1.4210526315789473) internal successors, (135), 95 states have internal predecessors, (135), 15 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 15 states have call predecessors, (15), 15 states have call successors, (15) [2024-10-13 05:55:05,300 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 112 states to 112 states and 165 transitions. [2024-10-13 05:55:05,300 INFO L78 Accepts]: Start accepts. Automaton has 112 states and 165 transitions. Word has length 126 [2024-10-13 05:55:05,300 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-13 05:55:05,300 INFO L471 AbstractCegarLoop]: Abstraction has 112 states and 165 transitions. [2024-10-13 05:55:05,301 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 13.5) internal successors, (54), 4 states have internal predecessors, (54), 1 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 1 states have call successors, (15) [2024-10-13 05:55:05,301 INFO L276 IsEmpty]: Start isEmpty. Operand 112 states and 165 transitions. [2024-10-13 05:55:05,302 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 129 [2024-10-13 05:55:05,302 INFO L207 NwaCegarLoop]: Found error trace [2024-10-13 05:55:05,302 INFO L215 NwaCegarLoop]: trace histogram [15, 15, 15, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-13 05:55:05,319 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-10-13 05:55:05,502 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-10-13 05:55:05,503 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-13 05:55:05,503 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 05:55:05,504 INFO L85 PathProgramCache]: Analyzing trace with hash -59935174, now seen corresponding path program 1 times [2024-10-13 05:55:05,504 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-13 05:55:05,504 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1172227281] [2024-10-13 05:55:05,504 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 05:55:05,504 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-10-13 05:55:05,505 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-13 05:55:05,507 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-10-13 05:55:05,508 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-10-13 05:55:05,914 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 05:55:05,929 INFO L255 TraceCheckSpWp]: Trace formula consists of 282 conjuncts, 8 conjuncts are in the unsatisfiable core [2024-10-13 05:55:05,932 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-13 05:55:06,554 INFO L134 CoverageAnalysis]: Checked inductivity of 420 backedges. 68 proven. 39 refuted. 0 times theorem prover too weak. 313 trivial. 0 not checked. [2024-10-13 05:55:06,555 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-13 05:55:06,787 INFO L134 CoverageAnalysis]: Checked inductivity of 420 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 420 trivial. 0 not checked. [2024-10-13 05:55:06,787 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-13 05:55:06,787 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1172227281] [2024-10-13 05:55:06,788 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1172227281] provided 1 perfect and 1 imperfect interpolant sequences [2024-10-13 05:55:06,788 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-10-13 05:55:06,788 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [9] total 10 [2024-10-13 05:55:06,788 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2049147171] [2024-10-13 05:55:06,788 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-13 05:55:06,788 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-10-13 05:55:06,788 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-13 05:55:06,789 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-10-13 05:55:06,789 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=69, Unknown=0, NotChecked=0, Total=90 [2024-10-13 05:55:06,789 INFO L87 Difference]: Start difference. First operand 112 states and 165 transitions. Second operand has 5 states, 5 states have (on average 11.2) internal successors, (56), 5 states have internal predecessors, (56), 1 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 1 states have call successors, (15) [2024-10-13 05:55:06,924 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-13 05:55:06,924 INFO L93 Difference]: Finished difference Result 258 states and 380 transitions. [2024-10-13 05:55:06,932 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-10-13 05:55:06,933 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 11.2) internal successors, (56), 5 states have internal predecessors, (56), 1 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 1 states have call successors, (15) Word has length 128 [2024-10-13 05:55:06,933 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-13 05:55:06,934 INFO L225 Difference]: With dead ends: 258 [2024-10-13 05:55:06,935 INFO L226 Difference]: Without dead ends: 147 [2024-10-13 05:55:06,935 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 255 GetRequests, 246 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=27, Invalid=83, Unknown=0, NotChecked=0, Total=110 [2024-10-13 05:55:06,936 INFO L432 NwaCegarLoop]: 144 mSDtfsCounter, 98 mSDsluCounter, 286 mSDsCounter, 0 mSdLazyCounter, 34 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 98 SdHoareTripleChecker+Valid, 430 SdHoareTripleChecker+Invalid, 34 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 34 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-13 05:55:06,939 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [98 Valid, 430 Invalid, 34 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 34 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-13 05:55:06,940 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 147 states. [2024-10-13 05:55:06,949 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 147 to 120. [2024-10-13 05:55:06,950 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 120 states, 103 states have (on average 1.4271844660194175) internal successors, (147), 103 states have internal predecessors, (147), 15 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 15 states have call predecessors, (15), 15 states have call successors, (15) [2024-10-13 05:55:06,953 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 120 states to 120 states and 177 transitions. [2024-10-13 05:55:06,953 INFO L78 Accepts]: Start accepts. Automaton has 120 states and 177 transitions. Word has length 128 [2024-10-13 05:55:06,953 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-13 05:55:06,953 INFO L471 AbstractCegarLoop]: Abstraction has 120 states and 177 transitions. [2024-10-13 05:55:06,954 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 11.2) internal successors, (56), 5 states have internal predecessors, (56), 1 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 1 states have call successors, (15) [2024-10-13 05:55:06,954 INFO L276 IsEmpty]: Start isEmpty. Operand 120 states and 177 transitions. [2024-10-13 05:55:06,955 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 130 [2024-10-13 05:55:06,955 INFO L207 NwaCegarLoop]: Found error trace [2024-10-13 05:55:06,955 INFO L215 NwaCegarLoop]: trace histogram [15, 15, 15, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-13 05:55:06,968 INFO L540 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)] Forceful destruction successful, exit code 0 [2024-10-13 05:55:07,156 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 /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-10-13 05:55:07,156 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-13 05:55:07,157 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 05:55:07,157 INFO L85 PathProgramCache]: Analyzing trace with hash -793687922, now seen corresponding path program 1 times [2024-10-13 05:55:07,157 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-13 05:55:07,157 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1503494030] [2024-10-13 05:55:07,157 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 05:55:07,158 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-10-13 05:55:07,158 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-13 05:55:07,159 INFO L229 MonitoredProcess]: Starting monitored process 7 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-10-13 05:55:07,159 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 (7)] Waiting until timeout for monitored process [2024-10-13 05:55:07,550 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 05:55:07,565 INFO L255 TraceCheckSpWp]: Trace formula consists of 284 conjuncts, 8 conjuncts are in the unsatisfiable core [2024-10-13 05:55:07,568 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-13 05:55:07,752 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-10-13 05:55:07,753 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-10-13 05:55:07,800 INFO L134 CoverageAnalysis]: Checked inductivity of 420 backedges. 104 proven. 0 refuted. 0 times theorem prover too weak. 316 trivial. 0 not checked. [2024-10-13 05:55:07,800 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-13 05:55:07,801 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-13 05:55:07,801 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1503494030] [2024-10-13 05:55:07,801 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1503494030] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-13 05:55:07,801 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-13 05:55:07,801 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-10-13 05:55:07,801 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [581654019] [2024-10-13 05:55:07,801 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-13 05:55:07,802 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-10-13 05:55:07,802 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-13 05:55:07,802 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-10-13 05:55:07,802 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2024-10-13 05:55:07,803 INFO L87 Difference]: Start difference. First operand 120 states and 177 transitions. Second operand has 6 states, 6 states have (on average 10.0) internal successors, (60), 5 states have internal predecessors, (60), 2 states have call successors, (15), 2 states have call predecessors, (15), 2 states have return successors, (15), 2 states have call predecessors, (15), 2 states have call successors, (15) [2024-10-13 05:55:10,171 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.88s for a HTC check with result INVALID. Formula has sorts [Array, Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2024-10-13 05:55:12,194 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.92s for a HTC check with result INVALID. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-10-13 05:55:14,828 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.79s for a HTC check with result INVALID. Formula has sorts [Array, Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2024-10-13 05:55:17,943 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 3.00s for a HTC check with result INVALID. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-10-13 05:55:18,033 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-13 05:55:18,034 INFO L93 Difference]: Finished difference Result 239 states and 353 transitions. [2024-10-13 05:55:18,054 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-10-13 05:55:18,055 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 10.0) internal successors, (60), 5 states have internal predecessors, (60), 2 states have call successors, (15), 2 states have call predecessors, (15), 2 states have return successors, (15), 2 states have call predecessors, (15), 2 states have call successors, (15) Word has length 129 [2024-10-13 05:55:18,055 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-13 05:55:18,056 INFO L225 Difference]: With dead ends: 239 [2024-10-13 05:55:18,056 INFO L226 Difference]: Without dead ends: 120 [2024-10-13 05:55:18,057 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 131 GetRequests, 124 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=24, Invalid=48, Unknown=0, NotChecked=0, Total=72 [2024-10-13 05:55:18,057 INFO L432 NwaCegarLoop]: 123 mSDtfsCounter, 143 mSDsluCounter, 337 mSDsCounter, 0 mSdLazyCounter, 147 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 10.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 143 SdHoareTripleChecker+Valid, 460 SdHoareTripleChecker+Invalid, 148 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 147 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 10.2s IncrementalHoareTripleChecker+Time [2024-10-13 05:55:18,058 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [143 Valid, 460 Invalid, 148 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 147 Invalid, 0 Unknown, 0 Unchecked, 10.2s Time] [2024-10-13 05:55:18,058 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 120 states. [2024-10-13 05:55:18,063 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 120 to 118. [2024-10-13 05:55:18,063 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 118 states, 101 states have (on average 1.4257425742574257) internal successors, (144), 101 states have internal predecessors, (144), 15 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 15 states have call predecessors, (15), 15 states have call successors, (15) [2024-10-13 05:55:18,064 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 118 states to 118 states and 174 transitions. [2024-10-13 05:55:18,064 INFO L78 Accepts]: Start accepts. Automaton has 118 states and 174 transitions. Word has length 129 [2024-10-13 05:55:18,065 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-13 05:55:18,066 INFO L471 AbstractCegarLoop]: Abstraction has 118 states and 174 transitions. [2024-10-13 05:55:18,066 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 10.0) internal successors, (60), 5 states have internal predecessors, (60), 2 states have call successors, (15), 2 states have call predecessors, (15), 2 states have return successors, (15), 2 states have call predecessors, (15), 2 states have call successors, (15) [2024-10-13 05:55:18,067 INFO L276 IsEmpty]: Start isEmpty. Operand 118 states and 174 transitions. [2024-10-13 05:55:18,068 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 132 [2024-10-13 05:55:18,068 INFO L207 NwaCegarLoop]: Found error trace [2024-10-13 05:55:18,068 INFO L215 NwaCegarLoop]: trace histogram [15, 15, 15, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-13 05:55:18,089 INFO L540 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 (7)] Forceful destruction successful, exit code 0 [2024-10-13 05:55:18,268 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 7 /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-10-13 05:55:18,269 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-13 05:55:18,269 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 05:55:18,270 INFO L85 PathProgramCache]: Analyzing trace with hash -1830801514, now seen corresponding path program 1 times [2024-10-13 05:55:18,270 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-13 05:55:18,270 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1513904947] [2024-10-13 05:55:18,270 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 05:55:18,270 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-10-13 05:55:18,271 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-13 05:55:18,273 INFO L229 MonitoredProcess]: Starting monitored process 8 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-10-13 05:55:18,274 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 (8)] Waiting until timeout for monitored process [2024-10-13 05:55:18,701 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 05:55:18,719 INFO L255 TraceCheckSpWp]: Trace formula consists of 288 conjuncts, 10 conjuncts are in the unsatisfiable core [2024-10-13 05:55:18,722 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-13 05:55:18,988 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-10-13 05:55:18,989 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 154 treesize of output 64 [2024-10-13 05:55:19,145 INFO L134 CoverageAnalysis]: Checked inductivity of 420 backedges. 144 proven. 8 refuted. 0 times theorem prover too weak. 268 trivial. 0 not checked. [2024-10-13 05:55:19,145 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-13 05:55:19,569 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-10-13 05:55:19,570 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 98 treesize of output 1 [2024-10-13 05:55:19,580 INFO L134 CoverageAnalysis]: Checked inductivity of 420 backedges. 6 proven. 36 refuted. 0 times theorem prover too weak. 378 trivial. 0 not checked. [2024-10-13 05:55:19,580 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-13 05:55:19,580 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1513904947] [2024-10-13 05:55:19,580 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1513904947] provided 0 perfect and 2 imperfect interpolant sequences [2024-10-13 05:55:19,580 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-10-13 05:55:19,581 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 8] total 12 [2024-10-13 05:55:19,581 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2121027386] [2024-10-13 05:55:19,581 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-10-13 05:55:19,581 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2024-10-13 05:55:19,581 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-13 05:55:19,582 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2024-10-13 05:55:19,582 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=29, Invalid=103, Unknown=0, NotChecked=0, Total=132 [2024-10-13 05:55:19,582 INFO L87 Difference]: Start difference. First operand 118 states and 174 transitions. Second operand has 12 states, 11 states have (on average 7.090909090909091) internal successors, (78), 12 states have internal predecessors, (78), 4 states have call successors, (29), 3 states have call predecessors, (29), 4 states have return successors, (29), 3 states have call predecessors, (29), 4 states have call successors, (29) [2024-10-13 05:55:22,538 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.54s for a HTC check with result INVALID. Formula has sorts [Array, Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2024-10-13 05:55:24,768 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.10s for a HTC check with result INVALID. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-10-13 05:55:26,255 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.24s for a HTC check with result INVALID. Formula has sorts [Array, Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2024-10-13 05:55:29,668 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 3.39s for a HTC check with result INVALID. Formula has sorts [Array, Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2024-10-13 05:55:32,243 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.39s for a HTC check with result INVALID. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-10-13 05:55:32,436 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-13 05:55:32,436 INFO L93 Difference]: Finished difference Result 248 states and 362 transitions. [2024-10-13 05:55:32,460 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2024-10-13 05:55:32,460 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 11 states have (on average 7.090909090909091) internal successors, (78), 12 states have internal predecessors, (78), 4 states have call successors, (29), 3 states have call predecessors, (29), 4 states have return successors, (29), 3 states have call predecessors, (29), 4 states have call successors, (29) Word has length 131 [2024-10-13 05:55:32,461 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-13 05:55:32,461 INFO L225 Difference]: With dead ends: 248 [2024-10-13 05:55:32,462 INFO L226 Difference]: Without dead ends: 120 [2024-10-13 05:55:32,462 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 271 GetRequests, 251 SyntacticMatches, 0 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 58 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=96, Invalid=366, Unknown=0, NotChecked=0, Total=462 [2024-10-13 05:55:32,463 INFO L432 NwaCegarLoop]: 107 mSDtfsCounter, 151 mSDsluCounter, 486 mSDsCounter, 0 mSdLazyCounter, 339 mSolverCounterSat, 15 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 12.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 164 SdHoareTripleChecker+Valid, 593 SdHoareTripleChecker+Invalid, 354 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 15 IncrementalHoareTripleChecker+Valid, 339 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 12.4s IncrementalHoareTripleChecker+Time [2024-10-13 05:55:32,463 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [164 Valid, 593 Invalid, 354 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [15 Valid, 339 Invalid, 0 Unknown, 0 Unchecked, 12.4s Time] [2024-10-13 05:55:32,463 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 120 states. [2024-10-13 05:55:32,482 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 120 to 118. [2024-10-13 05:55:32,485 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 118 states, 101 states have (on average 1.4059405940594059) internal successors, (142), 101 states have internal predecessors, (142), 15 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 15 states have call predecessors, (15), 15 states have call successors, (15) [2024-10-13 05:55:32,486 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 118 states to 118 states and 172 transitions. [2024-10-13 05:55:32,486 INFO L78 Accepts]: Start accepts. Automaton has 118 states and 172 transitions. Word has length 131 [2024-10-13 05:55:32,486 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-13 05:55:32,486 INFO L471 AbstractCegarLoop]: Abstraction has 118 states and 172 transitions. [2024-10-13 05:55:32,486 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 11 states have (on average 7.090909090909091) internal successors, (78), 12 states have internal predecessors, (78), 4 states have call successors, (29), 3 states have call predecessors, (29), 4 states have return successors, (29), 3 states have call predecessors, (29), 4 states have call successors, (29) [2024-10-13 05:55:32,487 INFO L276 IsEmpty]: Start isEmpty. Operand 118 states and 172 transitions. [2024-10-13 05:55:32,487 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 132 [2024-10-13 05:55:32,488 INFO L207 NwaCegarLoop]: Found error trace [2024-10-13 05:55:32,488 INFO L215 NwaCegarLoop]: trace histogram [15, 15, 15, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-13 05:55:32,512 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 (8)] Ended with exit code 0 [2024-10-13 05:55:32,688 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 8 /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-10-13 05:55:32,689 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-13 05:55:32,689 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 05:55:32,689 INFO L85 PathProgramCache]: Analyzing trace with hash -108798828, now seen corresponding path program 1 times [2024-10-13 05:55:32,690 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-13 05:55:32,690 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [64017938] [2024-10-13 05:55:32,690 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 05:55:32,690 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-10-13 05:55:32,690 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-13 05:55:32,691 INFO L229 MonitoredProcess]: Starting monitored process 9 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-10-13 05:55:32,693 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 (9)] Waiting until timeout for monitored process [2024-10-13 05:55:33,133 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 05:55:33,149 INFO L255 TraceCheckSpWp]: Trace formula consists of 290 conjuncts, 8 conjuncts are in the unsatisfiable core [2024-10-13 05:55:33,152 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-13 05:55:33,377 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-10-13 05:55:33,377 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 173 treesize of output 65 [2024-10-13 05:55:33,440 INFO L134 CoverageAnalysis]: Checked inductivity of 420 backedges. 144 proven. 0 refuted. 0 times theorem prover too weak. 276 trivial. 0 not checked. [2024-10-13 05:55:33,440 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-13 05:55:33,440 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-13 05:55:33,440 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [64017938] [2024-10-13 05:55:33,440 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [64017938] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-13 05:55:33,440 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-13 05:55:33,441 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-10-13 05:55:33,441 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [866649636] [2024-10-13 05:55:33,441 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-13 05:55:33,441 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-10-13 05:55:33,441 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-13 05:55:33,442 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-10-13 05:55:33,442 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2024-10-13 05:55:33,442 INFO L87 Difference]: Start difference. First operand 118 states and 172 transitions. Second operand has 6 states, 6 states have (on average 10.333333333333334) internal successors, (62), 5 states have internal predecessors, (62), 2 states have call successors, (15), 2 states have call predecessors, (15), 2 states have return successors, (15), 2 states have call predecessors, (15), 2 states have call successors, (15) [2024-10-13 05:55:37,700 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 3.60s for a HTC check with result INVALID. Formula has sorts [Array, Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2024-10-13 05:55:40,288 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.49s for a HTC check with result INVALID. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-10-13 05:55:44,505 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.04s for a HTC check with result INVALID. Formula has sorts [Array, Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2024-10-13 05:55:47,049 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.44s for a HTC check with result INVALID. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-10-13 05:55:47,152 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-13 05:55:47,152 INFO L93 Difference]: Finished difference Result 236 states and 344 transitions. [2024-10-13 05:55:47,177 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-10-13 05:55:47,178 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 10.333333333333334) internal successors, (62), 5 states have internal predecessors, (62), 2 states have call successors, (15), 2 states have call predecessors, (15), 2 states have return successors, (15), 2 states have call predecessors, (15), 2 states have call successors, (15) Word has length 131 [2024-10-13 05:55:47,178 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-13 05:55:47,179 INFO L225 Difference]: With dead ends: 236 [2024-10-13 05:55:47,179 INFO L226 Difference]: Without dead ends: 119 [2024-10-13 05:55:47,179 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 133 GetRequests, 126 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=24, Invalid=48, Unknown=0, NotChecked=0, Total=72 [2024-10-13 05:55:47,180 INFO L432 NwaCegarLoop]: 120 mSDtfsCounter, 132 mSDsluCounter, 328 mSDsCounter, 0 mSdLazyCounter, 150 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 13.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 132 SdHoareTripleChecker+Valid, 448 SdHoareTripleChecker+Invalid, 151 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 150 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 13.6s IncrementalHoareTripleChecker+Time [2024-10-13 05:55:47,180 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [132 Valid, 448 Invalid, 151 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 150 Invalid, 0 Unknown, 0 Unchecked, 13.6s Time] [2024-10-13 05:55:47,180 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 119 states. [2024-10-13 05:55:47,183 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 119 to 118. [2024-10-13 05:55:47,184 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 118 states, 101 states have (on average 1.396039603960396) internal successors, (141), 101 states have internal predecessors, (141), 15 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 15 states have call predecessors, (15), 15 states have call successors, (15) [2024-10-13 05:55:47,184 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 118 states to 118 states and 171 transitions. [2024-10-13 05:55:47,185 INFO L78 Accepts]: Start accepts. Automaton has 118 states and 171 transitions. Word has length 131 [2024-10-13 05:55:47,185 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-13 05:55:47,185 INFO L471 AbstractCegarLoop]: Abstraction has 118 states and 171 transitions. [2024-10-13 05:55:47,185 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 10.333333333333334) internal successors, (62), 5 states have internal predecessors, (62), 2 states have call successors, (15), 2 states have call predecessors, (15), 2 states have return successors, (15), 2 states have call predecessors, (15), 2 states have call successors, (15) [2024-10-13 05:55:47,185 INFO L276 IsEmpty]: Start isEmpty. Operand 118 states and 171 transitions. [2024-10-13 05:55:47,186 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 134 [2024-10-13 05:55:47,186 INFO L207 NwaCegarLoop]: Found error trace [2024-10-13 05:55:47,186 INFO L215 NwaCegarLoop]: trace histogram [15, 15, 15, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-13 05:55:47,205 INFO L540 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 (9)] Forceful destruction successful, exit code 0 [2024-10-13 05:55:47,386 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 /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-10-13 05:55:47,387 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-13 05:55:47,387 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 05:55:47,387 INFO L85 PathProgramCache]: Analyzing trace with hash 1860386126, now seen corresponding path program 1 times [2024-10-13 05:55:47,388 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-13 05:55:47,388 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1132253961] [2024-10-13 05:55:47,388 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 05:55:47,388 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-10-13 05:55:47,388 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-13 05:55:47,390 INFO L229 MonitoredProcess]: Starting monitored process 10 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-10-13 05:55:47,391 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 (10)] Waiting until timeout for monitored process [2024-10-13 05:55:47,922 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 05:55:47,940 INFO L255 TraceCheckSpWp]: Trace formula consists of 296 conjuncts, 6 conjuncts are in the unsatisfiable core [2024-10-13 05:55:47,943 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-13 05:55:48,476 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 25 treesize of output 24 [2024-10-13 05:55:48,903 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-10-13 05:55:48,903 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 50 treesize of output 26 [2024-10-13 05:55:48,922 INFO L134 CoverageAnalysis]: Checked inductivity of 420 backedges. 144 proven. 0 refuted. 0 times theorem prover too weak. 276 trivial. 0 not checked. [2024-10-13 05:55:48,922 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-13 05:55:48,922 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-13 05:55:48,922 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1132253961] [2024-10-13 05:55:48,922 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1132253961] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-13 05:55:48,922 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-13 05:55:48,923 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-10-13 05:55:48,923 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1151241198] [2024-10-13 05:55:48,923 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-13 05:55:48,923 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-10-13 05:55:48,923 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-13 05:55:48,923 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-10-13 05:55:48,924 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2024-10-13 05:55:48,924 INFO L87 Difference]: Start difference. First operand 118 states and 171 transitions. Second operand has 5 states, 5 states have (on average 12.8) internal successors, (64), 4 states have internal predecessors, (64), 2 states have call successors, (15), 2 states have call predecessors, (15), 2 states have return successors, (15), 2 states have call predecessors, (15), 2 states have call successors, (15) [2024-10-13 05:55:49,365 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-13 05:55:49,365 INFO L93 Difference]: Finished difference Result 335 states and 484 transitions. [2024-10-13 05:55:49,366 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-10-13 05:55:49,367 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 12.8) internal successors, (64), 4 states have internal predecessors, (64), 2 states have call successors, (15), 2 states have call predecessors, (15), 2 states have return successors, (15), 2 states have call predecessors, (15), 2 states have call successors, (15) Word has length 133 [2024-10-13 05:55:49,367 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-13 05:55:49,368 INFO L225 Difference]: With dead ends: 335 [2024-10-13 05:55:49,368 INFO L226 Difference]: Without dead ends: 218 [2024-10-13 05:55:49,369 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 133 GetRequests, 129 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2024-10-13 05:55:49,369 INFO L432 NwaCegarLoop]: 134 mSDtfsCounter, 122 mSDsluCounter, 396 mSDsCounter, 0 mSdLazyCounter, 68 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 122 SdHoareTripleChecker+Valid, 530 SdHoareTripleChecker+Invalid, 71 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 68 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2024-10-13 05:55:49,369 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [122 Valid, 530 Invalid, 71 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 68 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2024-10-13 05:55:49,370 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 218 states. [2024-10-13 05:55:49,387 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 218 to 214. [2024-10-13 05:55:49,388 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 214 states, 181 states have (on average 1.3756906077348066) internal successors, (249), 181 states have internal predecessors, (249), 30 states have call successors, (30), 2 states have call predecessors, (30), 2 states have return successors, (30), 30 states have call predecessors, (30), 30 states have call successors, (30) [2024-10-13 05:55:49,389 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 214 states to 214 states and 309 transitions. [2024-10-13 05:55:49,389 INFO L78 Accepts]: Start accepts. Automaton has 214 states and 309 transitions. Word has length 133 [2024-10-13 05:55:49,389 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-13 05:55:49,390 INFO L471 AbstractCegarLoop]: Abstraction has 214 states and 309 transitions. [2024-10-13 05:55:49,390 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 12.8) internal successors, (64), 4 states have internal predecessors, (64), 2 states have call successors, (15), 2 states have call predecessors, (15), 2 states have return successors, (15), 2 states have call predecessors, (15), 2 states have call successors, (15) [2024-10-13 05:55:49,390 INFO L276 IsEmpty]: Start isEmpty. Operand 214 states and 309 transitions. [2024-10-13 05:55:49,391 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 134 [2024-10-13 05:55:49,391 INFO L207 NwaCegarLoop]: Found error trace [2024-10-13 05:55:49,395 INFO L215 NwaCegarLoop]: trace histogram [15, 15, 15, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-13 05:55:49,412 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 (10)] Ended with exit code 0 [2024-10-13 05:55:49,595 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 10 /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-10-13 05:55:49,596 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-13 05:55:49,596 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 05:55:49,596 INFO L85 PathProgramCache]: Analyzing trace with hash 1042737676, now seen corresponding path program 1 times [2024-10-13 05:55:49,597 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-13 05:55:49,597 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [947169501] [2024-10-13 05:55:49,597 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 05:55:49,597 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-10-13 05:55:49,597 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-13 05:55:49,598 INFO L229 MonitoredProcess]: Starting monitored process 11 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-10-13 05:55:49,599 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 (11)] Waiting until timeout for monitored process [2024-10-13 05:55:50,034 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 05:55:50,052 INFO L255 TraceCheckSpWp]: Trace formula consists of 299 conjuncts, 6 conjuncts are in the unsatisfiable core [2024-10-13 05:55:50,055 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-13 05:55:50,201 INFO L134 CoverageAnalysis]: Checked inductivity of 420 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 420 trivial. 0 not checked. [2024-10-13 05:55:50,202 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-13 05:55:50,202 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-13 05:55:50,202 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [947169501] [2024-10-13 05:55:50,202 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [947169501] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-13 05:55:50,202 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-13 05:55:50,202 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-10-13 05:55:50,202 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1150972789] [2024-10-13 05:55:50,203 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-13 05:55:50,203 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-10-13 05:55:50,203 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-13 05:55:50,203 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-10-13 05:55:50,204 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-10-13 05:55:50,204 INFO L87 Difference]: Start difference. First operand 214 states and 309 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, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 1 states have call successors, (15)