./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-ap_file-40.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version fca748b1 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-ap_file-40.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 701bed3a43f899916e62fb61f191b70b6f4d30dc354ae918413412b769e8c450 --- Real Ultimate output --- This is Ultimate 0.2.5-wip.dd.update-z3-fca748b-m [2024-11-20 08:35:33,826 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-20 08:35:33,902 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2024-11-20 08:35:33,911 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-20 08:35:33,912 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-20 08:35:33,947 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-20 08:35:33,949 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-20 08:35:33,949 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-20 08:35:33,950 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-11-20 08:35:33,951 INFO L153 SettingsManager]: * Use memory slicer=true [2024-11-20 08:35:33,953 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-20 08:35:33,953 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-20 08:35:33,954 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-20 08:35:33,954 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-20 08:35:33,955 INFO L153 SettingsManager]: * Use SBE=true [2024-11-20 08:35:33,956 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-20 08:35:33,956 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-11-20 08:35:33,959 INFO L153 SettingsManager]: * sizeof long=4 [2024-11-20 08:35:33,959 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-11-20 08:35:33,959 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-11-20 08:35:33,960 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-20 08:35:33,961 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-11-20 08:35:33,961 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-20 08:35:33,962 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-11-20 08:35:33,962 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-20 08:35:33,962 INFO L153 SettingsManager]: * sizeof long double=12 [2024-11-20 08:35:33,962 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-11-20 08:35:33,963 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-20 08:35:33,963 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-11-20 08:35:33,964 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-20 08:35:33,964 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-20 08:35:33,965 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-20 08:35:33,965 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-20 08:35:33,966 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-20 08:35:33,966 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-20 08:35:33,966 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-11-20 08:35:33,967 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-11-20 08:35:33,967 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-11-20 08:35:33,967 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-20 08:35:33,967 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-11-20 08:35:33,967 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-11-20 08:35:33,968 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-11-20 08:35:33,968 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 -> 701bed3a43f899916e62fb61f191b70b6f4d30dc354ae918413412b769e8c450 [2024-11-20 08:35:34,254 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-20 08:35:34,281 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-20 08:35:34,284 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-20 08:35:34,285 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-20 08:35:34,286 INFO L274 PluginConnector]: CDTParser initialized [2024-11-20 08:35:34,287 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-ap_file-40.i [2024-11-20 08:35:35,723 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-20 08:35:35,965 INFO L384 CDTParser]: Found 1 translation units. [2024-11-20 08:35:35,966 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-ap_file-40.i [2024-11-20 08:35:35,979 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/3d2394051/07c1f256b10e402fbd380a191c758e20/FLAG337ae92d2 [2024-11-20 08:35:36,328 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/3d2394051/07c1f256b10e402fbd380a191c758e20 [2024-11-20 08:35:36,331 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-20 08:35:36,332 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-20 08:35:36,333 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-20 08:35:36,333 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-20 08:35:36,339 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-20 08:35:36,340 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 20.11 08:35:36" (1/1) ... [2024-11-20 08:35:36,341 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@1c133770 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 08:35:36, skipping insertion in model container [2024-11-20 08:35:36,341 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 20.11 08:35:36" (1/1) ... [2024-11-20 08:35:36,374 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-20 08:35:36,575 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-ap_file-40.i[917,930] [2024-11-20 08:35:36,678 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-20 08:35:36,695 INFO L200 MainTranslator]: Completed pre-run [2024-11-20 08:35:36,708 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-ap_file-40.i[917,930] [2024-11-20 08:35:36,744 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-20 08:35:36,768 INFO L204 MainTranslator]: Completed translation [2024-11-20 08:35:36,769 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 08:35:36 WrapperNode [2024-11-20 08:35:36,769 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-20 08:35:36,771 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-20 08:35:36,771 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-20 08:35:36,771 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-20 08:35:36,780 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 08:35:36" (1/1) ... [2024-11-20 08:35:36,797 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 08:35:36" (1/1) ... [2024-11-20 08:35:36,840 INFO L138 Inliner]: procedures = 29, calls = 157, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 491 [2024-11-20 08:35:36,841 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-20 08:35:36,846 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-20 08:35:36,846 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-20 08:35:36,846 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-20 08:35:36,857 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 08:35:36" (1/1) ... [2024-11-20 08:35:36,857 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 08:35:36" (1/1) ... [2024-11-20 08:35:36,863 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 08:35:36" (1/1) ... [2024-11-20 08:35:36,896 INFO L175 MemorySlicer]: Split 120 memory accesses to 8 slices as follows [2, 16, 14, 15, 27, 17, 10, 19]. 23 percent of accesses are in the largest equivalence class. The 18 initializations are split as follows [2, 2, 2, 1, 3, 3, 2, 3]. The 17 writes are split as follows [0, 2, 2, 1, 3, 3, 2, 4]. [2024-11-20 08:35:36,896 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 08:35:36" (1/1) ... [2024-11-20 08:35:36,896 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 08:35:36" (1/1) ... [2024-11-20 08:35:36,918 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 08:35:36" (1/1) ... [2024-11-20 08:35:36,947 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 08:35:36" (1/1) ... [2024-11-20 08:35:36,962 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 08:35:36" (1/1) ... [2024-11-20 08:35:36,964 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 08:35:36" (1/1) ... [2024-11-20 08:35:36,979 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-20 08:35:36,985 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-11-20 08:35:36,985 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-11-20 08:35:36,985 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-11-20 08:35:36,986 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 08:35:36" (1/1) ... [2024-11-20 08:35:37,002 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-20 08:35:37,015 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-20 08:35:37,056 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2024-11-20 08:35:37,067 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2024-11-20 08:35:37,114 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-11-20 08:35:37,115 INFO L130 BoogieDeclarations]: Found specification of procedure read~real#0 [2024-11-20 08:35:37,116 INFO L130 BoogieDeclarations]: Found specification of procedure read~real#1 [2024-11-20 08:35:37,116 INFO L130 BoogieDeclarations]: Found specification of procedure read~real#2 [2024-11-20 08:35:37,116 INFO L130 BoogieDeclarations]: Found specification of procedure read~real#3 [2024-11-20 08:35:37,116 INFO L130 BoogieDeclarations]: Found specification of procedure read~real#4 [2024-11-20 08:35:37,116 INFO L130 BoogieDeclarations]: Found specification of procedure read~real#5 [2024-11-20 08:35:37,118 INFO L130 BoogieDeclarations]: Found specification of procedure read~real#6 [2024-11-20 08:35:37,118 INFO L130 BoogieDeclarations]: Found specification of procedure read~real#7 [2024-11-20 08:35:37,118 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#0 [2024-11-20 08:35:37,118 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#1 [2024-11-20 08:35:37,118 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#2 [2024-11-20 08:35:37,118 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#3 [2024-11-20 08:35:37,118 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#4 [2024-11-20 08:35:37,119 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#5 [2024-11-20 08:35:37,119 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#6 [2024-11-20 08:35:37,119 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#7 [2024-11-20 08:35:37,119 INFO L130 BoogieDeclarations]: Found specification of procedure write~real#0 [2024-11-20 08:35:37,119 INFO L130 BoogieDeclarations]: Found specification of procedure write~real#1 [2024-11-20 08:35:37,119 INFO L130 BoogieDeclarations]: Found specification of procedure write~real#2 [2024-11-20 08:35:37,119 INFO L130 BoogieDeclarations]: Found specification of procedure write~real#3 [2024-11-20 08:35:37,119 INFO L130 BoogieDeclarations]: Found specification of procedure write~real#4 [2024-11-20 08:35:37,119 INFO L130 BoogieDeclarations]: Found specification of procedure write~real#5 [2024-11-20 08:35:37,119 INFO L130 BoogieDeclarations]: Found specification of procedure write~real#6 [2024-11-20 08:35:37,119 INFO L130 BoogieDeclarations]: Found specification of procedure write~real#7 [2024-11-20 08:35:37,119 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#0 [2024-11-20 08:35:37,120 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#1 [2024-11-20 08:35:37,120 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#2 [2024-11-20 08:35:37,120 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#3 [2024-11-20 08:35:37,120 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#4 [2024-11-20 08:35:37,120 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#5 [2024-11-20 08:35:37,120 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#6 [2024-11-20 08:35:37,122 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#7 [2024-11-20 08:35:37,122 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~real#0 [2024-11-20 08:35:37,122 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~real#1 [2024-11-20 08:35:37,123 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~real#2 [2024-11-20 08:35:37,123 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~real#3 [2024-11-20 08:35:37,123 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~real#4 [2024-11-20 08:35:37,123 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~real#5 [2024-11-20 08:35:37,123 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~real#6 [2024-11-20 08:35:37,123 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~real#7 [2024-11-20 08:35:37,123 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2024-11-20 08:35:37,123 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2024-11-20 08:35:37,124 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-11-20 08:35:37,124 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#1 [2024-11-20 08:35:37,124 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#2 [2024-11-20 08:35:37,124 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#3 [2024-11-20 08:35:37,124 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#4 [2024-11-20 08:35:37,124 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#5 [2024-11-20 08:35:37,124 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#6 [2024-11-20 08:35:37,124 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#7 [2024-11-20 08:35:37,125 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-20 08:35:37,125 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-20 08:35:37,300 INFO L238 CfgBuilder]: Building ICFG [2024-11-20 08:35:37,302 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-20 08:35:37,865 INFO L? ?]: Removed 105 outVars from TransFormulas that were not future-live. [2024-11-20 08:35:37,866 INFO L287 CfgBuilder]: Performing block encoding [2024-11-20 08:35:37,882 INFO L311 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-20 08:35:37,883 INFO L316 CfgBuilder]: Removed 1 assume(true) statements. [2024-11-20 08:35:37,885 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 20.11 08:35:37 BoogieIcfgContainer [2024-11-20 08:35:37,885 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-11-20 08:35:37,887 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-11-20 08:35:37,887 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-11-20 08:35:37,891 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-11-20 08:35:37,892 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 20.11 08:35:36" (1/3) ... [2024-11-20 08:35:37,894 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3c836717 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 20.11 08:35:37, skipping insertion in model container [2024-11-20 08:35:37,894 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 08:35:36" (2/3) ... [2024-11-20 08:35:37,894 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3c836717 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 20.11 08:35:37, skipping insertion in model container [2024-11-20 08:35:37,894 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 20.11 08:35:37" (3/3) ... [2024-11-20 08:35:37,896 INFO L112 eAbstractionObserver]: Analyzing ICFG hardness_variablewrapping_wrapper-ap_file-40.i [2024-11-20 08:35:37,911 INFO L214 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-11-20 08:35:37,911 INFO L154 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-11-20 08:35:37,974 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-20 08:35:37,981 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;@795ff646, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-20 08:35:37,981 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-11-20 08:35:37,986 INFO L276 IsEmpty]: Start isEmpty. Operand has 113 states, 91 states have (on average 1.4175824175824177) 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-11-20 08:35:38,002 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 151 [2024-11-20 08:35:38,002 INFO L207 NwaCegarLoop]: Found error trace [2024-11-20 08:35:38,003 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] [2024-11-20 08:35:38,004 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-20 08:35:38,009 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-20 08:35:38,010 INFO L85 PathProgramCache]: Analyzing trace with hash 1897959538, now seen corresponding path program 1 times [2024-11-20 08:35:38,019 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-20 08:35:38,019 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1969137145] [2024-11-20 08:35:38,020 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-20 08:35:38,020 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-20 08:35:38,240 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 08:35:38,466 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-20 08:35:38,470 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 08:35:38,477 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-11-20 08:35:38,481 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 08:35:38,484 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-11-20 08:35:38,489 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 08:35:38,494 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2024-11-20 08:35:38,501 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 08:35:38,504 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-11-20 08:35:38,509 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 08:35:38,513 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-11-20 08:35:38,519 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 08:35:38,524 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2024-11-20 08:35:38,527 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 08:35:38,532 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2024-11-20 08:35:38,538 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 08:35:38,543 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2024-11-20 08:35:38,547 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 08:35:38,550 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2024-11-20 08:35:38,555 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 08:35:38,558 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2024-11-20 08:35:38,563 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 08:35:38,567 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2024-11-20 08:35:38,571 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 08:35:38,575 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 80 [2024-11-20 08:35:38,580 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 08:35:38,583 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 86 [2024-11-20 08:35:38,588 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 08:35:38,591 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 92 [2024-11-20 08:35:38,594 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 08:35:38,599 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 98 [2024-11-20 08:35:38,605 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 08:35:38,607 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 104 [2024-11-20 08:35:38,611 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 08:35:38,615 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 110 [2024-11-20 08:35:38,619 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 08:35:38,622 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 116 [2024-11-20 08:35:38,626 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 08:35:38,631 INFO L134 CoverageAnalysis]: Checked inductivity of 684 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 684 trivial. 0 not checked. [2024-11-20 08:35:38,633 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-20 08:35:38,633 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1969137145] [2024-11-20 08:35:38,634 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1969137145] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-20 08:35:38,635 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-20 08:35:38,635 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-20 08:35:38,637 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [962817936] [2024-11-20 08:35:38,638 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-20 08:35:38,642 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-11-20 08:35:38,643 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-20 08:35:38,667 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-11-20 08:35:38,667 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-11-20 08:35:38,669 INFO L87 Difference]: Start difference. First operand has 113 states, 91 states have (on average 1.4175824175824177) 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) Second operand has 2 states, 2 states have (on average 29.0) internal successors, (58), 2 states have internal predecessors, (58), 2 states have call successors, (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-11-20 08:35:38,699 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-20 08:35:38,700 INFO L93 Difference]: Finished difference Result 219 states and 347 transitions. [2024-11-20 08:35:38,701 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-11-20 08:35:38,702 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 29.0) internal successors, (58), 2 states have internal predecessors, (58), 2 states have call successors, (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 150 [2024-11-20 08:35:38,703 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-20 08:35:38,715 INFO L225 Difference]: With dead ends: 219 [2024-11-20 08:35:38,715 INFO L226 Difference]: Without dead ends: 109 [2024-11-20 08:35:38,720 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-11-20 08:35:38,726 INFO L432 NwaCegarLoop]: 160 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 0 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 160 SdHoareTripleChecker+Invalid, 0 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 0 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-20 08:35:38,728 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 160 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-20 08:35:38,745 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 109 states. [2024-11-20 08:35:38,778 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 109 to 109. [2024-11-20 08:35:38,779 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 109 states, 88 states have (on average 1.3863636363636365) internal successors, (122), 88 states have internal predecessors, (122), 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-11-20 08:35:38,783 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 109 states to 109 states and 160 transitions. [2024-11-20 08:35:38,787 INFO L78 Accepts]: Start accepts. Automaton has 109 states and 160 transitions. Word has length 150 [2024-11-20 08:35:38,787 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-20 08:35:38,788 INFO L471 AbstractCegarLoop]: Abstraction has 109 states and 160 transitions. [2024-11-20 08:35:38,788 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 29.0) internal successors, (58), 2 states have internal predecessors, (58), 2 states have call successors, (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-11-20 08:35:38,788 INFO L276 IsEmpty]: Start isEmpty. Operand 109 states and 160 transitions. [2024-11-20 08:35:38,793 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 151 [2024-11-20 08:35:38,794 INFO L207 NwaCegarLoop]: Found error trace [2024-11-20 08:35:38,794 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] [2024-11-20 08:35:38,794 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-11-20 08:35:38,795 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-20 08:35:38,795 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-20 08:35:38,796 INFO L85 PathProgramCache]: Analyzing trace with hash -1396978404, now seen corresponding path program 1 times [2024-11-20 08:35:38,796 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-20 08:35:38,796 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2017921349] [2024-11-20 08:35:38,796 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-20 08:35:38,796 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-20 08:35:38,891 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 08:35:39,276 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-20 08:35:39,279 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 08:35:39,281 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-11-20 08:35:39,283 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 08:35:39,285 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-11-20 08:35:39,287 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 08:35:39,288 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2024-11-20 08:35:39,290 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 08:35:39,291 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-11-20 08:35:39,293 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 08:35:39,294 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-11-20 08:35:39,296 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 08:35:39,299 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2024-11-20 08:35:39,301 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 08:35:39,304 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2024-11-20 08:35:39,306 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 08:35:39,308 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2024-11-20 08:35:39,311 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 08:35:39,313 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2024-11-20 08:35:39,317 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 08:35:39,322 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2024-11-20 08:35:39,324 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 08:35:39,326 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2024-11-20 08:35:39,329 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 08:35:39,331 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 80 [2024-11-20 08:35:39,333 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 08:35:39,336 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 86 [2024-11-20 08:35:39,338 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 08:35:39,341 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 92 [2024-11-20 08:35:39,342 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 08:35:39,346 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 98 [2024-11-20 08:35:39,348 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 08:35:39,350 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 104 [2024-11-20 08:35:39,353 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 08:35:39,356 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 110 [2024-11-20 08:35:39,359 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 08:35:39,361 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 116 [2024-11-20 08:35:39,364 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 08:35:39,369 INFO L134 CoverageAnalysis]: Checked inductivity of 684 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 684 trivial. 0 not checked. [2024-11-20 08:35:39,370 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-20 08:35:39,370 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2017921349] [2024-11-20 08:35:39,370 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2017921349] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-20 08:35:39,370 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-20 08:35:39,370 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-20 08:35:39,371 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1107233020] [2024-11-20 08:35:39,371 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-20 08:35:39,372 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-20 08:35:39,373 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-20 08:35:39,373 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-20 08:35:39,374 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-20 08:35:39,374 INFO L87 Difference]: Start difference. First operand 109 states and 160 transitions. Second operand has 4 states, 4 states have (on average 14.5) internal successors, (58), 4 states have internal predecessors, (58), 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-11-20 08:35:39,432 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-20 08:35:39,435 INFO L93 Difference]: Finished difference Result 217 states and 320 transitions. [2024-11-20 08:35:39,436 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-20 08:35:39,436 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 14.5) internal successors, (58), 4 states have internal predecessors, (58), 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 150 [2024-11-20 08:35:39,437 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-20 08:35:39,439 INFO L225 Difference]: With dead ends: 217 [2024-11-20 08:35:39,439 INFO L226 Difference]: Without dead ends: 111 [2024-11-20 08:35:39,440 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-11-20 08:35:39,441 INFO L432 NwaCegarLoop]: 158 mSDtfsCounter, 0 mSDsluCounter, 305 mSDsCounter, 0 mSdLazyCounter, 16 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 463 SdHoareTripleChecker+Invalid, 16 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 16 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-20 08:35:39,442 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 463 Invalid, 16 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 16 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-20 08:35:39,443 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 111 states. [2024-11-20 08:35:39,460 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 111 to 111. [2024-11-20 08:35:39,463 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 111 states, 90 states have (on average 1.3777777777777778) internal successors, (124), 90 states have internal predecessors, (124), 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-11-20 08:35:39,465 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 111 states to 111 states and 162 transitions. [2024-11-20 08:35:39,466 INFO L78 Accepts]: Start accepts. Automaton has 111 states and 162 transitions. Word has length 150 [2024-11-20 08:35:39,470 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-20 08:35:39,470 INFO L471 AbstractCegarLoop]: Abstraction has 111 states and 162 transitions. [2024-11-20 08:35:39,471 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 14.5) internal successors, (58), 4 states have internal predecessors, (58), 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-11-20 08:35:39,471 INFO L276 IsEmpty]: Start isEmpty. Operand 111 states and 162 transitions. [2024-11-20 08:35:39,473 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 154 [2024-11-20 08:35:39,477 INFO L207 NwaCegarLoop]: Found error trace [2024-11-20 08:35:39,477 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-11-20 08:35:39,477 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-11-20 08:35:39,477 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-20 08:35:39,478 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-20 08:35:39,478 INFO L85 PathProgramCache]: Analyzing trace with hash -677242547, now seen corresponding path program 1 times [2024-11-20 08:35:39,478 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-20 08:35:39,479 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [158337553] [2024-11-20 08:35:39,479 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-20 08:35:39,480 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-20 08:35:39,549 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 08:35:39,684 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-20 08:35:39,687 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 08:35:39,690 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-11-20 08:35:39,693 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 08:35:39,695 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-11-20 08:35:39,696 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 08:35:39,699 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2024-11-20 08:35:39,702 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 08:35:39,704 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-11-20 08:35:39,706 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 08:35:39,709 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-11-20 08:35:39,711 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 08:35:39,712 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2024-11-20 08:35:39,715 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 08:35:39,717 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2024-11-20 08:35:39,718 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 08:35:39,721 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2024-11-20 08:35:39,723 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 08:35:39,724 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2024-11-20 08:35:39,727 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 08:35:39,750 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2024-11-20 08:35:39,752 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 08:35:39,754 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2024-11-20 08:35:39,756 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 08:35:39,758 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 80 [2024-11-20 08:35:39,761 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 08:35:39,763 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 86 [2024-11-20 08:35:39,765 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 08:35:39,767 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 92 [2024-11-20 08:35:39,769 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 08:35:39,772 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 98 [2024-11-20 08:35:39,773 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 08:35:39,775 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 104 [2024-11-20 08:35:39,780 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 08:35:39,781 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 110 [2024-11-20 08:35:39,786 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 08:35:39,788 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 116 [2024-11-20 08:35:39,790 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 08:35:39,792 INFO L134 CoverageAnalysis]: Checked inductivity of 684 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 684 trivial. 0 not checked. [2024-11-20 08:35:39,792 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-20 08:35:39,792 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [158337553] [2024-11-20 08:35:39,793 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [158337553] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-20 08:35:39,796 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-20 08:35:39,796 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-20 08:35:39,796 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [988286929] [2024-11-20 08:35:39,797 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-20 08:35:39,797 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-20 08:35:39,797 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-20 08:35:39,798 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-20 08:35:39,798 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-20 08:35:39,798 INFO L87 Difference]: Start difference. First operand 111 states and 162 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-11-20 08:35:39,833 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-20 08:35:39,837 INFO L93 Difference]: Finished difference Result 222 states and 325 transitions. [2024-11-20 08:35:39,838 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-20 08:35:39,838 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-11-20 08:35:39,839 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-20 08:35:39,842 INFO L225 Difference]: With dead ends: 222 [2024-11-20 08:35:39,842 INFO L226 Difference]: Without dead ends: 114 [2024-11-20 08:35:39,845 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-11-20 08:35:39,846 INFO L432 NwaCegarLoop]: 157 mSDtfsCounter, 1 mSDsluCounter, 303 mSDsCounter, 0 mSdLazyCounter, 18 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 460 SdHoareTripleChecker+Invalid, 19 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 18 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-20 08:35:39,849 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1 Valid, 460 Invalid, 19 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 18 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-20 08:35:39,850 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 114 states. [2024-11-20 08:35:39,860 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 114 to 113. [2024-11-20 08:35:39,863 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 113 states, 92 states have (on average 1.3695652173913044) internal successors, (126), 92 states have internal predecessors, (126), 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-11-20 08:35:39,864 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 113 states to 113 states and 164 transitions. [2024-11-20 08:35:39,867 INFO L78 Accepts]: Start accepts. Automaton has 113 states and 164 transitions. Word has length 153 [2024-11-20 08:35:39,868 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-20 08:35:39,868 INFO L471 AbstractCegarLoop]: Abstraction has 113 states and 164 transitions. [2024-11-20 08:35:39,868 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-11-20 08:35:39,869 INFO L276 IsEmpty]: Start isEmpty. Operand 113 states and 164 transitions. [2024-11-20 08:35:39,871 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 154 [2024-11-20 08:35:39,874 INFO L207 NwaCegarLoop]: Found error trace [2024-11-20 08:35:39,874 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-11-20 08:35:39,875 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-11-20 08:35:39,875 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-20 08:35:39,875 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-20 08:35:39,875 INFO L85 PathProgramCache]: Analyzing trace with hash 2815823, now seen corresponding path program 1 times [2024-11-20 08:35:39,875 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-20 08:35:39,876 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [942629447] [2024-11-20 08:35:39,876 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-20 08:35:39,876 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-20 08:35:39,935 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 08:35:40,056 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-20 08:35:40,058 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 08:35:40,059 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-11-20 08:35:40,061 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 08:35:40,063 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-11-20 08:35:40,066 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 08:35:40,069 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2024-11-20 08:35:40,072 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 08:35:40,074 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-11-20 08:35:40,076 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 08:35:40,078 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-11-20 08:35:40,081 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 08:35:40,083 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2024-11-20 08:35:40,085 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 08:35:40,088 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2024-11-20 08:35:40,089 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 08:35:40,093 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2024-11-20 08:35:40,094 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 08:35:40,097 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2024-11-20 08:35:40,098 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 08:35:40,100 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2024-11-20 08:35:40,101 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 08:35:40,104 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2024-11-20 08:35:40,105 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 08:35:40,107 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 80 [2024-11-20 08:35:40,110 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 08:35:40,111 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 86 [2024-11-20 08:35:40,113 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 08:35:40,115 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 92 [2024-11-20 08:35:40,116 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 08:35:40,118 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 98 [2024-11-20 08:35:40,120 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 08:35:40,122 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 104 [2024-11-20 08:35:40,124 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 08:35:40,125 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 110 [2024-11-20 08:35:40,128 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 08:35:40,130 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 116 [2024-11-20 08:35:40,132 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 08:35:40,135 INFO L134 CoverageAnalysis]: Checked inductivity of 684 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 684 trivial. 0 not checked. [2024-11-20 08:35:40,139 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-20 08:35:40,140 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [942629447] [2024-11-20 08:35:40,140 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [942629447] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-20 08:35:40,140 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-20 08:35:40,140 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-20 08:35:40,140 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [81759474] [2024-11-20 08:35:40,140 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-20 08:35:40,141 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-20 08:35:40,141 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-20 08:35:40,142 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-20 08:35:40,142 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-20 08:35:40,142 INFO L87 Difference]: Start difference. First operand 113 states and 164 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-11-20 08:35:40,174 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-20 08:35:40,174 INFO L93 Difference]: Finished difference Result 226 states and 329 transitions. [2024-11-20 08:35:40,176 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-20 08:35:40,177 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-11-20 08:35:40,178 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-20 08:35:40,179 INFO L225 Difference]: With dead ends: 226 [2024-11-20 08:35:40,179 INFO L226 Difference]: Without dead ends: 116 [2024-11-20 08:35:40,180 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-11-20 08:35:40,183 INFO L432 NwaCegarLoop]: 157 mSDtfsCounter, 1 mSDsluCounter, 306 mSDsCounter, 0 mSdLazyCounter, 15 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 463 SdHoareTripleChecker+Invalid, 16 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 15 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-20 08:35:40,185 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1 Valid, 463 Invalid, 16 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 15 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-20 08:35:40,186 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 116 states. [2024-11-20 08:35:40,196 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 116 to 115. [2024-11-20 08:35:40,198 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 115 states, 94 states have (on average 1.3617021276595744) internal successors, (128), 94 states have internal predecessors, (128), 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-11-20 08:35:40,199 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 115 states to 115 states and 166 transitions. [2024-11-20 08:35:40,200 INFO L78 Accepts]: Start accepts. Automaton has 115 states and 166 transitions. Word has length 153 [2024-11-20 08:35:40,200 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-20 08:35:40,200 INFO L471 AbstractCegarLoop]: Abstraction has 115 states and 166 transitions. [2024-11-20 08:35:40,201 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-11-20 08:35:40,201 INFO L276 IsEmpty]: Start isEmpty. Operand 115 states and 166 transitions. [2024-11-20 08:35:40,203 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 154 [2024-11-20 08:35:40,203 INFO L207 NwaCegarLoop]: Found error trace [2024-11-20 08:35:40,203 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-11-20 08:35:40,203 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2024-11-20 08:35:40,204 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-20 08:35:40,204 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-20 08:35:40,204 INFO L85 PathProgramCache]: Analyzing trace with hash 4662865, now seen corresponding path program 1 times [2024-11-20 08:35:40,208 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-20 08:35:40,208 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1003583665] [2024-11-20 08:35:40,209 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-20 08:35:40,209 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-20 08:35:40,541 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 08:35:49,443 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-20 08:35:49,447 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 08:35:49,458 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-11-20 08:35:49,461 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 08:35:49,466 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-11-20 08:35:49,468 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 08:35:49,472 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2024-11-20 08:35:49,474 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 08:35:49,480 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-11-20 08:35:49,483 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 08:35:49,489 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-11-20 08:35:49,492 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 08:35:49,497 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2024-11-20 08:35:49,499 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 08:35:49,504 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2024-11-20 08:35:49,507 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 08:35:49,512 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2024-11-20 08:35:49,515 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 08:35:49,519 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2024-11-20 08:35:49,522 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 08:35:49,525 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2024-11-20 08:35:49,527 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 08:35:49,529 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2024-11-20 08:35:49,531 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 08:35:49,532 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 80 [2024-11-20 08:35:49,535 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 08:35:49,537 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 86 [2024-11-20 08:35:49,539 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 08:35:49,540 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 92 [2024-11-20 08:35:49,542 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 08:35:49,544 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 98 [2024-11-20 08:35:49,546 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 08:35:49,547 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 104 [2024-11-20 08:35:49,549 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 08:35:49,552 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 110 [2024-11-20 08:35:49,554 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 08:35:49,556 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 116 [2024-11-20 08:35:49,558 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 08:35:49,563 INFO L134 CoverageAnalysis]: Checked inductivity of 684 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 684 trivial. 0 not checked. [2024-11-20 08:35:49,564 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-20 08:35:49,565 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1003583665] [2024-11-20 08:35:49,565 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1003583665] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-20 08:35:49,565 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-20 08:35:49,565 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2024-11-20 08:35:49,565 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2051700605] [2024-11-20 08:35:49,565 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-20 08:35:49,566 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-11-20 08:35:49,566 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-20 08:35:49,566 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-11-20 08:35:49,567 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=70, Unknown=0, NotChecked=0, Total=90 [2024-11-20 08:35:49,567 INFO L87 Difference]: Start difference. First operand 115 states and 166 transitions. Second operand has 10 states, 10 states have (on average 6.1) internal successors, (61), 10 states have internal predecessors, (61), 3 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 3 states have call predecessors, (19), 3 states have call successors, (19) [2024-11-20 08:35:53,600 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-20 08:35:53,601 INFO L93 Difference]: Finished difference Result 431 states and 620 transitions. [2024-11-20 08:35:53,601 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-11-20 08:35:53,601 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 6.1) internal successors, (61), 10 states have internal predecessors, (61), 3 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 3 states have call predecessors, (19), 3 states have call successors, (19) Word has length 153 [2024-11-20 08:35:53,602 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-20 08:35:53,604 INFO L225 Difference]: With dead ends: 431 [2024-11-20 08:35:53,604 INFO L226 Difference]: Without dead ends: 319 [2024-11-20 08:35:53,605 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 55 GetRequests, 42 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 18 ImplicationChecksByTransitivity, 2.7s TimeCoverageRelationStatistics Valid=44, Invalid=166, Unknown=0, NotChecked=0, Total=210 [2024-11-20 08:35:53,609 INFO L432 NwaCegarLoop]: 155 mSDtfsCounter, 308 mSDsluCounter, 835 mSDsCounter, 0 mSdLazyCounter, 435 mSolverCounterSat, 39 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 308 SdHoareTripleChecker+Valid, 990 SdHoareTripleChecker+Invalid, 474 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 39 IncrementalHoareTripleChecker+Valid, 435 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.6s IncrementalHoareTripleChecker+Time [2024-11-20 08:35:53,612 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [308 Valid, 990 Invalid, 474 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [39 Valid, 435 Invalid, 0 Unknown, 0 Unchecked, 2.6s Time] [2024-11-20 08:35:53,614 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 319 states. [2024-11-20 08:35:53,637 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 319 to 311. [2024-11-20 08:35:53,638 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 311 states, 258 states have (on average 1.3643410852713178) internal successors, (352), 260 states have internal predecessors, (352), 48 states have call successors, (48), 4 states have call predecessors, (48), 4 states have return successors, (48), 46 states have call predecessors, (48), 48 states have call successors, (48) [2024-11-20 08:35:53,640 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 311 states to 311 states and 448 transitions. [2024-11-20 08:35:53,640 INFO L78 Accepts]: Start accepts. Automaton has 311 states and 448 transitions. Word has length 153 [2024-11-20 08:35:53,641 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-20 08:35:53,641 INFO L471 AbstractCegarLoop]: Abstraction has 311 states and 448 transitions. [2024-11-20 08:35:53,641 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 6.1) internal successors, (61), 10 states have internal predecessors, (61), 3 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 3 states have call predecessors, (19), 3 states have call successors, (19) [2024-11-20 08:35:53,641 INFO L276 IsEmpty]: Start isEmpty. Operand 311 states and 448 transitions. [2024-11-20 08:35:53,643 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 154 [2024-11-20 08:35:53,643 INFO L207 NwaCegarLoop]: Found error trace [2024-11-20 08:35:53,643 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-11-20 08:35:53,644 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2024-11-20 08:35:53,644 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-20 08:35:53,644 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-20 08:35:53,644 INFO L85 PathProgramCache]: Analyzing trace with hash -1016405489, now seen corresponding path program 1 times [2024-11-20 08:35:53,645 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-20 08:35:53,645 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [995027413] [2024-11-20 08:35:53,645 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-20 08:35:53,645 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-20 08:35:53,717 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 08:35:54,321 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-20 08:35:54,323 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 08:35:54,324 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-11-20 08:35:54,325 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 08:35:54,327 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-11-20 08:35:54,328 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 08:35:54,329 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2024-11-20 08:35:54,330 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 08:35:54,332 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-11-20 08:35:54,333 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 08:35:54,334 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-11-20 08:35:54,335 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 08:35:54,337 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2024-11-20 08:35:54,338 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 08:35:54,340 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2024-11-20 08:35:54,341 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 08:35:54,342 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2024-11-20 08:35:54,343 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 08:35:54,345 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2024-11-20 08:35:54,346 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 08:35:54,348 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2024-11-20 08:35:54,350 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 08:35:54,352 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2024-11-20 08:35:54,353 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 08:35:54,355 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 80 [2024-11-20 08:35:54,356 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 08:35:54,358 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 86 [2024-11-20 08:35:54,359 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 08:35:54,360 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 92 [2024-11-20 08:35:54,361 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 08:35:54,362 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 98 [2024-11-20 08:35:54,363 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 08:35:54,364 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 104 [2024-11-20 08:35:54,366 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 08:35:54,367 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 110 [2024-11-20 08:35:54,368 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 08:35:54,370 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 116 [2024-11-20 08:35:54,371 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 08:35:54,373 INFO L134 CoverageAnalysis]: Checked inductivity of 684 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 684 trivial. 0 not checked. [2024-11-20 08:35:54,373 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-20 08:35:54,374 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [995027413] [2024-11-20 08:35:54,374 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [995027413] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-20 08:35:54,374 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-20 08:35:54,374 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-11-20 08:35:54,374 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1513844802] [2024-11-20 08:35:54,374 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-20 08:35:54,375 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-11-20 08:35:54,375 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-20 08:35:54,375 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-11-20 08:35:54,376 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2024-11-20 08:35:54,376 INFO L87 Difference]: Start difference. First operand 311 states and 448 transitions. Second operand has 7 states, 7 states have (on average 8.714285714285714) internal successors, (61), 7 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-11-20 08:35:54,632 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-20 08:35:54,632 INFO L93 Difference]: Finished difference Result 667 states and 951 transitions. [2024-11-20 08:35:54,632 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-11-20 08:35:54,633 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 8.714285714285714) internal successors, (61), 7 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-11-20 08:35:54,633 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-20 08:35:54,638 INFO L225 Difference]: With dead ends: 667 [2024-11-20 08:35:54,638 INFO L226 Difference]: Without dead ends: 475 [2024-11-20 08:35:54,640 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 49 GetRequests, 40 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=33, Invalid=77, Unknown=0, NotChecked=0, Total=110 [2024-11-20 08:35:54,641 INFO L432 NwaCegarLoop]: 210 mSDtfsCounter, 255 mSDsluCounter, 728 mSDsCounter, 0 mSdLazyCounter, 99 mSolverCounterSat, 30 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 255 SdHoareTripleChecker+Valid, 938 SdHoareTripleChecker+Invalid, 129 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 30 IncrementalHoareTripleChecker+Valid, 99 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-11-20 08:35:54,641 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [255 Valid, 938 Invalid, 129 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [30 Valid, 99 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-11-20 08:35:54,645 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 475 states. [2024-11-20 08:35:54,687 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 475 to 420. [2024-11-20 08:35:54,688 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 420 states, 351 states have (on average 1.3618233618233617) internal successors, (478), 354 states have internal predecessors, (478), 63 states have call successors, (63), 5 states have call predecessors, (63), 5 states have return successors, (63), 60 states have call predecessors, (63), 63 states have call successors, (63) [2024-11-20 08:35:54,691 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 420 states to 420 states and 604 transitions. [2024-11-20 08:35:54,692 INFO L78 Accepts]: Start accepts. Automaton has 420 states and 604 transitions. Word has length 153 [2024-11-20 08:35:54,694 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-20 08:35:54,694 INFO L471 AbstractCegarLoop]: Abstraction has 420 states and 604 transitions. [2024-11-20 08:35:54,694 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 8.714285714285714) internal successors, (61), 7 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-11-20 08:35:54,694 INFO L276 IsEmpty]: Start isEmpty. Operand 420 states and 604 transitions. [2024-11-20 08:35:54,697 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 154 [2024-11-20 08:35:54,699 INFO L207 NwaCegarLoop]: Found error trace [2024-11-20 08:35:54,699 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-11-20 08:35:54,699 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2024-11-20 08:35:54,700 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-20 08:35:54,700 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-20 08:35:54,700 INFO L85 PathProgramCache]: Analyzing trace with hash 201377829, now seen corresponding path program 1 times [2024-11-20 08:35:54,700 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-20 08:35:54,700 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1466613108] [2024-11-20 08:35:54,700 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-20 08:35:54,701 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-20 08:35:54,742 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 08:35:54,870 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-20 08:35:54,872 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 08:35:54,873 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-11-20 08:35:54,875 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 08:35:54,877 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-11-20 08:35:54,878 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 08:35:54,879 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2024-11-20 08:35:54,881 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 08:35:54,882 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-11-20 08:35:54,883 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 08:35:54,886 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-11-20 08:35:54,888 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 08:35:54,889 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2024-11-20 08:35:54,890 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 08:35:54,893 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2024-11-20 08:35:54,894 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 08:35:54,895 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2024-11-20 08:35:54,897 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 08:35:54,898 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2024-11-20 08:35:54,899 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 08:35:54,901 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2024-11-20 08:35:54,902 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 08:35:54,903 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2024-11-20 08:35:54,905 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 08:35:54,906 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 80 [2024-11-20 08:35:54,908 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 08:35:54,909 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 86 [2024-11-20 08:35:54,910 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 08:35:54,911 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 92 [2024-11-20 08:35:54,912 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 08:35:54,913 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 98 [2024-11-20 08:35:54,915 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 08:35:54,917 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 104 [2024-11-20 08:35:54,918 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 08:35:54,920 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 110 [2024-11-20 08:35:54,921 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 08:35:54,921 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 116 [2024-11-20 08:35:54,922 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 08:35:54,923 INFO L134 CoverageAnalysis]: Checked inductivity of 684 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 684 trivial. 0 not checked. [2024-11-20 08:35:54,924 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-20 08:35:54,924 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1466613108] [2024-11-20 08:35:54,924 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1466613108] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-20 08:35:54,924 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-20 08:35:54,924 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-20 08:35:54,924 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1929066901] [2024-11-20 08:35:54,925 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-20 08:35:54,925 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-20 08:35:54,925 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-20 08:35:54,926 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-20 08:35:54,927 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-11-20 08:35:54,927 INFO L87 Difference]: Start difference. First operand 420 states and 604 transitions. Second operand has 5 states, 5 states have (on average 12.2) internal successors, (61), 5 states have internal predecessors, (61), 1 states have call successors, (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-11-20 08:35:54,964 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-20 08:35:54,964 INFO L93 Difference]: Finished difference Result 726 states and 1038 transitions. [2024-11-20 08:35:54,965 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-20 08:35:54,965 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 12.2) internal successors, (61), 5 states have internal predecessors, (61), 1 states have call successors, (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-11-20 08:35:54,966 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-20 08:35:54,968 INFO L225 Difference]: With dead ends: 726 [2024-11-20 08:35:54,970 INFO L226 Difference]: Without dead ends: 435 [2024-11-20 08:35:54,971 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 44 GetRequests, 41 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-11-20 08:35:54,972 INFO L432 NwaCegarLoop]: 157 mSDtfsCounter, 0 mSDsluCounter, 456 mSDsCounter, 0 mSdLazyCounter, 25 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 613 SdHoareTripleChecker+Invalid, 26 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 25 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-20 08:35:54,972 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 613 Invalid, 26 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 25 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-20 08:35:54,975 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 435 states. [2024-11-20 08:35:55,000 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 435 to 425. [2024-11-20 08:35:55,001 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 425 states, 356 states have (on average 1.3567415730337078) internal successors, (483), 359 states have internal predecessors, (483), 63 states have call successors, (63), 5 states have call predecessors, (63), 5 states have return successors, (63), 60 states have call predecessors, (63), 63 states have call successors, (63) [2024-11-20 08:35:55,004 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 425 states to 425 states and 609 transitions. [2024-11-20 08:35:55,005 INFO L78 Accepts]: Start accepts. Automaton has 425 states and 609 transitions. Word has length 153 [2024-11-20 08:35:55,005 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-20 08:35:55,006 INFO L471 AbstractCegarLoop]: Abstraction has 425 states and 609 transitions. [2024-11-20 08:35:55,006 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 12.2) internal successors, (61), 5 states have internal predecessors, (61), 1 states have call successors, (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-11-20 08:35:55,006 INFO L276 IsEmpty]: Start isEmpty. Operand 425 states and 609 transitions. [2024-11-20 08:35:55,008 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 154 [2024-11-20 08:35:55,008 INFO L207 NwaCegarLoop]: Found error trace [2024-11-20 08:35:55,009 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-11-20 08:35:55,009 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2024-11-20 08:35:55,009 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-20 08:35:55,009 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-20 08:35:55,010 INFO L85 PathProgramCache]: Analyzing trace with hash -135885745, now seen corresponding path program 1 times [2024-11-20 08:35:55,010 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-20 08:35:55,010 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1010208611] [2024-11-20 08:35:55,010 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-20 08:35:55,010 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-20 08:35:55,081 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 08:35:55,867 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-20 08:35:55,869 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 08:35:55,871 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-11-20 08:35:55,873 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 08:35:55,876 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-11-20 08:35:55,877 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 08:35:55,880 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2024-11-20 08:35:55,881 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 08:35:55,884 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-11-20 08:35:55,886 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 08:35:55,889 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-11-20 08:35:55,890 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 08:35:55,893 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2024-11-20 08:35:55,895 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 08:35:55,898 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2024-11-20 08:35:55,899 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 08:35:55,902 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2024-11-20 08:35:55,904 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 08:35:55,906 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2024-11-20 08:35:55,908 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 08:35:55,911 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2024-11-20 08:35:55,913 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 08:35:55,916 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2024-11-20 08:35:55,917 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 08:35:55,920 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 80 [2024-11-20 08:35:55,922 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 08:35:55,924 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 86 [2024-11-20 08:35:55,926 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 08:35:55,929 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 92 [2024-11-20 08:35:55,931 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 08:35:55,934 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 98 [2024-11-20 08:35:55,936 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 08:35:55,938 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 104 [2024-11-20 08:35:55,941 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 08:35:55,944 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 110 [2024-11-20 08:35:55,946 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 08:35:55,958 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 116 [2024-11-20 08:35:55,960 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 08:35:55,963 INFO L134 CoverageAnalysis]: Checked inductivity of 684 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 684 trivial. 0 not checked. [2024-11-20 08:35:55,964 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-20 08:35:55,964 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1010208611] [2024-11-20 08:35:55,964 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1010208611] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-20 08:35:55,964 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-20 08:35:55,964 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-11-20 08:35:55,964 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1760263388] [2024-11-20 08:35:55,965 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-20 08:35:55,965 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-11-20 08:35:55,965 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-20 08:35:55,966 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-11-20 08:35:55,966 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2024-11-20 08:35:55,966 INFO L87 Difference]: Start difference. First operand 425 states and 609 transitions. Second operand has 7 states, 7 states have (on average 8.714285714285714) internal successors, (61), 7 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-11-20 08:35:56,321 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-20 08:35:56,321 INFO L93 Difference]: Finished difference Result 685 states and 971 transitions. [2024-11-20 08:35:56,322 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-11-20 08:35:56,322 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 8.714285714285714) internal successors, (61), 7 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-11-20 08:35:56,323 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-20 08:35:56,325 INFO L225 Difference]: With dead ends: 685 [2024-11-20 08:35:56,325 INFO L226 Difference]: Without dead ends: 442 [2024-11-20 08:35:56,327 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 49 GetRequests, 40 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=33, Invalid=77, Unknown=0, NotChecked=0, Total=110 [2024-11-20 08:35:56,329 INFO L432 NwaCegarLoop]: 245 mSDtfsCounter, 218 mSDsluCounter, 821 mSDsCounter, 0 mSdLazyCounter, 110 mSolverCounterSat, 30 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 218 SdHoareTripleChecker+Valid, 1066 SdHoareTripleChecker+Invalid, 140 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 30 IncrementalHoareTripleChecker+Valid, 110 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-11-20 08:35:56,330 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [218 Valid, 1066 Invalid, 140 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [30 Valid, 110 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-11-20 08:35:56,332 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 442 states. [2024-11-20 08:35:56,360 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 442 to 321. [2024-11-20 08:35:56,361 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 321 states, 272 states have (on average 1.3713235294117647) internal successors, (373), 273 states have internal predecessors, (373), 43 states have call successors, (43), 5 states have call predecessors, (43), 5 states have return successors, (43), 42 states have call predecessors, (43), 43 states have call successors, (43) [2024-11-20 08:35:56,362 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 321 states to 321 states and 459 transitions. [2024-11-20 08:35:56,363 INFO L78 Accepts]: Start accepts. Automaton has 321 states and 459 transitions. Word has length 153 [2024-11-20 08:35:56,365 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-20 08:35:56,366 INFO L471 AbstractCegarLoop]: Abstraction has 321 states and 459 transitions. [2024-11-20 08:35:56,366 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 8.714285714285714) internal successors, (61), 7 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-11-20 08:35:56,366 INFO L276 IsEmpty]: Start isEmpty. Operand 321 states and 459 transitions. [2024-11-20 08:35:56,368 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 154 [2024-11-20 08:35:56,368 INFO L207 NwaCegarLoop]: Found error trace [2024-11-20 08:35:56,368 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-11-20 08:35:56,368 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2024-11-20 08:35:56,369 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-20 08:35:56,369 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-20 08:35:56,369 INFO L85 PathProgramCache]: Analyzing trace with hash -1156954099, now seen corresponding path program 1 times [2024-11-20 08:35:56,369 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-20 08:35:56,369 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1357040603] [2024-11-20 08:35:56,369 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-20 08:35:56,370 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-20 08:35:56,488 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat