./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-sp_file-70.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 023d838f Calling Ultimate with: /root/.sdkman/candidates/java/11.0.12-open/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-sp_file-70.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 d988db7712de2c6d8eb7d61491428486f8a118d4b3658639fd5dbb77a89642a4 --- Real Ultimate output --- This is Ultimate 0.2.5-tmp.fs.icfgbuilder-eval-023d838-m [2024-11-10 10:00:59,988 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-10 10:01:00,041 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2024-11-10 10:01:00,045 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-10 10:01:00,045 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-10 10:01:00,069 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-10 10:01:00,070 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-10 10:01:00,070 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-10 10:01:00,071 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-11-10 10:01:00,071 INFO L153 SettingsManager]: * Use memory slicer=true [2024-11-10 10:01:00,072 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-10 10:01:00,072 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-10 10:01:00,072 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-10 10:01:00,074 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-10 10:01:00,074 INFO L153 SettingsManager]: * Use SBE=true [2024-11-10 10:01:00,074 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-10 10:01:00,074 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-11-10 10:01:00,075 INFO L153 SettingsManager]: * sizeof long=4 [2024-11-10 10:01:00,075 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-11-10 10:01:00,075 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-11-10 10:01:00,078 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-10 10:01:00,079 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-11-10 10:01:00,079 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-10 10:01:00,079 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-11-10 10:01:00,079 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-10 10:01:00,079 INFO L153 SettingsManager]: * sizeof long double=12 [2024-11-10 10:01:00,079 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-11-10 10:01:00,080 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-10 10:01:00,080 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2024-11-10 10:01:00,080 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-10 10:01:00,080 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-10 10:01:00,080 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-10 10:01:00,080 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-10 10:01:00,081 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-10 10:01:00,081 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-10 10:01:00,081 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-11-10 10:01:00,081 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-11-10 10:01:00,081 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-11-10 10:01:00,081 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-10 10:01:00,081 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-11-10 10:01:00,082 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-11-10 10:01:00,083 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-11-10 10:01:00,083 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 -> d988db7712de2c6d8eb7d61491428486f8a118d4b3658639fd5dbb77a89642a4 [2024-11-10 10:01:00,310 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-10 10:01:00,328 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-10 10:01:00,330 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-10 10:01:00,331 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-10 10:01:00,331 INFO L274 PluginConnector]: CDTParser initialized [2024-11-10 10:01:00,332 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-sp_file-70.i [2024-11-10 10:01:01,552 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-10 10:01:01,723 INFO L384 CDTParser]: Found 1 translation units. [2024-11-10 10:01:01,724 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-sp_file-70.i [2024-11-10 10:01:01,733 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/82779343e/b674b5e71915487c8b940962a2315899/FLAGf3c54fcab [2024-11-10 10:01:02,121 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/82779343e/b674b5e71915487c8b940962a2315899 [2024-11-10 10:01:02,123 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-10 10:01:02,124 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-10 10:01:02,125 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-10 10:01:02,127 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-10 10:01:02,132 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-10 10:01:02,132 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 10.11 10:01:02" (1/1) ... [2024-11-10 10:01:02,133 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@27b3151e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 10:01:02, skipping insertion in model container [2024-11-10 10:01:02,134 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 10.11 10:01:02" (1/1) ... [2024-11-10 10:01:02,162 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-10 10:01:02,304 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-sp_file-70.i[917,930] [2024-11-10 10:01:02,353 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-10 10:01:02,362 INFO L200 MainTranslator]: Completed pre-run [2024-11-10 10:01:02,373 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-sp_file-70.i[917,930] [2024-11-10 10:01:02,408 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-10 10:01:02,424 INFO L204 MainTranslator]: Completed translation [2024-11-10 10:01:02,425 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 10:01:02 WrapperNode [2024-11-10 10:01:02,425 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-10 10:01:02,426 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-10 10:01:02,426 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-10 10:01:02,426 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-10 10:01:02,431 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 10:01:02" (1/1) ... [2024-11-10 10:01:02,444 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 10:01:02" (1/1) ... [2024-11-10 10:01:02,478 INFO L138 Inliner]: procedures = 30, calls = 156, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 529 [2024-11-10 10:01:02,479 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-10 10:01:02,479 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-10 10:01:02,479 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-10 10:01:02,479 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-10 10:01:02,491 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 10:01:02" (1/1) ... [2024-11-10 10:01:02,491 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 10:01:02" (1/1) ... [2024-11-10 10:01:02,496 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 10:01:02" (1/1) ... [2024-11-10 10:01:02,509 WARN L109 MemorySlicer]: Omit memory slicing because it failed with the following exception: Unsupported: Memory array in LHS [2024-11-10 10:01:02,509 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 10:01:02" (1/1) ... [2024-11-10 10:01:02,510 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 10:01:02" (1/1) ... [2024-11-10 10:01:02,526 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 10:01:02" (1/1) ... [2024-11-10 10:01:02,527 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 10:01:02" (1/1) ... [2024-11-10 10:01:02,530 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 10:01:02" (1/1) ... [2024-11-10 10:01:02,532 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 10:01:02" (1/1) ... [2024-11-10 10:01:02,536 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-10 10:01:02,542 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2024-11-10 10:01:02,542 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2024-11-10 10:01:02,542 INFO L274 PluginConnector]: IcfgBuilder initialized [2024-11-10 10:01:02,543 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 10:01:02" (1/1) ... [2024-11-10 10:01:02,553 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-10 10:01:02,563 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-10 10:01:02,580 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2024-11-10 10:01:02,583 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2024-11-10 10:01:02,643 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-11-10 10:01:02,647 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~real [2024-11-10 10:01:02,647 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~int [2024-11-10 10:01:02,647 INFO L130 BoogieDeclarations]: Found specification of procedure read~real [2024-11-10 10:01:02,647 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2024-11-10 10:01:02,647 INFO L130 BoogieDeclarations]: Found specification of procedure write~real [2024-11-10 10:01:02,647 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2024-11-10 10:01:02,648 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2024-11-10 10:01:02,648 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2024-11-10 10:01:02,648 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2024-11-10 10:01:02,648 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-10 10:01:02,648 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-10 10:01:02,775 INFO L256 CfgBuilder]: Building ICFG [2024-11-10 10:01:02,776 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-10 10:01:03,153 INFO L1247 $ProcedureCfgBuilder]: dead code at ProgramPoint L118: havoc property_#t~mem88#1;havoc property_#t~ite95#1;havoc property_#t~mem94#1;havoc property_#t~mem89#1;havoc property_#t~mem90#1;havoc property_#t~ite92#1;havoc property_#t~mem91#1;havoc property_#t~mem93#1;havoc property_#t~mem99#1;havoc property_#t~mem98#1;havoc property_#t~mem96#1;havoc property_#t~mem97#1;havoc property_#t~short100#1;havoc property_#t~ite102#1;havoc property_#t~mem101#1;havoc property_#t~short103#1;havoc property_#t~mem113#1;havoc property_#t~mem107#1;havoc property_#t~mem104#1;havoc property_#t~mem105#1;havoc property_#t~bitwise106#1;havoc property_#t~ite112#1;havoc property_#t~mem108#1;havoc property_#t~mem109#1;havoc property_#t~mem110#1;havoc property_#t~bitwise111#1;havoc property_#t~ite126#1;havoc property_#t~mem121#1;havoc property_#t~mem114#1;havoc property_#t~mem115#1;havoc property_#t~mem116#1;havoc property_#t~ite120#1;havoc property_#t~mem117#1;havoc property_#t~mem118#1;havoc property_#t~mem119#1;havoc property_#t~mem125#1;havoc property_#t~mem124#1;havoc property_#t~mem122#1;havoc property_#t~mem123#1;havoc property_#t~short127#1;havoc property_#t~mem128#1;havoc property_#t~mem129#1;havoc property_#t~ite137#1;havoc property_#t~mem132#1;havoc property_#t~mem130#1;havoc property_#t~mem131#1;havoc property_#t~mem136#1;havoc property_#t~mem133#1;havoc property_#t~mem134#1;havoc property_#t~mem135#1;havoc property_#t~short138#1;havoc property_#t~mem140#1;havoc property_#t~mem139#1;havoc property_#t~short141#1;havoc property_#t~mem143#1;havoc property_#t~mem142#1;havoc property_#t~short144#1; [2024-11-10 10:01:03,191 INFO L? ?]: Removed 145 outVars from TransFormulas that were not future-live. [2024-11-10 10:01:03,192 INFO L307 CfgBuilder]: Performing block encoding [2024-11-10 10:01:03,211 INFO L331 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-10 10:01:03,212 INFO L336 CfgBuilder]: Removed 0 assume(true) statements. [2024-11-10 10:01:03,212 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 10.11 10:01:03 BoogieIcfgContainer [2024-11-10 10:01:03,213 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2024-11-10 10:01:03,214 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-11-10 10:01:03,215 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-11-10 10:01:03,218 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-11-10 10:01:03,218 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 10.11 10:01:02" (1/3) ... [2024-11-10 10:01:03,219 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@a50d86f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 10.11 10:01:03, skipping insertion in model container [2024-11-10 10:01:03,219 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 10:01:02" (2/3) ... [2024-11-10 10:01:03,220 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@a50d86f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 10.11 10:01:03, skipping insertion in model container [2024-11-10 10:01:03,220 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 10.11 10:01:03" (3/3) ... [2024-11-10 10:01:03,221 INFO L112 eAbstractionObserver]: Analyzing ICFG hardness_variablewrapping_wrapper-sp_file-70.i [2024-11-10 10:01:03,233 INFO L214 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-11-10 10:01:03,233 INFO L154 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-11-10 10:01:03,285 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-10 10:01:03,294 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;@318b63cb, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-10 10:01:03,294 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-11-10 10:01:03,298 INFO L276 IsEmpty]: Start isEmpty. Operand has 114 states, 99 states have (on average 1.4242424242424243) internal successors, (141), 100 states have internal predecessors, (141), 12 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 12 states have call predecessors, (12), 12 states have call successors, (12) [2024-11-10 10:01:03,307 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 119 [2024-11-10 10:01:03,307 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 10:01:03,307 INFO L215 NwaCegarLoop]: trace histogram [12, 12, 12, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-10 10:01:03,308 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-10 10:01:03,311 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 10:01:03,311 INFO L85 PathProgramCache]: Analyzing trace with hash -649252825, now seen corresponding path program 1 times [2024-11-10 10:01:03,318 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 10:01:03,318 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2002382628] [2024-11-10 10:01:03,319 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 10:01:03,319 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 10:01:03,566 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 10:01:03,925 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2024-11-10 10:01:03,927 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 10:01:03,930 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2024-11-10 10:01:03,933 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 10:01:03,935 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2024-11-10 10:01:03,936 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 10:01:03,938 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2024-11-10 10:01:03,939 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 10:01:03,943 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2024-11-10 10:01:03,944 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 10:01:03,946 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 42 [2024-11-10 10:01:03,950 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 10:01:03,951 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2024-11-10 10:01:03,952 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 10:01:03,957 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 60 [2024-11-10 10:01:03,959 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 10:01:03,962 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 66 [2024-11-10 10:01:03,964 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 10:01:03,967 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 72 [2024-11-10 10:01:03,970 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 10:01:03,972 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 78 [2024-11-10 10:01:03,973 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 10:01:03,975 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 84 [2024-11-10 10:01:03,977 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 10:01:03,980 INFO L134 CoverageAnalysis]: Checked inductivity of 264 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 264 trivial. 0 not checked. [2024-11-10 10:01:03,981 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 10:01:03,981 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2002382628] [2024-11-10 10:01:03,982 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2002382628] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 10:01:03,982 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-10 10:01:03,982 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-10 10:01:03,983 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [707204183] [2024-11-10 10:01:03,984 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 10:01:03,987 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-10 10:01:03,988 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 10:01:04,007 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-10 10:01:04,007 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-10 10:01:04,010 INFO L87 Difference]: Start difference. First operand has 114 states, 99 states have (on average 1.4242424242424243) internal successors, (141), 100 states have internal predecessors, (141), 12 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 12 states have call predecessors, (12), 12 states have call successors, (12) Second operand has 4 states, 4 states have (on average 15.25) internal successors, (61), 4 states have internal predecessors, (61), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) [2024-11-10 10:01:04,074 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-10 10:01:04,074 INFO L93 Difference]: Finished difference Result 222 states and 338 transitions. [2024-11-10 10:01:04,075 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-10 10:01:04,076 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 15.25) internal successors, (61), 4 states have internal predecessors, (61), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) Word has length 118 [2024-11-10 10:01:04,077 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-10 10:01:04,082 INFO L225 Difference]: With dead ends: 222 [2024-11-10 10:01:04,082 INFO L226 Difference]: Without dead ends: 111 [2024-11-10 10:01:04,084 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 29 GetRequests, 27 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-10 10:01:04,086 INFO L432 NwaCegarLoop]: 151 mSDtfsCounter, 0 mSDsluCounter, 291 mSDsCounter, 0 mSdLazyCounter, 28 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 442 SdHoareTripleChecker+Invalid, 28 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 28 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-10 10:01:04,087 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 442 Invalid, 28 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 28 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-10 10:01:04,098 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 111 states. [2024-11-10 10:01:04,113 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 111 to 111. [2024-11-10 10:01:04,114 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 111 states, 97 states have (on average 1.3917525773195876) internal successors, (135), 97 states have internal predecessors, (135), 12 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 12 states have call predecessors, (12), 12 states have call successors, (12) [2024-11-10 10:01:04,115 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 111 states to 111 states and 159 transitions. [2024-11-10 10:01:04,116 INFO L78 Accepts]: Start accepts. Automaton has 111 states and 159 transitions. Word has length 118 [2024-11-10 10:01:04,117 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-10 10:01:04,117 INFO L471 AbstractCegarLoop]: Abstraction has 111 states and 159 transitions. [2024-11-10 10:01:04,117 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 15.25) internal successors, (61), 4 states have internal predecessors, (61), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) [2024-11-10 10:01:04,118 INFO L276 IsEmpty]: Start isEmpty. Operand 111 states and 159 transitions. [2024-11-10 10:01:04,120 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 121 [2024-11-10 10:01:04,121 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 10:01:04,121 INFO L215 NwaCegarLoop]: trace histogram [12, 12, 12, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-10 10:01:04,121 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-11-10 10:01:04,121 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-10 10:01:04,122 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 10:01:04,122 INFO L85 PathProgramCache]: Analyzing trace with hash -738255959, now seen corresponding path program 1 times [2024-11-10 10:01:04,122 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 10:01:04,122 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [745510425] [2024-11-10 10:01:04,122 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 10:01:04,122 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 10:01:04,172 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 10:01:04,287 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2024-11-10 10:01:04,289 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 10:01:04,290 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2024-11-10 10:01:04,291 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 10:01:04,292 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2024-11-10 10:01:04,294 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 10:01:04,295 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2024-11-10 10:01:04,297 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 10:01:04,298 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2024-11-10 10:01:04,300 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 10:01:04,301 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 42 [2024-11-10 10:01:04,302 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 10:01:04,304 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2024-11-10 10:01:04,304 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 10:01:04,306 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 60 [2024-11-10 10:01:04,308 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 10:01:04,309 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 66 [2024-11-10 10:01:04,310 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 10:01:04,311 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 72 [2024-11-10 10:01:04,313 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 10:01:04,314 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 78 [2024-11-10 10:01:04,316 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 10:01:04,317 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 84 [2024-11-10 10:01:04,318 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 10:01:04,320 INFO L134 CoverageAnalysis]: Checked inductivity of 264 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 264 trivial. 0 not checked. [2024-11-10 10:01:04,320 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 10:01:04,321 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [745510425] [2024-11-10 10:01:04,321 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [745510425] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 10:01:04,324 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-10 10:01:04,324 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-10 10:01:04,324 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1459481946] [2024-11-10 10:01:04,324 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 10:01:04,326 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-10 10:01:04,326 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 10:01:04,326 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-10 10:01:04,326 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-10 10:01:04,327 INFO L87 Difference]: Start difference. First operand 111 states and 159 transitions. Second operand has 4 states, 4 states have (on average 15.75) internal successors, (63), 4 states have internal predecessors, (63), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) [2024-11-10 10:01:04,359 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-10 10:01:04,359 INFO L93 Difference]: Finished difference Result 222 states and 319 transitions. [2024-11-10 10:01:04,360 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-10 10:01:04,360 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 15.75) internal successors, (63), 4 states have internal predecessors, (63), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) Word has length 120 [2024-11-10 10:01:04,361 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-10 10:01:04,362 INFO L225 Difference]: With dead ends: 222 [2024-11-10 10:01:04,363 INFO L226 Difference]: Without dead ends: 114 [2024-11-10 10:01:04,364 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 28 GetRequests, 26 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-10 10:01:04,366 INFO L432 NwaCegarLoop]: 150 mSDtfsCounter, 1 mSDsluCounter, 289 mSDsCounter, 0 mSdLazyCounter, 30 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 439 SdHoareTripleChecker+Invalid, 31 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 30 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-10 10:01:04,367 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1 Valid, 439 Invalid, 31 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 30 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-10 10:01:04,368 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 114 states. [2024-11-10 10:01:04,377 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 114 to 113. [2024-11-10 10:01:04,378 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 113 states, 99 states have (on average 1.3838383838383839) internal successors, (137), 99 states have internal predecessors, (137), 12 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 12 states have call predecessors, (12), 12 states have call successors, (12) [2024-11-10 10:01:04,379 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 113 states to 113 states and 161 transitions. [2024-11-10 10:01:04,380 INFO L78 Accepts]: Start accepts. Automaton has 113 states and 161 transitions. Word has length 120 [2024-11-10 10:01:04,380 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-10 10:01:04,380 INFO L471 AbstractCegarLoop]: Abstraction has 113 states and 161 transitions. [2024-11-10 10:01:04,380 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 15.75) internal successors, (63), 4 states have internal predecessors, (63), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) [2024-11-10 10:01:04,380 INFO L276 IsEmpty]: Start isEmpty. Operand 113 states and 161 transitions. [2024-11-10 10:01:04,386 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 121 [2024-11-10 10:01:04,387 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 10:01:04,387 INFO L215 NwaCegarLoop]: trace histogram [12, 12, 12, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-10 10:01:04,387 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-11-10 10:01:04,387 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-10 10:01:04,388 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 10:01:04,388 INFO L85 PathProgramCache]: Analyzing trace with hash 1004554376, now seen corresponding path program 1 times [2024-11-10 10:01:04,388 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 10:01:04,389 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [291214157] [2024-11-10 10:01:04,389 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 10:01:04,389 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 10:01:04,498 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 10:01:04,720 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2024-11-10 10:01:04,721 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 10:01:04,722 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2024-11-10 10:01:04,727 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 10:01:04,729 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2024-11-10 10:01:04,730 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 10:01:04,732 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2024-11-10 10:01:04,732 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 10:01:04,733 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2024-11-10 10:01:04,734 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 10:01:04,737 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 42 [2024-11-10 10:01:04,738 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 10:01:04,738 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2024-11-10 10:01:04,739 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 10:01:04,740 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 60 [2024-11-10 10:01:04,741 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 10:01:04,742 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 66 [2024-11-10 10:01:04,743 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 10:01:04,744 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 72 [2024-11-10 10:01:04,745 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 10:01:04,746 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 78 [2024-11-10 10:01:04,747 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 10:01:04,748 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 84 [2024-11-10 10:01:04,748 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 10:01:04,750 INFO L134 CoverageAnalysis]: Checked inductivity of 264 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 264 trivial. 0 not checked. [2024-11-10 10:01:04,751 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 10:01:04,751 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [291214157] [2024-11-10 10:01:04,751 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [291214157] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 10:01:04,752 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-10 10:01:04,752 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-10 10:01:04,752 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [710372830] [2024-11-10 10:01:04,752 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 10:01:04,752 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-10 10:01:04,752 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 10:01:04,753 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-10 10:01:04,753 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-11-10 10:01:04,753 INFO L87 Difference]: Start difference. First operand 113 states and 161 transitions. Second operand has 5 states, 5 states have (on average 12.6) internal successors, (63), 5 states have internal predecessors, (63), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) [2024-11-10 10:01:04,948 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-10 10:01:04,948 INFO L93 Difference]: Finished difference Result 240 states and 344 transitions. [2024-11-10 10:01:04,950 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-10 10:01:04,950 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 12.6) internal successors, (63), 5 states have internal predecessors, (63), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) Word has length 120 [2024-11-10 10:01:04,951 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-10 10:01:04,952 INFO L225 Difference]: With dead ends: 240 [2024-11-10 10:01:04,952 INFO L226 Difference]: Without dead ends: 130 [2024-11-10 10:01:04,953 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 30 GetRequests, 26 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2024-11-10 10:01:04,957 INFO L432 NwaCegarLoop]: 139 mSDtfsCounter, 21 mSDsluCounter, 339 mSDsCounter, 0 mSdLazyCounter, 145 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 21 SdHoareTripleChecker+Valid, 478 SdHoareTripleChecker+Invalid, 149 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 145 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-11-10 10:01:04,958 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [21 Valid, 478 Invalid, 149 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 145 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-11-10 10:01:04,958 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 130 states. [2024-11-10 10:01:04,965 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 130 to 116. [2024-11-10 10:01:04,966 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 116 states, 102 states have (on average 1.3725490196078431) internal successors, (140), 102 states have internal predecessors, (140), 12 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 12 states have call predecessors, (12), 12 states have call successors, (12) [2024-11-10 10:01:04,968 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 116 states to 116 states and 164 transitions. [2024-11-10 10:01:04,969 INFO L78 Accepts]: Start accepts. Automaton has 116 states and 164 transitions. Word has length 120 [2024-11-10 10:01:04,970 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-10 10:01:04,970 INFO L471 AbstractCegarLoop]: Abstraction has 116 states and 164 transitions. [2024-11-10 10:01:04,970 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 12.6) internal successors, (63), 5 states have internal predecessors, (63), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) [2024-11-10 10:01:04,970 INFO L276 IsEmpty]: Start isEmpty. Operand 116 states and 164 transitions. [2024-11-10 10:01:04,971 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 121 [2024-11-10 10:01:04,971 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 10:01:04,971 INFO L215 NwaCegarLoop]: trace histogram [12, 12, 12, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-10 10:01:04,971 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-11-10 10:01:04,972 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-10 10:01:04,972 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 10:01:04,972 INFO L85 PathProgramCache]: Analyzing trace with hash 1997188200, now seen corresponding path program 1 times [2024-11-10 10:01:04,972 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 10:01:04,972 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1193391930] [2024-11-10 10:01:04,972 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 10:01:04,972 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 10:01:05,049 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 10:01:05,611 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2024-11-10 10:01:05,613 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 10:01:05,615 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2024-11-10 10:01:05,616 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 10:01:05,619 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2024-11-10 10:01:05,620 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 10:01:05,623 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2024-11-10 10:01:05,624 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 10:01:05,627 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2024-11-10 10:01:05,628 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 10:01:05,631 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 42 [2024-11-10 10:01:05,633 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 10:01:05,635 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2024-11-10 10:01:05,641 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 10:01:05,646 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 60 [2024-11-10 10:01:05,647 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 10:01:05,650 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 66 [2024-11-10 10:01:05,651 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 10:01:05,654 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 72 [2024-11-10 10:01:05,656 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 10:01:05,658 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 78 [2024-11-10 10:01:05,659 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 10:01:05,663 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 84 [2024-11-10 10:01:05,667 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 10:01:05,674 INFO L134 CoverageAnalysis]: Checked inductivity of 264 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 264 trivial. 0 not checked. [2024-11-10 10:01:05,674 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 10:01:05,674 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1193391930] [2024-11-10 10:01:05,675 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1193391930] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 10:01:05,675 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-10 10:01:05,675 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-11-10 10:01:05,675 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [649137323] [2024-11-10 10:01:05,675 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 10:01:05,675 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-11-10 10:01:05,676 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 10:01:05,676 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-11-10 10:01:05,676 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=38, Unknown=0, NotChecked=0, Total=56 [2024-11-10 10:01:05,676 INFO L87 Difference]: Start difference. First operand 116 states and 164 transitions. Second operand has 8 states, 8 states have (on average 7.875) internal successors, (63), 8 states have internal predecessors, (63), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) [2024-11-10 10:01:05,963 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-10 10:01:05,963 INFO L93 Difference]: Finished difference Result 281 states and 396 transitions. [2024-11-10 10:01:05,965 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-10 10:01:05,965 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 7.875) internal successors, (63), 8 states have internal predecessors, (63), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) Word has length 120 [2024-11-10 10:01:05,966 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-10 10:01:05,967 INFO L225 Difference]: With dead ends: 281 [2024-11-10 10:01:05,967 INFO L226 Difference]: Without dead ends: 168 [2024-11-10 10:01:05,968 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 33 GetRequests, 26 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=25, Invalid=47, Unknown=0, NotChecked=0, Total=72 [2024-11-10 10:01:05,971 INFO L432 NwaCegarLoop]: 120 mSDtfsCounter, 294 mSDsluCounter, 270 mSDsCounter, 0 mSdLazyCounter, 233 mSolverCounterSat, 12 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 294 SdHoareTripleChecker+Valid, 390 SdHoareTripleChecker+Invalid, 245 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 12 IncrementalHoareTripleChecker+Valid, 233 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2024-11-10 10:01:05,971 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [294 Valid, 390 Invalid, 245 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [12 Valid, 233 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2024-11-10 10:01:05,972 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 168 states. [2024-11-10 10:01:05,981 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 168 to 131. [2024-11-10 10:01:05,984 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 131 states, 117 states have (on average 1.376068376068376) internal successors, (161), 117 states have internal predecessors, (161), 12 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 12 states have call predecessors, (12), 12 states have call successors, (12) [2024-11-10 10:01:05,985 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 131 states to 131 states and 185 transitions. [2024-11-10 10:01:05,985 INFO L78 Accepts]: Start accepts. Automaton has 131 states and 185 transitions. Word has length 120 [2024-11-10 10:01:05,985 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-10 10:01:05,985 INFO L471 AbstractCegarLoop]: Abstraction has 131 states and 185 transitions. [2024-11-10 10:01:05,985 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 7.875) internal successors, (63), 8 states have internal predecessors, (63), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) [2024-11-10 10:01:05,986 INFO L276 IsEmpty]: Start isEmpty. Operand 131 states and 185 transitions. [2024-11-10 10:01:05,989 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 122 [2024-11-10 10:01:05,989 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 10:01:05,989 INFO L215 NwaCegarLoop]: trace histogram [12, 12, 12, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-10 10:01:05,989 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2024-11-10 10:01:05,989 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-10 10:01:05,989 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 10:01:05,990 INFO L85 PathProgramCache]: Analyzing trace with hash -827768762, now seen corresponding path program 1 times [2024-11-10 10:01:05,990 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 10:01:05,990 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [605643871] [2024-11-10 10:01:05,990 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 10:01:05,990 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 10:01:06,055 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 10:01:06,297 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2024-11-10 10:01:06,298 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 10:01:06,299 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2024-11-10 10:01:06,300 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 10:01:06,302 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2024-11-10 10:01:06,303 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 10:01:06,304 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2024-11-10 10:01:06,304 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 10:01:06,305 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2024-11-10 10:01:06,306 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 10:01:06,307 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 42 [2024-11-10 10:01:06,308 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 10:01:06,309 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2024-11-10 10:01:06,310 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 10:01:06,311 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 60 [2024-11-10 10:01:06,312 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 10:01:06,313 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 66 [2024-11-10 10:01:06,314 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 10:01:06,314 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 72 [2024-11-10 10:01:06,315 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 10:01:06,317 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 78 [2024-11-10 10:01:06,318 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 10:01:06,319 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 84 [2024-11-10 10:01:06,320 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 10:01:06,322 INFO L134 CoverageAnalysis]: Checked inductivity of 264 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 264 trivial. 0 not checked. [2024-11-10 10:01:06,322 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 10:01:06,322 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [605643871] [2024-11-10 10:01:06,322 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [605643871] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 10:01:06,323 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-10 10:01:06,323 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-10 10:01:06,324 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1129149389] [2024-11-10 10:01:06,324 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 10:01:06,325 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-10 10:01:06,325 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 10:01:06,326 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-10 10:01:06,326 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-11-10 10:01:06,326 INFO L87 Difference]: Start difference. First operand 131 states and 185 transitions. Second operand has 5 states, 5 states have (on average 12.8) internal successors, (64), 5 states have internal predecessors, (64), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) [2024-11-10 10:01:06,501 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-10 10:01:06,501 INFO L93 Difference]: Finished difference Result 295 states and 416 transitions. [2024-11-10 10:01:06,501 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-10 10:01:06,501 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 12.8) internal successors, (64), 5 states have internal predecessors, (64), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) Word has length 121 [2024-11-10 10:01:06,502 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-10 10:01:06,503 INFO L225 Difference]: With dead ends: 295 [2024-11-10 10:01:06,503 INFO L226 Difference]: Without dead ends: 167 [2024-11-10 10:01:06,503 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 30 GetRequests, 26 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2024-11-10 10:01:06,504 INFO L432 NwaCegarLoop]: 137 mSDtfsCounter, 46 mSDsluCounter, 334 mSDsCounter, 0 mSdLazyCounter, 152 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 46 SdHoareTripleChecker+Valid, 471 SdHoareTripleChecker+Invalid, 156 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 152 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-11-10 10:01:06,504 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [46 Valid, 471 Invalid, 156 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 152 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-11-10 10:01:06,505 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 167 states. [2024-11-10 10:01:06,516 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 167 to 133. [2024-11-10 10:01:06,517 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 133 states, 119 states have (on average 1.3697478991596639) internal successors, (163), 119 states have internal predecessors, (163), 12 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 12 states have call predecessors, (12), 12 states have call successors, (12) [2024-11-10 10:01:06,519 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 133 states to 133 states and 187 transitions. [2024-11-10 10:01:06,519 INFO L78 Accepts]: Start accepts. Automaton has 133 states and 187 transitions. Word has length 121 [2024-11-10 10:01:06,521 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-10 10:01:06,521 INFO L471 AbstractCegarLoop]: Abstraction has 133 states and 187 transitions. [2024-11-10 10:01:06,522 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 12.8) internal successors, (64), 5 states have internal predecessors, (64), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) [2024-11-10 10:01:06,522 INFO L276 IsEmpty]: Start isEmpty. Operand 133 states and 187 transitions. [2024-11-10 10:01:06,523 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 122 [2024-11-10 10:01:06,523 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 10:01:06,524 INFO L215 NwaCegarLoop]: trace histogram [12, 12, 12, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-10 10:01:06,524 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2024-11-10 10:01:06,525 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-10 10:01:06,525 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 10:01:06,525 INFO L85 PathProgramCache]: Analyzing trace with hash 169248870, now seen corresponding path program 1 times [2024-11-10 10:01:06,525 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 10:01:06,525 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1965193329] [2024-11-10 10:01:06,525 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 10:01:06,526 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 10:01:06,566 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 10:01:06,684 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2024-11-10 10:01:06,685 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 10:01:06,686 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2024-11-10 10:01:06,687 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 10:01:06,688 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2024-11-10 10:01:06,689 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 10:01:06,690 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2024-11-10 10:01:06,691 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 10:01:06,692 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2024-11-10 10:01:06,693 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 10:01:06,693 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 42 [2024-11-10 10:01:06,694 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 10:01:06,695 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2024-11-10 10:01:06,695 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 10:01:06,696 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 60 [2024-11-10 10:01:06,697 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 10:01:06,697 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 66 [2024-11-10 10:01:06,698 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 10:01:06,701 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 72 [2024-11-10 10:01:06,702 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 10:01:06,703 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 78 [2024-11-10 10:01:06,705 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 10:01:06,706 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 84 [2024-11-10 10:01:06,707 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 10:01:06,708 INFO L134 CoverageAnalysis]: Checked inductivity of 264 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 264 trivial. 0 not checked. [2024-11-10 10:01:06,708 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 10:01:06,710 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1965193329] [2024-11-10 10:01:06,710 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1965193329] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 10:01:06,710 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-10 10:01:06,710 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-10 10:01:06,710 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1656698159] [2024-11-10 10:01:06,710 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 10:01:06,710 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-10 10:01:06,710 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 10:01:06,711 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-10 10:01:06,711 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-11-10 10:01:06,711 INFO L87 Difference]: Start difference. First operand 133 states and 187 transitions. Second operand has 5 states, 5 states have (on average 12.8) internal successors, (64), 5 states have internal predecessors, (64), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) [2024-11-10 10:01:06,743 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-10 10:01:06,743 INFO L93 Difference]: Finished difference Result 266 states and 375 transitions. [2024-11-10 10:01:06,744 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-10 10:01:06,744 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 12.8) internal successors, (64), 5 states have internal predecessors, (64), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) Word has length 121 [2024-11-10 10:01:06,744 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-10 10:01:06,745 INFO L225 Difference]: With dead ends: 266 [2024-11-10 10:01:06,745 INFO L226 Difference]: Without dead ends: 136 [2024-11-10 10:01:06,746 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 30 GetRequests, 27 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-11-10 10:01:06,747 INFO L432 NwaCegarLoop]: 150 mSDtfsCounter, 0 mSDsluCounter, 433 mSDsCounter, 0 mSdLazyCounter, 44 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 583 SdHoareTripleChecker+Invalid, 44 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 44 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-10 10:01:06,748 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 583 Invalid, 44 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 44 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-10 10:01:06,749 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 136 states. [2024-11-10 10:01:06,758 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 136 to 136. [2024-11-10 10:01:06,758 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 136 states, 122 states have (on average 1.360655737704918) internal successors, (166), 122 states have internal predecessors, (166), 12 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 12 states have call predecessors, (12), 12 states have call successors, (12) [2024-11-10 10:01:06,759 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 136 states to 136 states and 190 transitions. [2024-11-10 10:01:06,759 INFO L78 Accepts]: Start accepts. Automaton has 136 states and 190 transitions. Word has length 121 [2024-11-10 10:01:06,759 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-10 10:01:06,760 INFO L471 AbstractCegarLoop]: Abstraction has 136 states and 190 transitions. [2024-11-10 10:01:06,760 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 12.8) internal successors, (64), 5 states have internal predecessors, (64), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) [2024-11-10 10:01:06,760 INFO L276 IsEmpty]: Start isEmpty. Operand 136 states and 190 transitions. [2024-11-10 10:01:06,760 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 123 [2024-11-10 10:01:06,761 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 10:01:06,761 INFO L215 NwaCegarLoop]: trace histogram [12, 12, 12, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-10 10:01:06,761 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2024-11-10 10:01:06,761 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-10 10:01:06,761 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 10:01:06,761 INFO L85 PathProgramCache]: Analyzing trace with hash 1361998438, now seen corresponding path program 1 times [2024-11-10 10:01:06,761 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 10:01:06,761 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1066448268] [2024-11-10 10:01:06,761 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 10:01:06,761 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 10:01:06,876 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 10:01:06,983 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2024-11-10 10:01:06,984 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 10:01:06,985 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2024-11-10 10:01:06,985 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 10:01:06,986 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2024-11-10 10:01:06,987 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 10:01:06,987 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2024-11-10 10:01:06,988 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 10:01:06,988 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2024-11-10 10:01:06,989 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 10:01:06,989 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 42 [2024-11-10 10:01:06,990 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 10:01:06,991 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2024-11-10 10:01:06,991 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 10:01:06,992 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 60 [2024-11-10 10:01:06,992 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 10:01:06,993 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 66 [2024-11-10 10:01:06,993 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 10:01:06,994 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 72 [2024-11-10 10:01:06,994 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 10:01:06,995 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 78 [2024-11-10 10:01:06,996 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 10:01:06,996 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 84 [2024-11-10 10:01:06,997 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 10:01:06,998 INFO L134 CoverageAnalysis]: Checked inductivity of 264 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 264 trivial. 0 not checked. [2024-11-10 10:01:06,998 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 10:01:06,998 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1066448268] [2024-11-10 10:01:06,998 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1066448268] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 10:01:06,998 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-10 10:01:06,998 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-10 10:01:06,998 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [90036995] [2024-11-10 10:01:06,998 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 10:01:06,999 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-10 10:01:06,999 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 10:01:06,999 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-10 10:01:06,999 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-10 10:01:06,999 INFO L87 Difference]: Start difference. First operand 136 states and 190 transitions. Second operand has 4 states, 4 states have (on average 16.25) internal successors, (65), 4 states have internal predecessors, (65), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) [2024-11-10 10:01:07,180 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-10 10:01:07,182 INFO L93 Difference]: Finished difference Result 269 states and 377 transitions. [2024-11-10 10:01:07,183 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-10 10:01:07,183 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 16.25) internal successors, (65), 4 states have internal predecessors, (65), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) Word has length 122 [2024-11-10 10:01:07,184 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-10 10:01:07,185 INFO L225 Difference]: With dead ends: 269 [2024-11-10 10:01:07,185 INFO L226 Difference]: Without dead ends: 136 [2024-11-10 10:01:07,186 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 28 GetRequests, 26 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-10 10:01:07,187 INFO L432 NwaCegarLoop]: 149 mSDtfsCounter, 1 mSDsluCounter, 206 mSDsCounter, 0 mSdLazyCounter, 109 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 355 SdHoareTripleChecker+Invalid, 110 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 109 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-11-10 10:01:07,189 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1 Valid, 355 Invalid, 110 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 109 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-11-10 10:01:07,189 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 136 states. [2024-11-10 10:01:07,193 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 136 to 136. [2024-11-10 10:01:07,194 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 136 states, 122 states have (on average 1.3442622950819672) internal successors, (164), 122 states have internal predecessors, (164), 12 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 12 states have call predecessors, (12), 12 states have call successors, (12) [2024-11-10 10:01:07,194 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 136 states to 136 states and 188 transitions. [2024-11-10 10:01:07,194 INFO L78 Accepts]: Start accepts. Automaton has 136 states and 188 transitions. Word has length 122 [2024-11-10 10:01:07,195 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-10 10:01:07,195 INFO L471 AbstractCegarLoop]: Abstraction has 136 states and 188 transitions. [2024-11-10 10:01:07,195 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 16.25) internal successors, (65), 4 states have internal predecessors, (65), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) [2024-11-10 10:01:07,195 INFO L276 IsEmpty]: Start isEmpty. Operand 136 states and 188 transitions. [2024-11-10 10:01:07,195 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 125 [2024-11-10 10:01:07,196 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 10:01:07,196 INFO L215 NwaCegarLoop]: trace histogram [12, 12, 12, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-10 10:01:07,196 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2024-11-10 10:01:07,196 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-10 10:01:07,197 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 10:01:07,197 INFO L85 PathProgramCache]: Analyzing trace with hash 872136395, now seen corresponding path program 1 times [2024-11-10 10:01:07,197 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 10:01:07,197 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [31723471] [2024-11-10 10:01:07,197 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 10:01:07,198 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 10:01:07,268 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 10:01:07,373 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2024-11-10 10:01:07,374 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 10:01:07,375 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2024-11-10 10:01:07,375 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 10:01:07,387 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2024-11-10 10:01:07,388 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 10:01:07,389 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2024-11-10 10:01:07,390 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 10:01:07,391 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2024-11-10 10:01:07,392 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 10:01:07,393 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 42 [2024-11-10 10:01:07,393 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 10:01:07,394 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2024-11-10 10:01:07,394 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 10:01:07,395 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 60 [2024-11-10 10:01:07,396 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 10:01:07,396 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 66 [2024-11-10 10:01:07,397 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 10:01:07,397 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 72 [2024-11-10 10:01:07,398 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 10:01:07,399 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 78 [2024-11-10 10:01:07,399 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 10:01:07,400 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 84 [2024-11-10 10:01:07,401 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 10:01:07,401 INFO L134 CoverageAnalysis]: Checked inductivity of 264 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 264 trivial. 0 not checked. [2024-11-10 10:01:07,402 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 10:01:07,402 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [31723471] [2024-11-10 10:01:07,402 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [31723471] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 10:01:07,402 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-10 10:01:07,402 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-10 10:01:07,402 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [435828547] [2024-11-10 10:01:07,402 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 10:01:07,402 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-10 10:01:07,403 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 10:01:07,403 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-10 10:01:07,403 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-10 10:01:07,404 INFO L87 Difference]: Start difference. First operand 136 states and 188 transitions. Second operand has 3 states, 3 states have (on average 22.333333333333332) internal successors, (67), 3 states have internal predecessors, (67), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) [2024-11-10 10:01:07,419 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-10 10:01:07,420 INFO L93 Difference]: Finished difference Result 269 states and 373 transitions. [2024-11-10 10:01:07,421 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-10 10:01:07,421 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 22.333333333333332) internal successors, (67), 3 states have internal predecessors, (67), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) Word has length 124 [2024-11-10 10:01:07,421 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-10 10:01:07,422 INFO L225 Difference]: With dead ends: 269 [2024-11-10 10:01:07,422 INFO L226 Difference]: Without dead ends: 136 [2024-11-10 10:01:07,422 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 27 GetRequests, 26 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-10 10:01:07,423 INFO L432 NwaCegarLoop]: 150 mSDtfsCounter, 0 mSDsluCounter, 147 mSDsCounter, 0 mSdLazyCounter, 12 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 297 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-11-10 10:01:07,424 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 297 Invalid, 12 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 12 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-10 10:01:07,425 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 136 states. [2024-11-10 10:01:07,430 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 136 to 136. [2024-11-10 10:01:07,431 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 136 states, 122 states have (on average 1.3278688524590163) internal successors, (162), 122 states have internal predecessors, (162), 12 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 12 states have call predecessors, (12), 12 states have call successors, (12) [2024-11-10 10:01:07,431 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 136 states to 136 states and 186 transitions. [2024-11-10 10:01:07,432 INFO L78 Accepts]: Start accepts. Automaton has 136 states and 186 transitions. Word has length 124 [2024-11-10 10:01:07,432 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-10 10:01:07,433 INFO L471 AbstractCegarLoop]: Abstraction has 136 states and 186 transitions. [2024-11-10 10:01:07,433 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 22.333333333333332) internal successors, (67), 3 states have internal predecessors, (67), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) [2024-11-10 10:01:07,433 INFO L276 IsEmpty]: Start isEmpty. Operand 136 states and 186 transitions. [2024-11-10 10:01:07,434 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 125 [2024-11-10 10:01:07,434 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 10:01:07,434 INFO L215 NwaCegarLoop]: trace histogram [12, 12, 12, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-10 10:01:07,434 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2024-11-10 10:01:07,435 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-10 10:01:07,435 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 10:01:07,435 INFO L85 PathProgramCache]: Analyzing trace with hash 463312170, now seen corresponding path program 1 times [2024-11-10 10:01:07,435 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 10:01:07,435 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1931571993] [2024-11-10 10:01:07,435 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 10:01:07,435 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 10:01:07,565 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 10:01:09,553 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2024-11-10 10:01:09,555 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 10:01:09,559 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2024-11-10 10:01:09,560 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 10:01:09,565 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2024-11-10 10:01:09,566 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 10:01:09,570 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2024-11-10 10:01:09,572 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 10:01:09,576 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2024-11-10 10:01:09,577 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 10:01:09,581 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 42 [2024-11-10 10:01:09,582 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 10:01:09,586 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2024-11-10 10:01:09,587 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 10:01:09,591 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 60 [2024-11-10 10:01:09,592 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 10:01:09,598 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 66 [2024-11-10 10:01:09,600 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 10:01:09,604 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 72 [2024-11-10 10:01:09,605 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 10:01:09,610 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 78 [2024-11-10 10:01:09,612 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 10:01:09,618 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 84 [2024-11-10 10:01:09,619 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 10:01:09,624 INFO L134 CoverageAnalysis]: Checked inductivity of 264 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 264 trivial. 0 not checked. [2024-11-10 10:01:09,624 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 10:01:09,624 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1931571993] [2024-11-10 10:01:09,624 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1931571993] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 10:01:09,624 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-10 10:01:09,624 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [15] imperfect sequences [] total 15 [2024-11-10 10:01:09,624 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1359721556] [2024-11-10 10:01:09,624 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 10:01:09,625 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 15 states [2024-11-10 10:01:09,625 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 10:01:09,625 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2024-11-10 10:01:09,625 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=37, Invalid=173, Unknown=0, NotChecked=0, Total=210 [2024-11-10 10:01:09,625 INFO L87 Difference]: Start difference. First operand 136 states and 186 transitions. Second operand has 15 states, 15 states have (on average 4.466666666666667) internal successors, (67), 15 states have internal predecessors, (67), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) [2024-11-10 10:01:10,769 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-10 10:01:10,769 INFO L93 Difference]: Finished difference Result 337 states and 459 transitions. [2024-11-10 10:01:10,770 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2024-11-10 10:01:10,770 INFO L78 Accepts]: Start accepts. Automaton has has 15 states, 15 states have (on average 4.466666666666667) internal successors, (67), 15 states have internal predecessors, (67), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) Word has length 124 [2024-11-10 10:01:10,770 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-10 10:01:10,771 INFO L225 Difference]: With dead ends: 337 [2024-11-10 10:01:10,771 INFO L226 Difference]: Without dead ends: 204 [2024-11-10 10:01:10,771 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 47 GetRequests, 26 SyntacticMatches, 0 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 88 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=107, Invalid=399, Unknown=0, NotChecked=0, Total=506 [2024-11-10 10:01:10,772 INFO L432 NwaCegarLoop]: 138 mSDtfsCounter, 420 mSDsluCounter, 646 mSDsCounter, 0 mSdLazyCounter, 605 mSolverCounterSat, 16 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 420 SdHoareTripleChecker+Valid, 784 SdHoareTripleChecker+Invalid, 621 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 16 IncrementalHoareTripleChecker+Valid, 605 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2024-11-10 10:01:10,772 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [420 Valid, 784 Invalid, 621 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [16 Valid, 605 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2024-11-10 10:01:10,773 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 204 states. [2024-11-10 10:01:10,784 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 204 to 159. [2024-11-10 10:01:10,784 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 159 states, 145 states have (on average 1.3310344827586207) internal successors, (193), 145 states have internal predecessors, (193), 12 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 12 states have call predecessors, (12), 12 states have call successors, (12) [2024-11-10 10:01:10,785 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 159 states to 159 states and 217 transitions. [2024-11-10 10:01:10,786 INFO L78 Accepts]: Start accepts. Automaton has 159 states and 217 transitions. Word has length 124 [2024-11-10 10:01:10,786 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-10 10:01:10,786 INFO L471 AbstractCegarLoop]: Abstraction has 159 states and 217 transitions. [2024-11-10 10:01:10,786 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 15 states, 15 states have (on average 4.466666666666667) internal successors, (67), 15 states have internal predecessors, (67), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) [2024-11-10 10:01:10,787 INFO L276 IsEmpty]: Start isEmpty. Operand 159 states and 217 transitions. [2024-11-10 10:01:10,787 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 125 [2024-11-10 10:01:10,787 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 10:01:10,788 INFO L215 NwaCegarLoop]: trace histogram [12, 12, 12, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-10 10:01:10,788 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2024-11-10 10:01:10,788 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-10 10:01:10,788 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 10:01:10,789 INFO L85 PathProgramCache]: Analyzing trace with hash 1816621867, now seen corresponding path program 1 times [2024-11-10 10:01:10,789 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 10:01:10,789 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [43940837] [2024-11-10 10:01:10,789 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 10:01:10,789 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 10:01:10,851 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 10:01:11,676 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2024-11-10 10:01:11,678 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 10:01:11,681 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2024-11-10 10:01:11,683 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 10:01:11,689 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2024-11-10 10:01:11,690 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 10:01:11,697 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2024-11-10 10:01:11,698 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 10:01:11,708 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2024-11-10 10:01:11,709 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 10:01:11,712 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 42 [2024-11-10 10:01:11,713 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 10:01:11,718 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2024-11-10 10:01:11,719 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 10:01:11,722 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 60 [2024-11-10 10:01:11,723 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 10:01:11,727 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 66 [2024-11-10 10:01:11,728 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 10:01:11,730 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 72 [2024-11-10 10:01:11,732 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 10:01:11,736 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 78 [2024-11-10 10:01:11,737 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 10:01:11,740 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 84 [2024-11-10 10:01:11,741 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 10:01:11,745 INFO L134 CoverageAnalysis]: Checked inductivity of 264 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 264 trivial. 0 not checked. [2024-11-10 10:01:11,745 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 10:01:11,745 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [43940837] [2024-11-10 10:01:11,745 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [43940837] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 10:01:11,745 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-10 10:01:11,746 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2024-11-10 10:01:11,746 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1341272722] [2024-11-10 10:01:11,746 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 10:01:11,746 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2024-11-10 10:01:11,746 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 10:01:11,747 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2024-11-10 10:01:11,747 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=40, Invalid=116, Unknown=0, NotChecked=0, Total=156 [2024-11-10 10:01:11,747 INFO L87 Difference]: Start difference. First operand 159 states and 217 transitions. Second operand has 13 states, 13 states have (on average 5.153846153846154) internal successors, (67), 13 states have internal predecessors, (67), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) [2024-11-10 10:01:12,484 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-10 10:01:12,484 INFO L93 Difference]: Finished difference Result 357 states and 485 transitions. [2024-11-10 10:01:12,484 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-11-10 10:01:12,485 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 13 states have (on average 5.153846153846154) internal successors, (67), 13 states have internal predecessors, (67), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) Word has length 124 [2024-11-10 10:01:12,485 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-10 10:01:12,486 INFO L225 Difference]: With dead ends: 357 [2024-11-10 10:01:12,486 INFO L226 Difference]: Without dead ends: 201 [2024-11-10 10:01:12,486 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 38 GetRequests, 25 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 36 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=60, Invalid=150, Unknown=0, NotChecked=0, Total=210 [2024-11-10 10:01:12,487 INFO L432 NwaCegarLoop]: 164 mSDtfsCounter, 260 mSDsluCounter, 722 mSDsCounter, 0 mSdLazyCounter, 665 mSolverCounterSat, 9 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 260 SdHoareTripleChecker+Valid, 886 SdHoareTripleChecker+Invalid, 674 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 9 IncrementalHoareTripleChecker+Valid, 665 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2024-11-10 10:01:12,488 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [260 Valid, 886 Invalid, 674 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [9 Valid, 665 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2024-11-10 10:01:12,488 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 201 states. [2024-11-10 10:01:12,496 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 201 to 159. [2024-11-10 10:01:12,496 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 159 states, 145 states have (on average 1.3241379310344827) internal successors, (192), 145 states have internal predecessors, (192), 12 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 12 states have call predecessors, (12), 12 states have call successors, (12) [2024-11-10 10:01:12,497 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 159 states to 159 states and 216 transitions. [2024-11-10 10:01:12,497 INFO L78 Accepts]: Start accepts. Automaton has 159 states and 216 transitions. Word has length 124 [2024-11-10 10:01:12,497 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-10 10:01:12,497 INFO L471 AbstractCegarLoop]: Abstraction has 159 states and 216 transitions. [2024-11-10 10:01:12,498 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 13 states have (on average 5.153846153846154) internal successors, (67), 13 states have internal predecessors, (67), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) [2024-11-10 10:01:12,498 INFO L276 IsEmpty]: Start isEmpty. Operand 159 states and 216 transitions. [2024-11-10 10:01:12,499 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 125 [2024-11-10 10:01:12,499 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 10:01:12,499 INFO L215 NwaCegarLoop]: trace histogram [12, 12, 12, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-10 10:01:12,499 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2024-11-10 10:01:12,499 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-10 10:01:12,500 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 10:01:12,500 INFO L85 PathProgramCache]: Analyzing trace with hash -1546791671, now seen corresponding path program 1 times [2024-11-10 10:01:12,500 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 10:01:12,500 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1107078308] [2024-11-10 10:01:12,500 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 10:01:12,500 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 10:01:12,570 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 10:01:13,217 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2024-11-10 10:01:13,219 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 10:01:13,222 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2024-11-10 10:01:13,223 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 10:01:13,232 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2024-11-10 10:01:13,234 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 10:01:13,241 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2024-11-10 10:01:13,242 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 10:01:13,247 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2024-11-10 10:01:13,248 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 10:01:13,252 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 42 [2024-11-10 10:01:13,253 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 10:01:13,257 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2024-11-10 10:01:13,258 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 10:01:13,261 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 60 [2024-11-10 10:01:13,263 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 10:01:13,268 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 66 [2024-11-10 10:01:13,269 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 10:01:13,272 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 72 [2024-11-10 10:01:13,274 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 10:01:13,278 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 78 [2024-11-10 10:01:13,279 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 10:01:13,284 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 84 [2024-11-10 10:01:13,285 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 10:01:13,289 INFO L134 CoverageAnalysis]: Checked inductivity of 264 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 264 trivial. 0 not checked. [2024-11-10 10:01:13,290 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 10:01:13,290 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1107078308] [2024-11-10 10:01:13,290 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1107078308] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 10:01:13,290 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-10 10:01:13,290 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2024-11-10 10:01:13,290 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1454338580] [2024-11-10 10:01:13,290 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 10:01:13,291 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-11-10 10:01:13,291 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 10:01:13,292 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-11-10 10:01:13,292 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=29, Invalid=61, Unknown=0, NotChecked=0, Total=90 [2024-11-10 10:01:13,293 INFO L87 Difference]: Start difference. First operand 159 states and 216 transitions. Second operand has 10 states, 10 states have (on average 6.7) internal successors, (67), 10 states have internal predecessors, (67), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) [2024-11-10 10:01:13,650 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-10 10:01:13,650 INFO L93 Difference]: Finished difference Result 357 states and 483 transitions. [2024-11-10 10:01:13,652 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-10 10:01:13,652 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 6.7) internal successors, (67), 10 states have internal predecessors, (67), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) Word has length 124 [2024-11-10 10:01:13,652 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-10 10:01:13,653 INFO L225 Difference]: With dead ends: 357 [2024-11-10 10:01:13,653 INFO L226 Difference]: Without dead ends: 201 [2024-11-10 10:01:13,654 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 34 GetRequests, 25 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 14 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=38, Invalid=72, Unknown=0, NotChecked=0, Total=110 [2024-11-10 10:01:13,654 INFO L432 NwaCegarLoop]: 145 mSDtfsCounter, 248 mSDsluCounter, 389 mSDsCounter, 0 mSdLazyCounter, 377 mSolverCounterSat, 11 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 248 SdHoareTripleChecker+Valid, 534 SdHoareTripleChecker+Invalid, 388 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 11 IncrementalHoareTripleChecker+Valid, 377 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2024-11-10 10:01:13,654 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [248 Valid, 534 Invalid, 388 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [11 Valid, 377 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2024-11-10 10:01:13,655 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 201 states. [2024-11-10 10:01:13,668 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 201 to 159. [2024-11-10 10:01:13,668 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 159 states, 145 states have (on average 1.3172413793103448) internal successors, (191), 145 states have internal predecessors, (191), 12 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 12 states have call predecessors, (12), 12 states have call successors, (12) [2024-11-10 10:01:13,669 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 159 states to 159 states and 215 transitions. [2024-11-10 10:01:13,670 INFO L78 Accepts]: Start accepts. Automaton has 159 states and 215 transitions. Word has length 124 [2024-11-10 10:01:13,670 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-10 10:01:13,670 INFO L471 AbstractCegarLoop]: Abstraction has 159 states and 215 transitions. [2024-11-10 10:01:13,670 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 6.7) internal successors, (67), 10 states have internal predecessors, (67), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) [2024-11-10 10:01:13,670 INFO L276 IsEmpty]: Start isEmpty. Operand 159 states and 215 transitions. [2024-11-10 10:01:13,671 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 125 [2024-11-10 10:01:13,671 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 10:01:13,672 INFO L215 NwaCegarLoop]: trace histogram [12, 12, 12, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-10 10:01:13,672 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2024-11-10 10:01:13,672 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-10 10:01:13,672 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 10:01:13,672 INFO L85 PathProgramCache]: Analyzing trace with hash -193481974, now seen corresponding path program 1 times [2024-11-10 10:01:13,672 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 10:01:13,673 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1528988778] [2024-11-10 10:01:13,673 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 10:01:13,673 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 10:01:13,758 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 10:01:14,820 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2024-11-10 10:01:14,822 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 10:01:14,825 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2024-11-10 10:01:14,826 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 10:01:14,829 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2024-11-10 10:01:14,830 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 10:01:14,833 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2024-11-10 10:01:14,834 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 10:01:14,838 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2024-11-10 10:01:14,839 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 10:01:14,842 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 42 [2024-11-10 10:01:14,843 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 10:01:14,846 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2024-11-10 10:01:14,847 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 10:01:14,850 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 60 [2024-11-10 10:01:14,851 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 10:01:14,855 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 66 [2024-11-10 10:01:14,859 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 10:01:14,862 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 72 [2024-11-10 10:01:14,863 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 10:01:14,866 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 78 [2024-11-10 10:01:14,867 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 10:01:14,870 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 84 [2024-11-10 10:01:14,870 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 10:01:14,872 INFO L134 CoverageAnalysis]: Checked inductivity of 264 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 264 trivial. 0 not checked. [2024-11-10 10:01:14,873 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 10:01:14,873 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1528988778] [2024-11-10 10:01:14,873 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1528988778] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 10:01:14,873 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-10 10:01:14,873 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2024-11-10 10:01:14,873 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1925113749] [2024-11-10 10:01:14,873 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 10:01:14,873 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2024-11-10 10:01:14,874 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 10:01:14,874 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2024-11-10 10:01:14,874 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=31, Invalid=79, Unknown=0, NotChecked=0, Total=110 [2024-11-10 10:01:14,874 INFO L87 Difference]: Start difference. First operand 159 states and 215 transitions. Second operand has 11 states, 10 states have (on average 6.7) internal successors, (67), 11 states have internal predecessors, (67), 4 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 3 states have call predecessors, (12), 4 states have call successors, (12) [2024-11-10 10:01:15,543 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-10 10:01:15,544 INFO L93 Difference]: Finished difference Result 315 states and 427 transitions. [2024-11-10 10:01:15,544 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-11-10 10:01:15,544 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 10 states have (on average 6.7) internal successors, (67), 11 states have internal predecessors, (67), 4 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 3 states have call predecessors, (12), 4 states have call successors, (12) Word has length 124 [2024-11-10 10:01:15,544 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-10 10:01:15,545 INFO L225 Difference]: With dead ends: 315 [2024-11-10 10:01:15,545 INFO L226 Difference]: Without dead ends: 159 [2024-11-10 10:01:15,545 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 45 GetRequests, 31 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 34 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=69, Invalid=171, Unknown=0, NotChecked=0, Total=240 [2024-11-10 10:01:15,546 INFO L432 NwaCegarLoop]: 104 mSDtfsCounter, 339 mSDsluCounter, 385 mSDsCounter, 0 mSdLazyCounter, 531 mSolverCounterSat, 27 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 340 SdHoareTripleChecker+Valid, 489 SdHoareTripleChecker+Invalid, 558 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 27 IncrementalHoareTripleChecker+Valid, 531 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2024-11-10 10:01:15,546 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [340 Valid, 489 Invalid, 558 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [27 Valid, 531 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2024-11-10 10:01:15,546 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 159 states. [2024-11-10 10:01:15,555 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 159 to 158. [2024-11-10 10:01:15,556 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 158 states, 144 states have (on average 1.3125) internal successors, (189), 144 states have internal predecessors, (189), 12 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 12 states have call predecessors, (12), 12 states have call successors, (12) [2024-11-10 10:01:15,556 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 158 states to 158 states and 213 transitions. [2024-11-10 10:01:15,557 INFO L78 Accepts]: Start accepts. Automaton has 158 states and 213 transitions. Word has length 124 [2024-11-10 10:01:15,557 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-10 10:01:15,557 INFO L471 AbstractCegarLoop]: Abstraction has 158 states and 213 transitions. [2024-11-10 10:01:15,557 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 10 states have (on average 6.7) internal successors, (67), 11 states have internal predecessors, (67), 4 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 3 states have call predecessors, (12), 4 states have call successors, (12) [2024-11-10 10:01:15,557 INFO L276 IsEmpty]: Start isEmpty. Operand 158 states and 213 transitions. [2024-11-10 10:01:15,558 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 125 [2024-11-10 10:01:15,558 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 10:01:15,558 INFO L215 NwaCegarLoop]: trace histogram [12, 12, 12, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-10 10:01:15,558 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2024-11-10 10:01:15,558 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-10 10:01:15,559 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 10:01:15,559 INFO L85 PathProgramCache]: Analyzing trace with hash -448218519, now seen corresponding path program 1 times [2024-11-10 10:01:15,559 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 10:01:15,559 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1596945480] [2024-11-10 10:01:15,559 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 10:01:15,559 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 10:01:15,652 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 10:01:18,688 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2024-11-10 10:01:18,690 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 10:01:18,698 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2024-11-10 10:01:18,700 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 10:01:18,708 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2024-11-10 10:01:18,709 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 10:01:18,717 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2024-11-10 10:01:18,718 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 10:01:18,726 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2024-11-10 10:01:18,726 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 10:01:18,733 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 42 [2024-11-10 10:01:18,734 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 10:01:18,743 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2024-11-10 10:01:18,744 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 10:01:18,751 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 60 [2024-11-10 10:01:18,753 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 10:01:18,759 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 66 [2024-11-10 10:01:18,761 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 10:01:18,767 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 72 [2024-11-10 10:01:18,768 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 10:01:18,775 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 78 [2024-11-10 10:01:18,776 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 10:01:18,783 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 84 [2024-11-10 10:01:18,784 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 10:01:18,789 INFO L134 CoverageAnalysis]: Checked inductivity of 264 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 264 trivial. 0 not checked. [2024-11-10 10:01:18,790 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 10:01:18,790 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1596945480] [2024-11-10 10:01:18,790 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1596945480] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 10:01:18,790 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-10 10:01:18,790 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [19] imperfect sequences [] total 19 [2024-11-10 10:01:18,790 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [312322749] [2024-11-10 10:01:18,790 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 10:01:18,791 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 19 states [2024-11-10 10:01:18,791 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 10:01:18,791 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2024-11-10 10:01:18,792 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=54, Invalid=288, Unknown=0, NotChecked=0, Total=342 [2024-11-10 10:01:18,792 INFO L87 Difference]: Start difference. First operand 158 states and 213 transitions. Second operand has 19 states, 18 states have (on average 3.7222222222222223) internal successors, (67), 19 states have internal predecessors, (67), 4 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 3 states have call predecessors, (12), 4 states have call successors, (12) [2024-11-10 10:01:23,238 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-10 10:01:23,238 INFO L93 Difference]: Finished difference Result 412 states and 551 transitions. [2024-11-10 10:01:23,239 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2024-11-10 10:01:23,239 INFO L78 Accepts]: Start accepts. Automaton has has 19 states, 18 states have (on average 3.7222222222222223) internal successors, (67), 19 states have internal predecessors, (67), 4 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 3 states have call predecessors, (12), 4 states have call successors, (12) Word has length 124 [2024-11-10 10:01:23,239 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-10 10:01:23,240 INFO L225 Difference]: With dead ends: 412 [2024-11-10 10:01:23,240 INFO L226 Difference]: Without dead ends: 257 [2024-11-10 10:01:23,241 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 62 GetRequests, 31 SyntacticMatches, 0 SemanticMatches, 31 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 192 ImplicationChecksByTransitivity, 2.7s TimeCoverageRelationStatistics Valid=198, Invalid=858, Unknown=0, NotChecked=0, Total=1056 [2024-11-10 10:01:23,242 INFO L432 NwaCegarLoop]: 129 mSDtfsCounter, 533 mSDsluCounter, 968 mSDsCounter, 0 mSdLazyCounter, 1256 mSolverCounterSat, 26 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 534 SdHoareTripleChecker+Valid, 1097 SdHoareTripleChecker+Invalid, 1282 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 26 IncrementalHoareTripleChecker+Valid, 1256 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.3s IncrementalHoareTripleChecker+Time [2024-11-10 10:01:23,242 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [534 Valid, 1097 Invalid, 1282 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [26 Valid, 1256 Invalid, 0 Unknown, 0 Unchecked, 2.3s Time] [2024-11-10 10:01:23,242 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 257 states. [2024-11-10 10:01:23,250 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 257 to 170. [2024-11-10 10:01:23,250 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 170 states, 156 states have (on average 1.314102564102564) internal successors, (205), 156 states have internal predecessors, (205), 12 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 12 states have call predecessors, (12), 12 states have call successors, (12) [2024-11-10 10:01:23,251 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 170 states to 170 states and 229 transitions. [2024-11-10 10:01:23,251 INFO L78 Accepts]: Start accepts. Automaton has 170 states and 229 transitions. Word has length 124 [2024-11-10 10:01:23,251 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-10 10:01:23,251 INFO L471 AbstractCegarLoop]: Abstraction has 170 states and 229 transitions. [2024-11-10 10:01:23,252 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 19 states, 18 states have (on average 3.7222222222222223) internal successors, (67), 19 states have internal predecessors, (67), 4 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 3 states have call predecessors, (12), 4 states have call successors, (12) [2024-11-10 10:01:23,252 INFO L276 IsEmpty]: Start isEmpty. Operand 170 states and 229 transitions. [2024-11-10 10:01:23,252 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 126 [2024-11-10 10:01:23,252 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 10:01:23,252 INFO L215 NwaCegarLoop]: trace histogram [12, 12, 12, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-10 10:01:23,253 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2024-11-10 10:01:23,253 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-10 10:01:23,253 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 10:01:23,253 INFO L85 PathProgramCache]: Analyzing trace with hash 1128375058, now seen corresponding path program 1 times [2024-11-10 10:01:23,253 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 10:01:23,253 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [838999171] [2024-11-10 10:01:23,253 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 10:01:23,253 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 10:01:23,304 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 10:01:23,489 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2024-11-10 10:01:23,490 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 10:01:23,491 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2024-11-10 10:01:23,492 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 10:01:23,492 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2024-11-10 10:01:23,493 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 10:01:23,494 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2024-11-10 10:01:23,494 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 10:01:23,495 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2024-11-10 10:01:23,496 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 10:01:23,496 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 42 [2024-11-10 10:01:23,497 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 10:01:23,497 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2024-11-10 10:01:23,497 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 10:01:23,498 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 60 [2024-11-10 10:01:23,498 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 10:01:23,499 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 66 [2024-11-10 10:01:23,499 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 10:01:23,500 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 72 [2024-11-10 10:01:23,500 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 10:01:23,501 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 78 [2024-11-10 10:01:23,501 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 10:01:23,502 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 84 [2024-11-10 10:01:23,502 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 10:01:23,503 INFO L134 CoverageAnalysis]: Checked inductivity of 264 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 264 trivial. 0 not checked. [2024-11-10 10:01:23,503 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 10:01:23,503 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [838999171] [2024-11-10 10:01:23,503 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [838999171] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 10:01:23,503 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-10 10:01:23,503 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-11-10 10:01:23,503 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [21996619] [2024-11-10 10:01:23,503 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 10:01:23,504 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-10 10:01:23,504 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 10:01:23,504 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-10 10:01:23,504 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2024-11-10 10:01:23,504 INFO L87 Difference]: Start difference. First operand 170 states and 229 transitions. Second operand has 6 states, 6 states have (on average 11.333333333333334) internal successors, (68), 6 states have internal predecessors, (68), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) [2024-11-10 10:01:23,816 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-10 10:01:23,817 INFO L93 Difference]: Finished difference Result 354 states and 478 transitions. [2024-11-10 10:01:23,817 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-10 10:01:23,817 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 11.333333333333334) internal successors, (68), 6 states have internal predecessors, (68), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) Word has length 125 [2024-11-10 10:01:23,818 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-10 10:01:23,818 INFO L225 Difference]: With dead ends: 354 [2024-11-10 10:01:23,818 INFO L226 Difference]: Without dead ends: 187 [2024-11-10 10:01:23,819 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 33 GetRequests, 27 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=19, Invalid=37, Unknown=0, NotChecked=0, Total=56 [2024-11-10 10:01:23,819 INFO L432 NwaCegarLoop]: 149 mSDtfsCounter, 12 mSDsluCounter, 451 mSDsCounter, 0 mSdLazyCounter, 204 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 12 SdHoareTripleChecker+Valid, 600 SdHoareTripleChecker+Invalid, 205 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 204 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2024-11-10 10:01:23,819 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [12 Valid, 600 Invalid, 205 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 204 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2024-11-10 10:01:23,820 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 187 states. [2024-11-10 10:01:23,827 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 187 to 174. [2024-11-10 10:01:23,827 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 174 states, 160 states have (on average 1.3) internal successors, (208), 160 states have internal predecessors, (208), 12 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 12 states have call predecessors, (12), 12 states have call successors, (12) [2024-11-10 10:01:23,828 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 174 states to 174 states and 232 transitions. [2024-11-10 10:01:23,828 INFO L78 Accepts]: Start accepts. Automaton has 174 states and 232 transitions. Word has length 125 [2024-11-10 10:01:23,829 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-10 10:01:23,829 INFO L471 AbstractCegarLoop]: Abstraction has 174 states and 232 transitions. [2024-11-10 10:01:23,829 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 11.333333333333334) internal successors, (68), 6 states have internal predecessors, (68), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) [2024-11-10 10:01:23,829 INFO L276 IsEmpty]: Start isEmpty. Operand 174 states and 232 transitions. [2024-11-10 10:01:23,830 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 127 [2024-11-10 10:01:23,830 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 10:01:23,830 INFO L215 NwaCegarLoop]: trace histogram [12, 12, 12, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-10 10:01:23,830 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2024-11-10 10:01:23,830 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-10 10:01:23,830 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 10:01:23,830 INFO L85 PathProgramCache]: Analyzing trace with hash -933637086, now seen corresponding path program 1 times [2024-11-10 10:01:23,831 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 10:01:23,831 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1628817667] [2024-11-10 10:01:23,831 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 10:01:23,831 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 10:01:23,976 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 10:01:51,243 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2024-11-10 10:01:51,245 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 10:01:51,252 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2024-11-10 10:01:51,256 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 10:01:51,262 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2024-11-10 10:01:51,263 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 10:01:51,269 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2024-11-10 10:01:51,270 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 10:01:51,276 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2024-11-10 10:01:51,277 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 10:01:51,282 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 42 [2024-11-10 10:01:51,283 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 10:01:51,288 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2024-11-10 10:01:51,289 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 10:01:51,294 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 60 [2024-11-10 10:01:51,295 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 10:01:51,300 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 66 [2024-11-10 10:01:51,302 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 10:01:51,307 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 72 [2024-11-10 10:01:51,309 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 10:01:51,317 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 78 [2024-11-10 10:01:51,318 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 10:01:51,323 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 84 [2024-11-10 10:01:51,323 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 10:01:51,329 INFO L134 CoverageAnalysis]: Checked inductivity of 264 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 264 trivial. 0 not checked. [2024-11-10 10:01:51,329 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 10:01:51,329 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1628817667] [2024-11-10 10:01:51,329 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1628817667] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 10:01:51,329 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-10 10:01:51,329 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [22] imperfect sequences [] total 22 [2024-11-10 10:01:51,329 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [795832760] [2024-11-10 10:01:51,330 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 10:01:51,330 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 22 states [2024-11-10 10:01:51,330 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 10:01:51,331 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 22 interpolants. [2024-11-10 10:01:51,331 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=62, Invalid=400, Unknown=0, NotChecked=0, Total=462 [2024-11-10 10:01:51,331 INFO L87 Difference]: Start difference. First operand 174 states and 232 transitions. Second operand has 22 states, 21 states have (on average 3.2857142857142856) internal successors, (69), 22 states have internal predecessors, (69), 3 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 2 states have call predecessors, (12), 3 states have call successors, (12) [2024-11-10 10:01:56,977 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.75s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2024-11-10 10:02:07,681 WARN L286 SmtUtils]: Spent 9.07s on a formula simplification. DAG size of input: 189 DAG size of output: 135 (called from [L 388] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2024-11-10 10:02:16,813 WARN L286 SmtUtils]: Spent 6.85s on a formula simplification. DAG size of input: 168 DAG size of output: 133 (called from [L 388] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate)