./Ultimate.py --spec /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/properties/unreach-call.prp --file /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-p_file-53.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version a046e57d Calling Ultimate with: /root/.sdkman/candidates/java/current/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-p_file-53.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 8e24809269f51bce916d93021d3fd241dd9f82f81ed2d62c2bdb32d3cd025077 --- Real Ultimate output --- This is Ultimate 0.2.5-tmp.dk.eval-mul-div-a046e57-m [2024-10-13 06:19:39,295 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-10-13 06:19:39,376 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2024-10-13 06:19:39,382 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-10-13 06:19:39,383 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-10-13 06:19:39,417 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-10-13 06:19:39,418 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-10-13 06:19:39,418 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-10-13 06:19:39,419 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-10-13 06:19:39,420 INFO L153 SettingsManager]: * Use memory slicer=true [2024-10-13 06:19:39,420 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-10-13 06:19:39,421 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-10-13 06:19:39,421 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-10-13 06:19:39,424 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-10-13 06:19:39,424 INFO L153 SettingsManager]: * Use SBE=true [2024-10-13 06:19:39,424 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-10-13 06:19:39,425 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-10-13 06:19:39,425 INFO L153 SettingsManager]: * sizeof long=4 [2024-10-13 06:19:39,425 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-10-13 06:19:39,426 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-10-13 06:19:39,426 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-10-13 06:19:39,427 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-10-13 06:19:39,430 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-10-13 06:19:39,431 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-10-13 06:19:39,431 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-10-13 06:19:39,431 INFO L153 SettingsManager]: * sizeof long double=12 [2024-10-13 06:19:39,431 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-10-13 06:19:39,431 INFO L153 SettingsManager]: * Use constant arrays=true [2024-10-13 06:19:39,432 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-10-13 06:19:39,432 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-10-13 06:19:39,432 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-10-13 06:19:39,432 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-10-13 06:19:39,433 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-13 06:19:39,433 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-10-13 06:19:39,434 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-10-13 06:19:39,434 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-10-13 06:19:39,435 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-10-13 06:19:39,436 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-10-13 06:19:39,436 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-10-13 06:19:39,436 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-10-13 06:19:39,437 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-10-13 06:19:39,437 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-10-13 06:19:39,437 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 -> 8e24809269f51bce916d93021d3fd241dd9f82f81ed2d62c2bdb32d3cd025077 [2024-10-13 06:19:39,744 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-10-13 06:19:39,773 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-10-13 06:19:39,776 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-10-13 06:19:39,778 INFO L270 PluginConnector]: Initializing CDTParser... [2024-10-13 06:19:39,779 INFO L274 PluginConnector]: CDTParser initialized [2024-10-13 06:19:39,780 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-p_file-53.i [2024-10-13 06:19:41,436 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-10-13 06:19:41,680 INFO L384 CDTParser]: Found 1 translation units. [2024-10-13 06:19:41,681 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-p_file-53.i [2024-10-13 06:19:41,692 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/12b139dec/78f8321cbb244bb59b176cb73847001c/FLAG0aa2f6683 [2024-10-13 06:19:41,706 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/12b139dec/78f8321cbb244bb59b176cb73847001c [2024-10-13 06:19:41,708 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-10-13 06:19:41,710 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-10-13 06:19:41,711 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-10-13 06:19:41,711 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-10-13 06:19:41,720 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-10-13 06:19:41,722 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 13.10 06:19:41" (1/1) ... [2024-10-13 06:19:41,723 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@6c13939f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 06:19:41, skipping insertion in model container [2024-10-13 06:19:41,723 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 13.10 06:19:41" (1/1) ... [2024-10-13 06:19:41,754 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-10-13 06:19:41,945 WARN L248 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-p_file-53.i[916,929] [2024-10-13 06:19:42,042 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-13 06:19:42,062 INFO L200 MainTranslator]: Completed pre-run [2024-10-13 06:19:42,078 WARN L248 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-p_file-53.i[916,929] [2024-10-13 06:19:42,132 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-13 06:19:42,163 INFO L204 MainTranslator]: Completed translation [2024-10-13 06:19:42,164 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 06:19:42 WrapperNode [2024-10-13 06:19:42,164 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-10-13 06:19:42,166 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-10-13 06:19:42,167 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-10-13 06:19:42,167 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-10-13 06:19:42,174 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 06:19:42" (1/1) ... [2024-10-13 06:19:42,194 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 06:19:42" (1/1) ... [2024-10-13 06:19:42,244 INFO L138 Inliner]: procedures = 29, calls = 177, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 528 [2024-10-13 06:19:42,245 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-10-13 06:19:42,246 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-10-13 06:19:42,246 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-10-13 06:19:42,246 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-10-13 06:19:42,260 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 06:19:42" (1/1) ... [2024-10-13 06:19:42,260 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 06:19:42" (1/1) ... [2024-10-13 06:19:42,269 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 06:19:42" (1/1) ... [2024-10-13 06:19:42,350 INFO L175 MemorySlicer]: Split 133 memory accesses to 16 slices as follows [2, 3, 12, 12, 6, 5, 10, 7, 10, 10, 12, 17, 6, 10, 5, 6]. 13 percent of accesses are in the largest equivalence class. The 17 initializations are split as follows [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]. The 18 writes are split as follows [0, 1, 1, 1, 1, 1, 1, 3, 1, 1, 1, 1, 1, 1, 2, 1]. [2024-10-13 06:19:42,351 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 06:19:42" (1/1) ... [2024-10-13 06:19:42,351 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 06:19:42" (1/1) ... [2024-10-13 06:19:42,387 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 06:19:42" (1/1) ... [2024-10-13 06:19:42,427 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 06:19:42" (1/1) ... [2024-10-13 06:19:42,439 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 06:19:42" (1/1) ... [2024-10-13 06:19:42,446 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 06:19:42" (1/1) ... [2024-10-13 06:19:42,454 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-10-13 06:19:42,456 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-10-13 06:19:42,456 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-10-13 06:19:42,456 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-10-13 06:19:42,457 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 06:19:42" (1/1) ... [2024-10-13 06:19:42,466 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-13 06:19:42,480 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-13 06:19:42,510 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2024-10-13 06:19:42,514 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2024-10-13 06:19:42,570 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-10-13 06:19:42,571 INFO L130 BoogieDeclarations]: Found specification of procedure read~real#0 [2024-10-13 06:19:42,573 INFO L130 BoogieDeclarations]: Found specification of procedure read~real#1 [2024-10-13 06:19:42,573 INFO L130 BoogieDeclarations]: Found specification of procedure read~real#2 [2024-10-13 06:19:42,573 INFO L130 BoogieDeclarations]: Found specification of procedure read~real#3 [2024-10-13 06:19:42,573 INFO L130 BoogieDeclarations]: Found specification of procedure read~real#4 [2024-10-13 06:19:42,574 INFO L130 BoogieDeclarations]: Found specification of procedure read~real#5 [2024-10-13 06:19:42,574 INFO L130 BoogieDeclarations]: Found specification of procedure read~real#6 [2024-10-13 06:19:42,574 INFO L130 BoogieDeclarations]: Found specification of procedure read~real#7 [2024-10-13 06:19:42,574 INFO L130 BoogieDeclarations]: Found specification of procedure read~real#8 [2024-10-13 06:19:42,574 INFO L130 BoogieDeclarations]: Found specification of procedure read~real#9 [2024-10-13 06:19:42,575 INFO L130 BoogieDeclarations]: Found specification of procedure read~real#10 [2024-10-13 06:19:42,575 INFO L130 BoogieDeclarations]: Found specification of procedure read~real#11 [2024-10-13 06:19:42,575 INFO L130 BoogieDeclarations]: Found specification of procedure read~real#12 [2024-10-13 06:19:42,575 INFO L130 BoogieDeclarations]: Found specification of procedure read~real#13 [2024-10-13 06:19:42,575 INFO L130 BoogieDeclarations]: Found specification of procedure read~real#14 [2024-10-13 06:19:42,576 INFO L130 BoogieDeclarations]: Found specification of procedure read~real#15 [2024-10-13 06:19:42,576 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#0 [2024-10-13 06:19:42,576 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#1 [2024-10-13 06:19:42,576 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#2 [2024-10-13 06:19:42,577 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#3 [2024-10-13 06:19:42,577 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#4 [2024-10-13 06:19:42,577 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#5 [2024-10-13 06:19:42,578 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#6 [2024-10-13 06:19:42,578 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#7 [2024-10-13 06:19:42,578 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#8 [2024-10-13 06:19:42,578 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#9 [2024-10-13 06:19:42,578 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#10 [2024-10-13 06:19:42,578 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#11 [2024-10-13 06:19:42,579 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#12 [2024-10-13 06:19:42,579 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#13 [2024-10-13 06:19:42,579 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#14 [2024-10-13 06:19:42,579 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#15 [2024-10-13 06:19:42,580 INFO L130 BoogieDeclarations]: Found specification of procedure write~real#0 [2024-10-13 06:19:42,580 INFO L130 BoogieDeclarations]: Found specification of procedure write~real#1 [2024-10-13 06:19:42,580 INFO L130 BoogieDeclarations]: Found specification of procedure write~real#2 [2024-10-13 06:19:42,580 INFO L130 BoogieDeclarations]: Found specification of procedure write~real#3 [2024-10-13 06:19:42,580 INFO L130 BoogieDeclarations]: Found specification of procedure write~real#4 [2024-10-13 06:19:42,580 INFO L130 BoogieDeclarations]: Found specification of procedure write~real#5 [2024-10-13 06:19:42,582 INFO L130 BoogieDeclarations]: Found specification of procedure write~real#6 [2024-10-13 06:19:42,582 INFO L130 BoogieDeclarations]: Found specification of procedure write~real#7 [2024-10-13 06:19:42,583 INFO L130 BoogieDeclarations]: Found specification of procedure write~real#8 [2024-10-13 06:19:42,583 INFO L130 BoogieDeclarations]: Found specification of procedure write~real#9 [2024-10-13 06:19:42,583 INFO L130 BoogieDeclarations]: Found specification of procedure write~real#10 [2024-10-13 06:19:42,583 INFO L130 BoogieDeclarations]: Found specification of procedure write~real#11 [2024-10-13 06:19:42,583 INFO L130 BoogieDeclarations]: Found specification of procedure write~real#12 [2024-10-13 06:19:42,583 INFO L130 BoogieDeclarations]: Found specification of procedure write~real#13 [2024-10-13 06:19:42,584 INFO L130 BoogieDeclarations]: Found specification of procedure write~real#14 [2024-10-13 06:19:42,584 INFO L130 BoogieDeclarations]: Found specification of procedure write~real#15 [2024-10-13 06:19:42,584 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#0 [2024-10-13 06:19:42,584 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#1 [2024-10-13 06:19:42,584 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#2 [2024-10-13 06:19:42,584 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#3 [2024-10-13 06:19:42,584 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#4 [2024-10-13 06:19:42,584 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#5 [2024-10-13 06:19:42,585 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#6 [2024-10-13 06:19:42,585 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#7 [2024-10-13 06:19:42,585 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#8 [2024-10-13 06:19:42,585 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#9 [2024-10-13 06:19:42,585 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#10 [2024-10-13 06:19:42,585 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#11 [2024-10-13 06:19:42,585 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#12 [2024-10-13 06:19:42,585 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#13 [2024-10-13 06:19:42,586 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#14 [2024-10-13 06:19:42,586 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#15 [2024-10-13 06:19:42,586 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~real#0 [2024-10-13 06:19:42,586 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~real#1 [2024-10-13 06:19:42,586 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~real#2 [2024-10-13 06:19:42,586 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~real#3 [2024-10-13 06:19:42,586 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~real#4 [2024-10-13 06:19:42,586 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~real#5 [2024-10-13 06:19:42,586 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~real#6 [2024-10-13 06:19:42,586 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~real#7 [2024-10-13 06:19:42,586 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~real#8 [2024-10-13 06:19:42,587 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~real#9 [2024-10-13 06:19:42,587 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~real#10 [2024-10-13 06:19:42,587 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~real#11 [2024-10-13 06:19:42,587 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~real#12 [2024-10-13 06:19:42,587 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~real#13 [2024-10-13 06:19:42,587 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~real#14 [2024-10-13 06:19:42,587 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~real#15 [2024-10-13 06:19:42,587 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2024-10-13 06:19:42,587 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2024-10-13 06:19:42,587 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-10-13 06:19:42,587 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#1 [2024-10-13 06:19:42,588 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#2 [2024-10-13 06:19:42,588 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#3 [2024-10-13 06:19:42,588 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#4 [2024-10-13 06:19:42,588 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#5 [2024-10-13 06:19:42,588 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#6 [2024-10-13 06:19:42,590 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#7 [2024-10-13 06:19:42,590 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#8 [2024-10-13 06:19:42,590 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#9 [2024-10-13 06:19:42,590 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#10 [2024-10-13 06:19:42,591 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#11 [2024-10-13 06:19:42,591 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#12 [2024-10-13 06:19:42,591 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#13 [2024-10-13 06:19:42,591 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#14 [2024-10-13 06:19:42,591 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#15 [2024-10-13 06:19:42,592 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-10-13 06:19:42,592 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-10-13 06:19:42,858 INFO L238 CfgBuilder]: Building ICFG [2024-10-13 06:19:42,861 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-10-13 06:19:43,488 INFO L? ?]: Removed 117 outVars from TransFormulas that were not future-live. [2024-10-13 06:19:43,489 INFO L287 CfgBuilder]: Performing block encoding [2024-10-13 06:19:43,536 INFO L309 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-10-13 06:19:43,537 INFO L314 CfgBuilder]: Removed 1 assume(true) statements. [2024-10-13 06:19:43,537 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 13.10 06:19:43 BoogieIcfgContainer [2024-10-13 06:19:43,537 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-10-13 06:19:43,540 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-10-13 06:19:43,540 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-10-13 06:19:43,544 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-10-13 06:19:43,545 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 13.10 06:19:41" (1/3) ... [2024-10-13 06:19:43,545 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@580326bc and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 13.10 06:19:43, skipping insertion in model container [2024-10-13 06:19:43,546 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 06:19:42" (2/3) ... [2024-10-13 06:19:43,546 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@580326bc and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 13.10 06:19:43, skipping insertion in model container [2024-10-13 06:19:43,546 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 13.10 06:19:43" (3/3) ... [2024-10-13 06:19:43,547 INFO L112 eAbstractionObserver]: Analyzing ICFG hardness_variablewrapping_wrapper-p_file-53.i [2024-10-13 06:19:43,567 INFO L209 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-10-13 06:19:43,568 INFO L149 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-10-13 06:19:43,650 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-10-13 06:19:43,658 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;@67c0c722, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-10-13 06:19:43,659 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-10-13 06:19:43,664 INFO L276 IsEmpty]: Start isEmpty. Operand has 105 states, 84 states have (on average 1.4404761904761905) internal successors, (121), 85 states have internal predecessors, (121), 18 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 18 states have call predecessors, (18), 18 states have call successors, (18) [2024-10-13 06:19:43,679 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 136 [2024-10-13 06:19:43,680 INFO L207 NwaCegarLoop]: Found error trace [2024-10-13 06:19:43,681 INFO L215 NwaCegarLoop]: trace histogram [18, 18, 18, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-13 06:19:43,682 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-13 06:19:43,690 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 06:19:43,691 INFO L85 PathProgramCache]: Analyzing trace with hash -1079870598, now seen corresponding path program 1 times [2024-10-13 06:19:43,699 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-13 06:19:43,700 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2454695] [2024-10-13 06:19:43,700 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 06:19:43,701 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-13 06:19:43,924 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:19:44,120 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-13 06:19:44,125 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:19:44,132 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2024-10-13 06:19:44,143 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:19:44,150 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2024-10-13 06:19:44,153 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:19:44,161 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2024-10-13 06:19:44,165 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:19:44,168 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2024-10-13 06:19:44,173 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:19:44,177 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-10-13 06:19:44,180 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:19:44,184 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-10-13 06:19:44,189 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:19:44,197 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2024-10-13 06:19:44,202 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:19:44,208 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 53 [2024-10-13 06:19:44,211 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:19:44,215 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2024-10-13 06:19:44,222 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:19:44,225 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2024-10-13 06:19:44,229 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:19:44,232 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2024-10-13 06:19:44,235 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:19:44,238 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 80 [2024-10-13 06:19:44,244 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:19:44,250 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 86 [2024-10-13 06:19:44,255 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:19:44,261 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 92 [2024-10-13 06:19:44,265 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:19:44,269 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 98 [2024-10-13 06:19:44,272 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:19:44,277 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 104 [2024-10-13 06:19:44,281 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:19:44,284 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 110 [2024-10-13 06:19:44,319 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:19:44,327 INFO L134 CoverageAnalysis]: Checked inductivity of 612 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 612 trivial. 0 not checked. [2024-10-13 06:19:44,328 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-13 06:19:44,329 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2454695] [2024-10-13 06:19:44,329 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2454695] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-13 06:19:44,330 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-13 06:19:44,330 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-13 06:19:44,332 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1023393612] [2024-10-13 06:19:44,333 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-13 06:19:44,338 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-10-13 06:19:44,339 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-13 06:19:44,368 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-10-13 06:19:44,368 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-10-13 06:19:44,371 INFO L87 Difference]: Start difference. First operand has 105 states, 84 states have (on average 1.4404761904761905) internal successors, (121), 85 states have internal predecessors, (121), 18 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 18 states have call predecessors, (18), 18 states have call successors, (18) Second operand has 2 states, 2 states have (on average 24.0) internal successors, (48), 2 states have internal predecessors, (48), 2 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 2 states have call successors, (18) [2024-10-13 06:19:44,431 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-13 06:19:44,432 INFO L93 Difference]: Finished difference Result 207 states and 330 transitions. [2024-10-13 06:19:44,434 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-10-13 06:19:44,436 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 24.0) internal successors, (48), 2 states have internal predecessors, (48), 2 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 2 states have call successors, (18) Word has length 135 [2024-10-13 06:19:44,437 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-13 06:19:44,449 INFO L225 Difference]: With dead ends: 207 [2024-10-13 06:19:44,450 INFO L226 Difference]: Without dead ends: 103 [2024-10-13 06:19:44,456 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 56 GetRequests, 56 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-10-13 06:19:44,463 INFO L432 NwaCegarLoop]: 146 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 4 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 146 SdHoareTripleChecker+Invalid, 4 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 4 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-13 06:19:44,465 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 146 Invalid, 4 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 4 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-13 06:19:44,480 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 103 states. [2024-10-13 06:19:44,515 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 103 to 103. [2024-10-13 06:19:44,516 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 103 states, 83 states have (on average 1.3734939759036144) internal successors, (114), 83 states have internal predecessors, (114), 18 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 18 states have call predecessors, (18), 18 states have call successors, (18) [2024-10-13 06:19:44,519 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 103 states to 103 states and 150 transitions. [2024-10-13 06:19:44,521 INFO L78 Accepts]: Start accepts. Automaton has 103 states and 150 transitions. Word has length 135 [2024-10-13 06:19:44,522 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-13 06:19:44,522 INFO L471 AbstractCegarLoop]: Abstraction has 103 states and 150 transitions. [2024-10-13 06:19:44,523 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 24.0) internal successors, (48), 2 states have internal predecessors, (48), 2 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 2 states have call successors, (18) [2024-10-13 06:19:44,523 INFO L276 IsEmpty]: Start isEmpty. Operand 103 states and 150 transitions. [2024-10-13 06:19:44,528 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 136 [2024-10-13 06:19:44,529 INFO L207 NwaCegarLoop]: Found error trace [2024-10-13 06:19:44,529 INFO L215 NwaCegarLoop]: trace histogram [18, 18, 18, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-13 06:19:44,529 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-10-13 06:19:44,530 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-13 06:19:44,530 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 06:19:44,530 INFO L85 PathProgramCache]: Analyzing trace with hash -148898342, now seen corresponding path program 1 times [2024-10-13 06:19:44,531 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-13 06:19:44,531 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [540119936] [2024-10-13 06:19:44,531 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 06:19:44,531 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-13 06:19:44,752 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:19:45,093 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-13 06:19:45,096 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:19:45,101 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2024-10-13 06:19:45,105 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:19:45,108 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2024-10-13 06:19:45,113 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:19:45,117 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2024-10-13 06:19:45,123 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:19:45,126 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2024-10-13 06:19:45,132 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:19:45,134 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-10-13 06:19:45,140 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:19:45,144 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-10-13 06:19:45,147 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:19:45,150 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2024-10-13 06:19:45,175 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:19:45,181 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 53 [2024-10-13 06:19:45,187 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:19:45,192 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2024-10-13 06:19:45,194 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:19:45,200 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2024-10-13 06:19:45,204 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:19:45,207 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2024-10-13 06:19:45,209 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:19:45,212 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 80 [2024-10-13 06:19:45,214 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:19:45,217 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 86 [2024-10-13 06:19:45,219 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:19:45,221 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 92 [2024-10-13 06:19:45,223 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:19:45,225 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 98 [2024-10-13 06:19:45,228 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:19:45,231 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 104 [2024-10-13 06:19:45,235 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:19:45,237 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 110 [2024-10-13 06:19:45,240 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:19:45,245 INFO L134 CoverageAnalysis]: Checked inductivity of 612 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 612 trivial. 0 not checked. [2024-10-13 06:19:45,247 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-13 06:19:45,248 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [540119936] [2024-10-13 06:19:45,248 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [540119936] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-13 06:19:45,248 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-13 06:19:45,248 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-13 06:19:45,248 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1712029932] [2024-10-13 06:19:45,249 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-13 06:19:45,250 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-13 06:19:45,253 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-13 06:19:45,254 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-13 06:19:45,255 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-13 06:19:45,256 INFO L87 Difference]: Start difference. First operand 103 states and 150 transitions. Second operand has 3 states, 3 states have (on average 16.0) internal successors, (48), 3 states have internal predecessors, (48), 1 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 1 states have call successors, (18) [2024-10-13 06:19:45,313 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-13 06:19:45,313 INFO L93 Difference]: Finished difference Result 205 states and 299 transitions. [2024-10-13 06:19:45,314 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-13 06:19:45,314 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 16.0) internal successors, (48), 3 states have internal predecessors, (48), 1 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 1 states have call successors, (18) Word has length 135 [2024-10-13 06:19:45,315 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-13 06:19:45,316 INFO L225 Difference]: With dead ends: 205 [2024-10-13 06:19:45,317 INFO L226 Difference]: Without dead ends: 103 [2024-10-13 06:19:45,321 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 39 GetRequests, 38 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-13 06:19:45,322 INFO L432 NwaCegarLoop]: 144 mSDtfsCounter, 0 mSDsluCounter, 141 mSDsCounter, 0 mSdLazyCounter, 12 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 285 SdHoareTripleChecker+Invalid, 12 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 12 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-13 06:19:45,323 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 285 Invalid, 12 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 12 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-13 06:19:45,324 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 103 states. [2024-10-13 06:19:45,339 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 103 to 103. [2024-10-13 06:19:45,342 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 103 states, 83 states have (on average 1.3614457831325302) internal successors, (113), 83 states have internal predecessors, (113), 18 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 18 states have call predecessors, (18), 18 states have call successors, (18) [2024-10-13 06:19:45,346 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 103 states to 103 states and 149 transitions. [2024-10-13 06:19:45,347 INFO L78 Accepts]: Start accepts. Automaton has 103 states and 149 transitions. Word has length 135 [2024-10-13 06:19:45,349 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-13 06:19:45,349 INFO L471 AbstractCegarLoop]: Abstraction has 103 states and 149 transitions. [2024-10-13 06:19:45,349 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 16.0) internal successors, (48), 3 states have internal predecessors, (48), 1 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 1 states have call successors, (18) [2024-10-13 06:19:45,349 INFO L276 IsEmpty]: Start isEmpty. Operand 103 states and 149 transitions. [2024-10-13 06:19:45,354 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 136 [2024-10-13 06:19:45,356 INFO L207 NwaCegarLoop]: Found error trace [2024-10-13 06:19:45,357 INFO L215 NwaCegarLoop]: trace histogram [18, 18, 18, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-13 06:19:45,357 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-10-13 06:19:45,357 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-13 06:19:45,358 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 06:19:45,358 INFO L85 PathProgramCache]: Analyzing trace with hash -1428762020, now seen corresponding path program 1 times [2024-10-13 06:19:45,361 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-13 06:19:45,362 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [323281233] [2024-10-13 06:19:45,362 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 06:19:45,362 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-13 06:19:45,607 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:19:46,631 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-13 06:19:46,636 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:19:46,641 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2024-10-13 06:19:46,643 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:19:46,647 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2024-10-13 06:19:46,649 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:19:46,654 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2024-10-13 06:19:46,659 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:19:46,663 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2024-10-13 06:19:46,666 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:19:46,672 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-10-13 06:19:46,678 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:19:46,684 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-10-13 06:19:46,687 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:19:46,690 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2024-10-13 06:19:46,692 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:19:46,695 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 53 [2024-10-13 06:19:46,698 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:19:46,700 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2024-10-13 06:19:46,702 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:19:46,704 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2024-10-13 06:19:46,709 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:19:46,712 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2024-10-13 06:19:46,716 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:19:46,719 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 80 [2024-10-13 06:19:46,721 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:19:46,725 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 86 [2024-10-13 06:19:46,728 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:19:46,729 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 92 [2024-10-13 06:19:46,732 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:19:46,734 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 98 [2024-10-13 06:19:46,736 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:19:46,738 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 104 [2024-10-13 06:19:46,742 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:19:46,744 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 110 [2024-10-13 06:19:46,746 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:19:46,749 INFO L134 CoverageAnalysis]: Checked inductivity of 612 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 612 trivial. 0 not checked. [2024-10-13 06:19:46,751 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-13 06:19:46,751 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [323281233] [2024-10-13 06:19:46,751 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [323281233] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-13 06:19:46,751 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-13 06:19:46,751 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-10-13 06:19:46,751 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [256301371] [2024-10-13 06:19:46,751 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-13 06:19:46,752 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-10-13 06:19:46,752 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-13 06:19:46,753 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-10-13 06:19:46,753 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2024-10-13 06:19:46,755 INFO L87 Difference]: Start difference. First operand 103 states and 149 transitions. Second operand has 8 states, 7 states have (on average 6.857142857142857) internal successors, (48), 8 states have internal predecessors, (48), 4 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 3 states have call predecessors, (18), 4 states have call successors, (18) [2024-10-13 06:19:47,058 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-13 06:19:47,058 INFO L93 Difference]: Finished difference Result 211 states and 303 transitions. [2024-10-13 06:19:47,062 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-10-13 06:19:47,063 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 7 states have (on average 6.857142857142857) internal successors, (48), 8 states have internal predecessors, (48), 4 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 3 states have call predecessors, (18), 4 states have call successors, (18) Word has length 135 [2024-10-13 06:19:47,063 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-13 06:19:47,065 INFO L225 Difference]: With dead ends: 211 [2024-10-13 06:19:47,065 INFO L226 Difference]: Without dead ends: 109 [2024-10-13 06:19:47,066 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 50 GetRequests, 40 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=38, Invalid=94, Unknown=0, NotChecked=0, Total=132 [2024-10-13 06:19:47,070 INFO L432 NwaCegarLoop]: 133 mSDtfsCounter, 320 mSDsluCounter, 386 mSDsCounter, 0 mSdLazyCounter, 129 mSolverCounterSat, 50 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 320 SdHoareTripleChecker+Valid, 519 SdHoareTripleChecker+Invalid, 179 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 50 IncrementalHoareTripleChecker+Valid, 129 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-10-13 06:19:47,070 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [320 Valid, 519 Invalid, 179 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [50 Valid, 129 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-10-13 06:19:47,071 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 109 states. [2024-10-13 06:19:47,089 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 109 to 109. [2024-10-13 06:19:47,090 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 109 states, 88 states have (on average 1.3409090909090908) internal successors, (118), 88 states have internal predecessors, (118), 18 states have call successors, (18), 2 states have call predecessors, (18), 2 states have return successors, (18), 18 states have call predecessors, (18), 18 states have call successors, (18) [2024-10-13 06:19:47,092 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 109 states to 109 states and 154 transitions. [2024-10-13 06:19:47,096 INFO L78 Accepts]: Start accepts. Automaton has 109 states and 154 transitions. Word has length 135 [2024-10-13 06:19:47,097 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-13 06:19:47,097 INFO L471 AbstractCegarLoop]: Abstraction has 109 states and 154 transitions. [2024-10-13 06:19:47,097 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 7 states have (on average 6.857142857142857) internal successors, (48), 8 states have internal predecessors, (48), 4 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 3 states have call predecessors, (18), 4 states have call successors, (18) [2024-10-13 06:19:47,098 INFO L276 IsEmpty]: Start isEmpty. Operand 109 states and 154 transitions. [2024-10-13 06:19:47,099 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 136 [2024-10-13 06:19:47,102 INFO L207 NwaCegarLoop]: Found error trace [2024-10-13 06:19:47,102 INFO L215 NwaCegarLoop]: trace histogram [18, 18, 18, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-13 06:19:47,103 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-10-13 06:19:47,103 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-13 06:19:47,103 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 06:19:47,103 INFO L85 PathProgramCache]: Analyzing trace with hash -1821789030, now seen corresponding path program 1 times [2024-10-13 06:19:47,103 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-13 06:19:47,104 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1195165282] [2024-10-13 06:19:47,104 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 06:19:47,104 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-13 06:19:47,242 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:19:48,290 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-13 06:19:48,293 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:19:48,296 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2024-10-13 06:19:48,299 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:19:48,303 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2024-10-13 06:19:48,306 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:19:48,309 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2024-10-13 06:19:48,312 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:19:48,315 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2024-10-13 06:19:48,318 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:19:48,320 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-10-13 06:19:48,324 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:19:48,327 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-10-13 06:19:48,330 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:19:48,332 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2024-10-13 06:19:48,336 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:19:48,339 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 53 [2024-10-13 06:19:48,342 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:19:48,346 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2024-10-13 06:19:48,349 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:19:48,352 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2024-10-13 06:19:48,356 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:19:48,360 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2024-10-13 06:19:48,363 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:19:48,365 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 80 [2024-10-13 06:19:48,368 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:19:48,371 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 86 [2024-10-13 06:19:48,373 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:19:48,376 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 92 [2024-10-13 06:19:48,379 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:19:48,385 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 98 [2024-10-13 06:19:48,388 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:19:48,395 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 104 [2024-10-13 06:19:48,402 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:19:48,408 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 110 [2024-10-13 06:19:48,411 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:19:48,414 INFO L134 CoverageAnalysis]: Checked inductivity of 612 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 612 trivial. 0 not checked. [2024-10-13 06:19:48,414 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-13 06:19:48,414 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1195165282] [2024-10-13 06:19:48,414 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1195165282] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-13 06:19:48,415 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-13 06:19:48,415 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-10-13 06:19:48,415 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [687607927] [2024-10-13 06:19:48,415 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-13 06:19:48,416 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-10-13 06:19:48,416 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-13 06:19:48,420 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-10-13 06:19:48,421 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2024-10-13 06:19:48,421 INFO L87 Difference]: Start difference. First operand 109 states and 154 transitions. Second operand has 6 states, 6 states have (on average 8.0) internal successors, (48), 6 states have internal predecessors, (48), 1 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 1 states have call successors, (18) [2024-10-13 06:19:48,686 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-13 06:19:48,686 INFO L93 Difference]: Finished difference Result 324 states and 458 transitions. [2024-10-13 06:19:48,687 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-10-13 06:19:48,687 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 8.0) internal successors, (48), 6 states have internal predecessors, (48), 1 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 1 states have call successors, (18) Word has length 135 [2024-10-13 06:19:48,688 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-13 06:19:48,691 INFO L225 Difference]: With dead ends: 324 [2024-10-13 06:19:48,693 INFO L226 Difference]: Without dead ends: 216 [2024-10-13 06:19:48,694 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 42 GetRequests, 37 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2024-10-13 06:19:48,697 INFO L432 NwaCegarLoop]: 148 mSDtfsCounter, 94 mSDsluCounter, 414 mSDsCounter, 0 mSdLazyCounter, 141 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 94 SdHoareTripleChecker+Valid, 562 SdHoareTripleChecker+Invalid, 141 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 141 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-10-13 06:19:48,698 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [94 Valid, 562 Invalid, 141 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 141 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-10-13 06:19:48,699 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 216 states. [2024-10-13 06:19:48,730 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 216 to 211. [2024-10-13 06:19:48,731 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 211 states, 170 states have (on average 1.3411764705882352) internal successors, (228), 170 states have internal predecessors, (228), 36 states have call successors, (36), 4 states have call predecessors, (36), 4 states have return successors, (36), 36 states have call predecessors, (36), 36 states have call successors, (36) [2024-10-13 06:19:48,733 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 211 states to 211 states and 300 transitions. [2024-10-13 06:19:48,734 INFO L78 Accepts]: Start accepts. Automaton has 211 states and 300 transitions. Word has length 135 [2024-10-13 06:19:48,734 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-13 06:19:48,734 INFO L471 AbstractCegarLoop]: Abstraction has 211 states and 300 transitions. [2024-10-13 06:19:48,735 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 8.0) internal successors, (48), 6 states have internal predecessors, (48), 1 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 1 states have call successors, (18) [2024-10-13 06:19:48,735 INFO L276 IsEmpty]: Start isEmpty. Operand 211 states and 300 transitions. [2024-10-13 06:19:48,737 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 138 [2024-10-13 06:19:48,737 INFO L207 NwaCegarLoop]: Found error trace [2024-10-13 06:19:48,737 INFO L215 NwaCegarLoop]: trace histogram [18, 18, 18, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-13 06:19:48,737 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2024-10-13 06:19:48,738 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-13 06:19:48,738 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 06:19:48,738 INFO L85 PathProgramCache]: Analyzing trace with hash 668833267, now seen corresponding path program 1 times [2024-10-13 06:19:48,738 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-13 06:19:48,739 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [579981967] [2024-10-13 06:19:48,739 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 06:19:48,739 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-13 06:19:48,926 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:19:51,300 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-13 06:19:51,304 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:19:51,311 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2024-10-13 06:19:51,314 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:19:51,319 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2024-10-13 06:19:51,322 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:19:51,329 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2024-10-13 06:19:51,333 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:19:51,337 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2024-10-13 06:19:51,340 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:19:51,345 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-10-13 06:19:51,348 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:19:51,352 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-10-13 06:19:51,354 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:19:51,356 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2024-10-13 06:19:51,359 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:19:51,363 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 53 [2024-10-13 06:19:51,365 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:19:51,370 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2024-10-13 06:19:51,374 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:19:51,378 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2024-10-13 06:19:51,382 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:19:51,387 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2024-10-13 06:19:51,391 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:19:51,397 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 80 [2024-10-13 06:19:51,400 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:19:51,404 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 86 [2024-10-13 06:19:51,407 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:19:51,409 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 92 [2024-10-13 06:19:51,414 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:19:51,420 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 98 [2024-10-13 06:19:51,422 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:19:51,429 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 104 [2024-10-13 06:19:51,431 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:19:51,433 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 110 [2024-10-13 06:19:51,436 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:19:51,439 INFO L134 CoverageAnalysis]: Checked inductivity of 612 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 612 trivial. 0 not checked. [2024-10-13 06:19:51,439 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-13 06:19:51,439 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [579981967] [2024-10-13 06:19:51,439 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [579981967] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-13 06:19:51,440 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-13 06:19:51,440 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [17] imperfect sequences [] total 17 [2024-10-13 06:19:51,440 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1688278394] [2024-10-13 06:19:51,440 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-13 06:19:51,441 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 17 states [2024-10-13 06:19:51,441 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-13 06:19:51,442 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2024-10-13 06:19:51,442 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=51, Invalid=221, Unknown=0, NotChecked=0, Total=272 [2024-10-13 06:19:51,443 INFO L87 Difference]: Start difference. First operand 211 states and 300 transitions. Second operand has 17 states, 15 states have (on average 3.3333333333333335) internal successors, (50), 16 states have internal predecessors, (50), 6 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 5 states have call predecessors, (18), 6 states have call successors, (18) [2024-10-13 06:19:52,388 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-13 06:19:52,388 INFO L93 Difference]: Finished difference Result 318 states and 451 transitions. [2024-10-13 06:19:52,389 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2024-10-13 06:19:52,389 INFO L78 Accepts]: Start accepts. Automaton has has 17 states, 15 states have (on average 3.3333333333333335) internal successors, (50), 16 states have internal predecessors, (50), 6 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 5 states have call predecessors, (18), 6 states have call successors, (18) Word has length 137 [2024-10-13 06:19:52,390 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-13 06:19:52,392 INFO L225 Difference]: With dead ends: 318 [2024-10-13 06:19:52,393 INFO L226 Difference]: Without dead ends: 210 [2024-10-13 06:19:52,394 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 66 GetRequests, 41 SyntacticMatches, 0 SemanticMatches, 25 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 79 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=152, Invalid=550, Unknown=0, NotChecked=0, Total=702 [2024-10-13 06:19:52,395 INFO L432 NwaCegarLoop]: 115 mSDtfsCounter, 611 mSDsluCounter, 672 mSDsCounter, 0 mSdLazyCounter, 449 mSolverCounterSat, 150 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 611 SdHoareTripleChecker+Valid, 787 SdHoareTripleChecker+Invalid, 599 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 150 IncrementalHoareTripleChecker+Valid, 449 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2024-10-13 06:19:52,396 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [611 Valid, 787 Invalid, 599 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [150 Valid, 449 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2024-10-13 06:19:52,397 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 210 states. [2024-10-13 06:19:52,417 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 210 to 107. [2024-10-13 06:19:52,418 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 107 states, 86 states have (on average 1.3255813953488371) internal successors, (114), 86 states have internal predecessors, (114), 18 states have call successors, (18), 2 states have call predecessors, (18), 2 states have return successors, (18), 18 states have call predecessors, (18), 18 states have call successors, (18) [2024-10-13 06:19:52,419 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 107 states to 107 states and 150 transitions. [2024-10-13 06:19:52,419 INFO L78 Accepts]: Start accepts. Automaton has 107 states and 150 transitions. Word has length 137 [2024-10-13 06:19:52,420 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-13 06:19:52,420 INFO L471 AbstractCegarLoop]: Abstraction has 107 states and 150 transitions. [2024-10-13 06:19:52,420 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 17 states, 15 states have (on average 3.3333333333333335) internal successors, (50), 16 states have internal predecessors, (50), 6 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 5 states have call predecessors, (18), 6 states have call successors, (18) [2024-10-13 06:19:52,421 INFO L276 IsEmpty]: Start isEmpty. Operand 107 states and 150 transitions. [2024-10-13 06:19:52,422 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 141 [2024-10-13 06:19:52,422 INFO L207 NwaCegarLoop]: Found error trace [2024-10-13 06:19:52,422 INFO L215 NwaCegarLoop]: trace histogram [18, 18, 18, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-13 06:19:52,422 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2024-10-13 06:19:52,423 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-13 06:19:52,423 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 06:19:52,423 INFO L85 PathProgramCache]: Analyzing trace with hash -1993440470, now seen corresponding path program 1 times [2024-10-13 06:19:52,423 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-13 06:19:52,423 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1077629641] [2024-10-13 06:19:52,423 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 06:19:52,423 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-13 06:19:52,525 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:19:52,794 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-13 06:19:52,796 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:19:52,799 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2024-10-13 06:19:52,801 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:19:52,803 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2024-10-13 06:19:52,806 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:19:52,809 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2024-10-13 06:19:52,811 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:19:52,813 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2024-10-13 06:19:52,815 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:19:52,817 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-10-13 06:19:52,820 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:19:52,826 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-10-13 06:19:52,828 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:19:52,830 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2024-10-13 06:19:52,831 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:19:52,833 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 53 [2024-10-13 06:19:52,838 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:19:52,840 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2024-10-13 06:19:52,842 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:19:52,844 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2024-10-13 06:19:52,846 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:19:52,848 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2024-10-13 06:19:52,850 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:19:52,852 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 80 [2024-10-13 06:19:52,854 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:19:52,856 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 86 [2024-10-13 06:19:52,858 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:19:52,859 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 92 [2024-10-13 06:19:52,863 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:19:52,865 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 98 [2024-10-13 06:19:52,867 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:19:52,869 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 104 [2024-10-13 06:19:52,871 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:19:52,873 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 110 [2024-10-13 06:19:52,875 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:19:52,877 INFO L134 CoverageAnalysis]: Checked inductivity of 612 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 612 trivial. 0 not checked. [2024-10-13 06:19:52,877 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-13 06:19:52,877 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1077629641] [2024-10-13 06:19:52,878 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1077629641] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-13 06:19:52,878 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-13 06:19:52,878 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-10-13 06:19:52,878 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [306464594] [2024-10-13 06:19:52,878 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-13 06:19:52,878 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-10-13 06:19:52,878 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-13 06:19:52,880 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-10-13 06:19:52,880 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-10-13 06:19:52,881 INFO L87 Difference]: Start difference. First operand 107 states and 150 transitions. Second operand has 4 states, 4 states have (on average 13.25) internal successors, (53), 4 states have internal predecessors, (53), 1 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 1 states have call successors, (18) [2024-10-13 06:19:52,931 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-13 06:19:52,933 INFO L93 Difference]: Finished difference Result 213 states and 299 transitions. [2024-10-13 06:19:52,934 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-10-13 06:19:52,934 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 13.25) internal successors, (53), 4 states have internal predecessors, (53), 1 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 1 states have call successors, (18) Word has length 140 [2024-10-13 06:19:52,935 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-13 06:19:52,936 INFO L225 Difference]: With dead ends: 213 [2024-10-13 06:19:52,936 INFO L226 Difference]: Without dead ends: 107 [2024-10-13 06:19:52,936 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 41 GetRequests, 39 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-10-13 06:19:52,937 INFO L432 NwaCegarLoop]: 140 mSDtfsCounter, 0 mSDsluCounter, 270 mSDsCounter, 0 mSdLazyCounter, 26 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 410 SdHoareTripleChecker+Invalid, 26 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 26 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-13 06:19:52,938 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 410 Invalid, 26 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 26 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-13 06:19:52,940 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 107 states. [2024-10-13 06:19:52,958 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 107 to 107. [2024-10-13 06:19:52,959 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 107 states, 86 states have (on average 1.313953488372093) internal successors, (113), 86 states have internal predecessors, (113), 18 states have call successors, (18), 2 states have call predecessors, (18), 2 states have return successors, (18), 18 states have call predecessors, (18), 18 states have call successors, (18) [2024-10-13 06:19:52,960 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 107 states to 107 states and 149 transitions. [2024-10-13 06:19:52,961 INFO L78 Accepts]: Start accepts. Automaton has 107 states and 149 transitions. Word has length 140 [2024-10-13 06:19:52,962 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-13 06:19:52,962 INFO L471 AbstractCegarLoop]: Abstraction has 107 states and 149 transitions. [2024-10-13 06:19:52,962 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 13.25) internal successors, (53), 4 states have internal predecessors, (53), 1 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 1 states have call successors, (18) [2024-10-13 06:19:52,962 INFO L276 IsEmpty]: Start isEmpty. Operand 107 states and 149 transitions. [2024-10-13 06:19:52,963 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 141 [2024-10-13 06:19:52,963 INFO L207 NwaCegarLoop]: Found error trace [2024-10-13 06:19:52,964 INFO L215 NwaCegarLoop]: trace histogram [18, 18, 18, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-13 06:19:52,964 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2024-10-13 06:19:52,964 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-13 06:19:52,964 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 06:19:52,964 INFO L85 PathProgramCache]: Analyzing trace with hash -1735275032, now seen corresponding path program 1 times [2024-10-13 06:19:52,965 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-13 06:19:52,965 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1949860332] [2024-10-13 06:19:52,965 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 06:19:52,965 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-13 06:19:53,058 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:19:53,588 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-13 06:19:53,590 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:19:53,592 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2024-10-13 06:19:53,594 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:19:53,597 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2024-10-13 06:19:53,599 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:19:53,600 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2024-10-13 06:19:53,602 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:19:53,604 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2024-10-13 06:19:53,607 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:19:53,610 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-10-13 06:19:53,611 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:19:53,615 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-10-13 06:19:53,617 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:19:53,619 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2024-10-13 06:19:53,621 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:19:53,623 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 53 [2024-10-13 06:19:53,624 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:19:53,626 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2024-10-13 06:19:53,627 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:19:53,629 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2024-10-13 06:19:53,632 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:19:53,635 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2024-10-13 06:19:53,637 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:19:53,639 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 80 [2024-10-13 06:19:53,641 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:19:53,642 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 86 [2024-10-13 06:19:53,647 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:19:53,648 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 92 [2024-10-13 06:19:53,650 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:19:53,651 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 98 [2024-10-13 06:19:53,653 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:19:53,654 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 104 [2024-10-13 06:19:53,657 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:19:53,659 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 110 [2024-10-13 06:19:53,661 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:19:53,663 INFO L134 CoverageAnalysis]: Checked inductivity of 612 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 612 trivial. 0 not checked. [2024-10-13 06:19:53,663 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-13 06:19:53,663 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1949860332] [2024-10-13 06:19:53,664 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1949860332] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-13 06:19:53,664 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-13 06:19:53,665 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-10-13 06:19:53,665 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [937916591] [2024-10-13 06:19:53,665 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-13 06:19:53,665 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-10-13 06:19:53,665 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-13 06:19:53,666 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-10-13 06:19:53,666 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2024-10-13 06:19:53,666 INFO L87 Difference]: Start difference. First operand 107 states and 149 transitions. Second operand has 6 states, 6 states have (on average 8.833333333333334) internal successors, (53), 6 states have internal predecessors, (53), 1 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 1 states have call successors, (18) [2024-10-13 06:19:53,809 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-13 06:19:53,809 INFO L93 Difference]: Finished difference Result 289 states and 399 transitions. [2024-10-13 06:19:53,810 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-10-13 06:19:53,810 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 8.833333333333334) internal successors, (53), 6 states have internal predecessors, (53), 1 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 1 states have call successors, (18) Word has length 140 [2024-10-13 06:19:53,810 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-13 06:19:53,812 INFO L225 Difference]: With dead ends: 289 [2024-10-13 06:19:53,812 INFO L226 Difference]: Without dead ends: 183 [2024-10-13 06:19:53,812 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 46 GetRequests, 39 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=21, Invalid=51, Unknown=0, NotChecked=0, Total=72 [2024-10-13 06:19:53,813 INFO L432 NwaCegarLoop]: 195 mSDtfsCounter, 90 mSDsluCounter, 702 mSDsCounter, 0 mSdLazyCounter, 95 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 90 SdHoareTripleChecker+Valid, 897 SdHoareTripleChecker+Invalid, 95 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 95 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-13 06:19:53,813 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [90 Valid, 897 Invalid, 95 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 95 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-13 06:19:53,814 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 183 states. [2024-10-13 06:19:53,835 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 183 to 180. [2024-10-13 06:19:53,836 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 180 states, 147 states have (on average 1.3061224489795917) internal successors, (192), 148 states have internal predecessors, (192), 28 states have call successors, (28), 4 states have call predecessors, (28), 4 states have return successors, (28), 27 states have call predecessors, (28), 28 states have call successors, (28) [2024-10-13 06:19:53,837 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 180 states to 180 states and 248 transitions. [2024-10-13 06:19:53,838 INFO L78 Accepts]: Start accepts. Automaton has 180 states and 248 transitions. Word has length 140 [2024-10-13 06:19:53,838 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-13 06:19:53,838 INFO L471 AbstractCegarLoop]: Abstraction has 180 states and 248 transitions. [2024-10-13 06:19:53,839 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 8.833333333333334) internal successors, (53), 6 states have internal predecessors, (53), 1 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 1 states have call successors, (18) [2024-10-13 06:19:53,839 INFO L276 IsEmpty]: Start isEmpty. Operand 180 states and 248 transitions. [2024-10-13 06:19:53,840 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 142 [2024-10-13 06:19:53,841 INFO L207 NwaCegarLoop]: Found error trace [2024-10-13 06:19:53,841 INFO L215 NwaCegarLoop]: trace histogram [18, 18, 18, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-13 06:19:53,841 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2024-10-13 06:19:53,841 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-13 06:19:53,842 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 06:19:53,842 INFO L85 PathProgramCache]: Analyzing trace with hash -292630820, now seen corresponding path program 1 times [2024-10-13 06:19:53,842 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-13 06:19:53,842 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1272731311] [2024-10-13 06:19:53,842 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 06:19:53,842 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-13 06:19:53,950 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:19:55,466 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-13 06:19:55,470 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:19:55,474 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2024-10-13 06:19:55,477 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:19:55,481 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2024-10-13 06:19:55,484 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:19:55,491 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2024-10-13 06:19:55,493 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:19:55,496 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2024-10-13 06:19:55,499 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:19:55,505 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-10-13 06:19:55,511 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:19:55,514 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-10-13 06:19:55,519 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:19:55,526 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2024-10-13 06:19:55,532 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:19:55,535 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 53 [2024-10-13 06:19:55,542 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:19:55,548 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2024-10-13 06:19:55,551 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:19:55,553 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2024-10-13 06:19:55,558 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:19:55,560 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2024-10-13 06:19:55,564 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:19:55,566 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 80 [2024-10-13 06:19:55,571 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:19:55,573 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 86 [2024-10-13 06:19:55,576 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:19:55,577 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 92 [2024-10-13 06:19:55,582 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:19:55,584 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 98 [2024-10-13 06:19:55,586 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:19:55,589 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 104 [2024-10-13 06:19:55,591 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:19:55,594 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 110 [2024-10-13 06:19:55,597 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:19:55,600 INFO L134 CoverageAnalysis]: Checked inductivity of 612 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 612 trivial. 0 not checked. [2024-10-13 06:19:55,600 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-13 06:19:55,600 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1272731311] [2024-10-13 06:19:55,601 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1272731311] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-13 06:19:55,601 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-13 06:19:55,601 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [14] imperfect sequences [] total 14 [2024-10-13 06:19:55,601 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [556359152] [2024-10-13 06:19:55,601 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-13 06:19:55,602 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2024-10-13 06:19:55,602 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-13 06:19:55,603 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2024-10-13 06:19:55,603 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=36, Invalid=146, Unknown=0, NotChecked=0, Total=182 [2024-10-13 06:19:55,603 INFO L87 Difference]: Start difference. First operand 180 states and 248 transitions. Second operand has 14 states, 13 states have (on average 4.153846153846154) internal successors, (54), 13 states have internal predecessors, (54), 3 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 3 states have call predecessors, (18), 3 states have call successors, (18) [2024-10-13 06:19:56,482 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-13 06:19:56,482 INFO L93 Difference]: Finished difference Result 588 states and 810 transitions. [2024-10-13 06:19:56,482 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2024-10-13 06:19:56,483 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 13 states have (on average 4.153846153846154) internal successors, (54), 13 states have internal predecessors, (54), 3 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 3 states have call predecessors, (18), 3 states have call successors, (18) Word has length 141 [2024-10-13 06:19:56,483 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-13 06:19:56,487 INFO L225 Difference]: With dead ends: 588 [2024-10-13 06:19:56,488 INFO L226 Difference]: Without dead ends: 409 [2024-10-13 06:19:56,489 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 60 GetRequests, 39 SyntacticMatches, 0 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 61 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=96, Invalid=410, Unknown=0, NotChecked=0, Total=506 [2024-10-13 06:19:56,490 INFO L432 NwaCegarLoop]: 140 mSDtfsCounter, 226 mSDsluCounter, 1339 mSDsCounter, 0 mSdLazyCounter, 673 mSolverCounterSat, 9 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 226 SdHoareTripleChecker+Valid, 1479 SdHoareTripleChecker+Invalid, 682 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 9 IncrementalHoareTripleChecker+Valid, 673 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2024-10-13 06:19:56,490 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [226 Valid, 1479 Invalid, 682 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [9 Valid, 673 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2024-10-13 06:19:56,491 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 409 states. [2024-10-13 06:19:56,550 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 409 to 402. [2024-10-13 06:19:56,551 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 402 states, 334 states have (on average 1.3203592814371257) internal successors, (441), 337 states have internal predecessors, (441), 58 states have call successors, (58), 9 states have call predecessors, (58), 9 states have return successors, (58), 55 states have call predecessors, (58), 58 states have call successors, (58) [2024-10-13 06:19:56,554 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 402 states to 402 states and 557 transitions. [2024-10-13 06:19:56,554 INFO L78 Accepts]: Start accepts. Automaton has 402 states and 557 transitions. Word has length 141 [2024-10-13 06:19:56,555 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-13 06:19:56,555 INFO L471 AbstractCegarLoop]: Abstraction has 402 states and 557 transitions. [2024-10-13 06:19:56,556 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 13 states have (on average 4.153846153846154) internal successors, (54), 13 states have internal predecessors, (54), 3 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 3 states have call predecessors, (18), 3 states have call successors, (18) [2024-10-13 06:19:56,556 INFO L276 IsEmpty]: Start isEmpty. Operand 402 states and 557 transitions. [2024-10-13 06:19:56,557 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 142 [2024-10-13 06:19:56,558 INFO L207 NwaCegarLoop]: Found error trace [2024-10-13 06:19:56,558 INFO L215 NwaCegarLoop]: trace histogram [18, 18, 18, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-13 06:19:56,558 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2024-10-13 06:19:56,558 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-13 06:19:56,559 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 06:19:56,559 INFO L85 PathProgramCache]: Analyzing trace with hash -685657830, now seen corresponding path program 1 times [2024-10-13 06:19:56,559 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-13 06:19:56,559 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [120533276] [2024-10-13 06:19:56,559 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 06:19:56,559 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-13 06:19:56,656 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:19:57,049 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-13 06:19:57,051 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:19:57,053 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2024-10-13 06:19:57,054 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:19:57,056 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2024-10-13 06:19:57,057 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:19:57,059 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2024-10-13 06:19:57,060 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:19:57,061 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2024-10-13 06:19:57,063 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:19:57,064 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-10-13 06:19:57,065 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:19:57,066 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-10-13 06:19:57,067 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:19:57,069 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2024-10-13 06:19:57,070 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:19:57,072 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 53 [2024-10-13 06:19:57,074 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:19:57,075 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2024-10-13 06:19:57,077 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:19:57,078 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2024-10-13 06:19:57,080 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:19:57,082 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2024-10-13 06:19:57,083 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:19:57,084 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 80 [2024-10-13 06:19:57,086 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:19:57,087 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 86 [2024-10-13 06:19:57,089 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:19:57,091 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 92 [2024-10-13 06:19:57,094 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:19:57,095 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 98 [2024-10-13 06:19:57,097 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:19:57,098 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 104 [2024-10-13 06:19:57,100 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:19:57,102 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 110 [2024-10-13 06:19:57,107 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:19:57,110 INFO L134 CoverageAnalysis]: Checked inductivity of 612 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 612 trivial. 0 not checked. [2024-10-13 06:19:57,114 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-13 06:19:57,114 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [120533276] [2024-10-13 06:19:57,114 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [120533276] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-13 06:19:57,114 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-13 06:19:57,114 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-10-13 06:19:57,115 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [316407362] [2024-10-13 06:19:57,115 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-13 06:19:57,115 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-10-13 06:19:57,116 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-13 06:19:57,116 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-10-13 06:19:57,116 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2024-10-13 06:19:57,116 INFO L87 Difference]: Start difference. First operand 402 states and 557 transitions. Second operand has 6 states, 6 states have (on average 9.0) internal successors, (54), 6 states have internal predecessors, (54), 1 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 1 states have call successors, (18) [2024-10-13 06:19:57,259 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-13 06:19:57,259 INFO L93 Difference]: Finished difference Result 915 states and 1264 transitions. [2024-10-13 06:19:57,260 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-10-13 06:19:57,260 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 9.0) internal successors, (54), 6 states have internal predecessors, (54), 1 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 1 states have call successors, (18) Word has length 141 [2024-10-13 06:19:57,261 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-13 06:19:57,264 INFO L225 Difference]: With dead ends: 915 [2024-10-13 06:19:57,264 INFO L226 Difference]: Without dead ends: 514 [2024-10-13 06:19:57,265 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 44 GetRequests, 39 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2024-10-13 06:19:57,266 INFO L432 NwaCegarLoop]: 147 mSDtfsCounter, 48 mSDsluCounter, 552 mSDsCounter, 0 mSdLazyCounter, 87 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 48 SdHoareTripleChecker+Valid, 699 SdHoareTripleChecker+Invalid, 88 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 87 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-13 06:19:57,266 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [48 Valid, 699 Invalid, 88 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 87 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-13 06:19:57,267 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 514 states. [2024-10-13 06:19:57,308 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 514 to 428. [2024-10-13 06:19:57,309 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 428 states, 360 states have (on average 1.3055555555555556) internal successors, (470), 363 states have internal predecessors, (470), 58 states have call successors, (58), 9 states have call predecessors, (58), 9 states have return successors, (58), 55 states have call predecessors, (58), 58 states have call successors, (58) [2024-10-13 06:19:57,311 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 428 states to 428 states and 586 transitions. [2024-10-13 06:19:57,312 INFO L78 Accepts]: Start accepts. Automaton has 428 states and 586 transitions. Word has length 141 [2024-10-13 06:19:57,313 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-13 06:19:57,313 INFO L471 AbstractCegarLoop]: Abstraction has 428 states and 586 transitions. [2024-10-13 06:19:57,313 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 9.0) internal successors, (54), 6 states have internal predecessors, (54), 1 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 1 states have call successors, (18) [2024-10-13 06:19:57,313 INFO L276 IsEmpty]: Start isEmpty. Operand 428 states and 586 transitions. [2024-10-13 06:19:57,315 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 142 [2024-10-13 06:19:57,315 INFO L207 NwaCegarLoop]: Found error trace [2024-10-13 06:19:57,315 INFO L215 NwaCegarLoop]: trace histogram [18, 18, 18, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-13 06:19:57,315 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2024-10-13 06:19:57,316 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-13 06:19:57,316 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 06:19:57,316 INFO L85 PathProgramCache]: Analyzing trace with hash -1981574562, now seen corresponding path program 1 times [2024-10-13 06:19:57,316 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-13 06:19:57,316 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1027049547] [2024-10-13 06:19:57,316 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 06:19:57,317 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-13 06:19:57,387 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:19:57,732 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-13 06:19:57,734 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:19:57,736 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2024-10-13 06:19:57,737 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:19:57,739 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2024-10-13 06:19:57,740 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:19:57,742 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2024-10-13 06:19:57,743 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:19:57,744 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2024-10-13 06:19:57,746 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:19:57,747 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-10-13 06:19:57,748 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:19:57,749 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-10-13 06:19:57,751 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:19:57,752 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2024-10-13 06:19:57,753 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:19:57,755 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 53 [2024-10-13 06:19:57,756 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:19:57,757 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2024-10-13 06:19:57,759 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:19:57,760 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2024-10-13 06:19:57,761 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:19:57,763 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2024-10-13 06:19:57,764 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:19:57,766 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 80 [2024-10-13 06:19:57,767 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:19:57,768 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 86 [2024-10-13 06:19:57,770 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:19:57,771 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 92 [2024-10-13 06:19:57,772 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:19:57,773 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 98 [2024-10-13 06:19:57,775 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:19:57,776 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 104 [2024-10-13 06:19:57,778 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:19:57,779 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 110 [2024-10-13 06:19:57,781 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:19:57,782 INFO L134 CoverageAnalysis]: Checked inductivity of 612 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 612 trivial. 0 not checked. [2024-10-13 06:19:57,782 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-13 06:19:57,783 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1027049547] [2024-10-13 06:19:57,783 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1027049547] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-13 06:19:57,783 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-13 06:19:57,783 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-10-13 06:19:57,783 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1688274844] [2024-10-13 06:19:57,783 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-13 06:19:57,784 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-10-13 06:19:57,784 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-13 06:19:57,784 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-10-13 06:19:57,785 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2024-10-13 06:19:57,785 INFO L87 Difference]: Start difference. First operand 428 states and 586 transitions. Second operand has 6 states, 6 states have (on average 9.0) internal successors, (54), 6 states have internal predecessors, (54), 1 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 1 states have call successors, (18) [2024-10-13 06:19:57,922 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-13 06:19:57,922 INFO L93 Difference]: Finished difference Result 941 states and 1289 transitions. [2024-10-13 06:19:57,923 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-10-13 06:19:57,923 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 9.0) internal successors, (54), 6 states have internal predecessors, (54), 1 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 1 states have call successors, (18) Word has length 141 [2024-10-13 06:19:57,924 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-13 06:19:57,927 INFO L225 Difference]: With dead ends: 941 [2024-10-13 06:19:57,927 INFO L226 Difference]: Without dead ends: 514 [2024-10-13 06:19:57,928 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 44 GetRequests, 39 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2024-10-13 06:19:57,929 INFO L432 NwaCegarLoop]: 172 mSDtfsCounter, 48 mSDsluCounter, 618 mSDsCounter, 0 mSdLazyCounter, 96 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 48 SdHoareTripleChecker+Valid, 790 SdHoareTripleChecker+Invalid, 96 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 96 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-13 06:19:57,929 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [48 Valid, 790 Invalid, 96 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 96 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-13 06:19:57,930 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 514 states. [2024-10-13 06:19:57,973 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 514 to 428. [2024-10-13 06:19:57,974 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 428 states, 360 states have (on average 1.2944444444444445) internal successors, (466), 363 states have internal predecessors, (466), 58 states have call successors, (58), 9 states have call predecessors, (58), 9 states have return successors, (58), 55 states have call predecessors, (58), 58 states have call successors, (58) [2024-10-13 06:19:57,976 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 428 states to 428 states and 582 transitions. [2024-10-13 06:19:57,977 INFO L78 Accepts]: Start accepts. Automaton has 428 states and 582 transitions. Word has length 141 [2024-10-13 06:19:57,978 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-13 06:19:57,978 INFO L471 AbstractCegarLoop]: Abstraction has 428 states and 582 transitions. [2024-10-13 06:19:57,978 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 9.0) internal successors, (54), 6 states have internal predecessors, (54), 1 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 1 states have call successors, (18) [2024-10-13 06:19:57,978 INFO L276 IsEmpty]: Start isEmpty. Operand 428 states and 582 transitions. [2024-10-13 06:19:57,980 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 142 [2024-10-13 06:19:57,980 INFO L207 NwaCegarLoop]: Found error trace [2024-10-13 06:19:57,980 INFO L215 NwaCegarLoop]: trace histogram [18, 18, 18, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-13 06:19:57,981 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2024-10-13 06:19:57,981 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-13 06:19:57,981 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 06:19:57,981 INFO L85 PathProgramCache]: Analyzing trace with hash 1920365724, now seen corresponding path program 1 times [2024-10-13 06:19:57,982 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-13 06:19:57,982 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1408767410] [2024-10-13 06:19:57,982 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 06:19:57,982 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-13 06:19:58,068 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:19:58,791 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-13 06:19:58,793 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:19:58,795 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2024-10-13 06:19:58,797 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:19:58,799 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2024-10-13 06:19:58,801 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:19:58,803 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2024-10-13 06:19:58,805 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:19:58,807 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2024-10-13 06:19:58,808 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:19:58,810 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-10-13 06:19:58,812 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:19:58,814 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-10-13 06:19:58,816 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:19:58,817 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2024-10-13 06:19:58,819 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:19:58,821 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 53 [2024-10-13 06:19:58,823 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:19:58,825 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2024-10-13 06:19:58,827 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:19:58,829 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2024-10-13 06:19:58,831 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:19:58,833 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2024-10-13 06:19:58,835 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:19:58,838 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 80 [2024-10-13 06:19:58,840 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:19:58,842 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 86 [2024-10-13 06:19:58,844 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:19:58,846 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 92 [2024-10-13 06:19:58,848 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:19:58,849 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 98 [2024-10-13 06:19:58,852 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:19:58,854 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 104 [2024-10-13 06:19:58,856 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:19:58,858 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 110 [2024-10-13 06:19:58,860 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:19:58,863 INFO L134 CoverageAnalysis]: Checked inductivity of 612 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 612 trivial. 0 not checked. [2024-10-13 06:19:58,863 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-13 06:19:58,863 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1408767410] [2024-10-13 06:19:58,864 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1408767410] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-13 06:19:58,864 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-13 06:19:58,864 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2024-10-13 06:19:58,864 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1354203923] [2024-10-13 06:19:58,864 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-13 06:19:58,864 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-10-13 06:19:58,865 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-13 06:19:58,865 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-10-13 06:19:58,865 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=68, Unknown=0, NotChecked=0, Total=90 [2024-10-13 06:19:58,866 INFO L87 Difference]: Start difference. First operand 428 states and 582 transitions. Second operand has 10 states, 10 states have (on average 5.4) internal successors, (54), 10 states have internal predecessors, (54), 1 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 1 states have call successors, (18) [2024-10-13 06:19:59,300 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-13 06:19:59,300 INFO L93 Difference]: Finished difference Result 862 states and 1168 transitions. [2024-10-13 06:19:59,300 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-10-13 06:19:59,301 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 5.4) internal successors, (54), 10 states have internal predecessors, (54), 1 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 1 states have call successors, (18) Word has length 141 [2024-10-13 06:19:59,301 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-13 06:19:59,304 INFO L225 Difference]: With dead ends: 862 [2024-10-13 06:19:59,304 INFO L226 Difference]: Without dead ends: 435 [2024-10-13 06:19:59,305 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 48 GetRequests, 37 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 12 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=39, Invalid=117, Unknown=0, NotChecked=0, Total=156 [2024-10-13 06:19:59,306 INFO L432 NwaCegarLoop]: 172 mSDtfsCounter, 143 mSDsluCounter, 1096 mSDsCounter, 0 mSdLazyCounter, 415 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 143 SdHoareTripleChecker+Valid, 1268 SdHoareTripleChecker+Invalid, 416 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 415 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2024-10-13 06:19:59,306 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [143 Valid, 1268 Invalid, 416 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 415 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2024-10-13 06:19:59,307 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 435 states. [2024-10-13 06:19:59,345 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 435 to 428. [2024-10-13 06:19:59,346 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 428 states, 360 states have (on average 1.2916666666666667) internal successors, (465), 363 states have internal predecessors, (465), 58 states have call successors, (58), 9 states have call predecessors, (58), 9 states have return successors, (58), 55 states have call predecessors, (58), 58 states have call successors, (58) [2024-10-13 06:19:59,348 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 428 states to 428 states and 581 transitions. [2024-10-13 06:19:59,349 INFO L78 Accepts]: Start accepts. Automaton has 428 states and 581 transitions. Word has length 141 [2024-10-13 06:19:59,349 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-13 06:19:59,350 INFO L471 AbstractCegarLoop]: Abstraction has 428 states and 581 transitions. [2024-10-13 06:19:59,350 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 5.4) internal successors, (54), 10 states have internal predecessors, (54), 1 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 1 states have call successors, (18) [2024-10-13 06:19:59,350 INFO L276 IsEmpty]: Start isEmpty. Operand 428 states and 581 transitions. [2024-10-13 06:19:59,352 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 143 [2024-10-13 06:19:59,353 INFO L207 NwaCegarLoop]: Found error trace [2024-10-13 06:19:59,353 INFO L215 NwaCegarLoop]: trace histogram [18, 18, 18, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-13 06:19:59,353 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2024-10-13 06:19:59,353 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-13 06:19:59,354 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 06:19:59,354 INFO L85 PathProgramCache]: Analyzing trace with hash -733823082, now seen corresponding path program 1 times [2024-10-13 06:19:59,354 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-13 06:19:59,354 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [744793462] [2024-10-13 06:19:59,354 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 06:19:59,354 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-13 06:19:59,390 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:19:59,570 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-13 06:19:59,572 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:19:59,574 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2024-10-13 06:19:59,576 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:19:59,578 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2024-10-13 06:19:59,580 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:19:59,581 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2024-10-13 06:19:59,582 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:19:59,584 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2024-10-13 06:19:59,585 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:19:59,587 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-10-13 06:19:59,589 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:19:59,590 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-10-13 06:19:59,592 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:19:59,593 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2024-10-13 06:19:59,594 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:19:59,595 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 53 [2024-10-13 06:19:59,597 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:19:59,598 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2024-10-13 06:19:59,600 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:19:59,601 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2024-10-13 06:19:59,603 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:19:59,605 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2024-10-13 06:19:59,607 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:19:59,609 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 80 [2024-10-13 06:19:59,610 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:19:59,612 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 86 [2024-10-13 06:19:59,613 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:19:59,615 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 92 [2024-10-13 06:19:59,617 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:19:59,619 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 98 [2024-10-13 06:19:59,620 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:19:59,622 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 104 [2024-10-13 06:19:59,624 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:19:59,625 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 110 [2024-10-13 06:19:59,627 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:19:59,629 INFO L134 CoverageAnalysis]: Checked inductivity of 612 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 612 trivial. 0 not checked. [2024-10-13 06:19:59,629 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-13 06:19:59,629 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [744793462] [2024-10-13 06:19:59,629 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [744793462] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-13 06:19:59,629 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-13 06:19:59,630 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-10-13 06:19:59,630 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [774961906] [2024-10-13 06:19:59,630 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-13 06:19:59,630 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-10-13 06:19:59,630 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-13 06:19:59,631 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-10-13 06:19:59,631 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-10-13 06:19:59,631 INFO L87 Difference]: Start difference. First operand 428 states and 581 transitions. Second operand has 5 states, 5 states have (on average 11.0) internal successors, (55), 5 states have internal predecessors, (55), 1 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 1 states have call successors, (18) [2024-10-13 06:19:59,710 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-13 06:19:59,710 INFO L93 Difference]: Finished difference Result 870 states and 1181 transitions. [2024-10-13 06:19:59,711 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-10-13 06:19:59,711 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 11.0) internal successors, (55), 5 states have internal predecessors, (55), 1 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 1 states have call successors, (18) Word has length 142 [2024-10-13 06:19:59,712 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-13 06:19:59,716 INFO L225 Difference]: With dead ends: 870 [2024-10-13 06:19:59,716 INFO L226 Difference]: Without dead ends: 443 [2024-10-13 06:19:59,717 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 42 GetRequests, 39 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-10-13 06:19:59,718 INFO L432 NwaCegarLoop]: 139 mSDtfsCounter, 0 mSDsluCounter, 407 mSDsCounter, 0 mSdLazyCounter, 37 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 546 SdHoareTripleChecker+Invalid, 37 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 37 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-13 06:19:59,719 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 546 Invalid, 37 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 37 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-13 06:19:59,720 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 443 states. [2024-10-13 06:19:59,764 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 443 to 443. [2024-10-13 06:19:59,765 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 443 states, 375 states have (on average 1.28) internal successors, (480), 378 states have internal predecessors, (480), 58 states have call successors, (58), 9 states have call predecessors, (58), 9 states have return successors, (58), 55 states have call predecessors, (58), 58 states have call successors, (58) [2024-10-13 06:19:59,767 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 443 states to 443 states and 596 transitions. [2024-10-13 06:19:59,790 INFO L78 Accepts]: Start accepts. Automaton has 443 states and 596 transitions. Word has length 142 [2024-10-13 06:19:59,791 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-13 06:19:59,791 INFO L471 AbstractCegarLoop]: Abstraction has 443 states and 596 transitions. [2024-10-13 06:19:59,791 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 11.0) internal successors, (55), 5 states have internal predecessors, (55), 1 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 1 states have call successors, (18) [2024-10-13 06:19:59,791 INFO L276 IsEmpty]: Start isEmpty. Operand 443 states and 596 transitions. [2024-10-13 06:19:59,793 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 143 [2024-10-13 06:19:59,793 INFO L207 NwaCegarLoop]: Found error trace [2024-10-13 06:19:59,794 INFO L215 NwaCegarLoop]: trace histogram [18, 18, 18, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-13 06:19:59,794 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2024-10-13 06:19:59,794 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-13 06:19:59,794 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 06:19:59,795 INFO L85 PathProgramCache]: Analyzing trace with hash 408792204, now seen corresponding path program 1 times [2024-10-13 06:19:59,795 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-13 06:19:59,795 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [968937018] [2024-10-13 06:19:59,795 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 06:19:59,795 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-13 06:19:59,843 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:20:00,058 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-13 06:20:00,060 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:20:00,063 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2024-10-13 06:20:00,066 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:20:00,068 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2024-10-13 06:20:00,070 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:20:00,071 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2024-10-13 06:20:00,073 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:20:00,074 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2024-10-13 06:20:00,076 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:20:00,077 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-10-13 06:20:00,079 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:20:00,080 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-10-13 06:20:00,082 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:20:00,083 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2024-10-13 06:20:00,084 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:20:00,086 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 53 [2024-10-13 06:20:00,088 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:20:00,091 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2024-10-13 06:20:00,093 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:20:00,094 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2024-10-13 06:20:00,096 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:20:00,098 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2024-10-13 06:20:00,100 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:20:00,101 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 80 [2024-10-13 06:20:00,103 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:20:00,106 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 86 [2024-10-13 06:20:00,108 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:20:00,110 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 92 [2024-10-13 06:20:00,113 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:20:00,115 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 98 [2024-10-13 06:20:00,117 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:20:00,118 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 104 [2024-10-13 06:20:00,121 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:20:00,123 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 110 [2024-10-13 06:20:00,125 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:20:00,127 INFO L134 CoverageAnalysis]: Checked inductivity of 612 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 612 trivial. 0 not checked. [2024-10-13 06:20:00,127 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-13 06:20:00,127 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [968937018] [2024-10-13 06:20:00,127 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [968937018] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-13 06:20:00,127 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-13 06:20:00,128 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-10-13 06:20:00,128 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1665892674] [2024-10-13 06:20:00,128 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-13 06:20:00,128 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-10-13 06:20:00,128 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-13 06:20:00,129 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-10-13 06:20:00,131 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2024-10-13 06:20:00,131 INFO L87 Difference]: Start difference. First operand 443 states and 596 transitions. Second operand has 6 states, 6 states have (on average 9.166666666666666) internal successors, (55), 6 states have internal predecessors, (55), 1 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 1 states have call successors, (18) [2024-10-13 06:20:00,227 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-13 06:20:00,228 INFO L93 Difference]: Finished difference Result 905 states and 1216 transitions. [2024-10-13 06:20:00,229 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-10-13 06:20:00,229 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 9.166666666666666) internal successors, (55), 6 states have internal predecessors, (55), 1 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 1 states have call successors, (18) Word has length 142 [2024-10-13 06:20:00,229 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-13 06:20:00,235 INFO L225 Difference]: With dead ends: 905 [2024-10-13 06:20:00,235 INFO L226 Difference]: Without dead ends: 463 [2024-10-13 06:20:00,237 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 43 GetRequests, 39 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2024-10-13 06:20:00,237 INFO L432 NwaCegarLoop]: 141 mSDtfsCounter, 0 mSDsluCounter, 547 mSDsCounter, 0 mSdLazyCounter, 54 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 688 SdHoareTripleChecker+Invalid, 54 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 54 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-13 06:20:00,238 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 688 Invalid, 54 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 54 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-13 06:20:00,239 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 463 states. [2024-10-13 06:20:00,297 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 463 to 457. [2024-10-13 06:20:00,298 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 457 states, 389 states have (on average 1.2699228791773778) internal successors, (494), 392 states have internal predecessors, (494), 58 states have call successors, (58), 9 states have call predecessors, (58), 9 states have return successors, (58), 55 states have call predecessors, (58), 58 states have call successors, (58) [2024-10-13 06:20:00,301 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 457 states to 457 states and 610 transitions. [2024-10-13 06:20:00,302 INFO L78 Accepts]: Start accepts. Automaton has 457 states and 610 transitions. Word has length 142 [2024-10-13 06:20:00,302 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-13 06:20:00,302 INFO L471 AbstractCegarLoop]: Abstraction has 457 states and 610 transitions. [2024-10-13 06:20:00,303 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 9.166666666666666) internal successors, (55), 6 states have internal predecessors, (55), 1 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 1 states have call successors, (18) [2024-10-13 06:20:00,303 INFO L276 IsEmpty]: Start isEmpty. Operand 457 states and 610 transitions. [2024-10-13 06:20:00,306 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 144 [2024-10-13 06:20:00,306 INFO L207 NwaCegarLoop]: Found error trace [2024-10-13 06:20:00,306 INFO L215 NwaCegarLoop]: trace histogram [18, 18, 18, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-13 06:20:00,307 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2024-10-13 06:20:00,307 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-13 06:20:00,307 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 06:20:00,308 INFO L85 PathProgramCache]: Analyzing trace with hash -555710091, now seen corresponding path program 1 times [2024-10-13 06:20:00,308 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-13 06:20:00,308 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [491728481] [2024-10-13 06:20:00,308 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 06:20:00,308 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-13 06:20:00,468 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:20:02,041 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-13 06:20:02,043 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:20:02,048 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2024-10-13 06:20:02,051 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:20:02,054 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2024-10-13 06:20:02,056 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:20:02,059 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2024-10-13 06:20:02,060 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:20:02,062 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2024-10-13 06:20:02,063 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:20:02,064 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-10-13 06:20:02,065 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:20:02,068 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-10-13 06:20:02,069 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:20:02,070 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2024-10-13 06:20:02,072 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:20:02,073 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 53 [2024-10-13 06:20:02,076 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:20:02,078 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2024-10-13 06:20:02,079 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:20:02,081 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2024-10-13 06:20:02,082 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:20:02,084 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2024-10-13 06:20:02,085 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:20:02,086 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 80 [2024-10-13 06:20:02,088 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:20:02,089 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 86 [2024-10-13 06:20:02,091 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:20:02,092 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 92 [2024-10-13 06:20:02,093 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:20:02,094 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 98 [2024-10-13 06:20:02,096 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:20:02,098 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 104 [2024-10-13 06:20:02,100 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:20:02,102 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 110 [2024-10-13 06:20:02,104 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:20:02,106 INFO L134 CoverageAnalysis]: Checked inductivity of 612 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 612 trivial. 0 not checked. [2024-10-13 06:20:02,108 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-13 06:20:02,109 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [491728481] [2024-10-13 06:20:02,109 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [491728481] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-13 06:20:02,109 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-13 06:20:02,109 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [15] imperfect sequences [] total 15 [2024-10-13 06:20:02,109 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [849493968] [2024-10-13 06:20:02,109 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-13 06:20:02,110 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 15 states [2024-10-13 06:20:02,110 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-13 06:20:02,111 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2024-10-13 06:20:02,111 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=32, Invalid=178, Unknown=0, NotChecked=0, Total=210 [2024-10-13 06:20:02,111 INFO L87 Difference]: Start difference. First operand 457 states and 610 transitions. Second operand has 15 states, 14 states have (on average 4.0) internal successors, (56), 14 states have internal predecessors, (56), 3 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 3 states have call predecessors, (18), 3 states have call successors, (18) [2024-10-13 06:20:03,451 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-13 06:20:03,452 INFO L93 Difference]: Finished difference Result 711 states and 946 transitions. [2024-10-13 06:20:03,452 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2024-10-13 06:20:03,453 INFO L78 Accepts]: Start accepts. Automaton has has 15 states, 14 states have (on average 4.0) internal successors, (56), 14 states have internal predecessors, (56), 3 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 3 states have call predecessors, (18), 3 states have call successors, (18) Word has length 143 [2024-10-13 06:20:03,453 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-13 06:20:03,456 INFO L225 Difference]: With dead ends: 711 [2024-10-13 06:20:03,456 INFO L226 Difference]: Without dead ends: 501 [2024-10-13 06:20:03,458 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 65 GetRequests, 41 SyntacticMatches, 0 SemanticMatches, 24 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 68 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=113, Invalid=537, Unknown=0, NotChecked=0, Total=650 [2024-10-13 06:20:03,458 INFO L432 NwaCegarLoop]: 153 mSDtfsCounter, 295 mSDsluCounter, 1212 mSDsCounter, 0 mSdLazyCounter, 658 mSolverCounterSat, 83 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 295 SdHoareTripleChecker+Valid, 1365 SdHoareTripleChecker+Invalid, 741 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 83 IncrementalHoareTripleChecker+Valid, 658 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2024-10-13 06:20:03,459 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [295 Valid, 1365 Invalid, 741 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [83 Valid, 658 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2024-10-13 06:20:03,459 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 501 states. [2024-10-13 06:20:03,501 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 501 to 497. [2024-10-13 06:20:03,502 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 497 states, 426 states have (on average 1.2699530516431925) internal successors, (541), 430 states have internal predecessors, (541), 60 states have call successors, (60), 10 states have call predecessors, (60), 10 states have return successors, (60), 56 states have call predecessors, (60), 60 states have call successors, (60) [2024-10-13 06:20:03,504 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 497 states to 497 states and 661 transitions. [2024-10-13 06:20:03,505 INFO L78 Accepts]: Start accepts. Automaton has 497 states and 661 transitions. Word has length 143 [2024-10-13 06:20:03,506 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-13 06:20:03,506 INFO L471 AbstractCegarLoop]: Abstraction has 497 states and 661 transitions. [2024-10-13 06:20:03,506 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 15 states, 14 states have (on average 4.0) internal successors, (56), 14 states have internal predecessors, (56), 3 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 3 states have call predecessors, (18), 3 states have call successors, (18) [2024-10-13 06:20:03,506 INFO L276 IsEmpty]: Start isEmpty. Operand 497 states and 661 transitions. [2024-10-13 06:20:03,508 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 144 [2024-10-13 06:20:03,508 INFO L207 NwaCegarLoop]: Found error trace [2024-10-13 06:20:03,508 INFO L215 NwaCegarLoop]: trace histogram [18, 18, 18, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-13 06:20:03,509 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2024-10-13 06:20:03,509 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-13 06:20:03,509 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 06:20:03,509 INFO L85 PathProgramCache]: Analyzing trace with hash 1657286453, now seen corresponding path program 1 times [2024-10-13 06:20:03,509 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-13 06:20:03,510 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [389172963] [2024-10-13 06:20:03,510 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 06:20:03,510 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-13 06:20:03,627 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:20:04,225 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-13 06:20:04,226 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:20:04,228 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2024-10-13 06:20:04,229 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:20:04,230 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2024-10-13 06:20:04,231 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:20:04,235 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2024-10-13 06:20:04,236 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:20:04,238 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2024-10-13 06:20:04,243 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:20:04,245 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-10-13 06:20:04,246 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:20:04,247 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-10-13 06:20:04,249 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:20:04,250 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2024-10-13 06:20:04,251 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:20:04,252 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 53 [2024-10-13 06:20:04,254 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:20:04,255 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2024-10-13 06:20:04,256 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:20:04,257 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2024-10-13 06:20:04,258 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:20:04,259 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2024-10-13 06:20:04,262 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:20:04,264 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 80 [2024-10-13 06:20:04,267 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:20:04,269 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 86 [2024-10-13 06:20:04,270 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:20:04,272 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 92 [2024-10-13 06:20:04,273 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:20:04,274 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 98 [2024-10-13 06:20:04,275 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:20:04,276 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 104 [2024-10-13 06:20:04,278 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:20:04,279 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 110 [2024-10-13 06:20:04,280 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:20:04,282 INFO L134 CoverageAnalysis]: Checked inductivity of 612 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 612 trivial. 0 not checked. [2024-10-13 06:20:04,283 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-13 06:20:04,283 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [389172963] [2024-10-13 06:20:04,283 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [389172963] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-13 06:20:04,283 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-13 06:20:04,283 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-10-13 06:20:04,283 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [700905531] [2024-10-13 06:20:04,284 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-13 06:20:04,284 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-10-13 06:20:04,284 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-13 06:20:04,285 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-10-13 06:20:04,285 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2024-10-13 06:20:04,286 INFO L87 Difference]: Start difference. First operand 497 states and 661 transitions. Second operand has 8 states, 8 states have (on average 7.0) internal successors, (56), 8 states have internal predecessors, (56), 1 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 1 states have call successors, (18) [2024-10-13 06:20:04,591 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-13 06:20:04,592 INFO L93 Difference]: Finished difference Result 750 states and 995 transitions. [2024-10-13 06:20:04,592 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-10-13 06:20:04,593 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 7.0) internal successors, (56), 8 states have internal predecessors, (56), 1 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 1 states have call successors, (18) Word has length 143 [2024-10-13 06:20:04,593 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-13 06:20:04,596 INFO L225 Difference]: With dead ends: 750 [2024-10-13 06:20:04,597 INFO L226 Difference]: Without dead ends: 500 [2024-10-13 06:20:04,599 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 47 GetRequests, 38 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=27, Invalid=83, Unknown=0, NotChecked=0, Total=110 [2024-10-13 06:20:04,600 INFO L432 NwaCegarLoop]: 181 mSDtfsCounter, 50 mSDsluCounter, 981 mSDsCounter, 0 mSdLazyCounter, 175 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 50 SdHoareTripleChecker+Valid, 1162 SdHoareTripleChecker+Invalid, 176 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 175 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-10-13 06:20:04,600 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [50 Valid, 1162 Invalid, 176 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 175 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-10-13 06:20:04,601 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 500 states. [2024-10-13 06:20:04,628 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 500 to 251. [2024-10-13 06:20:04,629 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 251 states, 215 states have (on average 1.2651162790697674) internal successors, (272), 217 states have internal predecessors, (272), 30 states have call successors, (30), 5 states have call predecessors, (30), 5 states have return successors, (30), 28 states have call predecessors, (30), 30 states have call successors, (30) [2024-10-13 06:20:04,631 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 251 states to 251 states and 332 transitions. [2024-10-13 06:20:04,632 INFO L78 Accepts]: Start accepts. Automaton has 251 states and 332 transitions. Word has length 143 [2024-10-13 06:20:04,632 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-13 06:20:04,633 INFO L471 AbstractCegarLoop]: Abstraction has 251 states and 332 transitions. [2024-10-13 06:20:04,633 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 7.0) internal successors, (56), 8 states have internal predecessors, (56), 1 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 1 states have call successors, (18) [2024-10-13 06:20:04,633 INFO L276 IsEmpty]: Start isEmpty. Operand 251 states and 332 transitions. [2024-10-13 06:20:04,635 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 145 [2024-10-13 06:20:04,635 INFO L207 NwaCegarLoop]: Found error trace [2024-10-13 06:20:04,636 INFO L215 NwaCegarLoop]: trace histogram [18, 18, 18, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-13 06:20:04,636 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2024-10-13 06:20:04,636 INFO L396 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-13 06:20:04,637 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 06:20:04,637 INFO L85 PathProgramCache]: Analyzing trace with hash 1444241647, now seen corresponding path program 1 times [2024-10-13 06:20:04,637 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-13 06:20:04,637 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1956943965] [2024-10-13 06:20:04,637 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 06:20:04,637 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-13 06:20:04,732 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:20:05,093 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-13 06:20:05,095 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:20:05,097 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2024-10-13 06:20:05,098 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:20:05,100 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2024-10-13 06:20:05,101 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:20:05,102 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2024-10-13 06:20:05,103 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:20:05,104 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2024-10-13 06:20:05,105 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:20:05,106 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-10-13 06:20:05,107 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:20:05,109 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-10-13 06:20:05,111 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:20:05,112 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2024-10-13 06:20:05,113 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:20:05,114 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 53 [2024-10-13 06:20:05,116 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:20:05,116 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2024-10-13 06:20:05,119 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:20:05,120 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2024-10-13 06:20:05,122 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:20:05,123 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2024-10-13 06:20:05,124 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:20:05,125 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 80 [2024-10-13 06:20:05,127 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:20:05,129 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 86 [2024-10-13 06:20:05,131 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:20:05,131 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 92 [2024-10-13 06:20:05,133 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:20:05,134 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 98 [2024-10-13 06:20:05,135 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:20:05,136 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 104 [2024-10-13 06:20:05,137 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:20:05,138 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 110 [2024-10-13 06:20:05,140 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:20:05,141 INFO L134 CoverageAnalysis]: Checked inductivity of 612 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 612 trivial. 0 not checked. [2024-10-13 06:20:05,141 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-13 06:20:05,142 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1956943965] [2024-10-13 06:20:05,143 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1956943965] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-13 06:20:05,144 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-13 06:20:05,144 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-10-13 06:20:05,144 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2053897890] [2024-10-13 06:20:05,144 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-13 06:20:05,145 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-10-13 06:20:05,145 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-13 06:20:05,145 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-10-13 06:20:05,145 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-10-13 06:20:05,146 INFO L87 Difference]: Start difference. First operand 251 states and 332 transitions. Second operand has 5 states, 5 states have (on average 11.4) internal successors, (57), 5 states have internal predecessors, (57), 1 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 1 states have call successors, (18) [2024-10-13 06:20:05,288 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-13 06:20:05,288 INFO L93 Difference]: Finished difference Result 664 states and 872 transitions. [2024-10-13 06:20:05,289 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-10-13 06:20:05,289 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 11.4) internal successors, (57), 5 states have internal predecessors, (57), 1 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 1 states have call successors, (18) Word has length 144 [2024-10-13 06:20:05,289 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-13 06:20:05,292 INFO L225 Difference]: With dead ends: 664 [2024-10-13 06:20:05,292 INFO L226 Difference]: Without dead ends: 414 [2024-10-13 06:20:05,293 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 42 GetRequests, 38 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-10-13 06:20:05,294 INFO L432 NwaCegarLoop]: 140 mSDtfsCounter, 56 mSDsluCounter, 396 mSDsCounter, 0 mSdLazyCounter, 77 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 56 SdHoareTripleChecker+Valid, 536 SdHoareTripleChecker+Invalid, 77 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 77 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-13 06:20:05,294 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [56 Valid, 536 Invalid, 77 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 77 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-13 06:20:05,295 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 414 states. [2024-10-13 06:20:05,324 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 414 to 353. [2024-10-13 06:20:05,325 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 353 states, 314 states have (on average 1.2707006369426752) internal successors, (399), 317 states have internal predecessors, (399), 32 states have call successors, (32), 6 states have call predecessors, (32), 6 states have return successors, (32), 29 states have call predecessors, (32), 32 states have call successors, (32) [2024-10-13 06:20:05,328 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 353 states to 353 states and 463 transitions. [2024-10-13 06:20:05,329 INFO L78 Accepts]: Start accepts. Automaton has 353 states and 463 transitions. Word has length 144 [2024-10-13 06:20:05,330 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-13 06:20:05,330 INFO L471 AbstractCegarLoop]: Abstraction has 353 states and 463 transitions. [2024-10-13 06:20:05,330 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 11.4) internal successors, (57), 5 states have internal predecessors, (57), 1 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 1 states have call successors, (18) [2024-10-13 06:20:05,330 INFO L276 IsEmpty]: Start isEmpty. Operand 353 states and 463 transitions. [2024-10-13 06:20:05,332 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 145 [2024-10-13 06:20:05,332 INFO L207 NwaCegarLoop]: Found error trace [2024-10-13 06:20:05,332 INFO L215 NwaCegarLoop]: trace histogram [18, 18, 18, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-13 06:20:05,333 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2024-10-13 06:20:05,333 INFO L396 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-13 06:20:05,333 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 06:20:05,333 INFO L85 PathProgramCache]: Analyzing trace with hash -1355038757, now seen corresponding path program 1 times [2024-10-13 06:20:05,333 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-13 06:20:05,334 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [231532358] [2024-10-13 06:20:05,334 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 06:20:05,334 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-13 06:20:05,455 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:20:06,297 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-13 06:20:06,298 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:20:06,300 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2024-10-13 06:20:06,302 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:20:06,303 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2024-10-13 06:20:06,304 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:20:06,306 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2024-10-13 06:20:06,307 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:20:06,308 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2024-10-13 06:20:06,309 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:20:06,310 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-10-13 06:20:06,311 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:20:06,312 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-10-13 06:20:06,313 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:20:06,314 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2024-10-13 06:20:06,315 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:20:06,316 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 53 [2024-10-13 06:20:06,317 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:20:06,317 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2024-10-13 06:20:06,318 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:20:06,319 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2024-10-13 06:20:06,320 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:20:06,323 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2024-10-13 06:20:06,325 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:20:06,327 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 80 [2024-10-13 06:20:06,328 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:20:06,330 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 86 [2024-10-13 06:20:06,331 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:20:06,332 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 92 [2024-10-13 06:20:06,333 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:20:06,334 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 98 [2024-10-13 06:20:06,336 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:20:06,337 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 104 [2024-10-13 06:20:06,339 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:20:06,344 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 110 [2024-10-13 06:20:06,346 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:20:06,350 INFO L134 CoverageAnalysis]: Checked inductivity of 612 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 612 trivial. 0 not checked. [2024-10-13 06:20:06,350 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-13 06:20:06,350 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [231532358] [2024-10-13 06:20:06,350 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [231532358] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-13 06:20:06,350 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-13 06:20:06,351 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-10-13 06:20:06,351 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1240639989] [2024-10-13 06:20:06,351 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-13 06:20:06,351 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-10-13 06:20:06,351 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-13 06:20:06,352 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-10-13 06:20:06,352 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2024-10-13 06:20:06,352 INFO L87 Difference]: Start difference. First operand 353 states and 463 transitions. Second operand has 6 states, 6 states have (on average 9.5) internal successors, (57), 6 states have internal predecessors, (57), 1 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 1 states have call successors, (18) [2024-10-13 06:20:06,526 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-13 06:20:06,526 INFO L93 Difference]: Finished difference Result 692 states and 902 transitions. [2024-10-13 06:20:06,527 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-10-13 06:20:06,527 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 9.5) internal successors, (57), 6 states have internal predecessors, (57), 1 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 1 states have call successors, (18) Word has length 144 [2024-10-13 06:20:06,527 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-13 06:20:06,531 INFO L225 Difference]: With dead ends: 692 [2024-10-13 06:20:06,531 INFO L226 Difference]: Without dead ends: 690 [2024-10-13 06:20:06,532 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 45 GetRequests, 38 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=21, Invalid=51, Unknown=0, NotChecked=0, Total=72 [2024-10-13 06:20:06,532 INFO L432 NwaCegarLoop]: 182 mSDtfsCounter, 93 mSDsluCounter, 669 mSDsCounter, 0 mSdLazyCounter, 79 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 93 SdHoareTripleChecker+Valid, 851 SdHoareTripleChecker+Invalid, 79 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 79 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-13 06:20:06,532 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [93 Valid, 851 Invalid, 79 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 79 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-13 06:20:06,533 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 690 states. [2024-10-13 06:20:06,569 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 690 to 518. [2024-10-13 06:20:06,571 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 518 states, 479 states have (on average 1.2713987473903967) internal successors, (609), 482 states have internal predecessors, (609), 32 states have call successors, (32), 6 states have call predecessors, (32), 6 states have return successors, (32), 29 states have call predecessors, (32), 32 states have call successors, (32) [2024-10-13 06:20:06,573 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 518 states to 518 states and 673 transitions. [2024-10-13 06:20:06,574 INFO L78 Accepts]: Start accepts. Automaton has 518 states and 673 transitions. Word has length 144 [2024-10-13 06:20:06,574 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-13 06:20:06,574 INFO L471 AbstractCegarLoop]: Abstraction has 518 states and 673 transitions. [2024-10-13 06:20:06,574 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 9.5) internal successors, (57), 6 states have internal predecessors, (57), 1 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 1 states have call successors, (18) [2024-10-13 06:20:06,575 INFO L276 IsEmpty]: Start isEmpty. Operand 518 states and 673 transitions. [2024-10-13 06:20:06,576 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 145 [2024-10-13 06:20:06,576 INFO L207 NwaCegarLoop]: Found error trace [2024-10-13 06:20:06,577 INFO L215 NwaCegarLoop]: trace histogram [18, 18, 18, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-13 06:20:06,577 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2024-10-13 06:20:06,577 INFO L396 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-13 06:20:06,577 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 06:20:06,577 INFO L85 PathProgramCache]: Analyzing trace with hash 815036033, now seen corresponding path program 1 times [2024-10-13 06:20:06,578 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-13 06:20:06,578 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1615997500] [2024-10-13 06:20:06,578 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 06:20:06,578 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-13 06:20:06,611 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:20:06,883 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-13 06:20:06,885 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:20:06,886 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2024-10-13 06:20:06,888 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:20:06,889 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2024-10-13 06:20:06,890 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:20:06,892 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2024-10-13 06:20:06,893 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:20:06,894 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2024-10-13 06:20:06,896 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:20:06,897 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-10-13 06:20:06,897 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:20:06,899 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-10-13 06:20:06,900 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:20:06,901 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2024-10-13 06:20:06,902 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:20:06,903 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 53 [2024-10-13 06:20:06,904 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:20:06,905 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2024-10-13 06:20:06,906 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:20:06,909 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2024-10-13 06:20:06,910 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:20:06,911 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2024-10-13 06:20:06,913 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:20:06,914 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 80 [2024-10-13 06:20:06,915 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:20:06,916 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 86 [2024-10-13 06:20:06,918 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:20:06,919 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 92 [2024-10-13 06:20:06,920 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:20:06,921 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 98 [2024-10-13 06:20:06,922 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:20:06,923 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 104 [2024-10-13 06:20:06,924 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:20:06,925 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 110 [2024-10-13 06:20:06,926 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:20:06,928 INFO L134 CoverageAnalysis]: Checked inductivity of 612 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 612 trivial. 0 not checked. [2024-10-13 06:20:06,928 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-13 06:20:06,928 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1615997500] [2024-10-13 06:20:06,928 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1615997500] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-13 06:20:06,928 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-13 06:20:06,929 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-10-13 06:20:06,929 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1477931195] [2024-10-13 06:20:06,929 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-13 06:20:06,930 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-10-13 06:20:06,931 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-13 06:20:06,931 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-10-13 06:20:06,931 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2024-10-13 06:20:06,931 INFO L87 Difference]: Start difference. First operand 518 states and 673 transitions. Second operand has 7 states, 7 states have (on average 8.142857142857142) internal successors, (57), 7 states have internal predecessors, (57), 1 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 1 states have call successors, (18) [2024-10-13 06:20:07,025 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-13 06:20:07,025 INFO L93 Difference]: Finished difference Result 1087 states and 1405 transitions. [2024-10-13 06:20:07,026 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-10-13 06:20:07,026 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 8.142857142857142) internal successors, (57), 7 states have internal predecessors, (57), 1 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 1 states have call successors, (18) Word has length 144 [2024-10-13 06:20:07,026 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-13 06:20:07,029 INFO L225 Difference]: With dead ends: 1087 [2024-10-13 06:20:07,029 INFO L226 Difference]: Without dead ends: 570 [2024-10-13 06:20:07,031 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 44 GetRequests, 39 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2024-10-13 06:20:07,031 INFO L432 NwaCegarLoop]: 140 mSDtfsCounter, 0 mSDsluCounter, 681 mSDsCounter, 0 mSdLazyCounter, 69 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 821 SdHoareTripleChecker+Invalid, 70 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 69 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-13 06:20:07,033 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 821 Invalid, 70 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 69 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-13 06:20:07,034 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 570 states. [2024-10-13 06:20:07,068 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 570 to 526. [2024-10-13 06:20:07,070 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 526 states, 487 states have (on average 1.26694045174538) internal successors, (617), 490 states have internal predecessors, (617), 32 states have call successors, (32), 6 states have call predecessors, (32), 6 states have return successors, (32), 29 states have call predecessors, (32), 32 states have call successors, (32) [2024-10-13 06:20:07,072 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 526 states to 526 states and 681 transitions. [2024-10-13 06:20:07,073 INFO L78 Accepts]: Start accepts. Automaton has 526 states and 681 transitions. Word has length 144 [2024-10-13 06:20:07,073 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-13 06:20:07,074 INFO L471 AbstractCegarLoop]: Abstraction has 526 states and 681 transitions. [2024-10-13 06:20:07,074 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 8.142857142857142) internal successors, (57), 7 states have internal predecessors, (57), 1 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 1 states have call successors, (18) [2024-10-13 06:20:07,074 INFO L276 IsEmpty]: Start isEmpty. Operand 526 states and 681 transitions. [2024-10-13 06:20:07,077 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 147 [2024-10-13 06:20:07,077 INFO L207 NwaCegarLoop]: Found error trace [2024-10-13 06:20:07,078 INFO L215 NwaCegarLoop]: trace histogram [18, 18, 18, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-13 06:20:07,078 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2024-10-13 06:20:07,078 INFO L396 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-13 06:20:07,078 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 06:20:07,078 INFO L85 PathProgramCache]: Analyzing trace with hash 726762273, now seen corresponding path program 1 times [2024-10-13 06:20:07,078 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-13 06:20:07,079 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1616568518] [2024-10-13 06:20:07,079 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 06:20:07,079 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-13 06:20:07,174 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:20:07,810 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-13 06:20:07,812 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:20:07,815 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2024-10-13 06:20:07,816 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:20:07,819 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2024-10-13 06:20:07,822 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:20:07,858 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2024-10-13 06:20:07,860 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:20:07,864 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2024-10-13 06:20:07,867 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:20:07,869 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-10-13 06:20:07,871 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:20:07,873 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-10-13 06:20:07,875 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:20:07,877 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2024-10-13 06:20:07,879 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:20:07,884 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 53 [2024-10-13 06:20:07,887 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:20:07,889 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2024-10-13 06:20:07,892 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:20:07,894 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2024-10-13 06:20:07,897 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:20:07,901 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2024-10-13 06:20:07,903 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:20:07,905 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 80 [2024-10-13 06:20:07,908 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:20:07,911 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 86 [2024-10-13 06:20:07,913 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:20:07,916 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 92 [2024-10-13 06:20:07,918 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:20:07,920 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 98 [2024-10-13 06:20:07,923 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:20:07,925 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 104 [2024-10-13 06:20:07,928 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:20:07,930 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 110 [2024-10-13 06:20:07,933 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:20:07,936 INFO L134 CoverageAnalysis]: Checked inductivity of 612 backedges. 6 proven. 45 refuted. 0 times theorem prover too weak. 561 trivial. 0 not checked. [2024-10-13 06:20:07,936 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-13 06:20:07,936 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1616568518] [2024-10-13 06:20:07,936 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1616568518] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-13 06:20:07,937 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1329992379] [2024-10-13 06:20:07,937 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 06:20:07,937 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-13 06:20:07,937 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-13 06:20:07,939 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-10-13 06:20:07,941 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2024-10-13 06:20:08,389 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:20:08,402 INFO L255 TraceCheckSpWp]: Trace formula consists of 673 conjuncts, 48 conjuncts are in the unsatisfiable core [2024-10-13 06:20:08,435 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-13 06:20:08,724 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 3 [2024-10-13 06:20:09,646 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 1 [2024-10-13 06:20:10,076 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 14 [2024-10-13 06:20:10,125 INFO L134 CoverageAnalysis]: Checked inductivity of 612 backedges. 6 proven. 430 refuted. 0 times theorem prover too weak. 176 trivial. 0 not checked. [2024-10-13 06:20:10,128 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-13 06:20:10,591 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 32 treesize of output 28 [2024-10-13 06:20:11,206 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1329992379] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-13 06:20:11,207 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-10-13 06:20:11,207 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 16] total 28 [2024-10-13 06:20:11,207 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1665888317] [2024-10-13 06:20:11,207 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-10-13 06:20:11,209 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 28 states [2024-10-13 06:20:11,209 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-13 06:20:11,210 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 28 interpolants. [2024-10-13 06:20:11,211 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=325, Invalid=1481, Unknown=0, NotChecked=0, Total=1806 [2024-10-13 06:20:11,212 INFO L87 Difference]: Start difference. First operand 526 states and 681 transitions. Second operand has 28 states, 25 states have (on average 4.76) internal successors, (119), 24 states have internal predecessors, (119), 8 states have call successors, (36), 6 states have call predecessors, (36), 7 states have return successors, (36), 7 states have call predecessors, (36), 8 states have call successors, (36) [2024-10-13 06:20:12,741 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-13 06:20:12,741 INFO L93 Difference]: Finished difference Result 1058 states and 1365 transitions. [2024-10-13 06:20:12,742 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 26 states. [2024-10-13 06:20:12,742 INFO L78 Accepts]: Start accepts. Automaton has has 28 states, 25 states have (on average 4.76) internal successors, (119), 24 states have internal predecessors, (119), 8 states have call successors, (36), 6 states have call predecessors, (36), 7 states have return successors, (36), 7 states have call predecessors, (36), 8 states have call successors, (36) Word has length 146 [2024-10-13 06:20:12,743 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-13 06:20:12,745 INFO L225 Difference]: With dead ends: 1058 [2024-10-13 06:20:12,746 INFO L226 Difference]: Without dead ends: 533 [2024-10-13 06:20:12,749 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 346 GetRequests, 287 SyntacticMatches, 0 SemanticMatches, 59 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 893 ImplicationChecksByTransitivity, 1.8s TimeCoverageRelationStatistics Valid=764, Invalid=2896, Unknown=0, NotChecked=0, Total=3660 [2024-10-13 06:20:12,749 INFO L432 NwaCegarLoop]: 99 mSDtfsCounter, 764 mSDsluCounter, 1082 mSDsCounter, 0 mSdLazyCounter, 867 mSolverCounterSat, 189 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 765 SdHoareTripleChecker+Valid, 1181 SdHoareTripleChecker+Invalid, 1056 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 189 IncrementalHoareTripleChecker+Valid, 867 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time [2024-10-13 06:20:12,750 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [765 Valid, 1181 Invalid, 1056 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [189 Valid, 867 Invalid, 0 Unknown, 0 Unchecked, 0.8s Time] [2024-10-13 06:20:12,751 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 533 states. [2024-10-13 06:20:12,838 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 533 to 514. [2024-10-13 06:20:12,839 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 514 states, 471 states have (on average 1.267515923566879) internal successors, (597), 474 states have internal predecessors, (597), 32 states have call successors, (32), 10 states have call predecessors, (32), 10 states have return successors, (32), 29 states have call predecessors, (32), 32 states have call successors, (32) [2024-10-13 06:20:12,841 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 514 states to 514 states and 661 transitions. [2024-10-13 06:20:12,842 INFO L78 Accepts]: Start accepts. Automaton has 514 states and 661 transitions. Word has length 146 [2024-10-13 06:20:12,842 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-13 06:20:12,843 INFO L471 AbstractCegarLoop]: Abstraction has 514 states and 661 transitions. [2024-10-13 06:20:12,843 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 28 states, 25 states have (on average 4.76) internal successors, (119), 24 states have internal predecessors, (119), 8 states have call successors, (36), 6 states have call predecessors, (36), 7 states have return successors, (36), 7 states have call predecessors, (36), 8 states have call successors, (36) [2024-10-13 06:20:12,843 INFO L276 IsEmpty]: Start isEmpty. Operand 514 states and 661 transitions. [2024-10-13 06:20:12,845 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 147 [2024-10-13 06:20:12,845 INFO L207 NwaCegarLoop]: Found error trace [2024-10-13 06:20:12,845 INFO L215 NwaCegarLoop]: trace histogram [18, 18, 18, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-13 06:20:12,871 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2024-10-13 06:20:13,049 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18,2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-13 06:20:13,050 INFO L396 AbstractCegarLoop]: === Iteration 20 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-13 06:20:13,051 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 06:20:13,051 INFO L85 PathProgramCache]: Analyzing trace with hash -428319587, now seen corresponding path program 1 times [2024-10-13 06:20:13,051 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-13 06:20:13,051 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1833282406] [2024-10-13 06:20:13,051 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 06:20:13,051 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-13 06:20:13,152 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:20:13,905 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-13 06:20:13,908 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:20:13,946 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2024-10-13 06:20:13,948 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:20:13,953 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2024-10-13 06:20:13,957 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:20:13,960 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2024-10-13 06:20:13,962 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:20:13,965 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2024-10-13 06:20:13,966 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:20:13,968 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-10-13 06:20:13,970 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:20:13,972 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-10-13 06:20:13,976 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:20:13,979 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2024-10-13 06:20:13,981 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:20:13,983 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 53 [2024-10-13 06:20:13,985 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:20:13,987 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2024-10-13 06:20:13,991 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:20:13,994 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2024-10-13 06:20:13,996 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:20:13,998 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2024-10-13 06:20:14,000 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:20:14,003 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 80 [2024-10-13 06:20:14,006 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:20:14,008 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 86 [2024-10-13 06:20:14,011 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:20:14,015 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 92 [2024-10-13 06:20:14,018 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:20:14,020 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 98 [2024-10-13 06:20:14,023 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:20:14,026 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 104 [2024-10-13 06:20:14,029 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:20:14,032 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 110 [2024-10-13 06:20:14,035 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:20:14,038 INFO L134 CoverageAnalysis]: Checked inductivity of 612 backedges. 0 proven. 51 refuted. 0 times theorem prover too weak. 561 trivial. 0 not checked. [2024-10-13 06:20:14,039 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-13 06:20:14,040 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1833282406] [2024-10-13 06:20:14,040 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1833282406] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-13 06:20:14,040 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [159593024] [2024-10-13 06:20:14,040 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 06:20:14,041 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-13 06:20:14,041 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-13 06:20:14,043 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-10-13 06:20:14,045 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2024-10-13 06:20:14,844 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:20:14,852 INFO L255 TraceCheckSpWp]: Trace formula consists of 673 conjuncts, 63 conjuncts are in the unsatisfiable core [2024-10-13 06:20:14,870 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-13 06:20:14,939 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 1 [2024-10-13 06:20:15,215 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 1 [2024-10-13 06:20:16,007 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 1 [2024-10-13 06:20:16,467 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 9 treesize of output 5 [2024-10-13 06:20:16,518 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 17 [2024-10-13 06:20:16,569 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 9 [2024-10-13 06:20:16,606 INFO L134 CoverageAnalysis]: Checked inductivity of 612 backedges. 9 proven. 431 refuted. 0 times theorem prover too weak. 172 trivial. 0 not checked. [2024-10-13 06:20:16,606 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-13 06:20:16,760 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 12 [2024-10-13 06:20:17,181 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 32 treesize of output 28 [2024-10-13 06:20:17,619 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 44 treesize of output 40 [2024-10-13 06:20:17,855 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 32 treesize of output 28 [2024-10-13 06:20:17,911 INFO L134 CoverageAnalysis]: Checked inductivity of 612 backedges. 6 proven. 93 refuted. 0 times theorem prover too weak. 513 trivial. 0 not checked. [2024-10-13 06:20:17,912 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [159593024] provided 0 perfect and 2 imperfect interpolant sequences [2024-10-13 06:20:17,912 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-10-13 06:20:17,912 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 18, 19] total 46 [2024-10-13 06:20:17,913 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [435900313] [2024-10-13 06:20:17,913 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-10-13 06:20:17,914 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 46 states [2024-10-13 06:20:17,914 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-13 06:20:17,916 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 46 interpolants. [2024-10-13 06:20:17,916 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=314, Invalid=1756, Unknown=0, NotChecked=0, Total=2070 [2024-10-13 06:20:17,917 INFO L87 Difference]: Start difference. First operand 514 states and 661 transitions. Second operand has 46 states, 41 states have (on average 4.2926829268292686) internal successors, (176), 44 states have internal predecessors, (176), 13 states have call successors, (54), 6 states have call predecessors, (54), 9 states have return successors, (54), 8 states have call predecessors, (54), 13 states have call successors, (54) [2024-10-13 06:20:20,786 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-13 06:20:20,786 INFO L93 Difference]: Finished difference Result 1468 states and 1858 transitions. [2024-10-13 06:20:20,787 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 48 states. [2024-10-13 06:20:20,787 INFO L78 Accepts]: Start accepts. Automaton has has 46 states, 41 states have (on average 4.2926829268292686) internal successors, (176), 44 states have internal predecessors, (176), 13 states have call successors, (54), 6 states have call predecessors, (54), 9 states have return successors, (54), 8 states have call predecessors, (54), 13 states have call successors, (54) Word has length 146 [2024-10-13 06:20:20,788 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-13 06:20:20,792 INFO L225 Difference]: With dead ends: 1468 [2024-10-13 06:20:20,792 INFO L226 Difference]: Without dead ends: 955 [2024-10-13 06:20:20,796 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 388 GetRequests, 299 SyntacticMatches, 0 SemanticMatches, 89 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1745 ImplicationChecksByTransitivity, 2.7s TimeCoverageRelationStatistics Valid=1488, Invalid=6702, Unknown=0, NotChecked=0, Total=8190 [2024-10-13 06:20:20,797 INFO L432 NwaCegarLoop]: 131 mSDtfsCounter, 1896 mSDsluCounter, 2047 mSDsCounter, 0 mSdLazyCounter, 1701 mSolverCounterSat, 249 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1896 SdHoareTripleChecker+Valid, 2178 SdHoareTripleChecker+Invalid, 1950 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 249 IncrementalHoareTripleChecker+Valid, 1701 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.1s IncrementalHoareTripleChecker+Time [2024-10-13 06:20:20,798 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1896 Valid, 2178 Invalid, 1950 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [249 Valid, 1701 Invalid, 0 Unknown, 0 Unchecked, 1.1s Time] [2024-10-13 06:20:20,799 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 955 states. [2024-10-13 06:20:20,879 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 955 to 676. [2024-10-13 06:20:20,880 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 676 states, 595 states have (on average 1.253781512605042) internal successors, (746), 597 states have internal predecessors, (746), 56 states have call successors, (56), 24 states have call predecessors, (56), 24 states have return successors, (56), 54 states have call predecessors, (56), 56 states have call successors, (56) [2024-10-13 06:20:20,882 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 676 states to 676 states and 858 transitions. [2024-10-13 06:20:20,884 INFO L78 Accepts]: Start accepts. Automaton has 676 states and 858 transitions. Word has length 146 [2024-10-13 06:20:20,884 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-13 06:20:20,884 INFO L471 AbstractCegarLoop]: Abstraction has 676 states and 858 transitions. [2024-10-13 06:20:20,884 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 46 states, 41 states have (on average 4.2926829268292686) internal successors, (176), 44 states have internal predecessors, (176), 13 states have call successors, (54), 6 states have call predecessors, (54), 9 states have return successors, (54), 8 states have call predecessors, (54), 13 states have call successors, (54) [2024-10-13 06:20:20,885 INFO L276 IsEmpty]: Start isEmpty. Operand 676 states and 858 transitions. [2024-10-13 06:20:20,886 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 148 [2024-10-13 06:20:20,886 INFO L207 NwaCegarLoop]: Found error trace [2024-10-13 06:20:20,886 INFO L215 NwaCegarLoop]: trace histogram [18, 18, 18, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-13 06:20:20,910 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2024-10-13 06:20:21,090 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable19 [2024-10-13 06:20:21,091 INFO L396 AbstractCegarLoop]: === Iteration 21 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-13 06:20:21,091 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 06:20:21,091 INFO L85 PathProgramCache]: Analyzing trace with hash 381697767, now seen corresponding path program 1 times [2024-10-13 06:20:21,091 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-13 06:20:21,092 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1728108086] [2024-10-13 06:20:21,092 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 06:20:21,092 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-13 06:20:21,173 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:20:21,833 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-13 06:20:21,835 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:20:21,841 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2024-10-13 06:20:21,844 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:20:21,846 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2024-10-13 06:20:21,849 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:20:21,892 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2024-10-13 06:20:21,895 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:20:21,902 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2024-10-13 06:20:21,904 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:20:21,906 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-10-13 06:20:21,908 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:20:21,910 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-10-13 06:20:21,912 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:20:21,913 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2024-10-13 06:20:21,915 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:20:21,917 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 53 [2024-10-13 06:20:21,919 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:20:21,921 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2024-10-13 06:20:21,924 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:20:21,925 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2024-10-13 06:20:21,930 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:20:21,932 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2024-10-13 06:20:21,934 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:20:21,936 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 80 [2024-10-13 06:20:21,938 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:20:21,940 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 86 [2024-10-13 06:20:21,942 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:20:21,946 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 92 [2024-10-13 06:20:21,948 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:20:21,950 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 98 [2024-10-13 06:20:21,953 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:20:21,955 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 104 [2024-10-13 06:20:21,957 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:20:21,959 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 110 [2024-10-13 06:20:21,962 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:20:21,964 INFO L134 CoverageAnalysis]: Checked inductivity of 612 backedges. 6 proven. 45 refuted. 0 times theorem prover too weak. 561 trivial. 0 not checked. [2024-10-13 06:20:21,966 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-13 06:20:21,966 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1728108086] [2024-10-13 06:20:21,966 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1728108086] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-13 06:20:21,966 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [289145745] [2024-10-13 06:20:21,966 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 06:20:21,967 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-13 06:20:21,967 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-13 06:20:21,969 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-10-13 06:20:21,970 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2024-10-13 06:20:22,277 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:20:22,282 INFO L255 TraceCheckSpWp]: Trace formula consists of 660 conjuncts, 35 conjuncts are in the unsatisfiable core [2024-10-13 06:20:22,291 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-13 06:20:22,571 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 1 [2024-10-13 06:20:22,819 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 1 [2024-10-13 06:20:23,107 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 17 [2024-10-13 06:20:23,111 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2024-10-13 06:20:23,205 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 11 [2024-10-13 06:20:23,228 INFO L134 CoverageAnalysis]: Checked inductivity of 612 backedges. 9 proven. 431 refuted. 0 times theorem prover too weak. 172 trivial. 0 not checked. [2024-10-13 06:20:23,229 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-13 06:20:23,593 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 23 [2024-10-13 06:20:23,669 INFO L134 CoverageAnalysis]: Checked inductivity of 612 backedges. 48 proven. 48 refuted. 0 times theorem prover too weak. 516 trivial. 0 not checked. [2024-10-13 06:20:23,669 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [289145745] provided 0 perfect and 2 imperfect interpolant sequences [2024-10-13 06:20:23,669 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-10-13 06:20:23,670 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 15, 11] total 33 [2024-10-13 06:20:23,670 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1307507888] [2024-10-13 06:20:23,670 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-10-13 06:20:23,670 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 33 states [2024-10-13 06:20:23,671 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-13 06:20:23,672 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 33 interpolants. [2024-10-13 06:20:23,672 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=122, Invalid=934, Unknown=0, NotChecked=0, Total=1056 [2024-10-13 06:20:23,672 INFO L87 Difference]: Start difference. First operand 676 states and 858 transitions. Second operand has 33 states, 27 states have (on average 5.777777777777778) internal successors, (156), 31 states have internal predecessors, (156), 14 states have call successors, (54), 6 states have call predecessors, (54), 8 states have return successors, (54), 9 states have call predecessors, (54), 14 states have call successors, (54) [2024-10-13 06:20:25,559 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-13 06:20:25,559 INFO L93 Difference]: Finished difference Result 1435 states and 1794 transitions. [2024-10-13 06:20:25,560 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 28 states. [2024-10-13 06:20:25,560 INFO L78 Accepts]: Start accepts. Automaton has has 33 states, 27 states have (on average 5.777777777777778) internal successors, (156), 31 states have internal predecessors, (156), 14 states have call successors, (54), 6 states have call predecessors, (54), 8 states have return successors, (54), 9 states have call predecessors, (54), 14 states have call successors, (54) Word has length 147 [2024-10-13 06:20:25,561 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-13 06:20:25,565 INFO L225 Difference]: With dead ends: 1435 [2024-10-13 06:20:25,565 INFO L226 Difference]: Without dead ends: 760 [2024-10-13 06:20:25,568 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 367 GetRequests, 307 SyntacticMatches, 3 SemanticMatches, 57 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 633 ImplicationChecksByTransitivity, 1.7s TimeCoverageRelationStatistics Valid=673, Invalid=2749, Unknown=0, NotChecked=0, Total=3422 [2024-10-13 06:20:25,569 INFO L432 NwaCegarLoop]: 92 mSDtfsCounter, 1107 mSDsluCounter, 883 mSDsCounter, 0 mSdLazyCounter, 775 mSolverCounterSat, 231 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1107 SdHoareTripleChecker+Valid, 975 SdHoareTripleChecker+Invalid, 1006 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 231 IncrementalHoareTripleChecker+Valid, 775 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2024-10-13 06:20:25,569 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1107 Valid, 975 Invalid, 1006 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [231 Valid, 775 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2024-10-13 06:20:25,571 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 760 states. [2024-10-13 06:20:25,670 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 760 to 624. [2024-10-13 06:20:25,671 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 624 states, 537 states have (on average 1.217877094972067) internal successors, (654), 539 states have internal predecessors, (654), 56 states have call successors, (56), 30 states have call predecessors, (56), 30 states have return successors, (56), 54 states have call predecessors, (56), 56 states have call successors, (56) [2024-10-13 06:20:25,673 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 624 states to 624 states and 766 transitions. [2024-10-13 06:20:25,674 INFO L78 Accepts]: Start accepts. Automaton has 624 states and 766 transitions. Word has length 147 [2024-10-13 06:20:25,675 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-13 06:20:25,675 INFO L471 AbstractCegarLoop]: Abstraction has 624 states and 766 transitions. [2024-10-13 06:20:25,675 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 33 states, 27 states have (on average 5.777777777777778) internal successors, (156), 31 states have internal predecessors, (156), 14 states have call successors, (54), 6 states have call predecessors, (54), 8 states have return successors, (54), 9 states have call predecessors, (54), 14 states have call successors, (54) [2024-10-13 06:20:25,675 INFO L276 IsEmpty]: Start isEmpty. Operand 624 states and 766 transitions. [2024-10-13 06:20:25,677 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 149 [2024-10-13 06:20:25,677 INFO L207 NwaCegarLoop]: Found error trace [2024-10-13 06:20:25,677 INFO L215 NwaCegarLoop]: trace histogram [18, 18, 18, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-13 06:20:25,698 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Ended with exit code 0 [2024-10-13 06:20:25,878 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-13 06:20:25,878 INFO L396 AbstractCegarLoop]: === Iteration 22 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-13 06:20:25,879 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 06:20:25,879 INFO L85 PathProgramCache]: Analyzing trace with hash -105372650, now seen corresponding path program 1 times [2024-10-13 06:20:25,879 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-13 06:20:25,879 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1742412222] [2024-10-13 06:20:25,879 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 06:20:25,879 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-13 06:20:26,006 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:20:26,817 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-13 06:20:26,819 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:20:26,821 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2024-10-13 06:20:26,822 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:20:26,823 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2024-10-13 06:20:26,824 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:20:26,825 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2024-10-13 06:20:26,826 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:20:26,827 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2024-10-13 06:20:26,828 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:20:26,829 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-10-13 06:20:26,830 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:20:26,833 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-10-13 06:20:26,835 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:20:26,836 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2024-10-13 06:20:26,841 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:20:26,843 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 53 [2024-10-13 06:20:26,844 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:20:26,845 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2024-10-13 06:20:26,846 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:20:26,847 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2024-10-13 06:20:26,848 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:20:26,849 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2024-10-13 06:20:26,850 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:20:26,851 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 80 [2024-10-13 06:20:26,852 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:20:26,853 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 86 [2024-10-13 06:20:26,854 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:20:26,855 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 92 [2024-10-13 06:20:26,857 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:20:26,858 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 98 [2024-10-13 06:20:26,860 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:20:26,861 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 104 [2024-10-13 06:20:26,862 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:20:26,867 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 110 [2024-10-13 06:20:26,869 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:20:26,873 INFO L134 CoverageAnalysis]: Checked inductivity of 612 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 612 trivial. 0 not checked. [2024-10-13 06:20:26,873 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-13 06:20:26,873 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1742412222] [2024-10-13 06:20:26,874 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1742412222] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-13 06:20:26,874 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-13 06:20:26,874 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2024-10-13 06:20:26,874 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [504767796] [2024-10-13 06:20:26,874 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-13 06:20:26,875 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-10-13 06:20:26,875 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-13 06:20:26,875 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-10-13 06:20:26,875 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=72, Unknown=0, NotChecked=0, Total=90 [2024-10-13 06:20:26,876 INFO L87 Difference]: Start difference. First operand 624 states and 766 transitions. Second operand has 10 states, 10 states have (on average 6.1) internal successors, (61), 10 states have internal predecessors, (61), 1 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 1 states have call successors, (18) [2024-10-13 06:20:27,388 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-13 06:20:27,388 INFO L93 Difference]: Finished difference Result 1162 states and 1419 transitions. [2024-10-13 06:20:27,391 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2024-10-13 06:20:27,391 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 6.1) internal successors, (61), 10 states have internal predecessors, (61), 1 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 1 states have call successors, (18) Word has length 148 [2024-10-13 06:20:27,392 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-13 06:20:27,396 INFO L225 Difference]: With dead ends: 1162 [2024-10-13 06:20:27,396 INFO L226 Difference]: Without dead ends: 782 [2024-10-13 06:20:27,398 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 54 GetRequests, 41 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 14 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=40, Invalid=170, Unknown=0, NotChecked=0, Total=210 [2024-10-13 06:20:27,399 INFO L432 NwaCegarLoop]: 228 mSDtfsCounter, 99 mSDsluCounter, 1593 mSDsCounter, 0 mSdLazyCounter, 308 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 99 SdHoareTripleChecker+Valid, 1821 SdHoareTripleChecker+Invalid, 309 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 308 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2024-10-13 06:20:27,399 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [99 Valid, 1821 Invalid, 309 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 308 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2024-10-13 06:20:27,400 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 782 states. [2024-10-13 06:20:27,564 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 782 to 770. [2024-10-13 06:20:27,566 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 770 states, 644 states have (on average 1.2065217391304348) internal successors, (777), 648 states have internal predecessors, (777), 80 states have call successors, (80), 45 states have call predecessors, (80), 45 states have return successors, (80), 76 states have call predecessors, (80), 80 states have call successors, (80) [2024-10-13 06:20:27,571 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 770 states to 770 states and 937 transitions. [2024-10-13 06:20:27,574 INFO L78 Accepts]: Start accepts. Automaton has 770 states and 937 transitions. Word has length 148 [2024-10-13 06:20:27,575 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-13 06:20:27,575 INFO L471 AbstractCegarLoop]: Abstraction has 770 states and 937 transitions. [2024-10-13 06:20:27,576 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 6.1) internal successors, (61), 10 states have internal predecessors, (61), 1 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 1 states have call successors, (18) [2024-10-13 06:20:27,576 INFO L276 IsEmpty]: Start isEmpty. Operand 770 states and 937 transitions. [2024-10-13 06:20:27,578 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 150 [2024-10-13 06:20:27,578 INFO L207 NwaCegarLoop]: Found error trace [2024-10-13 06:20:27,578 INFO L215 NwaCegarLoop]: trace histogram [18, 18, 18, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-13 06:20:27,578 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable21 [2024-10-13 06:20:27,579 INFO L396 AbstractCegarLoop]: === Iteration 23 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-13 06:20:27,579 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 06:20:27,579 INFO L85 PathProgramCache]: Analyzing trace with hash 1274258361, now seen corresponding path program 1 times [2024-10-13 06:20:27,579 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-13 06:20:27,579 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2125504342] [2024-10-13 06:20:27,580 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 06:20:27,580 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-13 06:20:27,713 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:20:29,863 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-13 06:20:29,867 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:20:29,942 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2024-10-13 06:20:29,945 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:20:29,950 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2024-10-13 06:20:29,952 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:20:29,959 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2024-10-13 06:20:29,963 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:20:29,979 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2024-10-13 06:20:29,981 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:20:29,985 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-10-13 06:20:29,990 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:20:30,011 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-10-13 06:20:30,013 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:20:30,019 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2024-10-13 06:20:30,022 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:20:30,029 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 53 [2024-10-13 06:20:30,031 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:20:30,038 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2024-10-13 06:20:30,041 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:20:30,048 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2024-10-13 06:20:30,051 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:20:30,058 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2024-10-13 06:20:30,060 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:20:30,067 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 80 [2024-10-13 06:20:30,074 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:20:30,129 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 86 [2024-10-13 06:20:30,132 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:20:30,158 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 92 [2024-10-13 06:20:30,161 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:20:30,179 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 98 [2024-10-13 06:20:30,183 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:20:30,201 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 104 [2024-10-13 06:20:30,205 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:20:30,222 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 110 [2024-10-13 06:20:30,228 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:20:30,248 INFO L134 CoverageAnalysis]: Checked inductivity of 612 backedges. 42 proven. 126 refuted. 0 times theorem prover too weak. 444 trivial. 0 not checked. [2024-10-13 06:20:30,249 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-13 06:20:30,249 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2125504342] [2024-10-13 06:20:30,249 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2125504342] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-13 06:20:30,249 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2435320] [2024-10-13 06:20:30,250 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 06:20:30,250 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-13 06:20:30,250 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-13 06:20:30,252 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-10-13 06:20:30,253 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2024-10-13 06:20:31,044 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:20:31,050 INFO L255 TraceCheckSpWp]: Trace formula consists of 671 conjuncts, 74 conjuncts are in the unsatisfiable core [2024-10-13 06:20:31,057 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-13 06:20:31,297 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 1 [2024-10-13 06:20:31,855 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 1 [2024-10-13 06:20:32,670 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 1 [2024-10-13 06:20:33,614 INFO L134 CoverageAnalysis]: Checked inductivity of 612 backedges. 18 proven. 488 refuted. 0 times theorem prover too weak. 106 trivial. 0 not checked. [2024-10-13 06:20:33,614 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-13 06:20:34,077 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 64 treesize of output 60 [2024-10-13 06:20:35,179 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 154 treesize of output 142