./Ultimate.py --spec /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/properties/unreach-call.prp --file /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-a_file-6.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 61a67961 Calling Ultimate with: /root/.sdkman/candidates/java/current/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-a_file-6.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 fb9f80ac793eeca68c7fd49f4ea0c37ec5912db021eb8e0a4597e07f05d1e26c --- Real Ultimate output --- This is Ultimate 0.2.5-wip.fs.cvc5-61a6796-m [2024-10-14 13:26:39,153 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-10-14 13:26:39,216 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2024-10-14 13:26:39,219 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-10-14 13:26:39,221 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-10-14 13:26:39,246 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-10-14 13:26:39,246 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-10-14 13:26:39,247 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-10-14 13:26:39,247 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-10-14 13:26:39,248 INFO L153 SettingsManager]: * Use memory slicer=true [2024-10-14 13:26:39,248 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-10-14 13:26:39,249 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-10-14 13:26:39,250 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-10-14 13:26:39,250 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-10-14 13:26:39,252 INFO L153 SettingsManager]: * Use SBE=true [2024-10-14 13:26:39,252 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-10-14 13:26:39,252 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-10-14 13:26:39,252 INFO L153 SettingsManager]: * sizeof long=4 [2024-10-14 13:26:39,253 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-10-14 13:26:39,253 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-10-14 13:26:39,253 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-10-14 13:26:39,254 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-10-14 13:26:39,254 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-10-14 13:26:39,254 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-10-14 13:26:39,255 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-10-14 13:26:39,255 INFO L153 SettingsManager]: * sizeof long double=12 [2024-10-14 13:26:39,255 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-10-14 13:26:39,255 INFO L153 SettingsManager]: * Use constant arrays=true [2024-10-14 13:26:39,255 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-10-14 13:26:39,256 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-10-14 13:26:39,256 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-10-14 13:26:39,256 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-10-14 13:26:39,256 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-14 13:26:39,257 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-10-14 13:26:39,257 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-10-14 13:26:39,257 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-10-14 13:26:39,258 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-10-14 13:26:39,258 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-10-14 13:26:39,258 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-10-14 13:26:39,258 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-10-14 13:26:39,258 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-10-14 13:26:39,259 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-10-14 13:26:39,259 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 -> fb9f80ac793eeca68c7fd49f4ea0c37ec5912db021eb8e0a4597e07f05d1e26c [2024-10-14 13:26:39,475 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-10-14 13:26:39,502 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-10-14 13:26:39,504 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-10-14 13:26:39,505 INFO L270 PluginConnector]: Initializing CDTParser... [2024-10-14 13:26:39,505 INFO L274 PluginConnector]: CDTParser initialized [2024-10-14 13:26:39,506 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-a_file-6.i [2024-10-14 13:26:40,764 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-10-14 13:26:40,965 INFO L384 CDTParser]: Found 1 translation units. [2024-10-14 13:26:40,966 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-a_file-6.i [2024-10-14 13:26:40,978 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/a37548a74/391e11e223f7485e828bf878036f8b2b/FLAGbfdce61cf [2024-10-14 13:26:41,362 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/a37548a74/391e11e223f7485e828bf878036f8b2b [2024-10-14 13:26:41,364 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-10-14 13:26:41,366 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-10-14 13:26:41,368 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-10-14 13:26:41,368 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-10-14 13:26:41,372 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-10-14 13:26:41,372 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 14.10 01:26:41" (1/1) ... [2024-10-14 13:26:41,373 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@29835f0f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 01:26:41, skipping insertion in model container [2024-10-14 13:26:41,373 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 14.10 01:26:41" (1/1) ... [2024-10-14 13:26:41,392 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-10-14 13:26:41,514 WARN L248 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-a_file-6.i[915,928] [2024-10-14 13:26:41,563 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-14 13:26:41,577 INFO L200 MainTranslator]: Completed pre-run [2024-10-14 13:26:41,588 WARN L248 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-a_file-6.i[915,928] [2024-10-14 13:26:41,636 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-14 13:26:41,660 INFO L204 MainTranslator]: Completed translation [2024-10-14 13:26:41,660 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 01:26:41 WrapperNode [2024-10-14 13:26:41,661 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-10-14 13:26:41,661 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-10-14 13:26:41,662 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-10-14 13:26:41,662 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-10-14 13:26:41,668 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 01:26:41" (1/1) ... [2024-10-14 13:26:41,685 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 01:26:41" (1/1) ... [2024-10-14 13:26:41,738 INFO L138 Inliner]: procedures = 29, calls = 170, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 517 [2024-10-14 13:26:41,738 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-10-14 13:26:41,739 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-10-14 13:26:41,739 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-10-14 13:26:41,739 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-10-14 13:26:41,747 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 01:26:41" (1/1) ... [2024-10-14 13:26:41,748 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 01:26:41" (1/1) ... [2024-10-14 13:26:41,752 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 01:26:41" (1/1) ... [2024-10-14 13:26:41,780 INFO L175 MemorySlicer]: Split 135 memory accesses to 6 slices as follows [2, 16, 32, 28, 21, 36]. 27 percent of accesses are in the largest equivalence class. The 18 initializations are split as follows [2, 3, 4, 3, 3, 3]. The 18 writes are split as follows [0, 3, 4, 3, 4, 4]. [2024-10-14 13:26:41,781 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 01:26:41" (1/1) ... [2024-10-14 13:26:41,781 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 01:26:41" (1/1) ... [2024-10-14 13:26:41,832 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 01:26:41" (1/1) ... [2024-10-14 13:26:41,836 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 01:26:41" (1/1) ... [2024-10-14 13:26:41,838 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 01:26:41" (1/1) ... [2024-10-14 13:26:41,847 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 01:26:41" (1/1) ... [2024-10-14 13:26:41,851 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-10-14 13:26:41,851 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-10-14 13:26:41,852 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-10-14 13:26:41,852 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-10-14 13:26:41,852 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 01:26:41" (1/1) ... [2024-10-14 13:26:41,862 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-14 13:26:41,870 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-14 13:26:41,886 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-14 13:26:41,888 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-14 13:26:41,929 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-10-14 13:26:41,930 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#0 [2024-10-14 13:26:41,930 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#1 [2024-10-14 13:26:41,931 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#2 [2024-10-14 13:26:41,931 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#3 [2024-10-14 13:26:41,931 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#4 [2024-10-14 13:26:41,931 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#5 [2024-10-14 13:26:41,931 INFO L130 BoogieDeclarations]: Found specification of procedure read~real#0 [2024-10-14 13:26:41,931 INFO L130 BoogieDeclarations]: Found specification of procedure read~real#1 [2024-10-14 13:26:41,931 INFO L130 BoogieDeclarations]: Found specification of procedure read~real#2 [2024-10-14 13:26:41,932 INFO L130 BoogieDeclarations]: Found specification of procedure read~real#3 [2024-10-14 13:26:41,933 INFO L130 BoogieDeclarations]: Found specification of procedure read~real#4 [2024-10-14 13:26:41,933 INFO L130 BoogieDeclarations]: Found specification of procedure read~real#5 [2024-10-14 13:26:41,933 INFO L130 BoogieDeclarations]: Found specification of procedure write~real#0 [2024-10-14 13:26:41,933 INFO L130 BoogieDeclarations]: Found specification of procedure write~real#1 [2024-10-14 13:26:41,933 INFO L130 BoogieDeclarations]: Found specification of procedure write~real#2 [2024-10-14 13:26:41,933 INFO L130 BoogieDeclarations]: Found specification of procedure write~real#3 [2024-10-14 13:26:41,933 INFO L130 BoogieDeclarations]: Found specification of procedure write~real#4 [2024-10-14 13:26:41,933 INFO L130 BoogieDeclarations]: Found specification of procedure write~real#5 [2024-10-14 13:26:41,933 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#0 [2024-10-14 13:26:41,933 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#1 [2024-10-14 13:26:41,933 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#2 [2024-10-14 13:26:41,933 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#3 [2024-10-14 13:26:41,933 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#4 [2024-10-14 13:26:41,933 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#5 [2024-10-14 13:26:41,934 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~real#0 [2024-10-14 13:26:41,934 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~real#1 [2024-10-14 13:26:41,934 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~real#2 [2024-10-14 13:26:41,934 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~real#3 [2024-10-14 13:26:41,934 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~real#4 [2024-10-14 13:26:41,934 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~real#5 [2024-10-14 13:26:41,934 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2024-10-14 13:26:41,934 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2024-10-14 13:26:41,934 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-10-14 13:26:41,934 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#1 [2024-10-14 13:26:41,934 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#2 [2024-10-14 13:26:41,934 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#3 [2024-10-14 13:26:41,934 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#4 [2024-10-14 13:26:41,934 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#5 [2024-10-14 13:26:41,935 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-10-14 13:26:41,935 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-10-14 13:26:42,074 INFO L238 CfgBuilder]: Building ICFG [2024-10-14 13:26:42,075 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-10-14 13:26:42,453 INFO L? ?]: Removed 131 outVars from TransFormulas that were not future-live. [2024-10-14 13:26:42,453 INFO L287 CfgBuilder]: Performing block encoding [2024-10-14 13:26:42,484 INFO L309 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-10-14 13:26:42,485 INFO L314 CfgBuilder]: Removed 1 assume(true) statements. [2024-10-14 13:26:42,485 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 14.10 01:26:42 BoogieIcfgContainer [2024-10-14 13:26:42,485 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-10-14 13:26:42,487 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-10-14 13:26:42,487 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-10-14 13:26:42,489 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-10-14 13:26:42,489 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 14.10 01:26:41" (1/3) ... [2024-10-14 13:26:42,490 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3783e794 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 14.10 01:26:42, skipping insertion in model container [2024-10-14 13:26:42,490 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 01:26:41" (2/3) ... [2024-10-14 13:26:42,491 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3783e794 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 14.10 01:26:42, skipping insertion in model container [2024-10-14 13:26:42,491 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 14.10 01:26:42" (3/3) ... [2024-10-14 13:26:42,492 INFO L112 eAbstractionObserver]: Analyzing ICFG hardness_variablewrapping_wrapper-a_file-6.i [2024-10-14 13:26:42,506 INFO L209 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-10-14 13:26:42,506 INFO L149 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-10-14 13:26:42,549 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-10-14 13:26:42,554 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;@5a2307ba, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-10-14 13:26:42,554 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-10-14 13:26:42,558 INFO L276 IsEmpty]: Start isEmpty. Operand has 115 states, 93 states have (on average 1.4408602150537635) internal successors, (134), 94 states have internal predecessors, (134), 19 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 19 states have call predecessors, (19), 19 states have call successors, (19) [2024-10-14 13:26:42,568 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 154 [2024-10-14 13:26:42,569 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 13:26:42,569 INFO L215 NwaCegarLoop]: trace histogram [19, 19, 19, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-14 13:26:42,570 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-14 13:26:42,573 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 13:26:42,574 INFO L85 PathProgramCache]: Analyzing trace with hash -455682870, now seen corresponding path program 1 times [2024-10-14 13:26:42,580 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-14 13:26:42,580 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1324259032] [2024-10-14 13:26:42,581 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 13:26:42,581 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-14 13:26:42,685 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 13:26:42,793 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-14 13:26:42,796 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 13:26:42,804 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2024-10-14 13:26:42,805 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 13:26:42,809 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2024-10-14 13:26:42,814 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 13:26:42,816 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2024-10-14 13:26:42,817 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 13:26:42,821 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-10-14 13:26:42,822 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 13:26:42,824 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-10-14 13:26:42,826 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 13:26:42,830 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2024-10-14 13:26:42,832 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 13:26:42,837 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2024-10-14 13:26:42,839 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 13:26:42,842 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2024-10-14 13:26:42,851 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 13:26:42,853 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2024-10-14 13:26:42,855 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 13:26:42,856 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2024-10-14 13:26:42,858 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 13:26:42,861 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 80 [2024-10-14 13:26:42,864 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 13:26:42,865 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 86 [2024-10-14 13:26:42,870 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 13:26:42,872 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 92 [2024-10-14 13:26:42,876 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 13:26:42,880 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 98 [2024-10-14 13:26:42,882 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 13:26:42,884 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 104 [2024-10-14 13:26:42,888 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 13:26:42,889 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 110 [2024-10-14 13:26:42,890 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 13:26:42,891 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 116 [2024-10-14 13:26:42,896 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 13:26:42,897 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 122 [2024-10-14 13:26:42,898 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 13:26:42,904 INFO L134 CoverageAnalysis]: Checked inductivity of 684 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 684 trivial. 0 not checked. [2024-10-14 13:26:42,904 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-14 13:26:42,905 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1324259032] [2024-10-14 13:26:42,905 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1324259032] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-14 13:26:42,905 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-14 13:26:42,906 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-14 13:26:42,907 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [806211908] [2024-10-14 13:26:42,907 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-14 13:26:42,945 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-10-14 13:26:42,946 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-14 13:26:42,964 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-10-14 13:26:42,965 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-10-14 13:26:42,967 INFO L87 Difference]: Start difference. First operand has 115 states, 93 states have (on average 1.4408602150537635) internal successors, (134), 94 states have internal predecessors, (134), 19 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 19 states have call predecessors, (19), 19 states have call successors, (19) Second operand has 2 states, 2 states have (on average 30.5) internal successors, (61), 2 states have internal predecessors, (61), 2 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 1 states have call predecessors, (19), 2 states have call successors, (19) [2024-10-14 13:26:43,025 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-14 13:26:43,026 INFO L93 Difference]: Finished difference Result 227 states and 361 transitions. [2024-10-14 13:26:43,029 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-10-14 13:26:43,031 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 30.5) internal successors, (61), 2 states have internal predecessors, (61), 2 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 1 states have call predecessors, (19), 2 states have call successors, (19) Word has length 153 [2024-10-14 13:26:43,031 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-14 13:26:43,037 INFO L225 Difference]: With dead ends: 227 [2024-10-14 13:26:43,038 INFO L226 Difference]: Without dead ends: 113 [2024-10-14 13:26:43,042 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 59 GetRequests, 59 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-14 13:26:43,046 INFO L432 NwaCegarLoop]: 163 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, 163 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-14 13:26:43,047 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 163 Invalid, 4 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 4 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-14 13:26:43,060 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 113 states. [2024-10-14 13:26:43,083 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 113 to 113. [2024-10-14 13:26:43,085 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 113 states, 92 states have (on average 1.4021739130434783) internal successors, (129), 92 states have internal predecessors, (129), 19 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 19 states have call predecessors, (19), 19 states have call successors, (19) [2024-10-14 13:26:43,088 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 113 states to 113 states and 167 transitions. [2024-10-14 13:26:43,089 INFO L78 Accepts]: Start accepts. Automaton has 113 states and 167 transitions. Word has length 153 [2024-10-14 13:26:43,093 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-14 13:26:43,093 INFO L471 AbstractCegarLoop]: Abstraction has 113 states and 167 transitions. [2024-10-14 13:26:43,093 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 30.5) internal successors, (61), 2 states have internal predecessors, (61), 2 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 1 states have call predecessors, (19), 2 states have call successors, (19) [2024-10-14 13:26:43,094 INFO L276 IsEmpty]: Start isEmpty. Operand 113 states and 167 transitions. [2024-10-14 13:26:43,096 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 154 [2024-10-14 13:26:43,096 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 13:26:43,096 INFO L215 NwaCegarLoop]: trace histogram [19, 19, 19, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-14 13:26:43,096 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-10-14 13:26:43,097 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-14 13:26:43,098 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 13:26:43,098 INFO L85 PathProgramCache]: Analyzing trace with hash 1843939048, now seen corresponding path program 1 times [2024-10-14 13:26:43,098 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-14 13:26:43,098 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [983985644] [2024-10-14 13:26:43,098 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 13:26:43,099 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-14 13:26:43,160 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 13:26:43,330 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-14 13:26:43,331 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 13:26:43,332 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2024-10-14 13:26:43,333 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 13:26:43,337 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2024-10-14 13:26:43,338 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 13:26:43,340 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2024-10-14 13:26:43,344 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 13:26:43,345 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-10-14 13:26:43,345 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 13:26:43,346 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-10-14 13:26:43,347 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 13:26:43,352 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2024-10-14 13:26:43,353 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 13:26:43,354 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2024-10-14 13:26:43,358 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 13:26:43,359 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2024-10-14 13:26:43,360 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 13:26:43,361 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2024-10-14 13:26:43,364 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 13:26:43,365 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2024-10-14 13:26:43,367 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 13:26:43,369 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 80 [2024-10-14 13:26:43,370 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 13:26:43,371 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 86 [2024-10-14 13:26:43,372 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 13:26:43,375 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 92 [2024-10-14 13:26:43,377 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 13:26:43,379 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 98 [2024-10-14 13:26:43,384 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 13:26:43,386 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 104 [2024-10-14 13:26:43,391 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 13:26:43,393 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 110 [2024-10-14 13:26:43,394 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 13:26:43,397 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 116 [2024-10-14 13:26:43,398 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 13:26:43,399 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 122 [2024-10-14 13:26:43,400 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 13:26:43,401 INFO L134 CoverageAnalysis]: Checked inductivity of 684 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 684 trivial. 0 not checked. [2024-10-14 13:26:43,401 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-14 13:26:43,402 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [983985644] [2024-10-14 13:26:43,402 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [983985644] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-14 13:26:43,402 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-14 13:26:43,402 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-10-14 13:26:43,402 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [511061656] [2024-10-14 13:26:43,406 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-14 13:26:43,407 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-10-14 13:26:43,407 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-14 13:26:43,408 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-10-14 13:26:43,409 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-10-14 13:26:43,410 INFO L87 Difference]: Start difference. First operand 113 states and 167 transitions. Second operand has 4 states, 4 states have (on average 15.25) internal successors, (61), 4 states have internal predecessors, (61), 2 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 2 states have call predecessors, (19), 2 states have call successors, (19) [2024-10-14 13:26:43,460 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-14 13:26:43,461 INFO L93 Difference]: Finished difference Result 227 states and 336 transitions. [2024-10-14 13:26:43,462 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-10-14 13:26:43,463 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 15.25) internal successors, (61), 4 states have internal predecessors, (61), 2 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 2 states have call predecessors, (19), 2 states have call successors, (19) Word has length 153 [2024-10-14 13:26:43,463 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-14 13:26:43,464 INFO L225 Difference]: With dead ends: 227 [2024-10-14 13:26:43,465 INFO L226 Difference]: Without dead ends: 115 [2024-10-14 13:26:43,467 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 42 GetRequests, 40 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-14 13:26:43,469 INFO L432 NwaCegarLoop]: 161 mSDtfsCounter, 0 mSDsluCounter, 315 mSDsCounter, 0 mSdLazyCounter, 24 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 476 SdHoareTripleChecker+Invalid, 24 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 24 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-14 13:26:43,469 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 476 Invalid, 24 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 24 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-14 13:26:43,470 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 115 states. [2024-10-14 13:26:43,480 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 115 to 115. [2024-10-14 13:26:43,482 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 115 states, 94 states have (on average 1.3936170212765957) internal successors, (131), 94 states have internal predecessors, (131), 19 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 19 states have call predecessors, (19), 19 states have call successors, (19) [2024-10-14 13:26:43,483 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 115 states to 115 states and 169 transitions. [2024-10-14 13:26:43,483 INFO L78 Accepts]: Start accepts. Automaton has 115 states and 169 transitions. Word has length 153 [2024-10-14 13:26:43,484 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-14 13:26:43,484 INFO L471 AbstractCegarLoop]: Abstraction has 115 states and 169 transitions. [2024-10-14 13:26:43,484 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 15.25) internal successors, (61), 4 states have internal predecessors, (61), 2 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 2 states have call predecessors, (19), 2 states have call successors, (19) [2024-10-14 13:26:43,484 INFO L276 IsEmpty]: Start isEmpty. Operand 115 states and 169 transitions. [2024-10-14 13:26:43,486 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 154 [2024-10-14 13:26:43,486 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 13:26:43,486 INFO L215 NwaCegarLoop]: trace histogram [19, 19, 19, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-14 13:26:43,486 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-10-14 13:26:43,487 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-14 13:26:43,487 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 13:26:43,487 INFO L85 PathProgramCache]: Analyzing trace with hash -1412443674, now seen corresponding path program 1 times [2024-10-14 13:26:43,487 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-14 13:26:43,487 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1045196578] [2024-10-14 13:26:43,487 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 13:26:43,487 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-14 13:26:43,537 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 13:26:43,764 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-14 13:26:43,765 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 13:26:43,768 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2024-10-14 13:26:43,769 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 13:26:43,771 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2024-10-14 13:26:43,773 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 13:26:43,774 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2024-10-14 13:26:43,776 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 13:26:43,778 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-10-14 13:26:43,782 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 13:26:43,784 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-10-14 13:26:43,785 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 13:26:43,788 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2024-10-14 13:26:43,789 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 13:26:43,794 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2024-10-14 13:26:43,795 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 13:26:43,796 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2024-10-14 13:26:43,797 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 13:26:43,802 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2024-10-14 13:26:43,802 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 13:26:43,803 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2024-10-14 13:26:43,808 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 13:26:43,809 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 80 [2024-10-14 13:26:43,810 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 13:26:43,811 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 86 [2024-10-14 13:26:43,815 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 13:26:43,816 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 92 [2024-10-14 13:26:43,817 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 13:26:43,818 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 98 [2024-10-14 13:26:43,819 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 13:26:43,820 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 104 [2024-10-14 13:26:43,821 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 13:26:43,822 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 110 [2024-10-14 13:26:43,827 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 13:26:43,828 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 116 [2024-10-14 13:26:43,828 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 13:26:43,829 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 122 [2024-10-14 13:26:43,830 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 13:26:43,836 INFO L134 CoverageAnalysis]: Checked inductivity of 684 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 684 trivial. 0 not checked. [2024-10-14 13:26:43,836 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-14 13:26:43,836 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1045196578] [2024-10-14 13:26:43,836 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1045196578] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-14 13:26:43,836 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-14 13:26:43,836 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-14 13:26:43,836 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1596505859] [2024-10-14 13:26:43,837 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-14 13:26:43,837 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-14 13:26:43,841 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-14 13:26:43,842 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-14 13:26:43,842 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-14 13:26:43,842 INFO L87 Difference]: Start difference. First operand 115 states and 169 transitions. Second operand has 3 states, 3 states have (on average 20.333333333333332) internal successors, (61), 3 states have internal predecessors, (61), 1 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 1 states have call predecessors, (19), 1 states have call successors, (19) [2024-10-14 13:26:43,878 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-14 13:26:43,878 INFO L93 Difference]: Finished difference Result 229 states and 337 transitions. [2024-10-14 13:26:43,882 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-14 13:26:43,883 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 20.333333333333332) internal successors, (61), 3 states have internal predecessors, (61), 1 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 1 states have call predecessors, (19), 1 states have call successors, (19) Word has length 153 [2024-10-14 13:26:43,883 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-14 13:26:43,884 INFO L225 Difference]: With dead ends: 229 [2024-10-14 13:26:43,884 INFO L226 Difference]: Without dead ends: 115 [2024-10-14 13:26:43,885 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 41 GetRequests, 40 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-14 13:26:43,886 INFO L432 NwaCegarLoop]: 161 mSDtfsCounter, 0 mSDsluCounter, 157 mSDsCounter, 0 mSdLazyCounter, 13 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 318 SdHoareTripleChecker+Invalid, 13 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 13 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-14 13:26:43,886 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 318 Invalid, 13 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 13 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-14 13:26:43,889 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 115 states. [2024-10-14 13:26:43,898 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 115 to 115. [2024-10-14 13:26:43,901 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 115 states, 94 states have (on average 1.3829787234042554) internal successors, (130), 94 states have internal predecessors, (130), 19 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 19 states have call predecessors, (19), 19 states have call successors, (19) [2024-10-14 13:26:43,901 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 115 states to 115 states and 168 transitions. [2024-10-14 13:26:43,902 INFO L78 Accepts]: Start accepts. Automaton has 115 states and 168 transitions. Word has length 153 [2024-10-14 13:26:43,902 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-14 13:26:43,902 INFO L471 AbstractCegarLoop]: Abstraction has 115 states and 168 transitions. [2024-10-14 13:26:43,903 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 20.333333333333332) internal successors, (61), 3 states have internal predecessors, (61), 1 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 1 states have call predecessors, (19), 1 states have call successors, (19) [2024-10-14 13:26:43,903 INFO L276 IsEmpty]: Start isEmpty. Operand 115 states and 168 transitions. [2024-10-14 13:26:43,904 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 154 [2024-10-14 13:26:43,905 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 13:26:43,905 INFO L215 NwaCegarLoop]: trace histogram [19, 19, 19, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-14 13:26:43,905 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-10-14 13:26:43,905 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-14 13:26:43,905 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 13:26:43,906 INFO L85 PathProgramCache]: Analyzing trace with hash 888378916, now seen corresponding path program 1 times [2024-10-14 13:26:43,906 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-14 13:26:43,906 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1628885053] [2024-10-14 13:26:43,906 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 13:26:43,906 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-14 13:26:43,944 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 13:26:44,071 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-14 13:26:44,072 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 13:26:44,073 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2024-10-14 13:26:44,074 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 13:26:44,075 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2024-10-14 13:26:44,075 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 13:26:44,076 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2024-10-14 13:26:44,076 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 13:26:44,077 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-10-14 13:26:44,078 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 13:26:44,079 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-10-14 13:26:44,079 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 13:26:44,080 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2024-10-14 13:26:44,080 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 13:26:44,081 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2024-10-14 13:26:44,082 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 13:26:44,082 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2024-10-14 13:26:44,083 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 13:26:44,084 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2024-10-14 13:26:44,085 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 13:26:44,086 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2024-10-14 13:26:44,086 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 13:26:44,087 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 80 [2024-10-14 13:26:44,087 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 13:26:44,088 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 86 [2024-10-14 13:26:44,089 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 13:26:44,090 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 92 [2024-10-14 13:26:44,090 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 13:26:44,091 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 98 [2024-10-14 13:26:44,092 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 13:26:44,093 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 104 [2024-10-14 13:26:44,093 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 13:26:44,094 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 110 [2024-10-14 13:26:44,095 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 13:26:44,095 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 116 [2024-10-14 13:26:44,096 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 13:26:44,097 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 122 [2024-10-14 13:26:44,097 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 13:26:44,099 INFO L134 CoverageAnalysis]: Checked inductivity of 684 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 684 trivial. 0 not checked. [2024-10-14 13:26:44,099 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-14 13:26:44,099 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1628885053] [2024-10-14 13:26:44,099 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1628885053] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-14 13:26:44,099 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-14 13:26:44,099 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-10-14 13:26:44,099 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [724699098] [2024-10-14 13:26:44,100 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-14 13:26:44,100 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-10-14 13:26:44,100 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-14 13:26:44,101 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-10-14 13:26:44,101 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-10-14 13:26:44,101 INFO L87 Difference]: Start difference. First operand 115 states and 168 transitions. Second operand has 4 states, 4 states have (on average 15.25) internal successors, (61), 4 states have internal predecessors, (61), 1 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 1 states have call predecessors, (19), 1 states have call successors, (19) [2024-10-14 13:26:44,124 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-14 13:26:44,125 INFO L93 Difference]: Finished difference Result 231 states and 338 transitions. [2024-10-14 13:26:44,125 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-10-14 13:26:44,125 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 15.25) internal successors, (61), 4 states have internal predecessors, (61), 1 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 1 states have call predecessors, (19), 1 states have call successors, (19) Word has length 153 [2024-10-14 13:26:44,126 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-14 13:26:44,126 INFO L225 Difference]: With dead ends: 231 [2024-10-14 13:26:44,126 INFO L226 Difference]: Without dead ends: 117 [2024-10-14 13:26:44,130 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 43 GetRequests, 41 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-14 13:26:44,131 INFO L432 NwaCegarLoop]: 160 mSDtfsCounter, 0 mSDsluCounter, 313 mSDsCounter, 0 mSdLazyCounter, 24 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 473 SdHoareTripleChecker+Invalid, 24 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 24 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-14 13:26:44,131 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 473 Invalid, 24 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 24 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-14 13:26:44,132 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 117 states. [2024-10-14 13:26:44,135 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 117 to 117. [2024-10-14 13:26:44,136 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 117 states, 96 states have (on average 1.375) internal successors, (132), 96 states have internal predecessors, (132), 19 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 19 states have call predecessors, (19), 19 states have call successors, (19) [2024-10-14 13:26:44,136 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 117 states to 117 states and 170 transitions. [2024-10-14 13:26:44,137 INFO L78 Accepts]: Start accepts. Automaton has 117 states and 170 transitions. Word has length 153 [2024-10-14 13:26:44,137 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-14 13:26:44,137 INFO L471 AbstractCegarLoop]: Abstraction has 117 states and 170 transitions. [2024-10-14 13:26:44,137 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 15.25) internal successors, (61), 4 states have internal predecessors, (61), 1 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 1 states have call predecessors, (19), 1 states have call successors, (19) [2024-10-14 13:26:44,138 INFO L276 IsEmpty]: Start isEmpty. Operand 117 states and 170 transitions. [2024-10-14 13:26:44,139 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 156 [2024-10-14 13:26:44,139 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 13:26:44,139 INFO L215 NwaCegarLoop]: trace histogram [19, 19, 19, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-14 13:26:44,139 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2024-10-14 13:26:44,139 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-14 13:26:44,140 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 13:26:44,140 INFO L85 PathProgramCache]: Analyzing trace with hash -1184537934, now seen corresponding path program 1 times [2024-10-14 13:26:44,140 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-14 13:26:44,140 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [609640884] [2024-10-14 13:26:44,140 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 13:26:44,140 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-14 13:26:44,173 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 13:26:44,342 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-14 13:26:44,346 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 13:26:44,347 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2024-10-14 13:26:44,348 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 13:26:44,350 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2024-10-14 13:26:44,351 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 13:26:44,352 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2024-10-14 13:26:44,352 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 13:26:44,353 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-10-14 13:26:44,354 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 13:26:44,355 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-10-14 13:26:44,359 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 13:26:44,360 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2024-10-14 13:26:44,361 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 13:26:44,363 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2024-10-14 13:26:44,364 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 13:26:44,366 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2024-10-14 13:26:44,367 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 13:26:44,367 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2024-10-14 13:26:44,368 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 13:26:44,369 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2024-10-14 13:26:44,372 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 13:26:44,374 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 80 [2024-10-14 13:26:44,374 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 13:26:44,375 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 86 [2024-10-14 13:26:44,376 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 13:26:44,377 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 92 [2024-10-14 13:26:44,377 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 13:26:44,378 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 98 [2024-10-14 13:26:44,378 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 13:26:44,379 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 104 [2024-10-14 13:26:44,380 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 13:26:44,380 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 110 [2024-10-14 13:26:44,381 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 13:26:44,383 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 116 [2024-10-14 13:26:44,383 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 13:26:44,384 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 122 [2024-10-14 13:26:44,384 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 13:26:44,386 INFO L134 CoverageAnalysis]: Checked inductivity of 684 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 684 trivial. 0 not checked. [2024-10-14 13:26:44,386 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-14 13:26:44,386 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [609640884] [2024-10-14 13:26:44,387 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [609640884] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-14 13:26:44,387 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-14 13:26:44,387 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-10-14 13:26:44,388 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1856281695] [2024-10-14 13:26:44,388 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-14 13:26:44,388 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-10-14 13:26:44,388 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-14 13:26:44,389 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-10-14 13:26:44,389 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-10-14 13:26:44,389 INFO L87 Difference]: Start difference. First operand 117 states and 170 transitions. Second operand has 4 states, 4 states have (on average 15.75) internal successors, (63), 4 states have internal predecessors, (63), 1 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 1 states have call predecessors, (19), 1 states have call successors, (19) [2024-10-14 13:26:44,432 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-14 13:26:44,433 INFO L93 Difference]: Finished difference Result 233 states and 339 transitions. [2024-10-14 13:26:44,433 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-10-14 13:26:44,433 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 15.75) internal successors, (63), 4 states have internal predecessors, (63), 1 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 1 states have call predecessors, (19), 1 states have call successors, (19) Word has length 155 [2024-10-14 13:26:44,434 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-14 13:26:44,435 INFO L225 Difference]: With dead ends: 233 [2024-10-14 13:26:44,436 INFO L226 Difference]: Without dead ends: 117 [2024-10-14 13:26:44,436 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 43 GetRequests, 41 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-14 13:26:44,437 INFO L432 NwaCegarLoop]: 159 mSDtfsCounter, 0 mSDsluCounter, 300 mSDsCounter, 0 mSdLazyCounter, 34 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 459 SdHoareTripleChecker+Invalid, 34 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 34 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-14 13:26:44,439 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 459 Invalid, 34 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 34 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-14 13:26:44,440 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 117 states. [2024-10-14 13:26:44,447 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 117 to 117. [2024-10-14 13:26:44,448 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 117 states, 96 states have (on average 1.3645833333333333) internal successors, (131), 96 states have internal predecessors, (131), 19 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 19 states have call predecessors, (19), 19 states have call successors, (19) [2024-10-14 13:26:44,448 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 117 states to 117 states and 169 transitions. [2024-10-14 13:26:44,451 INFO L78 Accepts]: Start accepts. Automaton has 117 states and 169 transitions. Word has length 155 [2024-10-14 13:26:44,451 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-14 13:26:44,451 INFO L471 AbstractCegarLoop]: Abstraction has 117 states and 169 transitions. [2024-10-14 13:26:44,451 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 15.75) internal successors, (63), 4 states have internal predecessors, (63), 1 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 1 states have call predecessors, (19), 1 states have call successors, (19) [2024-10-14 13:26:44,452 INFO L276 IsEmpty]: Start isEmpty. Operand 117 states and 169 transitions. [2024-10-14 13:26:44,453 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 156 [2024-10-14 13:26:44,454 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 13:26:44,455 INFO L215 NwaCegarLoop]: trace histogram [19, 19, 19, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-14 13:26:44,455 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2024-10-14 13:26:44,455 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-14 13:26:44,455 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 13:26:44,455 INFO L85 PathProgramCache]: Analyzing trace with hash 2089361008, now seen corresponding path program 1 times [2024-10-14 13:26:44,456 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-14 13:26:44,456 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [610614850] [2024-10-14 13:26:44,456 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 13:26:44,456 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-14 13:26:44,602 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 13:26:45,757 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-14 13:26:45,758 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 13:26:45,759 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2024-10-14 13:26:45,759 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 13:26:45,766 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2024-10-14 13:26:45,767 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 13:26:45,768 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2024-10-14 13:26:45,769 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 13:26:45,769 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-10-14 13:26:45,770 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 13:26:45,771 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-10-14 13:26:45,771 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 13:26:45,772 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2024-10-14 13:26:45,772 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 13:26:45,773 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2024-10-14 13:26:45,773 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 13:26:45,774 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2024-10-14 13:26:45,774 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 13:26:45,775 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2024-10-14 13:26:45,776 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 13:26:45,776 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2024-10-14 13:26:45,777 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 13:26:45,777 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 80 [2024-10-14 13:26:45,778 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 13:26:45,779 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 86 [2024-10-14 13:26:45,779 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 13:26:45,780 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 92 [2024-10-14 13:26:45,780 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 13:26:45,781 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 98 [2024-10-14 13:26:45,782 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 13:26:45,783 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 104 [2024-10-14 13:26:45,783 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 13:26:45,784 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 110 [2024-10-14 13:26:45,785 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 13:26:45,785 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 116 [2024-10-14 13:26:45,786 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 13:26:45,786 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 122 [2024-10-14 13:26:45,787 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 13:26:45,788 INFO L134 CoverageAnalysis]: Checked inductivity of 684 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 684 trivial. 0 not checked. [2024-10-14 13:26:45,788 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-14 13:26:45,788 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [610614850] [2024-10-14 13:26:45,788 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [610614850] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-14 13:26:45,788 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-14 13:26:45,789 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2024-10-14 13:26:45,789 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [509555100] [2024-10-14 13:26:45,789 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-14 13:26:45,789 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-10-14 13:26:45,789 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-14 13:26:45,789 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-10-14 13:26:45,790 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=54, Unknown=0, NotChecked=0, Total=72 [2024-10-14 13:26:45,790 INFO L87 Difference]: Start difference. First operand 117 states and 169 transitions. Second operand has 9 states, 8 states have (on average 7.875) internal successors, (63), 9 states have internal predecessors, (63), 2 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 1 states have call predecessors, (19), 2 states have call successors, (19) [2024-10-14 13:26:46,020 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-14 13:26:46,021 INFO L93 Difference]: Finished difference Result 338 states and 487 transitions. [2024-10-14 13:26:46,021 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-10-14 13:26:46,021 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 8 states have (on average 7.875) internal successors, (63), 9 states have internal predecessors, (63), 2 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 1 states have call predecessors, (19), 2 states have call successors, (19) Word has length 155 [2024-10-14 13:26:46,022 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-14 13:26:46,023 INFO L225 Difference]: With dead ends: 338 [2024-10-14 13:26:46,023 INFO L226 Difference]: Without dead ends: 222 [2024-10-14 13:26:46,023 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 52 GetRequests, 42 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 11 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=33, Invalid=99, Unknown=0, NotChecked=0, Total=132 [2024-10-14 13:26:46,024 INFO L432 NwaCegarLoop]: 221 mSDtfsCounter, 242 mSDsluCounter, 1066 mSDsCounter, 0 mSdLazyCounter, 231 mSolverCounterSat, 29 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 243 SdHoareTripleChecker+Valid, 1287 SdHoareTripleChecker+Invalid, 260 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 29 IncrementalHoareTripleChecker+Valid, 231 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-10-14 13:26:46,024 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [243 Valid, 1287 Invalid, 260 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [29 Valid, 231 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-10-14 13:26:46,025 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 222 states. [2024-10-14 13:26:46,033 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 222 to 219. [2024-10-14 13:26:46,034 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 219 states, 183 states have (on average 1.360655737704918) internal successors, (249), 184 states have internal predecessors, (249), 33 states have call successors, (33), 2 states have call predecessors, (33), 2 states have return successors, (33), 32 states have call predecessors, (33), 33 states have call successors, (33) [2024-10-14 13:26:46,035 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 219 states to 219 states and 315 transitions. [2024-10-14 13:26:46,035 INFO L78 Accepts]: Start accepts. Automaton has 219 states and 315 transitions. Word has length 155 [2024-10-14 13:26:46,036 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-14 13:26:46,036 INFO L471 AbstractCegarLoop]: Abstraction has 219 states and 315 transitions. [2024-10-14 13:26:46,036 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 8 states have (on average 7.875) internal successors, (63), 9 states have internal predecessors, (63), 2 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 1 states have call predecessors, (19), 2 states have call successors, (19) [2024-10-14 13:26:46,036 INFO L276 IsEmpty]: Start isEmpty. Operand 219 states and 315 transitions. [2024-10-14 13:26:46,038 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 156 [2024-10-14 13:26:46,038 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 13:26:46,038 INFO L215 NwaCegarLoop]: trace histogram [19, 19, 19, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-14 13:26:46,038 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2024-10-14 13:26:46,038 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-14 13:26:46,039 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 13:26:46,039 INFO L85 PathProgramCache]: Analyzing trace with hash -302267351, now seen corresponding path program 1 times [2024-10-14 13:26:46,039 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-14 13:26:46,039 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1801663472] [2024-10-14 13:26:46,039 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 13:26:46,040 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-14 13:26:46,164 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat