./Ultimate.py --spec /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/properties/unreach-call.prp --file /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-a_file-24.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 84cfde4a Calling Ultimate with: /root/.sdkman/candidates/java/current/bin/java -Dosgi.configuration.area=/storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-a_file-24.i -s /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate-clean/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 1dbf57bc124875744eb5a4186252476f73fa3f14ae019c9a9da37b4d1a62cbf1 --- Real Ultimate output --- This is Ultimate 0.2.5-dev-84cfde4 [2024-10-11 13:14:48,529 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-10-11 13:14:48,617 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2024-10-11 13:14:48,623 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-10-11 13:14:48,623 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-10-11 13:14:48,648 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-10-11 13:14:48,649 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-10-11 13:14:48,649 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-10-11 13:14:48,650 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-10-11 13:14:48,651 INFO L153 SettingsManager]: * Use memory slicer=true [2024-10-11 13:14:48,652 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-10-11 13:14:48,652 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-10-11 13:14:48,653 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-10-11 13:14:48,653 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-10-11 13:14:48,655 INFO L153 SettingsManager]: * Use SBE=true [2024-10-11 13:14:48,655 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-10-11 13:14:48,656 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-10-11 13:14:48,656 INFO L153 SettingsManager]: * sizeof long=4 [2024-10-11 13:14:48,656 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-10-11 13:14:48,657 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-10-11 13:14:48,657 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-10-11 13:14:48,660 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-10-11 13:14:48,660 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-10-11 13:14:48,660 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-10-11 13:14:48,660 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-10-11 13:14:48,661 INFO L153 SettingsManager]: * sizeof long double=12 [2024-10-11 13:14:48,661 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-10-11 13:14:48,661 INFO L153 SettingsManager]: * Use constant arrays=true [2024-10-11 13:14:48,662 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-10-11 13:14:48,662 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-10-11 13:14:48,662 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-10-11 13:14:48,662 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-10-11 13:14:48,662 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-11 13:14:48,663 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-10-11 13:14:48,663 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-10-11 13:14:48,663 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-10-11 13:14:48,664 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-10-11 13:14:48,665 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-10-11 13:14:48,665 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-10-11 13:14:48,665 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-10-11 13:14:48,665 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-10-11 13:14:48,666 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-10-11 13:14:48,667 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-clean/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-clean/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 -> 1dbf57bc124875744eb5a4186252476f73fa3f14ae019c9a9da37b4d1a62cbf1 [2024-10-11 13:14:48,925 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-10-11 13:14:48,951 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-10-11 13:14:48,954 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-10-11 13:14:48,956 INFO L270 PluginConnector]: Initializing CDTParser... [2024-10-11 13:14:48,957 INFO L274 PluginConnector]: CDTParser initialized [2024-10-11 13:14:48,958 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-a_file-24.i [2024-10-11 13:14:50,431 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-10-11 13:14:50,653 INFO L384 CDTParser]: Found 1 translation units. [2024-10-11 13:14:50,653 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-a_file-24.i [2024-10-11 13:14:50,665 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/data/6845ff6cc/7417b1a79fcd42149c64d44d7b4f14f5/FLAGb540ca1e9 [2024-10-11 13:14:50,680 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/data/6845ff6cc/7417b1a79fcd42149c64d44d7b4f14f5 [2024-10-11 13:14:50,682 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-10-11 13:14:50,684 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-10-11 13:14:50,686 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-10-11 13:14:50,686 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-10-11 13:14:50,692 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-10-11 13:14:50,692 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 11.10 01:14:50" (1/1) ... [2024-10-11 13:14:50,693 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@74b20b19 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 01:14:50, skipping insertion in model container [2024-10-11 13:14:50,693 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 11.10 01:14:50" (1/1) ... [2024-10-11 13:14:50,722 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-10-11 13:14:50,883 WARN L248 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-a_file-24.i[916,929] [2024-10-11 13:14:50,940 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-11 13:14:50,952 INFO L200 MainTranslator]: Completed pre-run [2024-10-11 13:14:50,963 WARN L248 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-a_file-24.i[916,929] [2024-10-11 13:14:51,001 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-11 13:14:51,031 INFO L204 MainTranslator]: Completed translation [2024-10-11 13:14:51,032 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 01:14:51 WrapperNode [2024-10-11 13:14:51,032 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-10-11 13:14:51,033 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-10-11 13:14:51,033 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-10-11 13:14:51,034 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-10-11 13:14:51,040 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 01:14:51" (1/1) ... [2024-10-11 13:14:51,058 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 01:14:51" (1/1) ... [2024-10-11 13:14:51,094 INFO L138 Inliner]: procedures = 29, calls = 157, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 463 [2024-10-11 13:14:51,096 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-10-11 13:14:51,097 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-10-11 13:14:51,097 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-10-11 13:14:51,097 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-10-11 13:14:51,110 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 01:14:51" (1/1) ... [2024-10-11 13:14:51,112 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 01:14:51" (1/1) ... [2024-10-11 13:14:51,119 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 01:14:51" (1/1) ... [2024-10-11 13:14:51,141 INFO L175 MemorySlicer]: Split 126 memory accesses to 6 slices as follows [2, 27, 23, 56, 7, 11]. 44 percent of accesses are in the largest equivalence class. The 16 initializations are split as follows [2, 4, 2, 5, 1, 2]. The 17 writes are split as follows [0, 5, 2, 7, 1, 2]. [2024-10-11 13:14:51,141 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 01:14:51" (1/1) ... [2024-10-11 13:14:51,141 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 01:14:51" (1/1) ... [2024-10-11 13:14:51,162 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 01:14:51" (1/1) ... [2024-10-11 13:14:51,167 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 01:14:51" (1/1) ... [2024-10-11 13:14:51,170 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 01:14:51" (1/1) ... [2024-10-11 13:14:51,172 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 01:14:51" (1/1) ... [2024-10-11 13:14:51,180 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-10-11 13:14:51,181 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-10-11 13:14:51,183 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-10-11 13:14:51,184 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-10-11 13:14:51,185 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 01:14:51" (1/1) ... [2024-10-11 13:14:51,197 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-11 13:14:51,208 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-11 13:14:51,224 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2024-10-11 13:14:51,230 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2024-10-11 13:14:51,280 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-10-11 13:14:51,281 INFO L130 BoogieDeclarations]: Found specification of procedure read~real#0 [2024-10-11 13:14:51,282 INFO L130 BoogieDeclarations]: Found specification of procedure read~real#1 [2024-10-11 13:14:51,282 INFO L130 BoogieDeclarations]: Found specification of procedure read~real#2 [2024-10-11 13:14:51,282 INFO L130 BoogieDeclarations]: Found specification of procedure read~real#3 [2024-10-11 13:14:51,282 INFO L130 BoogieDeclarations]: Found specification of procedure read~real#4 [2024-10-11 13:14:51,282 INFO L130 BoogieDeclarations]: Found specification of procedure read~real#5 [2024-10-11 13:14:51,284 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#0 [2024-10-11 13:14:51,284 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#1 [2024-10-11 13:14:51,284 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#2 [2024-10-11 13:14:51,284 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#3 [2024-10-11 13:14:51,285 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#4 [2024-10-11 13:14:51,285 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#5 [2024-10-11 13:14:51,285 INFO L130 BoogieDeclarations]: Found specification of procedure write~real#0 [2024-10-11 13:14:51,316 INFO L130 BoogieDeclarations]: Found specification of procedure write~real#1 [2024-10-11 13:14:51,316 INFO L130 BoogieDeclarations]: Found specification of procedure write~real#2 [2024-10-11 13:14:51,316 INFO L130 BoogieDeclarations]: Found specification of procedure write~real#3 [2024-10-11 13:14:51,316 INFO L130 BoogieDeclarations]: Found specification of procedure write~real#4 [2024-10-11 13:14:51,316 INFO L130 BoogieDeclarations]: Found specification of procedure write~real#5 [2024-10-11 13:14:51,317 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#0 [2024-10-11 13:14:51,317 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#1 [2024-10-11 13:14:51,317 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#2 [2024-10-11 13:14:51,317 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#3 [2024-10-11 13:14:51,317 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#4 [2024-10-11 13:14:51,317 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#5 [2024-10-11 13:14:51,317 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~real#0 [2024-10-11 13:14:51,317 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~real#1 [2024-10-11 13:14:51,317 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~real#2 [2024-10-11 13:14:51,317 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~real#3 [2024-10-11 13:14:51,317 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~real#4 [2024-10-11 13:14:51,318 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~real#5 [2024-10-11 13:14:51,318 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2024-10-11 13:14:51,318 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2024-10-11 13:14:51,318 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-10-11 13:14:51,318 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#1 [2024-10-11 13:14:51,318 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#2 [2024-10-11 13:14:51,318 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#3 [2024-10-11 13:14:51,318 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#4 [2024-10-11 13:14:51,318 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#5 [2024-10-11 13:14:51,318 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-10-11 13:14:51,318 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-10-11 13:14:51,474 INFO L238 CfgBuilder]: Building ICFG [2024-10-11 13:14:51,476 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-10-11 13:14:51,896 INFO L? ?]: Removed 118 outVars from TransFormulas that were not future-live. [2024-10-11 13:14:51,896 INFO L287 CfgBuilder]: Performing block encoding [2024-10-11 13:14:51,934 INFO L309 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-10-11 13:14:51,937 INFO L314 CfgBuilder]: Removed 1 assume(true) statements. [2024-10-11 13:14:51,938 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 11.10 01:14:51 BoogieIcfgContainer [2024-10-11 13:14:51,938 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-10-11 13:14:51,940 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-10-11 13:14:51,940 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-10-11 13:14:51,944 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-10-11 13:14:51,944 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 11.10 01:14:50" (1/3) ... [2024-10-11 13:14:51,945 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1a95ece4 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 11.10 01:14:51, skipping insertion in model container [2024-10-11 13:14:51,945 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 01:14:51" (2/3) ... [2024-10-11 13:14:51,945 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1a95ece4 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 11.10 01:14:51, skipping insertion in model container [2024-10-11 13:14:51,945 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 11.10 01:14:51" (3/3) ... [2024-10-11 13:14:51,946 INFO L112 eAbstractionObserver]: Analyzing ICFG hardness_variablewrapping_wrapper-a_file-24.i [2024-10-11 13:14:51,962 INFO L209 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-10-11 13:14:51,962 INFO L149 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-10-11 13:14:52,028 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-10-11 13:14:52,035 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;@709fe47d, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-10-11 13:14:52,036 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-10-11 13:14:52,040 INFO L276 IsEmpty]: Start isEmpty. Operand has 94 states, 76 states have (on average 1.4342105263157894) internal successors, (109), 77 states have internal predecessors, (109), 15 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 15 states have call predecessors, (15), 15 states have call successors, (15) [2024-10-11 13:14:52,053 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 120 [2024-10-11 13:14:52,054 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 13:14:52,055 INFO L215 NwaCegarLoop]: trace histogram [15, 15, 15, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 13:14:52,057 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 13:14:52,061 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 13:14:52,062 INFO L85 PathProgramCache]: Analyzing trace with hash -339587267, now seen corresponding path program 1 times [2024-10-11 13:14:52,070 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 13:14:52,071 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1969858193] [2024-10-11 13:14:52,072 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 13:14:52,072 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 13:14:52,236 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:14:52,380 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-11 13:14:52,383 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:14:52,393 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2024-10-11 13:14:52,399 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:14:52,402 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2024-10-11 13:14:52,404 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:14:52,407 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2024-10-11 13:14:52,408 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:14:52,410 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2024-10-11 13:14:52,412 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:14:52,413 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-10-11 13:14:52,415 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:14:52,418 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2024-10-11 13:14:52,421 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:14:52,423 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2024-10-11 13:14:52,428 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:14:52,432 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 53 [2024-10-11 13:14:52,434 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:14:52,437 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2024-10-11 13:14:52,440 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:14:52,445 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2024-10-11 13:14:52,448 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:14:52,454 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2024-10-11 13:14:52,455 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:14:52,458 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2024-10-11 13:14:52,459 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:14:52,461 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2024-10-11 13:14:52,462 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:14:52,465 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 89 [2024-10-11 13:14:52,470 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:14:52,478 INFO L134 CoverageAnalysis]: Checked inductivity of 420 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 420 trivial. 0 not checked. [2024-10-11 13:14:52,479 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 13:14:52,479 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1969858193] [2024-10-11 13:14:52,480 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1969858193] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 13:14:52,480 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 13:14:52,480 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-11 13:14:52,483 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [436687685] [2024-10-11 13:14:52,483 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 13:14:52,488 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-10-11 13:14:52,488 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 13:14:52,516 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-10-11 13:14:52,517 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-10-11 13:14:52,521 INFO L87 Difference]: Start difference. First operand has 94 states, 76 states have (on average 1.4342105263157894) internal successors, (109), 77 states have internal predecessors, (109), 15 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 15 states have call predecessors, (15), 15 states have call successors, (15) Second operand has 2 states, 2 states have (on average 23.5) internal successors, (47), 2 states have internal predecessors, (47), 2 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 2 states have call successors, (15) [2024-10-11 13:14:52,570 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 13:14:52,571 INFO L93 Difference]: Finished difference Result 185 states and 291 transitions. [2024-10-11 13:14:52,572 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-10-11 13:14:52,573 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 23.5) internal successors, (47), 2 states have internal predecessors, (47), 2 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 2 states have call successors, (15) Word has length 119 [2024-10-11 13:14:52,574 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 13:14:52,583 INFO L225 Difference]: With dead ends: 185 [2024-10-11 13:14:52,584 INFO L226 Difference]: Without dead ends: 92 [2024-10-11 13:14:52,588 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 47 GetRequests, 47 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-10-11 13:14:52,592 INFO L432 NwaCegarLoop]: 130 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 4 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 130 SdHoareTripleChecker+Invalid, 4 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 4 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-11 13:14:52,593 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 130 Invalid, 4 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 4 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-11 13:14:52,627 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 92 states. [2024-10-11 13:14:52,649 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 92 to 92. [2024-10-11 13:14:52,650 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 92 states, 75 states have (on average 1.3866666666666667) internal successors, (104), 75 states have internal predecessors, (104), 15 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 15 states have call predecessors, (15), 15 states have call successors, (15) [2024-10-11 13:14:52,652 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 92 states to 92 states and 134 transitions. [2024-10-11 13:14:52,653 INFO L78 Accepts]: Start accepts. Automaton has 92 states and 134 transitions. Word has length 119 [2024-10-11 13:14:52,654 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 13:14:52,654 INFO L471 AbstractCegarLoop]: Abstraction has 92 states and 134 transitions. [2024-10-11 13:14:52,654 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 23.5) internal successors, (47), 2 states have internal predecessors, (47), 2 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 2 states have call successors, (15) [2024-10-11 13:14:52,655 INFO L276 IsEmpty]: Start isEmpty. Operand 92 states and 134 transitions. [2024-10-11 13:14:52,658 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 120 [2024-10-11 13:14:52,658 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 13:14:52,658 INFO L215 NwaCegarLoop]: trace histogram [15, 15, 15, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 13:14:52,658 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-10-11 13:14:52,658 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 13:14:52,659 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 13:14:52,661 INFO L85 PathProgramCache]: Analyzing trace with hash -393855625, now seen corresponding path program 1 times [2024-10-11 13:14:52,662 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 13:14:52,662 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [551083330] [2024-10-11 13:14:52,662 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 13:14:52,663 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 13:14:52,795 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:14:52,915 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-11 13:14:52,919 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:14:52,922 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2024-10-11 13:14:52,925 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:14:52,929 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2024-10-11 13:14:52,931 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:14:52,934 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2024-10-11 13:14:52,935 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:14:52,938 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2024-10-11 13:14:52,939 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:14:52,941 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-10-11 13:14:52,942 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:14:52,946 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2024-10-11 13:14:52,948 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:14:52,950 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2024-10-11 13:14:52,951 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:14:52,953 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 53 [2024-10-11 13:14:52,954 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:14:52,956 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2024-10-11 13:14:52,957 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:14:52,962 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2024-10-11 13:14:52,963 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:14:52,965 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2024-10-11 13:14:52,966 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:14:52,967 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2024-10-11 13:14:52,969 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:14:52,974 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2024-10-11 13:14:52,975 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:14:52,978 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 89 [2024-10-11 13:14:52,980 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:14:52,983 INFO L134 CoverageAnalysis]: Checked inductivity of 420 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 420 trivial. 0 not checked. [2024-10-11 13:14:52,984 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 13:14:52,984 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [551083330] [2024-10-11 13:14:52,984 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [551083330] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 13:14:52,985 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 13:14:52,985 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-11 13:14:52,986 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [701103388] [2024-10-11 13:14:52,986 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 13:14:52,988 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-11 13:14:52,989 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 13:14:52,991 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-11 13:14:52,992 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-11 13:14:52,992 INFO L87 Difference]: Start difference. First operand 92 states and 134 transitions. Second operand has 3 states, 3 states have (on average 15.666666666666666) internal successors, (47), 3 states have internal predecessors, (47), 1 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 1 states have call successors, (15) [2024-10-11 13:14:53,044 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 13:14:53,044 INFO L93 Difference]: Finished difference Result 184 states and 269 transitions. [2024-10-11 13:14:53,047 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-11 13:14:53,047 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 15.666666666666666) internal successors, (47), 3 states have internal predecessors, (47), 1 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 1 states have call successors, (15) Word has length 119 [2024-10-11 13:14:53,047 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 13:14:53,049 INFO L225 Difference]: With dead ends: 184 [2024-10-11 13:14:53,049 INFO L226 Difference]: Without dead ends: 93 [2024-10-11 13:14:53,050 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 33 GetRequests, 32 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-11 13:14:53,052 INFO L432 NwaCegarLoop]: 129 mSDtfsCounter, 0 mSDsluCounter, 124 mSDsCounter, 0 mSdLazyCounter, 14 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 253 SdHoareTripleChecker+Invalid, 14 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 14 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-11 13:14:53,052 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 253 Invalid, 14 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 14 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-11 13:14:53,054 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 93 states. [2024-10-11 13:14:53,067 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 93 to 93. [2024-10-11 13:14:53,068 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 93 states, 76 states have (on average 1.381578947368421) internal successors, (105), 76 states have internal predecessors, (105), 15 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 15 states have call predecessors, (15), 15 states have call successors, (15) [2024-10-11 13:14:53,069 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 93 states to 93 states and 135 transitions. [2024-10-11 13:14:53,070 INFO L78 Accepts]: Start accepts. Automaton has 93 states and 135 transitions. Word has length 119 [2024-10-11 13:14:53,071 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 13:14:53,071 INFO L471 AbstractCegarLoop]: Abstraction has 93 states and 135 transitions. [2024-10-11 13:14:53,072 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 15.666666666666666) internal successors, (47), 3 states have internal predecessors, (47), 1 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 1 states have call successors, (15) [2024-10-11 13:14:53,072 INFO L276 IsEmpty]: Start isEmpty. Operand 93 states and 135 transitions. [2024-10-11 13:14:53,074 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 120 [2024-10-11 13:14:53,074 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 13:14:53,074 INFO L215 NwaCegarLoop]: trace histogram [15, 15, 15, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 13:14:53,074 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-10-11 13:14:53,075 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 13:14:53,075 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 13:14:53,075 INFO L85 PathProgramCache]: Analyzing trace with hash -175000907, now seen corresponding path program 1 times [2024-10-11 13:14:53,076 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 13:14:53,076 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [504617285] [2024-10-11 13:14:53,076 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 13:14:53,076 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 13:14:53,141 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:14:53,228 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-11 13:14:53,229 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:14:53,231 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2024-10-11 13:14:53,232 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:14:53,234 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2024-10-11 13:14:53,237 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:14:53,238 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2024-10-11 13:14:53,239 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:14:53,240 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2024-10-11 13:14:53,243 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:14:53,244 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-10-11 13:14:53,249 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:14:53,250 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2024-10-11 13:14:53,251 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:14:53,252 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2024-10-11 13:14:53,253 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:14:53,254 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 53 [2024-10-11 13:14:53,258 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:14:53,260 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2024-10-11 13:14:53,261 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:14:53,263 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2024-10-11 13:14:53,264 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:14:53,265 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2024-10-11 13:14:53,267 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:14:53,268 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2024-10-11 13:14:53,270 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:14:53,271 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2024-10-11 13:14:53,272 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:14:53,274 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 89 [2024-10-11 13:14:53,275 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:14:53,277 INFO L134 CoverageAnalysis]: Checked inductivity of 420 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 420 trivial. 0 not checked. [2024-10-11 13:14:53,278 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 13:14:53,278 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [504617285] [2024-10-11 13:14:53,278 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [504617285] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 13:14:53,279 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 13:14:53,279 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-11 13:14:53,279 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [756318161] [2024-10-11 13:14:53,279 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 13:14:53,280 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-11 13:14:53,281 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 13:14:53,282 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-11 13:14:53,282 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-11 13:14:53,282 INFO L87 Difference]: Start difference. First operand 93 states and 135 transitions. Second operand has 3 states, 3 states have (on average 15.666666666666666) internal successors, (47), 3 states have internal predecessors, (47), 1 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 1 states have call successors, (15) [2024-10-11 13:14:53,321 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 13:14:53,321 INFO L93 Difference]: Finished difference Result 186 states and 271 transitions. [2024-10-11 13:14:53,322 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-11 13:14:53,322 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 15.666666666666666) internal successors, (47), 3 states have internal predecessors, (47), 1 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 1 states have call successors, (15) Word has length 119 [2024-10-11 13:14:53,323 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 13:14:53,323 INFO L225 Difference]: With dead ends: 186 [2024-10-11 13:14:53,324 INFO L226 Difference]: Without dead ends: 94 [2024-10-11 13:14:53,324 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 33 GetRequests, 32 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-11 13:14:53,325 INFO L432 NwaCegarLoop]: 129 mSDtfsCounter, 0 mSDsluCounter, 125 mSDsCounter, 0 mSdLazyCounter, 13 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 254 SdHoareTripleChecker+Invalid, 13 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 13 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-11 13:14:53,326 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 254 Invalid, 13 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 13 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-11 13:14:53,326 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 94 states. [2024-10-11 13:14:53,332 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 94 to 94. [2024-10-11 13:14:53,332 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 94 states, 77 states have (on average 1.3766233766233766) internal successors, (106), 77 states have internal predecessors, (106), 15 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 15 states have call predecessors, (15), 15 states have call successors, (15) [2024-10-11 13:14:53,333 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 94 states to 94 states and 136 transitions. [2024-10-11 13:14:53,334 INFO L78 Accepts]: Start accepts. Automaton has 94 states and 136 transitions. Word has length 119 [2024-10-11 13:14:53,334 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 13:14:53,334 INFO L471 AbstractCegarLoop]: Abstraction has 94 states and 136 transitions. [2024-10-11 13:14:53,334 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 15.666666666666666) internal successors, (47), 3 states have internal predecessors, (47), 1 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 1 states have call successors, (15) [2024-10-11 13:14:53,335 INFO L276 IsEmpty]: Start isEmpty. Operand 94 states and 136 transitions. [2024-10-11 13:14:53,336 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 120 [2024-10-11 13:14:53,336 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 13:14:53,336 INFO L215 NwaCegarLoop]: trace histogram [15, 15, 15, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 13:14:53,337 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-10-11 13:14:53,337 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 13:14:53,337 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 13:14:53,337 INFO L85 PathProgramCache]: Analyzing trace with hash -1454864585, now seen corresponding path program 1 times [2024-10-11 13:14:53,337 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 13:14:53,338 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1213351787] [2024-10-11 13:14:53,338 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 13:14:53,338 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 13:14:53,387 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:14:53,516 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-11 13:14:53,518 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:14:53,520 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2024-10-11 13:14:53,521 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:14:53,522 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2024-10-11 13:14:53,523 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:14:53,524 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2024-10-11 13:14:53,525 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:14:53,527 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2024-10-11 13:14:53,528 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:14:53,530 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-10-11 13:14:53,531 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:14:53,533 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2024-10-11 13:14:53,535 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:14:53,536 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2024-10-11 13:14:53,537 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:14:53,540 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 53 [2024-10-11 13:14:53,542 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:14:53,545 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2024-10-11 13:14:53,546 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:14:53,547 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2024-10-11 13:14:53,548 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:14:53,549 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2024-10-11 13:14:53,550 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:14:53,551 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2024-10-11 13:14:53,552 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:14:53,554 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2024-10-11 13:14:53,555 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:14:53,556 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 89 [2024-10-11 13:14:53,558 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:14:53,559 INFO L134 CoverageAnalysis]: Checked inductivity of 420 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 420 trivial. 0 not checked. [2024-10-11 13:14:53,559 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 13:14:53,560 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1213351787] [2024-10-11 13:14:53,560 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1213351787] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 13:14:53,560 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 13:14:53,560 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-10-11 13:14:53,561 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [670154038] [2024-10-11 13:14:53,561 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 13:14:53,562 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-10-11 13:14:53,562 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 13:14:53,563 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-10-11 13:14:53,563 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-10-11 13:14:53,563 INFO L87 Difference]: Start difference. First operand 94 states and 136 transitions. Second operand has 4 states, 4 states have (on average 11.75) internal successors, (47), 4 states have internal predecessors, (47), 1 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 1 states have call successors, (15) [2024-10-11 13:14:53,611 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 13:14:53,615 INFO L93 Difference]: Finished difference Result 190 states and 275 transitions. [2024-10-11 13:14:53,616 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-10-11 13:14:53,616 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 11.75) internal successors, (47), 4 states have internal predecessors, (47), 1 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 1 states have call successors, (15) Word has length 119 [2024-10-11 13:14:53,616 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 13:14:53,617 INFO L225 Difference]: With dead ends: 190 [2024-10-11 13:14:53,617 INFO L226 Difference]: Without dead ends: 97 [2024-10-11 13:14:53,618 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 34 GetRequests, 32 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-10-11 13:14:53,619 INFO L432 NwaCegarLoop]: 127 mSDtfsCounter, 1 mSDsluCounter, 247 mSDsCounter, 0 mSdLazyCounter, 26 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 374 SdHoareTripleChecker+Invalid, 27 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 26 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-11 13:14:53,619 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1 Valid, 374 Invalid, 27 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 26 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-11 13:14:53,624 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 97 states. [2024-10-11 13:14:53,633 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 97 to 96. [2024-10-11 13:14:53,633 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 96 states, 79 states have (on average 1.3670886075949367) internal successors, (108), 79 states have internal predecessors, (108), 15 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 15 states have call predecessors, (15), 15 states have call successors, (15) [2024-10-11 13:14:53,634 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 96 states to 96 states and 138 transitions. [2024-10-11 13:14:53,634 INFO L78 Accepts]: Start accepts. Automaton has 96 states and 138 transitions. Word has length 119 [2024-10-11 13:14:53,635 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 13:14:53,635 INFO L471 AbstractCegarLoop]: Abstraction has 96 states and 138 transitions. [2024-10-11 13:14:53,635 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 11.75) internal successors, (47), 4 states have internal predecessors, (47), 1 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 1 states have call successors, (15) [2024-10-11 13:14:53,635 INFO L276 IsEmpty]: Start isEmpty. Operand 96 states and 138 transitions. [2024-10-11 13:14:53,637 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 120 [2024-10-11 13:14:53,637 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 13:14:53,637 INFO L215 NwaCegarLoop]: trace histogram [15, 15, 15, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 13:14:53,637 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2024-10-11 13:14:53,638 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 13:14:53,638 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 13:14:53,638 INFO L85 PathProgramCache]: Analyzing trace with hash 2030756085, now seen corresponding path program 1 times [2024-10-11 13:14:53,638 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 13:14:53,639 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [982600917] [2024-10-11 13:14:53,639 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 13:14:53,639 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 13:14:53,680 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:14:53,785 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-11 13:14:53,786 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:14:53,788 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2024-10-11 13:14:53,789 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:14:53,791 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2024-10-11 13:14:53,791 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:14:53,793 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2024-10-11 13:14:53,794 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:14:53,796 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2024-10-11 13:14:53,797 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:14:53,798 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-10-11 13:14:53,799 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:14:53,800 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2024-10-11 13:14:53,801 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:14:53,803 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2024-10-11 13:14:53,805 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:14:53,806 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 53 [2024-10-11 13:14:53,807 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:14:53,809 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2024-10-11 13:14:53,809 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:14:53,811 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2024-10-11 13:14:53,811 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:14:53,813 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2024-10-11 13:14:53,814 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:14:53,816 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2024-10-11 13:14:53,818 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:14:53,820 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2024-10-11 13:14:53,821 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:14:53,823 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 89 [2024-10-11 13:14:53,824 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:14:53,825 INFO L134 CoverageAnalysis]: Checked inductivity of 420 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 420 trivial. 0 not checked. [2024-10-11 13:14:53,828 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 13:14:53,828 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [982600917] [2024-10-11 13:14:53,828 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [982600917] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 13:14:53,828 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 13:14:53,829 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-10-11 13:14:53,829 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1631493119] [2024-10-11 13:14:53,829 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 13:14:53,829 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-10-11 13:14:53,829 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 13:14:53,830 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-10-11 13:14:53,830 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-10-11 13:14:53,830 INFO L87 Difference]: Start difference. First operand 96 states and 138 transitions. Second operand has 4 states, 4 states have (on average 11.75) internal successors, (47), 4 states have internal predecessors, (47), 1 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 1 states have call successors, (15) [2024-10-11 13:14:53,872 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 13:14:53,872 INFO L93 Difference]: Finished difference Result 194 states and 279 transitions. [2024-10-11 13:14:53,873 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-10-11 13:14:53,873 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 11.75) internal successors, (47), 4 states have internal predecessors, (47), 1 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 1 states have call successors, (15) Word has length 119 [2024-10-11 13:14:53,873 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 13:14:53,874 INFO L225 Difference]: With dead ends: 194 [2024-10-11 13:14:53,874 INFO L226 Difference]: Without dead ends: 99 [2024-10-11 13:14:53,875 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 34 GetRequests, 32 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-10-11 13:14:53,876 INFO L432 NwaCegarLoop]: 127 mSDtfsCounter, 1 mSDsluCounter, 248 mSDsCounter, 0 mSdLazyCounter, 25 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 375 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-10-11 13:14:53,876 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1 Valid, 375 Invalid, 26 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 25 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-11 13:14:53,881 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 99 states. [2024-10-11 13:14:53,890 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 99 to 98. [2024-10-11 13:14:53,890 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 98 states, 81 states have (on average 1.3580246913580247) internal successors, (110), 81 states have internal predecessors, (110), 15 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 15 states have call predecessors, (15), 15 states have call successors, (15) [2024-10-11 13:14:53,892 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 98 states to 98 states and 140 transitions. [2024-10-11 13:14:53,893 INFO L78 Accepts]: Start accepts. Automaton has 98 states and 140 transitions. Word has length 119 [2024-10-11 13:14:53,895 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 13:14:53,896 INFO L471 AbstractCegarLoop]: Abstraction has 98 states and 140 transitions. [2024-10-11 13:14:53,896 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 11.75) internal successors, (47), 4 states have internal predecessors, (47), 1 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 1 states have call successors, (15) [2024-10-11 13:14:53,896 INFO L276 IsEmpty]: Start isEmpty. Operand 98 states and 140 transitions. [2024-10-11 13:14:53,898 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 120 [2024-10-11 13:14:53,899 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 13:14:53,899 INFO L215 NwaCegarLoop]: trace histogram [15, 15, 15, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 13:14:53,899 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2024-10-11 13:14:53,899 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 13:14:53,900 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 13:14:53,900 INFO L85 PathProgramCache]: Analyzing trace with hash 2088014387, now seen corresponding path program 1 times [2024-10-11 13:14:53,900 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 13:14:53,900 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1235721857] [2024-10-11 13:14:53,901 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 13:14:53,901 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 13:14:53,943 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:14:54,041 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-11 13:14:54,042 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:14:54,045 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2024-10-11 13:14:54,045 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:14:54,047 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2024-10-11 13:14:54,047 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:14:54,048 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2024-10-11 13:14:54,049 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:14:54,050 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2024-10-11 13:14:54,052 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:14:54,054 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-10-11 13:14:54,055 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:14:54,056 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2024-10-11 13:14:54,057 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:14:54,059 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2024-10-11 13:14:54,059 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:14:54,060 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 53 [2024-10-11 13:14:54,061 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:14:54,062 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2024-10-11 13:14:54,063 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:14:54,064 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2024-10-11 13:14:54,065 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:14:54,065 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2024-10-11 13:14:54,066 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:14:54,069 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2024-10-11 13:14:54,070 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:14:54,071 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2024-10-11 13:14:54,072 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:14:54,073 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 89 [2024-10-11 13:14:54,074 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:14:54,075 INFO L134 CoverageAnalysis]: Checked inductivity of 420 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 420 trivial. 0 not checked. [2024-10-11 13:14:54,075 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 13:14:54,076 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1235721857] [2024-10-11 13:14:54,077 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1235721857] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 13:14:54,077 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 13:14:54,077 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-10-11 13:14:54,077 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1842401158] [2024-10-11 13:14:54,077 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 13:14:54,078 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-10-11 13:14:54,078 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 13:14:54,079 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-10-11 13:14:54,079 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-10-11 13:14:54,079 INFO L87 Difference]: Start difference. First operand 98 states and 140 transitions. Second operand has 4 states, 4 states have (on average 11.75) internal successors, (47), 4 states have internal predecessors, (47), 1 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 1 states have call successors, (15) [2024-10-11 13:14:54,110 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 13:14:54,111 INFO L93 Difference]: Finished difference Result 198 states and 283 transitions. [2024-10-11 13:14:54,112 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-10-11 13:14:54,112 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 11.75) internal successors, (47), 4 states have internal predecessors, (47), 1 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 1 states have call successors, (15) Word has length 119 [2024-10-11 13:14:54,113 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 13:14:54,113 INFO L225 Difference]: With dead ends: 198 [2024-10-11 13:14:54,113 INFO L226 Difference]: Without dead ends: 101 [2024-10-11 13:14:54,114 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 34 GetRequests, 32 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-10-11 13:14:54,115 INFO L432 NwaCegarLoop]: 128 mSDtfsCounter, 1 mSDsluCounter, 250 mSDsCounter, 0 mSdLazyCounter, 22 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 378 SdHoareTripleChecker+Invalid, 23 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 22 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-11 13:14:54,115 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1 Valid, 378 Invalid, 23 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 22 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-11 13:14:54,120 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 101 states. [2024-10-11 13:14:54,124 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 101 to 100. [2024-10-11 13:14:54,124 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 100 states, 83 states have (on average 1.3493975903614457) internal successors, (112), 83 states have internal predecessors, (112), 15 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 15 states have call predecessors, (15), 15 states have call successors, (15) [2024-10-11 13:14:54,125 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 100 states to 100 states and 142 transitions. [2024-10-11 13:14:54,125 INFO L78 Accepts]: Start accepts. Automaton has 100 states and 142 transitions. Word has length 119 [2024-10-11 13:14:54,125 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 13:14:54,126 INFO L471 AbstractCegarLoop]: Abstraction has 100 states and 142 transitions. [2024-10-11 13:14:54,126 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 11.75) internal successors, (47), 4 states have internal predecessors, (47), 1 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 1 states have call successors, (15) [2024-10-11 13:14:54,126 INFO L276 IsEmpty]: Start isEmpty. Operand 100 states and 142 transitions. [2024-10-11 13:14:54,127 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 120 [2024-10-11 13:14:54,127 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 13:14:54,128 INFO L215 NwaCegarLoop]: trace histogram [15, 15, 15, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 13:14:54,128 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2024-10-11 13:14:54,128 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 13:14:54,128 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 13:14:54,129 INFO L85 PathProgramCache]: Analyzing trace with hash 2088073969, now seen corresponding path program 1 times [2024-10-11 13:14:54,129 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 13:14:54,129 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1696726710] [2024-10-11 13:14:54,129 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 13:14:54,129 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 13:14:54,160 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:14:54,492 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-11 13:14:54,497 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:14:54,499 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2024-10-11 13:14:54,500 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:14:54,504 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2024-10-11 13:14:54,505 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:14:54,506 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2024-10-11 13:14:54,511 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:14:54,512 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2024-10-11 13:14:54,513 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:14:54,514 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-10-11 13:14:54,519 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:14:54,521 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2024-10-11 13:14:54,521 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:14:54,526 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2024-10-11 13:14:54,527 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:14:54,529 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 53 [2024-10-11 13:14:54,530 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:14:54,531 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2024-10-11 13:14:54,532 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:14:54,533 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2024-10-11 13:14:54,534 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:14:54,535 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2024-10-11 13:14:54,539 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:14:54,540 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2024-10-11 13:14:54,543 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:14:54,544 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2024-10-11 13:14:54,545 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:14:54,546 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 89 [2024-10-11 13:14:54,547 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:14:54,549 INFO L134 CoverageAnalysis]: Checked inductivity of 420 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 420 trivial. 0 not checked. [2024-10-11 13:14:54,550 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 13:14:54,550 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1696726710] [2024-10-11 13:14:54,550 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1696726710] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 13:14:54,550 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 13:14:54,550 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-10-11 13:14:54,550 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1959607927] [2024-10-11 13:14:54,551 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 13:14:54,552 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-10-11 13:14:54,552 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 13:14:54,552 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-10-11 13:14:54,553 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-10-11 13:14:54,553 INFO L87 Difference]: Start difference. First operand 100 states and 142 transitions. Second operand has 5 states, 5 states have (on average 9.4) internal successors, (47), 5 states have internal predecessors, (47), 1 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 1 states have call successors, (15) [2024-10-11 13:14:54,748 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 13:14:54,750 INFO L93 Difference]: Finished difference Result 280 states and 396 transitions. [2024-10-11 13:14:54,750 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-10-11 13:14:54,750 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 9.4) internal successors, (47), 5 states have internal predecessors, (47), 1 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 1 states have call successors, (15) Word has length 119 [2024-10-11 13:14:54,751 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 13:14:54,752 INFO L225 Difference]: With dead ends: 280 [2024-10-11 13:14:54,752 INFO L226 Difference]: Without dead ends: 181 [2024-10-11 13:14:54,753 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 37 GetRequests, 32 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2024-10-11 13:14:54,754 INFO L432 NwaCegarLoop]: 171 mSDtfsCounter, 96 mSDsluCounter, 430 mSDsCounter, 0 mSdLazyCounter, 134 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 96 SdHoareTripleChecker+Valid, 601 SdHoareTripleChecker+Invalid, 136 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 134 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-10-11 13:14:54,754 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [96 Valid, 601 Invalid, 136 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 134 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-10-11 13:14:54,755 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 181 states. [2024-10-11 13:14:54,772 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 181 to 178. [2024-10-11 13:14:54,773 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 178 states, 149 states have (on average 1.342281879194631) internal successors, (200), 150 states have internal predecessors, (200), 26 states have call successors, (26), 2 states have call predecessors, (26), 2 states have return successors, (26), 25 states have call predecessors, (26), 26 states have call successors, (26) [2024-10-11 13:14:54,774 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 178 states to 178 states and 252 transitions. [2024-10-11 13:14:54,776 INFO L78 Accepts]: Start accepts. Automaton has 178 states and 252 transitions. Word has length 119 [2024-10-11 13:14:54,776 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 13:14:54,776 INFO L471 AbstractCegarLoop]: Abstraction has 178 states and 252 transitions. [2024-10-11 13:14:54,777 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 9.4) internal successors, (47), 5 states have internal predecessors, (47), 1 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 1 states have call successors, (15) [2024-10-11 13:14:54,777 INFO L276 IsEmpty]: Start isEmpty. Operand 178 states and 252 transitions. [2024-10-11 13:14:54,778 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 121 [2024-10-11 13:14:54,778 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 13:14:54,779 INFO L215 NwaCegarLoop]: trace histogram [15, 15, 15, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 13:14:54,779 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2024-10-11 13:14:54,779 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 13:14:54,779 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 13:14:54,779 INFO L85 PathProgramCache]: Analyzing trace with hash 304478038, now seen corresponding path program 1 times [2024-10-11 13:14:54,780 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 13:14:54,780 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1416801889] [2024-10-11 13:14:54,780 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 13:14:54,780 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 13:14:54,826 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:14:55,299 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-11 13:14:55,300 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:14:55,301 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2024-10-11 13:14:55,306 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:14:55,307 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2024-10-11 13:14:55,308 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:14:55,309 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2024-10-11 13:14:55,312 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:14:55,313 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2024-10-11 13:14:55,315 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:14:55,316 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-10-11 13:14:55,317 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:14:55,318 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2024-10-11 13:14:55,319 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:14:55,320 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2024-10-11 13:14:55,321 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:14:55,322 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 53 [2024-10-11 13:14:55,323 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:14:55,324 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2024-10-11 13:14:55,324 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:14:55,325 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2024-10-11 13:14:55,326 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:14:55,327 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2024-10-11 13:14:55,328 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:14:55,329 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2024-10-11 13:14:55,329 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:14:55,330 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2024-10-11 13:14:55,330 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:14:55,331 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 89 [2024-10-11 13:14:55,332 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:14:55,333 INFO L134 CoverageAnalysis]: Checked inductivity of 420 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 420 trivial. 0 not checked. [2024-10-11 13:14:55,334 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 13:14:55,334 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1416801889] [2024-10-11 13:14:55,334 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1416801889] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 13:14:55,334 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 13:14:55,334 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-10-11 13:14:55,334 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [914214754] [2024-10-11 13:14:55,334 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 13:14:55,335 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-10-11 13:14:55,335 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 13:14:55,335 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-10-11 13:14:55,336 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2024-10-11 13:14:55,336 INFO L87 Difference]: Start difference. First operand 178 states and 252 transitions. Second operand has 6 states, 6 states have (on average 8.0) internal successors, (48), 6 states have internal predecessors, (48), 1 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 1 states have call successors, (15) [2024-10-11 13:14:55,598 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 13:14:55,598 INFO L93 Difference]: Finished difference Result 626 states and 887 transitions. [2024-10-11 13:14:55,599 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-10-11 13:14:55,599 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 8.0) internal successors, (48), 6 states have internal predecessors, (48), 1 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 1 states have call successors, (15) Word has length 120 [2024-10-11 13:14:55,600 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 13:14:55,603 INFO L225 Difference]: With dead ends: 626 [2024-10-11 13:14:55,603 INFO L226 Difference]: Without dead ends: 449 [2024-10-11 13:14:55,604 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 39 GetRequests, 32 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=28, Invalid=44, Unknown=0, NotChecked=0, Total=72 [2024-10-11 13:14:55,604 INFO L432 NwaCegarLoop]: 213 mSDtfsCounter, 330 mSDsluCounter, 409 mSDsCounter, 0 mSdLazyCounter, 143 mSolverCounterSat, 42 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 330 SdHoareTripleChecker+Valid, 622 SdHoareTripleChecker+Invalid, 185 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 42 IncrementalHoareTripleChecker+Valid, 143 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-10-11 13:14:55,605 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [330 Valid, 622 Invalid, 185 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [42 Valid, 143 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-10-11 13:14:55,606 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 449 states. [2024-10-11 13:14:55,619 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 449 to 196. [2024-10-11 13:14:55,619 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 196 states, 167 states have (on average 1.3532934131736527) internal successors, (226), 168 states have internal predecessors, (226), 26 states have call successors, (26), 2 states have call predecessors, (26), 2 states have return successors, (26), 25 states have call predecessors, (26), 26 states have call successors, (26) [2024-10-11 13:14:55,620 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 196 states to 196 states and 278 transitions. [2024-10-11 13:14:55,621 INFO L78 Accepts]: Start accepts. Automaton has 196 states and 278 transitions. Word has length 120 [2024-10-11 13:14:55,621 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 13:14:55,621 INFO L471 AbstractCegarLoop]: Abstraction has 196 states and 278 transitions. [2024-10-11 13:14:55,622 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 8.0) internal successors, (48), 6 states have internal predecessors, (48), 1 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 1 states have call successors, (15) [2024-10-11 13:14:55,622 INFO L276 IsEmpty]: Start isEmpty. Operand 196 states and 278 transitions. [2024-10-11 13:14:55,623 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 121 [2024-10-11 13:14:55,623 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 13:14:55,623 INFO L215 NwaCegarLoop]: trace histogram [15, 15, 15, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 13:14:55,623 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2024-10-11 13:14:55,623 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 13:14:55,624 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 13:14:55,624 INFO L85 PathProgramCache]: Analyzing trace with hash -1500960296, now seen corresponding path program 1 times [2024-10-11 13:14:55,624 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 13:14:55,624 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [601673818] [2024-10-11 13:14:55,624 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 13:14:55,624 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 13:14:55,687 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:14:56,134 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-11 13:14:56,135 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:14:56,138 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2024-10-11 13:14:56,138 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:14:56,139 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2024-10-11 13:14:56,140 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:14:56,145 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2024-10-11 13:14:56,146 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:14:56,147 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2024-10-11 13:14:56,149 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:14:56,150 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-10-11 13:14:56,151 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:14:56,152 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2024-10-11 13:14:56,153 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:14:56,155 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2024-10-11 13:14:56,156 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:14:56,157 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 53 [2024-10-11 13:14:56,158 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:14:56,159 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2024-10-11 13:14:56,160 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:14:56,160 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2024-10-11 13:14:56,161 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:14:56,162 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2024-10-11 13:14:56,163 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:14:56,164 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2024-10-11 13:14:56,164 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:14:56,165 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2024-10-11 13:14:56,167 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:14:56,169 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 89 [2024-10-11 13:14:56,171 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:14:56,173 INFO L134 CoverageAnalysis]: Checked inductivity of 420 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 420 trivial. 0 not checked. [2024-10-11 13:14:56,175 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 13:14:56,175 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [601673818] [2024-10-11 13:14:56,175 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [601673818] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 13:14:56,175 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 13:14:56,175 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-10-11 13:14:56,176 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1321136103] [2024-10-11 13:14:56,176 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 13:14:56,176 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-10-11 13:14:56,177 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 13:14:56,177 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-10-11 13:14:56,177 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2024-10-11 13:14:56,178 INFO L87 Difference]: Start difference. First operand 196 states and 278 transitions. Second operand has 6 states, 6 states have (on average 8.0) internal successors, (48), 6 states have internal predecessors, (48), 1 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 1 states have call successors, (15) [2024-10-11 13:14:56,464 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 13:14:56,465 INFO L93 Difference]: Finished difference Result 644 states and 912 transitions. [2024-10-11 13:14:56,465 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-10-11 13:14:56,465 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 8.0) internal successors, (48), 6 states have internal predecessors, (48), 1 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 1 states have call successors, (15) Word has length 120 [2024-10-11 13:14:56,466 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 13:14:56,468 INFO L225 Difference]: With dead ends: 644 [2024-10-11 13:14:56,468 INFO L226 Difference]: Without dead ends: 449 [2024-10-11 13:14:56,469 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 38 GetRequests, 32 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=23, Invalid=33, Unknown=0, NotChecked=0, Total=56 [2024-10-11 13:14:56,469 INFO L432 NwaCegarLoop]: 143 mSDtfsCounter, 426 mSDsluCounter, 440 mSDsCounter, 0 mSdLazyCounter, 127 mSolverCounterSat, 76 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 426 SdHoareTripleChecker+Valid, 583 SdHoareTripleChecker+Invalid, 203 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 76 IncrementalHoareTripleChecker+Valid, 127 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-10-11 13:14:56,470 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [426 Valid, 583 Invalid, 203 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [76 Valid, 127 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-10-11 13:14:56,471 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 449 states. [2024-10-11 13:14:56,489 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 449 to 198. [2024-10-11 13:14:56,490 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 198 states, 169 states have (on average 1.3550295857988166) internal successors, (229), 170 states have internal predecessors, (229), 26 states have call successors, (26), 2 states have call predecessors, (26), 2 states have return successors, (26), 25 states have call predecessors, (26), 26 states have call successors, (26) [2024-10-11 13:14:56,491 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 198 states to 198 states and 281 transitions. [2024-10-11 13:14:56,492 INFO L78 Accepts]: Start accepts. Automaton has 198 states and 281 transitions. Word has length 120 [2024-10-11 13:14:56,492 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 13:14:56,492 INFO L471 AbstractCegarLoop]: Abstraction has 198 states and 281 transitions. [2024-10-11 13:14:56,492 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 8.0) internal successors, (48), 6 states have internal predecessors, (48), 1 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 1 states have call successors, (15) [2024-10-11 13:14:56,492 INFO L276 IsEmpty]: Start isEmpty. Operand 198 states and 281 transitions. [2024-10-11 13:14:56,493 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 121 [2024-10-11 13:14:56,493 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 13:14:56,494 INFO L215 NwaCegarLoop]: trace histogram [15, 15, 15, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 13:14:56,494 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2024-10-11 13:14:56,494 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 13:14:56,494 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 13:14:56,494 INFO L85 PathProgramCache]: Analyzing trace with hash 163929428, now seen corresponding path program 1 times [2024-10-11 13:14:56,495 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 13:14:56,495 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1623963840] [2024-10-11 13:14:56,495 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 13:14:56,495 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 13:14:56,557 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:14:57,283 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-11 13:14:57,285 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:14:57,287 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2024-10-11 13:14:57,288 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:14:57,289 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2024-10-11 13:14:57,289 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:14:57,290 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2024-10-11 13:14:57,291 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:14:57,302 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2024-10-11 13:14:57,304 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:14:57,305 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-10-11 13:14:57,306 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:14:57,308 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2024-10-11 13:14:57,309 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:14:57,310 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2024-10-11 13:14:57,311 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:14:57,312 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 53 [2024-10-11 13:14:57,313 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:14:57,314 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2024-10-11 13:14:57,315 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:14:57,316 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2024-10-11 13:14:57,317 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:14:57,318 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2024-10-11 13:14:57,319 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:14:57,323 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2024-10-11 13:14:57,324 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:14:57,325 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2024-10-11 13:14:57,326 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:14:57,327 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 89 [2024-10-11 13:14:57,328 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:14:57,331 INFO L134 CoverageAnalysis]: Checked inductivity of 420 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 420 trivial. 0 not checked. [2024-10-11 13:14:57,331 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 13:14:57,331 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1623963840] [2024-10-11 13:14:57,331 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1623963840] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 13:14:57,331 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 13:14:57,331 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-10-11 13:14:57,332 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1505458812] [2024-10-11 13:14:57,332 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 13:14:57,332 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-10-11 13:14:57,332 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 13:14:57,333 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-10-11 13:14:57,333 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2024-10-11 13:14:57,333 INFO L87 Difference]: Start difference. First operand 198 states and 281 transitions. Second operand has 6 states, 5 states have (on average 9.6) internal successors, (48), 6 states have internal predecessors, (48), 2 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 2 states have call successors, (15) [2024-10-11 13:14:57,559 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 13:14:57,560 INFO L93 Difference]: Finished difference Result 489 states and 694 transitions. [2024-10-11 13:14:57,560 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-10-11 13:14:57,560 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 9.6) internal successors, (48), 6 states have internal predecessors, (48), 2 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 2 states have call successors, (15) Word has length 120 [2024-10-11 13:14:57,561 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 13:14:57,563 INFO L225 Difference]: With dead ends: 489 [2024-10-11 13:14:57,563 INFO L226 Difference]: Without dead ends: 292 [2024-10-11 13:14:57,563 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 43 GetRequests, 37 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=20, Invalid=36, Unknown=0, NotChecked=0, Total=56 [2024-10-11 13:14:57,564 INFO L432 NwaCegarLoop]: 223 mSDtfsCounter, 201 mSDsluCounter, 511 mSDsCounter, 0 mSdLazyCounter, 141 mSolverCounterSat, 38 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 202 SdHoareTripleChecker+Valid, 734 SdHoareTripleChecker+Invalid, 179 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 38 IncrementalHoareTripleChecker+Valid, 141 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-10-11 13:14:57,564 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [202 Valid, 734 Invalid, 179 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [38 Valid, 141 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-10-11 13:14:57,565 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 292 states. [2024-10-11 13:14:57,578 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 292 to 197. [2024-10-11 13:14:57,579 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 197 states, 168 states have (on average 1.3571428571428572) internal successors, (228), 169 states have internal predecessors, (228), 26 states have call successors, (26), 2 states have call predecessors, (26), 2 states have return successors, (26), 25 states have call predecessors, (26), 26 states have call successors, (26) [2024-10-11 13:14:57,581 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 197 states to 197 states and 280 transitions. [2024-10-11 13:14:57,582 INFO L78 Accepts]: Start accepts. Automaton has 197 states and 280 transitions. Word has length 120 [2024-10-11 13:14:57,584 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 13:14:57,584 INFO L471 AbstractCegarLoop]: Abstraction has 197 states and 280 transitions. [2024-10-11 13:14:57,585 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 9.6) internal successors, (48), 6 states have internal predecessors, (48), 2 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 2 states have call successors, (15) [2024-10-11 13:14:57,585 INFO L276 IsEmpty]: Start isEmpty. Operand 197 states and 280 transitions. [2024-10-11 13:14:57,586 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 121 [2024-10-11 13:14:57,586 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 13:14:57,586 INFO L215 NwaCegarLoop]: trace histogram [15, 15, 15, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 13:14:57,587 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2024-10-11 13:14:57,587 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 13:14:57,588 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 13:14:57,589 INFO L85 PathProgramCache]: Analyzing trace with hash -1641508906, now seen corresponding path program 1 times [2024-10-11 13:14:57,589 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 13:14:57,589 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [140392600] [2024-10-11 13:14:57,589 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 13:14:57,589 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 13:14:57,647 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:14:58,199 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-11 13:14:58,201 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:14:58,204 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2024-10-11 13:14:58,204 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:14:58,205 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2024-10-11 13:14:58,206 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:14:58,207 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2024-10-11 13:14:58,208 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:14:58,208 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2024-10-11 13:14:58,209 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:14:58,210 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-10-11 13:14:58,210 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:14:58,211 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2024-10-11 13:14:58,213 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:14:58,213 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2024-10-11 13:14:58,214 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:14:58,215 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 53 [2024-10-11 13:14:58,215 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:14:58,216 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2024-10-11 13:14:58,217 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:14:58,217 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2024-10-11 13:14:58,218 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:14:58,219 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2024-10-11 13:14:58,219 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:14:58,220 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2024-10-11 13:14:58,221 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:14:58,222 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2024-10-11 13:14:58,222 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:14:58,223 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 89 [2024-10-11 13:14:58,224 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:14:58,225 INFO L134 CoverageAnalysis]: Checked inductivity of 420 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 420 trivial. 0 not checked. [2024-10-11 13:14:58,225 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 13:14:58,225 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [140392600] [2024-10-11 13:14:58,225 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [140392600] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 13:14:58,225 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 13:14:58,225 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-10-11 13:14:58,226 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [843276381] [2024-10-11 13:14:58,226 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 13:14:58,227 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-10-11 13:14:58,227 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 13:14:58,227 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-10-11 13:14:58,227 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2024-10-11 13:14:58,228 INFO L87 Difference]: Start difference. First operand 197 states and 280 transitions. Second operand has 6 states, 5 states have (on average 9.6) internal successors, (48), 6 states have internal predecessors, (48), 2 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 2 states have call successors, (15) [2024-10-11 13:14:58,420 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 13:14:58,420 INFO L93 Difference]: Finished difference Result 472 states and 669 transitions. [2024-10-11 13:14:58,421 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-10-11 13:14:58,421 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 9.6) internal successors, (48), 6 states have internal predecessors, (48), 2 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 2 states have call successors, (15) Word has length 120 [2024-10-11 13:14:58,421 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 13:14:58,423 INFO L225 Difference]: With dead ends: 472 [2024-10-11 13:14:58,425 INFO L226 Difference]: Without dead ends: 276 [2024-10-11 13:14:58,425 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 43 GetRequests, 37 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=20, Invalid=36, Unknown=0, NotChecked=0, Total=56 [2024-10-11 13:14:58,426 INFO L432 NwaCegarLoop]: 123 mSDtfsCounter, 124 mSDsluCounter, 432 mSDsCounter, 0 mSdLazyCounter, 133 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 125 SdHoareTripleChecker+Valid, 555 SdHoareTripleChecker+Invalid, 139 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 133 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-10-11 13:14:58,426 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [125 Valid, 555 Invalid, 139 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 133 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-10-11 13:14:58,427 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 276 states. [2024-10-11 13:14:58,437 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 276 to 193. [2024-10-11 13:14:58,438 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 193 states, 164 states have (on average 1.3475609756097562) internal successors, (221), 165 states have internal predecessors, (221), 26 states have call successors, (26), 2 states have call predecessors, (26), 2 states have return successors, (26), 25 states have call predecessors, (26), 26 states have call successors, (26) [2024-10-11 13:14:58,439 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 193 states to 193 states and 273 transitions. [2024-10-11 13:14:58,440 INFO L78 Accepts]: Start accepts. Automaton has 193 states and 273 transitions. Word has length 120 [2024-10-11 13:14:58,440 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 13:14:58,440 INFO L471 AbstractCegarLoop]: Abstraction has 193 states and 273 transitions. [2024-10-11 13:14:58,440 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 9.6) internal successors, (48), 6 states have internal predecessors, (48), 2 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 2 states have call successors, (15) [2024-10-11 13:14:58,440 INFO L276 IsEmpty]: Start isEmpty. Operand 193 states and 273 transitions. [2024-10-11 13:14:58,441 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 122 [2024-10-11 13:14:58,441 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 13:14:58,442 INFO L215 NwaCegarLoop]: trace histogram [15, 15, 15, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 13:14:58,442 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2024-10-11 13:14:58,442 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 13:14:58,442 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 13:14:58,443 INFO L85 PathProgramCache]: Analyzing trace with hash -1013331468, now seen corresponding path program 1 times [2024-10-11 13:14:58,443 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 13:14:58,443 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2015483764] [2024-10-11 13:14:58,443 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 13:14:58,443 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 13:14:58,481 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:14:58,826 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-11 13:14:58,828 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:14:58,829 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2024-10-11 13:14:58,830 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:14:58,831 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2024-10-11 13:14:58,831 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:14:58,832 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2024-10-11 13:14:58,833 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:14:58,834 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2024-10-11 13:14:58,835 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:14:58,836 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-10-11 13:14:58,836 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:14:58,837 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2024-10-11 13:14:58,838 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:14:58,838 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2024-10-11 13:14:58,839 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:14:58,840 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 53 [2024-10-11 13:14:58,840 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:14:58,841 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2024-10-11 13:14:58,842 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:14:58,842 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2024-10-11 13:14:58,843 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:14:58,844 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2024-10-11 13:14:58,844 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:14:58,845 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2024-10-11 13:14:58,846 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:14:58,846 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2024-10-11 13:14:58,847 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:14:58,848 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 89 [2024-10-11 13:14:58,850 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:14:58,852 INFO L134 CoverageAnalysis]: Checked inductivity of 420 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 420 trivial. 0 not checked. [2024-10-11 13:14:58,852 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 13:14:58,852 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2015483764] [2024-10-11 13:14:58,852 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2015483764] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 13:14:58,852 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 13:14:58,852 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-10-11 13:14:58,852 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [997128216] [2024-10-11 13:14:58,852 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 13:14:58,853 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-10-11 13:14:58,853 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 13:14:58,853 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-10-11 13:14:58,854 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2024-10-11 13:14:58,854 INFO L87 Difference]: Start difference. First operand 193 states and 273 transitions. Second operand has 6 states, 6 states have (on average 8.166666666666666) internal successors, (49), 6 states have internal predecessors, (49), 1 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 1 states have call successors, (15) [2024-10-11 13:14:59,111 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 13:14:59,112 INFO L93 Difference]: Finished difference Result 654 states and 925 transitions. [2024-10-11 13:14:59,112 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-10-11 13:14:59,112 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 8.166666666666666) internal successors, (49), 6 states have internal predecessors, (49), 1 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 1 states have call successors, (15) Word has length 121 [2024-10-11 13:14:59,113 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 13:14:59,115 INFO L225 Difference]: With dead ends: 654 [2024-10-11 13:14:59,115 INFO L226 Difference]: Without dead ends: 462 [2024-10-11 13:14:59,116 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 38 GetRequests, 32 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=23, Invalid=33, Unknown=0, NotChecked=0, Total=56 [2024-10-11 13:14:59,117 INFO L432 NwaCegarLoop]: 124 mSDtfsCounter, 408 mSDsluCounter, 420 mSDsCounter, 0 mSdLazyCounter, 128 mSolverCounterSat, 76 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 408 SdHoareTripleChecker+Valid, 544 SdHoareTripleChecker+Invalid, 204 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 76 IncrementalHoareTripleChecker+Valid, 128 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-10-11 13:14:59,117 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [408 Valid, 544 Invalid, 204 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [76 Valid, 128 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-10-11 13:14:59,118 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 462 states. [2024-10-11 13:14:59,134 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 462 to 219. [2024-10-11 13:14:59,135 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 219 states, 190 states have (on average 1.3578947368421053) internal successors, (258), 191 states have internal predecessors, (258), 26 states have call successors, (26), 2 states have call predecessors, (26), 2 states have return successors, (26), 25 states have call predecessors, (26), 26 states have call successors, (26) [2024-10-11 13:14:59,136 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 219 states to 219 states and 310 transitions. [2024-10-11 13:14:59,136 INFO L78 Accepts]: Start accepts. Automaton has 219 states and 310 transitions. Word has length 121 [2024-10-11 13:14:59,138 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 13:14:59,138 INFO L471 AbstractCegarLoop]: Abstraction has 219 states and 310 transitions. [2024-10-11 13:14:59,138 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 8.166666666666666) internal successors, (49), 6 states have internal predecessors, (49), 1 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 1 states have call successors, (15) [2024-10-11 13:14:59,138 INFO L276 IsEmpty]: Start isEmpty. Operand 219 states and 310 transitions. [2024-10-11 13:14:59,141 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 122 [2024-10-11 13:14:59,141 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 13:14:59,141 INFO L215 NwaCegarLoop]: trace histogram [15, 15, 15, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 13:14:59,141 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2024-10-11 13:14:59,142 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 13:14:59,143 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 13:14:59,143 INFO L85 PathProgramCache]: Analyzing trace with hash 1693287926, now seen corresponding path program 1 times [2024-10-11 13:14:59,143 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 13:14:59,143 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [190342805] [2024-10-11 13:14:59,143 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 13:14:59,143 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 13:14:59,175 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:14:59,515 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-11 13:14:59,516 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:14:59,518 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2024-10-11 13:14:59,519 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:14:59,522 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2024-10-11 13:14:59,522 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:14:59,524 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2024-10-11 13:14:59,524 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:14:59,525 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2024-10-11 13:14:59,526 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:14:59,527 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-10-11 13:14:59,527 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:14:59,528 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2024-10-11 13:14:59,529 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:14:59,530 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2024-10-11 13:14:59,530 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:14:59,532 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 53 [2024-10-11 13:14:59,532 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:14:59,533 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2024-10-11 13:14:59,534 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:14:59,535 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2024-10-11 13:14:59,535 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:14:59,537 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2024-10-11 13:14:59,538 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:14:59,539 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2024-10-11 13:14:59,540 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:14:59,541 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2024-10-11 13:14:59,542 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:14:59,543 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 89 [2024-10-11 13:14:59,543 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:14:59,545 INFO L134 CoverageAnalysis]: Checked inductivity of 420 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 420 trivial. 0 not checked. [2024-10-11 13:14:59,545 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 13:14:59,545 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [190342805] [2024-10-11 13:14:59,545 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [190342805] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 13:14:59,546 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 13:14:59,546 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-10-11 13:14:59,546 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [304339847] [2024-10-11 13:14:59,546 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 13:14:59,546 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-10-11 13:14:59,547 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 13:14:59,547 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-10-11 13:14:59,547 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2024-10-11 13:14:59,547 INFO L87 Difference]: Start difference. First operand 219 states and 310 transitions. Second operand has 6 states, 6 states have (on average 8.166666666666666) internal successors, (49), 6 states have internal predecessors, (49), 1 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 1 states have call successors, (15) [2024-10-11 13:14:59,806 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 13:14:59,806 INFO L93 Difference]: Finished difference Result 680 states and 960 transitions. [2024-10-11 13:14:59,807 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-10-11 13:14:59,807 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 8.166666666666666) internal successors, (49), 6 states have internal predecessors, (49), 1 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 1 states have call successors, (15) Word has length 121 [2024-10-11 13:14:59,807 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 13:14:59,810 INFO L225 Difference]: With dead ends: 680 [2024-10-11 13:14:59,810 INFO L226 Difference]: Without dead ends: 462 [2024-10-11 13:14:59,811 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 38 GetRequests, 32 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=23, Invalid=33, Unknown=0, NotChecked=0, Total=56 [2024-10-11 13:14:59,811 INFO L432 NwaCegarLoop]: 164 mSDtfsCounter, 325 mSDsluCounter, 461 mSDsCounter, 0 mSdLazyCounter, 137 mSolverCounterSat, 42 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 325 SdHoareTripleChecker+Valid, 625 SdHoareTripleChecker+Invalid, 179 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 42 IncrementalHoareTripleChecker+Valid, 137 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-10-11 13:14:59,811 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [325 Valid, 625 Invalid, 179 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [42 Valid, 137 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-10-11 13:14:59,812 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 462 states. [2024-10-11 13:14:59,824 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 462 to 223. [2024-10-11 13:14:59,825 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 223 states, 194 states have (on average 1.3608247422680413) internal successors, (264), 195 states have internal predecessors, (264), 26 states have call successors, (26), 2 states have call predecessors, (26), 2 states have return successors, (26), 25 states have call predecessors, (26), 26 states have call successors, (26) [2024-10-11 13:14:59,826 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 223 states to 223 states and 316 transitions. [2024-10-11 13:14:59,827 INFO L78 Accepts]: Start accepts. Automaton has 223 states and 316 transitions. Word has length 121 [2024-10-11 13:14:59,827 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 13:14:59,827 INFO L471 AbstractCegarLoop]: Abstraction has 223 states and 316 transitions. [2024-10-11 13:14:59,827 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 8.166666666666666) internal successors, (49), 6 states have internal predecessors, (49), 1 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 1 states have call successors, (15) [2024-10-11 13:14:59,827 INFO L276 IsEmpty]: Start isEmpty. Operand 223 states and 316 transitions. [2024-10-11 13:14:59,829 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 122 [2024-10-11 13:14:59,829 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 13:14:59,829 INFO L215 NwaCegarLoop]: trace histogram [15, 15, 15, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 13:14:59,829 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2024-10-11 13:14:59,829 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 13:14:59,830 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 13:14:59,830 INFO L85 PathProgramCache]: Analyzing trace with hash -1075371082, now seen corresponding path program 1 times [2024-10-11 13:14:59,830 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 13:14:59,830 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1931264676] [2024-10-11 13:14:59,830 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 13:14:59,830 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 13:14:59,886 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:15:00,479 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-11 13:15:00,481 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:15:00,482 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2024-10-11 13:15:00,483 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:15:00,484 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2024-10-11 13:15:00,485 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:15:00,486 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2024-10-11 13:15:00,486 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:15:00,487 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2024-10-11 13:15:00,488 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:15:00,488 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-10-11 13:15:00,489 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:15:00,490 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2024-10-11 13:15:00,490 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:15:00,491 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2024-10-11 13:15:00,492 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:15:00,492 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 53 [2024-10-11 13:15:00,493 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:15:00,494 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2024-10-11 13:15:00,494 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:15:00,495 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2024-10-11 13:15:00,496 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:15:00,497 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2024-10-11 13:15:00,497 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:15:00,498 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2024-10-11 13:15:00,499 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:15:00,499 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2024-10-11 13:15:00,500 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:15:00,501 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 89 [2024-10-11 13:15:00,501 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:15:00,502 INFO L134 CoverageAnalysis]: Checked inductivity of 420 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 420 trivial. 0 not checked. [2024-10-11 13:15:00,503 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 13:15:00,503 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1931264676] [2024-10-11 13:15:00,503 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1931264676] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 13:15:00,503 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 13:15:00,503 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-10-11 13:15:00,503 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1572556030] [2024-10-11 13:15:00,503 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 13:15:00,504 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-10-11 13:15:00,504 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 13:15:00,504 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-10-11 13:15:00,505 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2024-10-11 13:15:00,505 INFO L87 Difference]: Start difference. First operand 223 states and 316 transitions. Second operand has 6 states, 5 states have (on average 9.8) internal successors, (49), 6 states have internal predecessors, (49), 2 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 2 states have call successors, (15) [2024-10-11 13:15:00,675 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 13:15:00,676 INFO L93 Difference]: Finished difference Result 522 states and 739 transitions. [2024-10-11 13:15:00,676 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-10-11 13:15:00,676 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 9.8) internal successors, (49), 6 states have internal predecessors, (49), 2 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 2 states have call successors, (15) Word has length 121 [2024-10-11 13:15:00,677 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 13:15:00,678 INFO L225 Difference]: With dead ends: 522 [2024-10-11 13:15:00,678 INFO L226 Difference]: Without dead ends: 300 [2024-10-11 13:15:00,679 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 43 GetRequests, 37 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=20, Invalid=36, Unknown=0, NotChecked=0, Total=56 [2024-10-11 13:15:00,679 INFO L432 NwaCegarLoop]: 123 mSDtfsCounter, 118 mSDsluCounter, 432 mSDsCounter, 0 mSdLazyCounter, 134 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 119 SdHoareTripleChecker+Valid, 555 SdHoareTripleChecker+Invalid, 140 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 134 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-11 13:15:00,680 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [119 Valid, 555 Invalid, 140 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 134 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-11 13:15:00,681 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 300 states. [2024-10-11 13:15:00,692 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 300 to 222. [2024-10-11 13:15:00,693 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 222 states, 193 states have (on average 1.3523316062176165) internal successors, (261), 194 states have internal predecessors, (261), 26 states have call successors, (26), 2 states have call predecessors, (26), 2 states have return successors, (26), 25 states have call predecessors, (26), 26 states have call successors, (26) [2024-10-11 13:15:00,693 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 222 states to 222 states and 313 transitions. [2024-10-11 13:15:00,694 INFO L78 Accepts]: Start accepts. Automaton has 222 states and 313 transitions. Word has length 121 [2024-10-11 13:15:00,694 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 13:15:00,694 INFO L471 AbstractCegarLoop]: Abstraction has 222 states and 313 transitions. [2024-10-11 13:15:00,695 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 9.8) internal successors, (49), 6 states have internal predecessors, (49), 2 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 2 states have call successors, (15) [2024-10-11 13:15:00,695 INFO L276 IsEmpty]: Start isEmpty. Operand 222 states and 313 transitions. [2024-10-11 13:15:00,697 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 122 [2024-10-11 13:15:00,697 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 13:15:00,697 INFO L215 NwaCegarLoop]: trace histogram [15, 15, 15, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 13:15:00,697 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2024-10-11 13:15:00,698 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 13:15:00,698 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 13:15:00,698 INFO L85 PathProgramCache]: Analyzing trace with hash 1631248312, now seen corresponding path program 1 times [2024-10-11 13:15:00,698 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 13:15:00,698 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1488275445] [2024-10-11 13:15:00,699 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 13:15:00,699 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 13:15:00,740 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:15:01,286 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-11 13:15:01,287 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:15:01,289 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2024-10-11 13:15:01,289 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:15:01,290 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2024-10-11 13:15:01,291 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:15:01,292 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2024-10-11 13:15:01,293 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:15:01,294 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2024-10-11 13:15:01,294 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:15:01,295 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-10-11 13:15:01,296 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:15:01,297 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2024-10-11 13:15:01,297 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:15:01,298 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2024-10-11 13:15:01,299 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:15:01,300 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 53 [2024-10-11 13:15:01,301 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:15:01,301 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2024-10-11 13:15:01,302 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:15:01,303 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2024-10-11 13:15:01,304 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:15:01,305 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2024-10-11 13:15:01,306 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:15:01,307 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2024-10-11 13:15:01,308 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:15:01,309 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2024-10-11 13:15:01,309 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:15:01,311 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 89 [2024-10-11 13:15:01,311 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:15:01,313 INFO L134 CoverageAnalysis]: Checked inductivity of 420 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 420 trivial. 0 not checked. [2024-10-11 13:15:01,314 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 13:15:01,314 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1488275445] [2024-10-11 13:15:01,314 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1488275445] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 13:15:01,314 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 13:15:01,314 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-10-11 13:15:01,314 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1448582171] [2024-10-11 13:15:01,314 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 13:15:01,315 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-10-11 13:15:01,315 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 13:15:01,315 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-10-11 13:15:01,316 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2024-10-11 13:15:01,316 INFO L87 Difference]: Start difference. First operand 222 states and 313 transitions. Second operand has 6 states, 5 states have (on average 9.8) internal successors, (49), 6 states have internal predecessors, (49), 2 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 2 states have call successors, (15) [2024-10-11 13:15:01,502 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 13:15:01,503 INFO L93 Difference]: Finished difference Result 521 states and 734 transitions. [2024-10-11 13:15:01,503 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-10-11 13:15:01,503 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 9.8) internal successors, (49), 6 states have internal predecessors, (49), 2 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 2 states have call successors, (15) Word has length 121 [2024-10-11 13:15:01,504 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 13:15:01,505 INFO L225 Difference]: With dead ends: 521 [2024-10-11 13:15:01,506 INFO L226 Difference]: Without dead ends: 300 [2024-10-11 13:15:01,507 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 43 GetRequests, 37 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=20, Invalid=36, Unknown=0, NotChecked=0, Total=56 [2024-10-11 13:15:01,508 INFO L432 NwaCegarLoop]: 144 mSDtfsCounter, 115 mSDsluCounter, 472 mSDsCounter, 0 mSdLazyCounter, 139 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 116 SdHoareTripleChecker+Valid, 616 SdHoareTripleChecker+Invalid, 145 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 139 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-11 13:15:01,508 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [116 Valid, 616 Invalid, 145 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 139 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-11 13:15:01,509 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 300 states. [2024-10-11 13:15:01,522 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 300 to 193. [2024-10-11 13:15:01,523 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 193 states, 164 states have (on average 1.329268292682927) internal successors, (218), 165 states have internal predecessors, (218), 26 states have call successors, (26), 2 states have call predecessors, (26), 2 states have return successors, (26), 25 states have call predecessors, (26), 26 states have call successors, (26) [2024-10-11 13:15:01,523 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 193 states to 193 states and 270 transitions. [2024-10-11 13:15:01,524 INFO L78 Accepts]: Start accepts. Automaton has 193 states and 270 transitions. Word has length 121 [2024-10-11 13:15:01,524 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 13:15:01,524 INFO L471 AbstractCegarLoop]: Abstraction has 193 states and 270 transitions. [2024-10-11 13:15:01,524 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 9.8) internal successors, (49), 6 states have internal predecessors, (49), 2 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 2 states have call successors, (15) [2024-10-11 13:15:01,525 INFO L276 IsEmpty]: Start isEmpty. Operand 193 states and 270 transitions. [2024-10-11 13:15:01,525 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 123 [2024-10-11 13:15:01,526 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 13:15:01,526 INFO L215 NwaCegarLoop]: trace histogram [15, 15, 15, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 13:15:01,526 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2024-10-11 13:15:01,526 INFO L396 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 13:15:01,526 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 13:15:01,526 INFO L85 PathProgramCache]: Analyzing trace with hash -1357070055, now seen corresponding path program 1 times [2024-10-11 13:15:01,526 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 13:15:01,526 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1677642909] [2024-10-11 13:15:01,527 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 13:15:01,527 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 13:15:01,589 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:15:02,087 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-11 13:15:02,088 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:15:02,089 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2024-10-11 13:15:02,090 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:15:02,091 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2024-10-11 13:15:02,093 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:15:02,118 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2024-10-11 13:15:02,120 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:15:02,126 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2024-10-11 13:15:02,128 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:15:02,129 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-10-11 13:15:02,130 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:15:02,132 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2024-10-11 13:15:02,133 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:15:02,134 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2024-10-11 13:15:02,135 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:15:02,137 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 53 [2024-10-11 13:15:02,138 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:15:02,139 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2024-10-11 13:15:02,140 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:15:02,142 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2024-10-11 13:15:02,147 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:15:02,149 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2024-10-11 13:15:02,150 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:15:02,155 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2024-10-11 13:15:02,156 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:15:02,158 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2024-10-11 13:15:02,162 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:15:02,164 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 89 [2024-10-11 13:15:02,165 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:15:02,168 INFO L134 CoverageAnalysis]: Checked inductivity of 420 backedges. 6 proven. 36 refuted. 0 times theorem prover too weak. 378 trivial. 0 not checked. [2024-10-11 13:15:02,169 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 13:15:02,169 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1677642909] [2024-10-11 13:15:02,170 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1677642909] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-11 13:15:02,170 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [396632484] [2024-10-11 13:15:02,170 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 13:15:02,170 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-11 13:15:02,170 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-11 13:15:02,172 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-10-11 13:15:02,173 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2024-10-11 13:15:02,490 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:15:02,495 INFO L255 TraceCheckSpWp]: Trace formula consists of 427 conjuncts, 23 conjuncts are in the unsatisfiable core [2024-10-11 13:15:02,509 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-11 13:15:02,569 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 1 [2024-10-11 13:15:02,620 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 43 treesize of output 21 [2024-10-11 13:15:02,859 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 78 treesize of output 58 [2024-10-11 13:15:02,865 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 2 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 58 treesize of output 68 [2024-10-11 13:15:02,888 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-10-11 13:15:02,889 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 42 treesize of output 36 [2024-10-11 13:15:02,955 INFO L134 CoverageAnalysis]: Checked inductivity of 420 backedges. 114 proven. 36 refuted. 0 times theorem prover too weak. 270 trivial. 0 not checked. [2024-10-11 13:15:02,955 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-11 13:15:03,294 INFO L134 CoverageAnalysis]: Checked inductivity of 420 backedges. 6 proven. 36 refuted. 0 times theorem prover too weak. 378 trivial. 0 not checked. [2024-10-11 13:15:03,295 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [396632484] provided 0 perfect and 2 imperfect interpolant sequences [2024-10-11 13:15:03,295 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-10-11 13:15:03,295 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 8, 8] total 15 [2024-10-11 13:15:03,296 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1865803021] [2024-10-11 13:15:03,296 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-10-11 13:15:03,296 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 15 states [2024-10-11 13:15:03,297 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 13:15:03,297 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2024-10-11 13:15:03,297 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=54, Invalid=156, Unknown=0, NotChecked=0, Total=210 [2024-10-11 13:15:03,298 INFO L87 Difference]: Start difference. First operand 193 states and 270 transitions. Second operand has 15 states, 12 states have (on average 5.5) internal successors, (66), 15 states have internal predecessors, (66), 5 states have call successors, (29), 2 states have call predecessors, (29), 4 states have return successors, (29), 2 states have call predecessors, (29), 5 states have call successors, (29) [2024-10-11 13:15:03,888 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 13:15:03,888 INFO L93 Difference]: Finished difference Result 583 states and 802 transitions. [2024-10-11 13:15:03,889 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2024-10-11 13:15:03,889 INFO L78 Accepts]: Start accepts. Automaton has has 15 states, 12 states have (on average 5.5) internal successors, (66), 15 states have internal predecessors, (66), 5 states have call successors, (29), 2 states have call predecessors, (29), 4 states have return successors, (29), 2 states have call predecessors, (29), 5 states have call successors, (29) Word has length 122 [2024-10-11 13:15:03,889 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 13:15:03,891 INFO L225 Difference]: With dead ends: 583 [2024-10-11 13:15:03,892 INFO L226 Difference]: Without dead ends: 391 [2024-10-11 13:15:03,893 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 294 GetRequests, 265 SyntacticMatches, 4 SemanticMatches, 25 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 125 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=168, Invalid=534, Unknown=0, NotChecked=0, Total=702 [2024-10-11 13:15:03,893 INFO L432 NwaCegarLoop]: 117 mSDtfsCounter, 382 mSDsluCounter, 692 mSDsCounter, 0 mSdLazyCounter, 399 mSolverCounterSat, 36 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 399 SdHoareTripleChecker+Valid, 809 SdHoareTripleChecker+Invalid, 435 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 36 IncrementalHoareTripleChecker+Valid, 399 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2024-10-11 13:15:03,893 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [399 Valid, 809 Invalid, 435 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [36 Valid, 399 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2024-10-11 13:15:03,895 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 391 states. [2024-10-11 13:15:03,912 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 391 to 203. [2024-10-11 13:15:03,913 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 203 states, 172 states have (on average 1.313953488372093) internal successors, (226), 173 states have internal predecessors, (226), 26 states have call successors, (26), 4 states have call predecessors, (26), 4 states have return successors, (26), 25 states have call predecessors, (26), 26 states have call successors, (26) [2024-10-11 13:15:03,914 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 203 states to 203 states and 278 transitions. [2024-10-11 13:15:03,915 INFO L78 Accepts]: Start accepts. Automaton has 203 states and 278 transitions. Word has length 122 [2024-10-11 13:15:03,915 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 13:15:03,915 INFO L471 AbstractCegarLoop]: Abstraction has 203 states and 278 transitions. [2024-10-11 13:15:03,916 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 15 states, 12 states have (on average 5.5) internal successors, (66), 15 states have internal predecessors, (66), 5 states have call successors, (29), 2 states have call predecessors, (29), 4 states have return successors, (29), 2 states have call predecessors, (29), 5 states have call successors, (29) [2024-10-11 13:15:03,916 INFO L276 IsEmpty]: Start isEmpty. Operand 203 states and 278 transitions. [2024-10-11 13:15:03,917 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 123 [2024-10-11 13:15:03,917 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 13:15:03,917 INFO L215 NwaCegarLoop]: trace histogram [15, 15, 15, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 13:15:03,937 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2024-10-11 13:15:04,118 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable15 [2024-10-11 13:15:04,118 INFO L396 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 13:15:04,119 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 13:15:04,119 INFO L85 PathProgramCache]: Analyzing trace with hash 1014669207, now seen corresponding path program 1 times [2024-10-11 13:15:04,119 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 13:15:04,119 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1325362205] [2024-10-11 13:15:04,119 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 13:15:04,120 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 13:15:04,216 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:15:05,130 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-11 13:15:05,132 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:15:05,133 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2024-10-11 13:15:05,134 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:15:05,135 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2024-10-11 13:15:05,135 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:15:05,136 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2024-10-11 13:15:05,137 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:15:05,137 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2024-10-11 13:15:05,138 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:15:05,138 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-10-11 13:15:05,140 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:15:05,140 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2024-10-11 13:15:05,141 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:15:05,142 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2024-10-11 13:15:05,142 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:15:05,143 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 53 [2024-10-11 13:15:05,143 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:15:05,144 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2024-10-11 13:15:05,145 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:15:05,145 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2024-10-11 13:15:05,146 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:15:05,146 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2024-10-11 13:15:05,147 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:15:05,147 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2024-10-11 13:15:05,148 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:15:05,149 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2024-10-11 13:15:05,149 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:15:05,150 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 89 [2024-10-11 13:15:05,151 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:15:05,153 INFO L134 CoverageAnalysis]: Checked inductivity of 420 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 420 trivial. 0 not checked. [2024-10-11 13:15:05,153 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 13:15:05,153 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1325362205] [2024-10-11 13:15:05,153 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1325362205] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 13:15:05,153 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 13:15:05,153 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-10-11 13:15:05,154 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1247009816] [2024-10-11 13:15:05,154 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 13:15:05,155 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-10-11 13:15:05,155 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 13:15:05,155 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-10-11 13:15:05,156 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2024-10-11 13:15:05,156 INFO L87 Difference]: Start difference. First operand 203 states and 278 transitions. Second operand has 7 states, 6 states have (on average 8.333333333333334) internal successors, (50), 7 states have internal predecessors, (50), 2 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 2 states have call successors, (15) [2024-10-11 13:15:05,510 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 13:15:05,511 INFO L93 Difference]: Finished difference Result 486 states and 663 transitions. [2024-10-11 13:15:05,511 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-10-11 13:15:05,512 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 6 states have (on average 8.333333333333334) internal successors, (50), 7 states have internal predecessors, (50), 2 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 2 states have call successors, (15) Word has length 122 [2024-10-11 13:15:05,512 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 13:15:05,513 INFO L225 Difference]: With dead ends: 486 [2024-10-11 13:15:05,514 INFO L226 Difference]: Without dead ends: 284 [2024-10-11 13:15:05,514 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 43 GetRequests, 35 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=23, Invalid=67, Unknown=0, NotChecked=0, Total=90 [2024-10-11 13:15:05,515 INFO L432 NwaCegarLoop]: 198 mSDtfsCounter, 89 mSDsluCounter, 816 mSDsCounter, 0 mSdLazyCounter, 249 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 90 SdHoareTripleChecker+Valid, 1014 SdHoareTripleChecker+Invalid, 250 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 249 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-10-11 13:15:05,515 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [90 Valid, 1014 Invalid, 250 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 249 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-10-11 13:15:05,515 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 284 states. [2024-10-11 13:15:05,540 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 284 to 281. [2024-10-11 13:15:05,541 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 281 states, 239 states have (on average 1.3096234309623431) internal successors, (313), 241 states have internal predecessors, (313), 35 states have call successors, (35), 6 states have call predecessors, (35), 6 states have return successors, (35), 33 states have call predecessors, (35), 35 states have call successors, (35) [2024-10-11 13:15:05,542 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 281 states to 281 states and 383 transitions. [2024-10-11 13:15:05,542 INFO L78 Accepts]: Start accepts. Automaton has 281 states and 383 transitions. Word has length 122 [2024-10-11 13:15:05,543 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 13:15:05,543 INFO L471 AbstractCegarLoop]: Abstraction has 281 states and 383 transitions. [2024-10-11 13:15:05,543 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 6 states have (on average 8.333333333333334) internal successors, (50), 7 states have internal predecessors, (50), 2 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 2 states have call successors, (15) [2024-10-11 13:15:05,543 INFO L276 IsEmpty]: Start isEmpty. Operand 281 states and 383 transitions. [2024-10-11 13:15:05,545 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 124 [2024-10-11 13:15:05,545 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 13:15:05,546 INFO L215 NwaCegarLoop]: trace histogram [15, 15, 15, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 13:15:05,546 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2024-10-11 13:15:05,546 INFO L396 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 13:15:05,546 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 13:15:05,546 INFO L85 PathProgramCache]: Analyzing trace with hash -1666105052, now seen corresponding path program 1 times [2024-10-11 13:15:05,547 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 13:15:05,547 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [482257307] [2024-10-11 13:15:05,547 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 13:15:05,547 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 13:15:05,574 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:15:05,678 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-11 13:15:05,681 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:15:05,682 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2024-10-11 13:15:05,683 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:15:05,684 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2024-10-11 13:15:05,685 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:15:05,689 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2024-10-11 13:15:05,690 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:15:05,691 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2024-10-11 13:15:05,692 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:15:05,692 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-10-11 13:15:05,693 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:15:05,694 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2024-10-11 13:15:05,694 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:15:05,695 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2024-10-11 13:15:05,696 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:15:05,696 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 53 [2024-10-11 13:15:05,697 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:15:05,698 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2024-10-11 13:15:05,698 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:15:05,699 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2024-10-11 13:15:05,699 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:15:05,702 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2024-10-11 13:15:05,703 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:15:05,704 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2024-10-11 13:15:05,705 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:15:05,706 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2024-10-11 13:15:05,706 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:15:05,707 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 89 [2024-10-11 13:15:05,708 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:15:05,709 INFO L134 CoverageAnalysis]: Checked inductivity of 420 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 420 trivial. 0 not checked. [2024-10-11 13:15:05,709 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 13:15:05,709 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [482257307] [2024-10-11 13:15:05,709 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [482257307] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 13:15:05,709 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 13:15:05,709 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-10-11 13:15:05,709 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1180543711] [2024-10-11 13:15:05,710 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 13:15:05,711 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-10-11 13:15:05,712 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 13:15:05,712 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-10-11 13:15:05,712 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-10-11 13:15:05,713 INFO L87 Difference]: Start difference. First operand 281 states and 383 transitions. Second operand has 5 states, 5 states have (on average 10.2) internal successors, (51), 5 states have internal predecessors, (51), 1 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 1 states have call successors, (15) [2024-10-11 13:15:05,773 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 13:15:05,773 INFO L93 Difference]: Finished difference Result 570 states and 777 transitions. [2024-10-11 13:15:05,773 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-10-11 13:15:05,774 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 10.2) internal successors, (51), 5 states have internal predecessors, (51), 1 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 1 states have call successors, (15) Word has length 123 [2024-10-11 13:15:05,774 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 13:15:05,776 INFO L225 Difference]: With dead ends: 570 [2024-10-11 13:15:05,776 INFO L226 Difference]: Without dead ends: 290 [2024-10-11 13:15:05,777 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 36 GetRequests, 33 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-10-11 13:15:05,777 INFO L432 NwaCegarLoop]: 127 mSDtfsCounter, 0 mSDsluCounter, 370 mSDsCounter, 0 mSdLazyCounter, 38 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 497 SdHoareTripleChecker+Invalid, 38 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 38 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-11 13:15:05,778 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 497 Invalid, 38 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 38 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-11 13:15:05,778 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 290 states. [2024-10-11 13:15:05,806 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 290 to 290. [2024-10-11 13:15:05,807 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 290 states, 248 states have (on average 1.2983870967741935) internal successors, (322), 250 states have internal predecessors, (322), 35 states have call successors, (35), 6 states have call predecessors, (35), 6 states have return successors, (35), 33 states have call predecessors, (35), 35 states have call successors, (35) [2024-10-11 13:15:05,808 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 290 states to 290 states and 392 transitions. [2024-10-11 13:15:05,808 INFO L78 Accepts]: Start accepts. Automaton has 290 states and 392 transitions. Word has length 123 [2024-10-11 13:15:05,810 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 13:15:05,810 INFO L471 AbstractCegarLoop]: Abstraction has 290 states and 392 transitions. [2024-10-11 13:15:05,810 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 10.2) internal successors, (51), 5 states have internal predecessors, (51), 1 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 1 states have call successors, (15) [2024-10-11 13:15:05,810 INFO L276 IsEmpty]: Start isEmpty. Operand 290 states and 392 transitions. [2024-10-11 13:15:05,811 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 125 [2024-10-11 13:15:05,812 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 13:15:05,812 INFO L215 NwaCegarLoop]: trace histogram [15, 15, 15, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 13:15:05,812 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2024-10-11 13:15:05,812 INFO L396 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 13:15:05,812 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 13:15:05,812 INFO L85 PathProgramCache]: Analyzing trace with hash -1444352480, now seen corresponding path program 1 times [2024-10-11 13:15:05,813 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 13:15:05,813 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [250184167] [2024-10-11 13:15:05,813 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 13:15:05,813 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 13:15:05,868 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-11 13:15:05,868 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-10-11 13:15:05,907 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-11 13:15:05,963 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-10-11 13:15:05,963 INFO L325 BasicCegarLoop]: Counterexample is feasible [2024-10-11 13:15:05,965 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2024-10-11 13:15:05,967 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2024-10-11 13:15:05,969 INFO L407 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 13:15:06,062 INFO L165 ceAbstractionStarter]: Computing trace abstraction results [2024-10-11 13:15:06,064 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 11.10 01:15:06 BoogieIcfgContainer [2024-10-11 13:15:06,064 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2024-10-11 13:15:06,065 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2024-10-11 13:15:06,065 INFO L270 PluginConnector]: Initializing Witness Printer... [2024-10-11 13:15:06,065 INFO L274 PluginConnector]: Witness Printer initialized [2024-10-11 13:15:06,065 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 11.10 01:14:51" (3/4) ... [2024-10-11 13:15:06,067 INFO L142 WitnessPrinter]: No result that supports witness generation found [2024-10-11 13:15:06,068 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2024-10-11 13:15:06,069 INFO L158 Benchmark]: Toolchain (without parser) took 15385.35ms. Allocated memory was 148.9MB in the beginning and 471.9MB in the end (delta: 323.0MB). Free memory was 93.5MB in the beginning and 189.6MB in the end (delta: -96.1MB). Peak memory consumption was 228.2MB. Max. memory is 16.1GB. [2024-10-11 13:15:06,069 INFO L158 Benchmark]: CDTParser took 0.17ms. Allocated memory is still 148.9MB. Free memory is still 109.9MB. There was no memory consumed. Max. memory is 16.1GB. [2024-10-11 13:15:06,070 INFO L158 Benchmark]: CACSL2BoogieTranslator took 346.60ms. Allocated memory is still 148.9MB. Free memory was 93.5MB in the beginning and 77.4MB in the end (delta: 16.1MB). Peak memory consumption was 14.7MB. Max. memory is 16.1GB. [2024-10-11 13:15:06,070 INFO L158 Benchmark]: Boogie Procedure Inliner took 62.80ms. Allocated memory is still 148.9MB. Free memory was 77.4MB in the beginning and 73.6MB in the end (delta: 3.8MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. [2024-10-11 13:15:06,071 INFO L158 Benchmark]: Boogie Preprocessor took 84.17ms. Allocated memory is still 148.9MB. Free memory was 73.6MB in the beginning and 68.3MB in the end (delta: 5.2MB). Peak memory consumption was 6.3MB. Max. memory is 16.1GB. [2024-10-11 13:15:06,071 INFO L158 Benchmark]: RCFGBuilder took 756.51ms. Allocated memory is still 148.9MB. Free memory was 68.3MB in the beginning and 86.4MB in the end (delta: -18.1MB). Peak memory consumption was 10.3MB. Max. memory is 16.1GB. [2024-10-11 13:15:06,071 INFO L158 Benchmark]: TraceAbstraction took 14124.32ms. Allocated memory was 148.9MB in the beginning and 471.9MB in the end (delta: 323.0MB). Free memory was 85.7MB in the beginning and 190.7MB in the end (delta: -104.9MB). Peak memory consumption was 218.0MB. Max. memory is 16.1GB. [2024-10-11 13:15:06,071 INFO L158 Benchmark]: Witness Printer took 3.94ms. Allocated memory is still 471.9MB. Free memory was 190.7MB in the beginning and 189.6MB in the end (delta: 1.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2024-10-11 13:15:06,073 INFO L338 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.17ms. Allocated memory is still 148.9MB. Free memory is still 109.9MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 346.60ms. Allocated memory is still 148.9MB. Free memory was 93.5MB in the beginning and 77.4MB in the end (delta: 16.1MB). Peak memory consumption was 14.7MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 62.80ms. Allocated memory is still 148.9MB. Free memory was 77.4MB in the beginning and 73.6MB in the end (delta: 3.8MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. * Boogie Preprocessor took 84.17ms. Allocated memory is still 148.9MB. Free memory was 73.6MB in the beginning and 68.3MB in the end (delta: 5.2MB). Peak memory consumption was 6.3MB. Max. memory is 16.1GB. * RCFGBuilder took 756.51ms. Allocated memory is still 148.9MB. Free memory was 68.3MB in the beginning and 86.4MB in the end (delta: -18.1MB). Peak memory consumption was 10.3MB. Max. memory is 16.1GB. * TraceAbstraction took 14124.32ms. Allocated memory was 148.9MB in the beginning and 471.9MB in the end (delta: 323.0MB). Free memory was 85.7MB in the beginning and 190.7MB in the end (delta: -104.9MB). Peak memory consumption was 218.0MB. Max. memory is 16.1GB. * Witness Printer took 3.94ms. Allocated memory is still 471.9MB. Free memory was 190.7MB in the beginning and 189.6MB in the end (delta: 1.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: ErrorAutomatonStatistics NumberErrorTraces: 0, NumberStatementsAllTraces: 0, NumberRelevantStatements: 0, 0.0s ErrorAutomatonConstructionTimeTotal, 0.0s FaulLocalizationTime, NumberStatementsFirstTrace: -1, TraceLengthAvg: 0, 0.0s ErrorAutomatonConstructionTimeAvg, 0.0s ErrorAutomatonDifferenceTimeAvg, 0.0s ErrorAutomatonDifferenceTimeTotal, NumberOfNoEnhancement: 0, NumberOfFiniteEnhancement: 0, NumberOfInfiniteEnhancement: 0 - UnprovableResult [Line: 19]: Unable to prove that a call to reach_error is unreachable Unable to prove that a call to reach_error is unreachable Reason: overapproximation of someBinaryFLOATComparisonOperation at line 89, overapproximation of someBinaryDOUBLEComparisonOperation at line 57, overapproximation of someBinaryArithmeticDOUBLEoperation at line 57. Possible FailurePath: [L21] unsigned char isInitial = 0; [L22-L24] unsigned char BOOL_unsigned_char_Array_0[2][2] = { {0, 1}, {1, 0} }; [L22-L24] unsigned char BOOL_unsigned_char_Array_0[2][2] = { {0, 1}, {1, 0} }; [L22-L24] unsigned char BOOL_unsigned_char_Array_0[2][2] = { {0, 1}, {1, 0} }; [L22-L24] unsigned char BOOL_unsigned_char_Array_0[2][2] = { {0, 1}, {1, 0} }; [L22-L24] unsigned char BOOL_unsigned_char_Array_0[2][2] = { {0, 1}, {1, 0} }; [L25-L27] float float_Array_0[2] = { 2.25, 199.4 }; [L25-L27] float float_Array_0[2] = { 2.25, 199.4 }; [L25-L27] float float_Array_0[2] = { 2.25, 199.4 }; [L28-L30] signed char signed_char_Array_0[5] = { -128, 0, 4, 16, 32 }; [L28-L30] signed char signed_char_Array_0[5] = { -128, 0, 4, 16, 32 }; [L28-L30] signed char signed_char_Array_0[5] = { -128, 0, 4, 16, 32 }; [L28-L30] signed char signed_char_Array_0[5] = { -128, 0, 4, 16, 32 }; [L28-L30] signed char signed_char_Array_0[5] = { -128, 0, 4, 16, 32 }; [L28-L30] signed char signed_char_Array_0[5] = { -128, 0, 4, 16, 32 }; [L31-L33] unsigned char unsigned_char_Array_0[1] = { 100 }; [L31-L33] unsigned char unsigned_char_Array_0[1] = { 100 }; [L34-L36] unsigned short int unsigned_short_int_Array_0[2] = { 55182, 0 }; [L34-L36] unsigned short int unsigned_short_int_Array_0[2] = { 55182, 0 }; [L34-L36] unsigned short int unsigned_short_int_Array_0[2] = { 55182, 0 }; [L93] isInitial = 1 [L94] FCALL initially() [L95] COND TRUE 1 [L96] FCALL updateLastVariables() [L97] CALL updateVariables() [L62] BOOL_unsigned_char_Array_0[1][0] = __VERIFIER_nondet_uchar() [L63] EXPR BOOL_unsigned_char_Array_0[1][0] VAL [BOOL_unsigned_char_Array_0={4:0}, float_Array_0={5:0}, isInitial=1, signed_char_Array_0={6:0}, unsigned_char_Array_0={7:0}, unsigned_short_int_Array_0={8:0}] [L63] CALL assume_abort_if_not(BOOL_unsigned_char_Array_0[1][0] >= 1) VAL [BOOL_unsigned_char_Array_0={4:0}, \old(cond)=1, float_Array_0={5:0}, isInitial=1, signed_char_Array_0={6:0}, unsigned_char_Array_0={7:0}, unsigned_short_int_Array_0={8:0}] [L20] COND FALSE !(!cond) VAL [BOOL_unsigned_char_Array_0={4:0}, \old(cond)=1, float_Array_0={5:0}, isInitial=1, signed_char_Array_0={6:0}, unsigned_char_Array_0={7:0}, unsigned_short_int_Array_0={8:0}] [L63] RET assume_abort_if_not(BOOL_unsigned_char_Array_0[1][0] >= 1) VAL [BOOL_unsigned_char_Array_0={4:0}, float_Array_0={5:0}, isInitial=1, signed_char_Array_0={6:0}, unsigned_char_Array_0={7:0}, unsigned_short_int_Array_0={8:0}] [L64] EXPR BOOL_unsigned_char_Array_0[1][0] VAL [BOOL_unsigned_char_Array_0={4:0}, float_Array_0={5:0}, isInitial=1, signed_char_Array_0={6:0}, unsigned_char_Array_0={7:0}, unsigned_short_int_Array_0={8:0}] [L64] CALL assume_abort_if_not(BOOL_unsigned_char_Array_0[1][0] <= 1) VAL [BOOL_unsigned_char_Array_0={4:0}, \old(cond)=1, float_Array_0={5:0}, isInitial=1, signed_char_Array_0={6:0}, unsigned_char_Array_0={7:0}, unsigned_short_int_Array_0={8:0}] [L20] COND FALSE !(!cond) VAL [BOOL_unsigned_char_Array_0={4:0}, \old(cond)=1, float_Array_0={5:0}, isInitial=1, signed_char_Array_0={6:0}, unsigned_char_Array_0={7:0}, unsigned_short_int_Array_0={8:0}] [L64] RET assume_abort_if_not(BOOL_unsigned_char_Array_0[1][0] <= 1) VAL [BOOL_unsigned_char_Array_0={4:0}, float_Array_0={5:0}, isInitial=1, signed_char_Array_0={6:0}, unsigned_char_Array_0={7:0}, unsigned_short_int_Array_0={8:0}] [L65] BOOL_unsigned_char_Array_0[0][1] = __VERIFIER_nondet_uchar() [L66] EXPR BOOL_unsigned_char_Array_0[0][1] VAL [BOOL_unsigned_char_Array_0={4:0}, float_Array_0={5:0}, isInitial=1, signed_char_Array_0={6:0}, unsigned_char_Array_0={7:0}, unsigned_short_int_Array_0={8:0}] [L66] CALL assume_abort_if_not(BOOL_unsigned_char_Array_0[0][1] >= 1) VAL [BOOL_unsigned_char_Array_0={4:0}, \old(cond)=1, float_Array_0={5:0}, isInitial=1, signed_char_Array_0={6:0}, unsigned_char_Array_0={7:0}, unsigned_short_int_Array_0={8:0}] [L20] COND FALSE !(!cond) VAL [BOOL_unsigned_char_Array_0={4:0}, \old(cond)=1, float_Array_0={5:0}, isInitial=1, signed_char_Array_0={6:0}, unsigned_char_Array_0={7:0}, unsigned_short_int_Array_0={8:0}] [L66] RET assume_abort_if_not(BOOL_unsigned_char_Array_0[0][1] >= 1) VAL [BOOL_unsigned_char_Array_0={4:0}, float_Array_0={5:0}, isInitial=1, signed_char_Array_0={6:0}, unsigned_char_Array_0={7:0}, unsigned_short_int_Array_0={8:0}] [L67] EXPR BOOL_unsigned_char_Array_0[0][1] VAL [BOOL_unsigned_char_Array_0={4:0}, float_Array_0={5:0}, isInitial=1, signed_char_Array_0={6:0}, unsigned_char_Array_0={7:0}, unsigned_short_int_Array_0={8:0}] [L67] CALL assume_abort_if_not(BOOL_unsigned_char_Array_0[0][1] <= 1) VAL [BOOL_unsigned_char_Array_0={4:0}, \old(cond)=1, float_Array_0={5:0}, isInitial=1, signed_char_Array_0={6:0}, unsigned_char_Array_0={7:0}, unsigned_short_int_Array_0={8:0}] [L20] COND FALSE !(!cond) VAL [BOOL_unsigned_char_Array_0={4:0}, \old(cond)=1, float_Array_0={5:0}, isInitial=1, signed_char_Array_0={6:0}, unsigned_char_Array_0={7:0}, unsigned_short_int_Array_0={8:0}] [L67] RET assume_abort_if_not(BOOL_unsigned_char_Array_0[0][1] <= 1) VAL [BOOL_unsigned_char_Array_0={4:0}, float_Array_0={5:0}, isInitial=1, signed_char_Array_0={6:0}, unsigned_char_Array_0={7:0}, unsigned_short_int_Array_0={8:0}] [L68] BOOL_unsigned_char_Array_0[1][1] = __VERIFIER_nondet_uchar() [L69] EXPR BOOL_unsigned_char_Array_0[1][1] VAL [BOOL_unsigned_char_Array_0={4:0}, float_Array_0={5:0}, isInitial=1, signed_char_Array_0={6:0}, unsigned_char_Array_0={7:0}, unsigned_short_int_Array_0={8:0}] [L69] CALL assume_abort_if_not(BOOL_unsigned_char_Array_0[1][1] >= 0) VAL [BOOL_unsigned_char_Array_0={4:0}, \old(cond)=1, float_Array_0={5:0}, isInitial=1, signed_char_Array_0={6:0}, unsigned_char_Array_0={7:0}, unsigned_short_int_Array_0={8:0}] [L20] COND FALSE !(!cond) VAL [BOOL_unsigned_char_Array_0={4:0}, \old(cond)=1, float_Array_0={5:0}, isInitial=1, signed_char_Array_0={6:0}, unsigned_char_Array_0={7:0}, unsigned_short_int_Array_0={8:0}] [L69] RET assume_abort_if_not(BOOL_unsigned_char_Array_0[1][1] >= 0) VAL [BOOL_unsigned_char_Array_0={4:0}, float_Array_0={5:0}, isInitial=1, signed_char_Array_0={6:0}, unsigned_char_Array_0={7:0}, unsigned_short_int_Array_0={8:0}] [L70] EXPR BOOL_unsigned_char_Array_0[1][1] VAL [BOOL_unsigned_char_Array_0={4:0}, float_Array_0={5:0}, isInitial=1, signed_char_Array_0={6:0}, unsigned_char_Array_0={7:0}, unsigned_short_int_Array_0={8:0}] [L70] CALL assume_abort_if_not(BOOL_unsigned_char_Array_0[1][1] <= 1) VAL [BOOL_unsigned_char_Array_0={4:0}, \old(cond)=1, float_Array_0={5:0}, isInitial=1, signed_char_Array_0={6:0}, unsigned_char_Array_0={7:0}, unsigned_short_int_Array_0={8:0}] [L20] COND FALSE !(!cond) VAL [BOOL_unsigned_char_Array_0={4:0}, \old(cond)=1, float_Array_0={5:0}, isInitial=1, signed_char_Array_0={6:0}, unsigned_char_Array_0={7:0}, unsigned_short_int_Array_0={8:0}] [L70] RET assume_abort_if_not(BOOL_unsigned_char_Array_0[1][1] <= 1) VAL [BOOL_unsigned_char_Array_0={4:0}, float_Array_0={5:0}, isInitial=1, signed_char_Array_0={6:0}, unsigned_char_Array_0={7:0}, unsigned_short_int_Array_0={8:0}] [L71] float_Array_0[1] = __VERIFIER_nondet_float() [L72] EXPR float_Array_0[1] [L72] EXPR float_Array_0[1] >= -922337.2036854765600e+13F && float_Array_0[1] <= -1.0e-20F VAL [BOOL_unsigned_char_Array_0={4:0}, float_Array_0={5:0}, isInitial=1, signed_char_Array_0={6:0}, unsigned_char_Array_0={7:0}, unsigned_short_int_Array_0={8:0}] [L72] EXPR float_Array_0[1] >= -922337.2036854765600e+13F && float_Array_0[1] <= -1.0e-20F [L72] EXPR float_Array_0[1] [L72] EXPR float_Array_0[1] >= -922337.2036854765600e+13F && float_Array_0[1] <= -1.0e-20F VAL [BOOL_unsigned_char_Array_0={4:0}, float_Array_0={5:0}, isInitial=1, signed_char_Array_0={6:0}, unsigned_char_Array_0={7:0}, unsigned_short_int_Array_0={8:0}] [L72] EXPR (float_Array_0[1] >= -922337.2036854765600e+13F && float_Array_0[1] <= -1.0e-20F) || (float_Array_0[1] <= 9223372.036854765600e+12F && float_Array_0[1] >= 1.0e-20F ) VAL [BOOL_unsigned_char_Array_0={4:0}, float_Array_0={5:0}, isInitial=1, signed_char_Array_0={6:0}, unsigned_char_Array_0={7:0}, unsigned_short_int_Array_0={8:0}] [L72] EXPR (float_Array_0[1] >= -922337.2036854765600e+13F && float_Array_0[1] <= -1.0e-20F) || (float_Array_0[1] <= 9223372.036854765600e+12F && float_Array_0[1] >= 1.0e-20F ) VAL [BOOL_unsigned_char_Array_0={4:0}, float_Array_0={5:0}, isInitial=1, signed_char_Array_0={6:0}, unsigned_char_Array_0={7:0}, unsigned_short_int_Array_0={8:0}] [L72] CALL assume_abort_if_not((float_Array_0[1] >= -922337.2036854765600e+13F && float_Array_0[1] <= -1.0e-20F) || (float_Array_0[1] <= 9223372.036854765600e+12F && float_Array_0[1] >= 1.0e-20F )) VAL [BOOL_unsigned_char_Array_0={4:0}, \old(cond)=1, float_Array_0={5:0}, isInitial=1, signed_char_Array_0={6:0}, unsigned_char_Array_0={7:0}, unsigned_short_int_Array_0={8:0}] [L20] COND FALSE !(!cond) VAL [BOOL_unsigned_char_Array_0={4:0}, \old(cond)=1, float_Array_0={5:0}, isInitial=1, signed_char_Array_0={6:0}, unsigned_char_Array_0={7:0}, unsigned_short_int_Array_0={8:0}] [L72] RET assume_abort_if_not((float_Array_0[1] >= -922337.2036854765600e+13F && float_Array_0[1] <= -1.0e-20F) || (float_Array_0[1] <= 9223372.036854765600e+12F && float_Array_0[1] >= 1.0e-20F )) VAL [BOOL_unsigned_char_Array_0={4:0}, float_Array_0={5:0}, isInitial=1, signed_char_Array_0={6:0}, unsigned_char_Array_0={7:0}, unsigned_short_int_Array_0={8:0}] [L73] signed_char_Array_0[1] = __VERIFIER_nondet_char() [L74] EXPR signed_char_Array_0[1] VAL [BOOL_unsigned_char_Array_0={4:0}, float_Array_0={5:0}, isInitial=1, signed_char_Array_0={6:0}, unsigned_char_Array_0={7:0}, unsigned_short_int_Array_0={8:0}] [L74] CALL assume_abort_if_not(signed_char_Array_0[1] >= -127) VAL [BOOL_unsigned_char_Array_0={4:0}, \old(cond)=1, float_Array_0={5:0}, isInitial=1, signed_char_Array_0={6:0}, unsigned_char_Array_0={7:0}, unsigned_short_int_Array_0={8:0}] [L20] COND FALSE !(!cond) VAL [BOOL_unsigned_char_Array_0={4:0}, \old(cond)=1, float_Array_0={5:0}, isInitial=1, signed_char_Array_0={6:0}, unsigned_char_Array_0={7:0}, unsigned_short_int_Array_0={8:0}] [L74] RET assume_abort_if_not(signed_char_Array_0[1] >= -127) VAL [BOOL_unsigned_char_Array_0={4:0}, float_Array_0={5:0}, isInitial=1, signed_char_Array_0={6:0}, unsigned_char_Array_0={7:0}, unsigned_short_int_Array_0={8:0}] [L75] EXPR signed_char_Array_0[1] VAL [BOOL_unsigned_char_Array_0={4:0}, float_Array_0={5:0}, isInitial=1, signed_char_Array_0={6:0}, unsigned_char_Array_0={7:0}, unsigned_short_int_Array_0={8:0}] [L75] CALL assume_abort_if_not(signed_char_Array_0[1] <= 126) VAL [BOOL_unsigned_char_Array_0={4:0}, \old(cond)=1, float_Array_0={5:0}, isInitial=1, signed_char_Array_0={6:0}, unsigned_char_Array_0={7:0}, unsigned_short_int_Array_0={8:0}] [L20] COND FALSE !(!cond) VAL [BOOL_unsigned_char_Array_0={4:0}, \old(cond)=1, float_Array_0={5:0}, isInitial=1, signed_char_Array_0={6:0}, unsigned_char_Array_0={7:0}, unsigned_short_int_Array_0={8:0}] [L75] RET assume_abort_if_not(signed_char_Array_0[1] <= 126) VAL [BOOL_unsigned_char_Array_0={4:0}, float_Array_0={5:0}, isInitial=1, signed_char_Array_0={6:0}, unsigned_char_Array_0={7:0}, unsigned_short_int_Array_0={8:0}] [L76] signed_char_Array_0[2] = __VERIFIER_nondet_char() [L77] EXPR signed_char_Array_0[2] VAL [BOOL_unsigned_char_Array_0={4:0}, float_Array_0={5:0}, isInitial=1, signed_char_Array_0={6:0}, unsigned_char_Array_0={7:0}, unsigned_short_int_Array_0={8:0}] [L77] CALL assume_abort_if_not(signed_char_Array_0[2] >= 0) VAL [BOOL_unsigned_char_Array_0={4:0}, \old(cond)=1, float_Array_0={5:0}, isInitial=1, signed_char_Array_0={6:0}, unsigned_char_Array_0={7:0}, unsigned_short_int_Array_0={8:0}] [L20] COND FALSE !(!cond) VAL [BOOL_unsigned_char_Array_0={4:0}, \old(cond)=1, float_Array_0={5:0}, isInitial=1, signed_char_Array_0={6:0}, unsigned_char_Array_0={7:0}, unsigned_short_int_Array_0={8:0}] [L77] RET assume_abort_if_not(signed_char_Array_0[2] >= 0) VAL [BOOL_unsigned_char_Array_0={4:0}, float_Array_0={5:0}, isInitial=1, signed_char_Array_0={6:0}, unsigned_char_Array_0={7:0}, unsigned_short_int_Array_0={8:0}] [L78] EXPR signed_char_Array_0[2] VAL [BOOL_unsigned_char_Array_0={4:0}, float_Array_0={5:0}, isInitial=1, signed_char_Array_0={6:0}, unsigned_char_Array_0={7:0}, unsigned_short_int_Array_0={8:0}] [L78] CALL assume_abort_if_not(signed_char_Array_0[2] <= 126) VAL [BOOL_unsigned_char_Array_0={4:0}, \old(cond)=1, float_Array_0={5:0}, isInitial=1, signed_char_Array_0={6:0}, unsigned_char_Array_0={7:0}, unsigned_short_int_Array_0={8:0}] [L20] COND FALSE !(!cond) VAL [BOOL_unsigned_char_Array_0={4:0}, \old(cond)=1, float_Array_0={5:0}, isInitial=1, signed_char_Array_0={6:0}, unsigned_char_Array_0={7:0}, unsigned_short_int_Array_0={8:0}] [L78] RET assume_abort_if_not(signed_char_Array_0[2] <= 126) VAL [BOOL_unsigned_char_Array_0={4:0}, float_Array_0={5:0}, isInitial=1, signed_char_Array_0={6:0}, unsigned_char_Array_0={7:0}, unsigned_short_int_Array_0={8:0}] [L79] signed_char_Array_0[3] = __VERIFIER_nondet_char() [L80] EXPR signed_char_Array_0[3] VAL [BOOL_unsigned_char_Array_0={4:0}, float_Array_0={5:0}, isInitial=1, signed_char_Array_0={6:0}, unsigned_char_Array_0={7:0}, unsigned_short_int_Array_0={8:0}] [L80] CALL assume_abort_if_not(signed_char_Array_0[3] >= -1) VAL [BOOL_unsigned_char_Array_0={4:0}, \old(cond)=1, float_Array_0={5:0}, isInitial=1, signed_char_Array_0={6:0}, unsigned_char_Array_0={7:0}, unsigned_short_int_Array_0={8:0}] [L20] COND FALSE !(!cond) VAL [BOOL_unsigned_char_Array_0={4:0}, \old(cond)=1, float_Array_0={5:0}, isInitial=1, signed_char_Array_0={6:0}, unsigned_char_Array_0={7:0}, unsigned_short_int_Array_0={8:0}] [L80] RET assume_abort_if_not(signed_char_Array_0[3] >= -1) VAL [BOOL_unsigned_char_Array_0={4:0}, float_Array_0={5:0}, isInitial=1, signed_char_Array_0={6:0}, unsigned_char_Array_0={7:0}, unsigned_short_int_Array_0={8:0}] [L81] EXPR signed_char_Array_0[3] VAL [BOOL_unsigned_char_Array_0={4:0}, float_Array_0={5:0}, isInitial=1, signed_char_Array_0={6:0}, unsigned_char_Array_0={7:0}, unsigned_short_int_Array_0={8:0}] [L81] CALL assume_abort_if_not(signed_char_Array_0[3] <= 126) VAL [BOOL_unsigned_char_Array_0={4:0}, \old(cond)=1, float_Array_0={5:0}, isInitial=1, signed_char_Array_0={6:0}, unsigned_char_Array_0={7:0}, unsigned_short_int_Array_0={8:0}] [L20] COND FALSE !(!cond) VAL [BOOL_unsigned_char_Array_0={4:0}, \old(cond)=1, float_Array_0={5:0}, isInitial=1, signed_char_Array_0={6:0}, unsigned_char_Array_0={7:0}, unsigned_short_int_Array_0={8:0}] [L81] RET assume_abort_if_not(signed_char_Array_0[3] <= 126) VAL [BOOL_unsigned_char_Array_0={4:0}, float_Array_0={5:0}, isInitial=1, signed_char_Array_0={6:0}, unsigned_char_Array_0={7:0}, unsigned_short_int_Array_0={8:0}] [L82] unsigned_short_int_Array_0[0] = __VERIFIER_nondet_ushort() [L83] EXPR unsigned_short_int_Array_0[0] VAL [BOOL_unsigned_char_Array_0={4:0}, float_Array_0={5:0}, isInitial=1, signed_char_Array_0={6:0}, unsigned_char_Array_0={7:0}, unsigned_short_int_Array_0={8:0}] [L83] CALL assume_abort_if_not(unsigned_short_int_Array_0[0] >= 32767) VAL [BOOL_unsigned_char_Array_0={4:0}, \old(cond)=1, float_Array_0={5:0}, isInitial=1, signed_char_Array_0={6:0}, unsigned_char_Array_0={7:0}, unsigned_short_int_Array_0={8:0}] [L20] COND FALSE !(!cond) VAL [BOOL_unsigned_char_Array_0={4:0}, \old(cond)=1, float_Array_0={5:0}, isInitial=1, signed_char_Array_0={6:0}, unsigned_char_Array_0={7:0}, unsigned_short_int_Array_0={8:0}] [L83] RET assume_abort_if_not(unsigned_short_int_Array_0[0] >= 32767) VAL [BOOL_unsigned_char_Array_0={4:0}, float_Array_0={5:0}, isInitial=1, signed_char_Array_0={6:0}, unsigned_char_Array_0={7:0}, unsigned_short_int_Array_0={8:0}] [L84] EXPR unsigned_short_int_Array_0[0] VAL [BOOL_unsigned_char_Array_0={4:0}, float_Array_0={5:0}, isInitial=1, signed_char_Array_0={6:0}, unsigned_char_Array_0={7:0}, unsigned_short_int_Array_0={8:0}] [L84] CALL assume_abort_if_not(unsigned_short_int_Array_0[0] <= 65534) VAL [BOOL_unsigned_char_Array_0={4:0}, \old(cond)=1, float_Array_0={5:0}, isInitial=1, signed_char_Array_0={6:0}, unsigned_char_Array_0={7:0}, unsigned_short_int_Array_0={8:0}] [L20] COND FALSE !(!cond) VAL [BOOL_unsigned_char_Array_0={4:0}, \old(cond)=1, float_Array_0={5:0}, isInitial=1, signed_char_Array_0={6:0}, unsigned_char_Array_0={7:0}, unsigned_short_int_Array_0={8:0}] [L84] RET assume_abort_if_not(unsigned_short_int_Array_0[0] <= 65534) VAL [BOOL_unsigned_char_Array_0={4:0}, float_Array_0={5:0}, isInitial=1, signed_char_Array_0={6:0}, unsigned_char_Array_0={7:0}, unsigned_short_int_Array_0={8:0}] [L97] RET updateVariables() [L98] CALL step() [L40] EXPR BOOL_unsigned_char_Array_0[1][1] VAL [BOOL_unsigned_char_Array_0={4:0}, float_Array_0={5:0}, isInitial=1, signed_char_Array_0={6:0}, unsigned_char_Array_0={7:0}, unsigned_short_int_Array_0={8:0}] [L40] COND FALSE !(! BOOL_unsigned_char_Array_0[1][1]) [L43] EXPR BOOL_unsigned_char_Array_0[0][1] [L43] BOOL_unsigned_char_Array_0[0][0] = ((! BOOL_unsigned_char_Array_0[0][1]) || (! (! 0))) [L45] EXPR signed_char_Array_0[2] [L45] unsigned_char_Array_0[0] = signed_char_Array_0[2] [L46] EXPR float_Array_0[1] [L46] float_Array_0[0] = float_Array_0[1] [L47] EXPR signed_char_Array_0[3] [L47] signed_char_Array_0[0] = signed_char_Array_0[3] [L48] EXPR BOOL_unsigned_char_Array_0[0][0] [L48] BOOL_unsigned_char_Array_0[0][0] || (64.75f < float_Array_0[0]) VAL [BOOL_unsigned_char_Array_0={4:0}, float_Array_0={5:0}, isInitial=1, signed_char_Array_0={6:0}, unsigned_char_Array_0={7:0}, unsigned_short_int_Array_0={8:0}] [L48] BOOL_unsigned_char_Array_0[0][0] || (64.75f < float_Array_0[0]) [L48] EXPR float_Array_0[0] [L48] BOOL_unsigned_char_Array_0[0][0] || (64.75f < float_Array_0[0]) VAL [BOOL_unsigned_char_Array_0={4:0}, float_Array_0={5:0}, isInitial=1, signed_char_Array_0={6:0}, unsigned_char_Array_0={7:0}, unsigned_short_int_Array_0={8:0}] [L48] COND TRUE BOOL_unsigned_char_Array_0[0][0] || (64.75f < float_Array_0[0]) [L49] BOOL_unsigned_char_Array_0[0][0] VAL [BOOL_unsigned_char_Array_0={4:0}, float_Array_0={5:0}, isInitial=1, signed_char_Array_0={6:0}, unsigned_char_Array_0={7:0}, unsigned_short_int_Array_0={8:0}] [L49] COND FALSE !(BOOL_unsigned_char_Array_0[0][0]) [L52] EXPR signed_char_Array_0[3] [L52] EXPR signed_char_Array_0[2] VAL [BOOL_unsigned_char_Array_0={4:0}, float_Array_0={5:0}, isInitial=1, signed_char_Array_0={6:0}, unsigned_char_Array_0={7:0}, unsigned_short_int_Array_0={8:0}] [L52] EXPR ((signed_char_Array_0[3]) > (signed_char_Array_0[2])) ? (signed_char_Array_0[3]) : (signed_char_Array_0[2]) [L52] EXPR signed_char_Array_0[3] [L52] EXPR ((signed_char_Array_0[3]) > (signed_char_Array_0[2])) ? (signed_char_Array_0[3]) : (signed_char_Array_0[2]) VAL [BOOL_unsigned_char_Array_0={4:0}, float_Array_0={5:0}, isInitial=1, signed_char_Array_0={6:0}, unsigned_char_Array_0={7:0}, unsigned_short_int_Array_0={8:0}] [L52] EXPR signed_char_Array_0[1] VAL [BOOL_unsigned_char_Array_0={4:0}, float_Array_0={5:0}, isInitial=1, signed_char_Array_0={6:0}, unsigned_char_Array_0={7:0}, unsigned_short_int_Array_0={8:0}] [L52] EXPR ((((((signed_char_Array_0[3]) > (signed_char_Array_0[2])) ? (signed_char_Array_0[3]) : (signed_char_Array_0[2])))) < (signed_char_Array_0[1])) ? (((((signed_char_Array_0[3]) > (signed_char_Array_0[2])) ? (signed_char_Array_0[3]) : (signed_char_Array_0[2])))) : (signed_char_Array_0[1]) [L52] EXPR signed_char_Array_0[1] [L52] EXPR ((((((signed_char_Array_0[3]) > (signed_char_Array_0[2])) ? (signed_char_Array_0[3]) : (signed_char_Array_0[2])))) < (signed_char_Array_0[1])) ? (((((signed_char_Array_0[3]) > (signed_char_Array_0[2])) ? (signed_char_Array_0[3]) : (signed_char_Array_0[2])))) : (signed_char_Array_0[1]) VAL [BOOL_unsigned_char_Array_0={4:0}, float_Array_0={5:0}, isInitial=1, signed_char_Array_0={6:0}, unsigned_char_Array_0={7:0}, unsigned_short_int_Array_0={8:0}] [L52] signed_char_Array_0[4] = ((((((((signed_char_Array_0[3]) > (signed_char_Array_0[2])) ? (signed_char_Array_0[3]) : (signed_char_Array_0[2])))) < (signed_char_Array_0[1])) ? (((((signed_char_Array_0[3]) > (signed_char_Array_0[2])) ? (signed_char_Array_0[3]) : (signed_char_Array_0[2])))) : (signed_char_Array_0[1]))) [L57] EXPR float_Array_0[0] [L57] EXPR float_Array_0[0] VAL [BOOL_unsigned_char_Array_0={4:0}, float_Array_0={5:0}, isInitial=1, signed_char_Array_0={6:0}, unsigned_char_Array_0={7:0}, unsigned_short_int_Array_0={8:0}] [L57] EXPR (((float_Array_0[0] * 127.75)) > ((float_Array_0[0] / 3.4))) ? ((float_Array_0[0] * 127.75)) : ((float_Array_0[0] / 3.4)) [L57] EXPR float_Array_0[0] [L57] EXPR (((float_Array_0[0] * 127.75)) > ((float_Array_0[0] / 3.4))) ? ((float_Array_0[0] * 127.75)) : ((float_Array_0[0] / 3.4)) VAL [BOOL_unsigned_char_Array_0={4:0}, float_Array_0={5:0}, isInitial=1, signed_char_Array_0={6:0}, unsigned_char_Array_0={7:0}, unsigned_short_int_Array_0={8:0}] [L57] EXPR float_Array_0[0] VAL [BOOL_unsigned_char_Array_0={4:0}, float_Array_0={5:0}, isInitial=1, signed_char_Array_0={6:0}, unsigned_char_Array_0={7:0}, unsigned_short_int_Array_0={8:0}] [L57] COND FALSE !((((((float_Array_0[0] * 127.75)) > ((float_Array_0[0] / 3.4))) ? ((float_Array_0[0] * 127.75)) : ((float_Array_0[0] / 3.4)))) >= float_Array_0[0]) [L98] RET step() [L99] CALL, EXPR property() [L89] EXPR BOOL_unsigned_char_Array_0[0][0] [L89] EXPR BOOL_unsigned_char_Array_0[0][0] || (64.75f < float_Array_0[0]) VAL [BOOL_unsigned_char_Array_0={4:0}, float_Array_0={5:0}, isInitial=1, signed_char_Array_0={6:0}, unsigned_char_Array_0={7:0}, unsigned_short_int_Array_0={8:0}] [L89] EXPR BOOL_unsigned_char_Array_0[0][0] || (64.75f < float_Array_0[0]) [L89] EXPR float_Array_0[0] [L89] EXPR BOOL_unsigned_char_Array_0[0][0] || (64.75f < float_Array_0[0]) VAL [BOOL_unsigned_char_Array_0={4:0}, float_Array_0={5:0}, isInitial=1, signed_char_Array_0={6:0}, unsigned_char_Array_0={7:0}, unsigned_short_int_Array_0={8:0}] [L89] EXPR (BOOL_unsigned_char_Array_0[0][0] || (64.75f < float_Array_0[0])) ? (BOOL_unsigned_char_Array_0[0][0] ? (signed_char_Array_0[4] == ((signed char) (signed_char_Array_0[3] - signed_char_Array_0[2]))) : (signed_char_Array_0[4] == ((signed char) ((((((((signed_char_Array_0[3]) > (signed_char_Array_0[2])) ? (signed_char_Array_0[3]) : (signed_char_Array_0[2])))) < (signed_char_Array_0[1])) ? (((((signed_char_Array_0[3]) > (signed_char_Array_0[2])) ? (signed_char_Array_0[3]) : (signed_char_Array_0[2])))) : (signed_char_Array_0[1])))))) : (signed_char_Array_0[4] == ((signed char) signed_char_Array_0[3])) [L89] EXPR signed_char_Array_0[4] [L89] EXPR signed_char_Array_0[3] [L89] EXPR (BOOL_unsigned_char_Array_0[0][0] || (64.75f < float_Array_0[0])) ? (BOOL_unsigned_char_Array_0[0][0] ? (signed_char_Array_0[4] == ((signed char) (signed_char_Array_0[3] - signed_char_Array_0[2]))) : (signed_char_Array_0[4] == ((signed char) ((((((((signed_char_Array_0[3]) > (signed_char_Array_0[2])) ? (signed_char_Array_0[3]) : (signed_char_Array_0[2])))) < (signed_char_Array_0[1])) ? (((((signed_char_Array_0[3]) > (signed_char_Array_0[2])) ? (signed_char_Array_0[3]) : (signed_char_Array_0[2])))) : (signed_char_Array_0[1])))))) : (signed_char_Array_0[4] == ((signed char) signed_char_Array_0[3])) VAL [BOOL_unsigned_char_Array_0={4:0}, float_Array_0={5:0}, isInitial=1, signed_char_Array_0={6:0}, unsigned_char_Array_0={7:0}, unsigned_short_int_Array_0={8:0}] [L89] EXPR ((BOOL_unsigned_char_Array_0[0][0] || (64.75f < float_Array_0[0])) ? (BOOL_unsigned_char_Array_0[0][0] ? (signed_char_Array_0[4] == ((signed char) (signed_char_Array_0[3] - signed_char_Array_0[2]))) : (signed_char_Array_0[4] == ((signed char) ((((((((signed_char_Array_0[3]) > (signed_char_Array_0[2])) ? (signed_char_Array_0[3]) : (signed_char_Array_0[2])))) < (signed_char_Array_0[1])) ? (((((signed_char_Array_0[3]) > (signed_char_Array_0[2])) ? (signed_char_Array_0[3]) : (signed_char_Array_0[2])))) : (signed_char_Array_0[1])))))) : (signed_char_Array_0[4] == ((signed char) signed_char_Array_0[3]))) && (((((((float_Array_0[0] * 127.75)) > ((float_Array_0[0] / 3.4))) ? ((float_Array_0[0] * 127.75)) : ((float_Array_0[0] / 3.4)))) >= float_Array_0[0]) ? (unsigned_short_int_Array_0[1] == ((unsigned short int) (((((unsigned_short_int_Array_0[0] - (22925 - signed_char_Array_0[2]))) < (unsigned_char_Array_0[0])) ? ((unsigned_short_int_Array_0[0] - (22925 - signed_char_Array_0[2]))) : (unsigned_char_Array_0[0]))))) : 1) VAL [BOOL_unsigned_char_Array_0={4:0}, float_Array_0={5:0}, isInitial=1, signed_char_Array_0={6:0}, unsigned_char_Array_0={7:0}, unsigned_short_int_Array_0={8:0}] [L89] EXPR ((BOOL_unsigned_char_Array_0[0][0] || (64.75f < float_Array_0[0])) ? (BOOL_unsigned_char_Array_0[0][0] ? (signed_char_Array_0[4] == ((signed char) (signed_char_Array_0[3] - signed_char_Array_0[2]))) : (signed_char_Array_0[4] == ((signed char) ((((((((signed_char_Array_0[3]) > (signed_char_Array_0[2])) ? (signed_char_Array_0[3]) : (signed_char_Array_0[2])))) < (signed_char_Array_0[1])) ? (((((signed_char_Array_0[3]) > (signed_char_Array_0[2])) ? (signed_char_Array_0[3]) : (signed_char_Array_0[2])))) : (signed_char_Array_0[1])))))) : (signed_char_Array_0[4] == ((signed char) signed_char_Array_0[3]))) && (((((((float_Array_0[0] * 127.75)) > ((float_Array_0[0] / 3.4))) ? ((float_Array_0[0] * 127.75)) : ((float_Array_0[0] / 3.4)))) >= float_Array_0[0]) ? (unsigned_short_int_Array_0[1] == ((unsigned short int) (((((unsigned_short_int_Array_0[0] - (22925 - signed_char_Array_0[2]))) < (unsigned_char_Array_0[0])) ? ((unsigned_short_int_Array_0[0] - (22925 - signed_char_Array_0[2]))) : (unsigned_char_Array_0[0]))))) : 1) VAL [BOOL_unsigned_char_Array_0={4:0}, float_Array_0={5:0}, isInitial=1, signed_char_Array_0={6:0}, unsigned_char_Array_0={7:0}, unsigned_short_int_Array_0={8:0}] [L89] EXPR (((BOOL_unsigned_char_Array_0[0][0] || (64.75f < float_Array_0[0])) ? (BOOL_unsigned_char_Array_0[0][0] ? (signed_char_Array_0[4] == ((signed char) (signed_char_Array_0[3] - signed_char_Array_0[2]))) : (signed_char_Array_0[4] == ((signed char) ((((((((signed_char_Array_0[3]) > (signed_char_Array_0[2])) ? (signed_char_Array_0[3]) : (signed_char_Array_0[2])))) < (signed_char_Array_0[1])) ? (((((signed_char_Array_0[3]) > (signed_char_Array_0[2])) ? (signed_char_Array_0[3]) : (signed_char_Array_0[2])))) : (signed_char_Array_0[1])))))) : (signed_char_Array_0[4] == ((signed char) signed_char_Array_0[3]))) && (((((((float_Array_0[0] * 127.75)) > ((float_Array_0[0] / 3.4))) ? ((float_Array_0[0] * 127.75)) : ((float_Array_0[0] / 3.4)))) >= float_Array_0[0]) ? (unsigned_short_int_Array_0[1] == ((unsigned short int) (((((unsigned_short_int_Array_0[0] - (22925 - signed_char_Array_0[2]))) < (unsigned_char_Array_0[0])) ? ((unsigned_short_int_Array_0[0] - (22925 - signed_char_Array_0[2]))) : (unsigned_char_Array_0[0]))))) : 1)) && ((! BOOL_unsigned_char_Array_0[1][1]) ? (BOOL_unsigned_char_Array_0[0][0] == ((unsigned char) BOOL_unsigned_char_Array_0[1][0])) : (BOOL_unsigned_char_Array_0[0][0] == ((unsigned char) ((! BOOL_unsigned_char_Array_0[0][1]) || (! (! 0)))))) VAL [BOOL_unsigned_char_Array_0={4:0}, float_Array_0={5:0}, isInitial=1, signed_char_Array_0={6:0}, unsigned_char_Array_0={7:0}, unsigned_short_int_Array_0={8:0}] [L89] EXPR (((BOOL_unsigned_char_Array_0[0][0] || (64.75f < float_Array_0[0])) ? (BOOL_unsigned_char_Array_0[0][0] ? (signed_char_Array_0[4] == ((signed char) (signed_char_Array_0[3] - signed_char_Array_0[2]))) : (signed_char_Array_0[4] == ((signed char) ((((((((signed_char_Array_0[3]) > (signed_char_Array_0[2])) ? (signed_char_Array_0[3]) : (signed_char_Array_0[2])))) < (signed_char_Array_0[1])) ? (((((signed_char_Array_0[3]) > (signed_char_Array_0[2])) ? (signed_char_Array_0[3]) : (signed_char_Array_0[2])))) : (signed_char_Array_0[1])))))) : (signed_char_Array_0[4] == ((signed char) signed_char_Array_0[3]))) && (((((((float_Array_0[0] * 127.75)) > ((float_Array_0[0] / 3.4))) ? ((float_Array_0[0] * 127.75)) : ((float_Array_0[0] / 3.4)))) >= float_Array_0[0]) ? (unsigned_short_int_Array_0[1] == ((unsigned short int) (((((unsigned_short_int_Array_0[0] - (22925 - signed_char_Array_0[2]))) < (unsigned_char_Array_0[0])) ? ((unsigned_short_int_Array_0[0] - (22925 - signed_char_Array_0[2]))) : (unsigned_char_Array_0[0]))))) : 1)) && ((! BOOL_unsigned_char_Array_0[1][1]) ? (BOOL_unsigned_char_Array_0[0][0] == ((unsigned char) BOOL_unsigned_char_Array_0[1][0])) : (BOOL_unsigned_char_Array_0[0][0] == ((unsigned char) ((! BOOL_unsigned_char_Array_0[0][1]) || (! (! 0)))))) VAL [BOOL_unsigned_char_Array_0={4:0}, float_Array_0={5:0}, isInitial=1, signed_char_Array_0={6:0}, unsigned_char_Array_0={7:0}, unsigned_short_int_Array_0={8:0}] [L89] EXPR ((((BOOL_unsigned_char_Array_0[0][0] || (64.75f < float_Array_0[0])) ? (BOOL_unsigned_char_Array_0[0][0] ? (signed_char_Array_0[4] == ((signed char) (signed_char_Array_0[3] - signed_char_Array_0[2]))) : (signed_char_Array_0[4] == ((signed char) ((((((((signed_char_Array_0[3]) > (signed_char_Array_0[2])) ? (signed_char_Array_0[3]) : (signed_char_Array_0[2])))) < (signed_char_Array_0[1])) ? (((((signed_char_Array_0[3]) > (signed_char_Array_0[2])) ? (signed_char_Array_0[3]) : (signed_char_Array_0[2])))) : (signed_char_Array_0[1])))))) : (signed_char_Array_0[4] == ((signed char) signed_char_Array_0[3]))) && (((((((float_Array_0[0] * 127.75)) > ((float_Array_0[0] / 3.4))) ? ((float_Array_0[0] * 127.75)) : ((float_Array_0[0] / 3.4)))) >= float_Array_0[0]) ? (unsigned_short_int_Array_0[1] == ((unsigned short int) (((((unsigned_short_int_Array_0[0] - (22925 - signed_char_Array_0[2]))) < (unsigned_char_Array_0[0])) ? ((unsigned_short_int_Array_0[0] - (22925 - signed_char_Array_0[2]))) : (unsigned_char_Array_0[0]))))) : 1)) && ((! BOOL_unsigned_char_Array_0[1][1]) ? (BOOL_unsigned_char_Array_0[0][0] == ((unsigned char) BOOL_unsigned_char_Array_0[1][0])) : (BOOL_unsigned_char_Array_0[0][0] == ((unsigned char) ((! BOOL_unsigned_char_Array_0[0][1]) || (! (! 0))))))) && (unsigned_char_Array_0[0] == ((unsigned char) signed_char_Array_0[2])) VAL [BOOL_unsigned_char_Array_0={4:0}, float_Array_0={5:0}, isInitial=1, signed_char_Array_0={6:0}, unsigned_char_Array_0={7:0}, unsigned_short_int_Array_0={8:0}] [L89] EXPR ((((BOOL_unsigned_char_Array_0[0][0] || (64.75f < float_Array_0[0])) ? (BOOL_unsigned_char_Array_0[0][0] ? (signed_char_Array_0[4] == ((signed char) (signed_char_Array_0[3] - signed_char_Array_0[2]))) : (signed_char_Array_0[4] == ((signed char) ((((((((signed_char_Array_0[3]) > (signed_char_Array_0[2])) ? (signed_char_Array_0[3]) : (signed_char_Array_0[2])))) < (signed_char_Array_0[1])) ? (((((signed_char_Array_0[3]) > (signed_char_Array_0[2])) ? (signed_char_Array_0[3]) : (signed_char_Array_0[2])))) : (signed_char_Array_0[1])))))) : (signed_char_Array_0[4] == ((signed char) signed_char_Array_0[3]))) && (((((((float_Array_0[0] * 127.75)) > ((float_Array_0[0] / 3.4))) ? ((float_Array_0[0] * 127.75)) : ((float_Array_0[0] / 3.4)))) >= float_Array_0[0]) ? (unsigned_short_int_Array_0[1] == ((unsigned short int) (((((unsigned_short_int_Array_0[0] - (22925 - signed_char_Array_0[2]))) < (unsigned_char_Array_0[0])) ? ((unsigned_short_int_Array_0[0] - (22925 - signed_char_Array_0[2]))) : (unsigned_char_Array_0[0]))))) : 1)) && ((! BOOL_unsigned_char_Array_0[1][1]) ? (BOOL_unsigned_char_Array_0[0][0] == ((unsigned char) BOOL_unsigned_char_Array_0[1][0])) : (BOOL_unsigned_char_Array_0[0][0] == ((unsigned char) ((! BOOL_unsigned_char_Array_0[0][1]) || (! (! 0))))))) && (unsigned_char_Array_0[0] == ((unsigned char) signed_char_Array_0[2])) VAL [BOOL_unsigned_char_Array_0={4:0}, float_Array_0={5:0}, isInitial=1, signed_char_Array_0={6:0}, unsigned_char_Array_0={7:0}, unsigned_short_int_Array_0={8:0}] [L89] EXPR (((((BOOL_unsigned_char_Array_0[0][0] || (64.75f < float_Array_0[0])) ? (BOOL_unsigned_char_Array_0[0][0] ? (signed_char_Array_0[4] == ((signed char) (signed_char_Array_0[3] - signed_char_Array_0[2]))) : (signed_char_Array_0[4] == ((signed char) ((((((((signed_char_Array_0[3]) > (signed_char_Array_0[2])) ? (signed_char_Array_0[3]) : (signed_char_Array_0[2])))) < (signed_char_Array_0[1])) ? (((((signed_char_Array_0[3]) > (signed_char_Array_0[2])) ? (signed_char_Array_0[3]) : (signed_char_Array_0[2])))) : (signed_char_Array_0[1])))))) : (signed_char_Array_0[4] == ((signed char) signed_char_Array_0[3]))) && (((((((float_Array_0[0] * 127.75)) > ((float_Array_0[0] / 3.4))) ? ((float_Array_0[0] * 127.75)) : ((float_Array_0[0] / 3.4)))) >= float_Array_0[0]) ? (unsigned_short_int_Array_0[1] == ((unsigned short int) (((((unsigned_short_int_Array_0[0] - (22925 - signed_char_Array_0[2]))) < (unsigned_char_Array_0[0])) ? ((unsigned_short_int_Array_0[0] - (22925 - signed_char_Array_0[2]))) : (unsigned_char_Array_0[0]))))) : 1)) && ((! BOOL_unsigned_char_Array_0[1][1]) ? (BOOL_unsigned_char_Array_0[0][0] == ((unsigned char) BOOL_unsigned_char_Array_0[1][0])) : (BOOL_unsigned_char_Array_0[0][0] == ((unsigned char) ((! BOOL_unsigned_char_Array_0[0][1]) || (! (! 0))))))) && (unsigned_char_Array_0[0] == ((unsigned char) signed_char_Array_0[2]))) && (float_Array_0[0] == ((float) float_Array_0[1])) VAL [BOOL_unsigned_char_Array_0={4:0}, float_Array_0={5:0}, isInitial=1, signed_char_Array_0={6:0}, unsigned_char_Array_0={7:0}, unsigned_short_int_Array_0={8:0}] [L89] EXPR (((((BOOL_unsigned_char_Array_0[0][0] || (64.75f < float_Array_0[0])) ? (BOOL_unsigned_char_Array_0[0][0] ? (signed_char_Array_0[4] == ((signed char) (signed_char_Array_0[3] - signed_char_Array_0[2]))) : (signed_char_Array_0[4] == ((signed char) ((((((((signed_char_Array_0[3]) > (signed_char_Array_0[2])) ? (signed_char_Array_0[3]) : (signed_char_Array_0[2])))) < (signed_char_Array_0[1])) ? (((((signed_char_Array_0[3]) > (signed_char_Array_0[2])) ? (signed_char_Array_0[3]) : (signed_char_Array_0[2])))) : (signed_char_Array_0[1])))))) : (signed_char_Array_0[4] == ((signed char) signed_char_Array_0[3]))) && (((((((float_Array_0[0] * 127.75)) > ((float_Array_0[0] / 3.4))) ? ((float_Array_0[0] * 127.75)) : ((float_Array_0[0] / 3.4)))) >= float_Array_0[0]) ? (unsigned_short_int_Array_0[1] == ((unsigned short int) (((((unsigned_short_int_Array_0[0] - (22925 - signed_char_Array_0[2]))) < (unsigned_char_Array_0[0])) ? ((unsigned_short_int_Array_0[0] - (22925 - signed_char_Array_0[2]))) : (unsigned_char_Array_0[0]))))) : 1)) && ((! BOOL_unsigned_char_Array_0[1][1]) ? (BOOL_unsigned_char_Array_0[0][0] == ((unsigned char) BOOL_unsigned_char_Array_0[1][0])) : (BOOL_unsigned_char_Array_0[0][0] == ((unsigned char) ((! BOOL_unsigned_char_Array_0[0][1]) || (! (! 0))))))) && (unsigned_char_Array_0[0] == ((unsigned char) signed_char_Array_0[2]))) && (float_Array_0[0] == ((float) float_Array_0[1])) VAL [BOOL_unsigned_char_Array_0={4:0}, float_Array_0={5:0}, isInitial=1, signed_char_Array_0={6:0}, unsigned_char_Array_0={7:0}, unsigned_short_int_Array_0={8:0}] [L89] EXPR ((((((BOOL_unsigned_char_Array_0[0][0] || (64.75f < float_Array_0[0])) ? (BOOL_unsigned_char_Array_0[0][0] ? (signed_char_Array_0[4] == ((signed char) (signed_char_Array_0[3] - signed_char_Array_0[2]))) : (signed_char_Array_0[4] == ((signed char) ((((((((signed_char_Array_0[3]) > (signed_char_Array_0[2])) ? (signed_char_Array_0[3]) : (signed_char_Array_0[2])))) < (signed_char_Array_0[1])) ? (((((signed_char_Array_0[3]) > (signed_char_Array_0[2])) ? (signed_char_Array_0[3]) : (signed_char_Array_0[2])))) : (signed_char_Array_0[1])))))) : (signed_char_Array_0[4] == ((signed char) signed_char_Array_0[3]))) && (((((((float_Array_0[0] * 127.75)) > ((float_Array_0[0] / 3.4))) ? ((float_Array_0[0] * 127.75)) : ((float_Array_0[0] / 3.4)))) >= float_Array_0[0]) ? (unsigned_short_int_Array_0[1] == ((unsigned short int) (((((unsigned_short_int_Array_0[0] - (22925 - signed_char_Array_0[2]))) < (unsigned_char_Array_0[0])) ? ((unsigned_short_int_Array_0[0] - (22925 - signed_char_Array_0[2]))) : (unsigned_char_Array_0[0]))))) : 1)) && ((! BOOL_unsigned_char_Array_0[1][1]) ? (BOOL_unsigned_char_Array_0[0][0] == ((unsigned char) BOOL_unsigned_char_Array_0[1][0])) : (BOOL_unsigned_char_Array_0[0][0] == ((unsigned char) ((! BOOL_unsigned_char_Array_0[0][1]) || (! (! 0))))))) && (unsigned_char_Array_0[0] == ((unsigned char) signed_char_Array_0[2]))) && (float_Array_0[0] == ((float) float_Array_0[1]))) && (signed_char_Array_0[0] == ((signed char) signed_char_Array_0[3])) VAL [BOOL_unsigned_char_Array_0={4:0}, float_Array_0={5:0}, isInitial=1, signed_char_Array_0={6:0}, unsigned_char_Array_0={7:0}, unsigned_short_int_Array_0={8:0}] [L89] EXPR ((((((BOOL_unsigned_char_Array_0[0][0] || (64.75f < float_Array_0[0])) ? (BOOL_unsigned_char_Array_0[0][0] ? (signed_char_Array_0[4] == ((signed char) (signed_char_Array_0[3] - signed_char_Array_0[2]))) : (signed_char_Array_0[4] == ((signed char) ((((((((signed_char_Array_0[3]) > (signed_char_Array_0[2])) ? (signed_char_Array_0[3]) : (signed_char_Array_0[2])))) < (signed_char_Array_0[1])) ? (((((signed_char_Array_0[3]) > (signed_char_Array_0[2])) ? (signed_char_Array_0[3]) : (signed_char_Array_0[2])))) : (signed_char_Array_0[1])))))) : (signed_char_Array_0[4] == ((signed char) signed_char_Array_0[3]))) && (((((((float_Array_0[0] * 127.75)) > ((float_Array_0[0] / 3.4))) ? ((float_Array_0[0] * 127.75)) : ((float_Array_0[0] / 3.4)))) >= float_Array_0[0]) ? (unsigned_short_int_Array_0[1] == ((unsigned short int) (((((unsigned_short_int_Array_0[0] - (22925 - signed_char_Array_0[2]))) < (unsigned_char_Array_0[0])) ? ((unsigned_short_int_Array_0[0] - (22925 - signed_char_Array_0[2]))) : (unsigned_char_Array_0[0]))))) : 1)) && ((! BOOL_unsigned_char_Array_0[1][1]) ? (BOOL_unsigned_char_Array_0[0][0] == ((unsigned char) BOOL_unsigned_char_Array_0[1][0])) : (BOOL_unsigned_char_Array_0[0][0] == ((unsigned char) ((! BOOL_unsigned_char_Array_0[0][1]) || (! (! 0))))))) && (unsigned_char_Array_0[0] == ((unsigned char) signed_char_Array_0[2]))) && (float_Array_0[0] == ((float) float_Array_0[1]))) && (signed_char_Array_0[0] == ((signed char) signed_char_Array_0[3])) VAL [BOOL_unsigned_char_Array_0={4:0}, float_Array_0={5:0}, isInitial=1, signed_char_Array_0={6:0}, unsigned_char_Array_0={7:0}, unsigned_short_int_Array_0={8:0}] [L89-L90] return ((((((BOOL_unsigned_char_Array_0[0][0] || (64.75f < float_Array_0[0])) ? (BOOL_unsigned_char_Array_0[0][0] ? (signed_char_Array_0[4] == ((signed char) (signed_char_Array_0[3] - signed_char_Array_0[2]))) : (signed_char_Array_0[4] == ((signed char) ((((((((signed_char_Array_0[3]) > (signed_char_Array_0[2])) ? (signed_char_Array_0[3]) : (signed_char_Array_0[2])))) < (signed_char_Array_0[1])) ? (((((signed_char_Array_0[3]) > (signed_char_Array_0[2])) ? (signed_char_Array_0[3]) : (signed_char_Array_0[2])))) : (signed_char_Array_0[1])))))) : (signed_char_Array_0[4] == ((signed char) signed_char_Array_0[3]))) && (((((((float_Array_0[0] * 127.75)) > ((float_Array_0[0] / 3.4))) ? ((float_Array_0[0] * 127.75)) : ((float_Array_0[0] / 3.4)))) >= float_Array_0[0]) ? (unsigned_short_int_Array_0[1] == ((unsigned short int) (((((unsigned_short_int_Array_0[0] - (22925 - signed_char_Array_0[2]))) < (unsigned_char_Array_0[0])) ? ((unsigned_short_int_Array_0[0] - (22925 - signed_char_Array_0[2]))) : (unsigned_char_Array_0[0]))))) : 1)) && ((! BOOL_unsigned_char_Array_0[1][1]) ? (BOOL_unsigned_char_Array_0[0][0] == ((unsigned char) BOOL_unsigned_char_Array_0[1][0])) : (BOOL_unsigned_char_Array_0[0][0] == ((unsigned char) ((! BOOL_unsigned_char_Array_0[0][1]) || (! (! 0))))))) && (unsigned_char_Array_0[0] == ((unsigned char) signed_char_Array_0[2]))) && (float_Array_0[0] == ((float) float_Array_0[1]))) && (signed_char_Array_0[0] == ((signed char) signed_char_Array_0[3])) ; [L99] RET, EXPR property() [L99] CALL __VERIFIER_assert(property()) [L19] COND TRUE !(cond) VAL [BOOL_unsigned_char_Array_0={4:0}, float_Array_0={5:0}, isInitial=1, signed_char_Array_0={6:0}, unsigned_char_Array_0={7:0}, unsigned_short_int_Array_0={8:0}] [L19] reach_error() VAL [BOOL_unsigned_char_Array_0={4:0}, float_Array_0={5:0}, isInitial=1, signed_char_Array_0={6:0}, unsigned_char_Array_0={7:0}, unsigned_short_int_Array_0={8:0}] - StatisticsResult: Ultimate Automizer benchmark data CFG has 2 procedures, 94 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 14.0s, OverallIterations: 19, TraceHistogramMax: 15, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 3.5s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 2639 SdHoareTripleChecker+Valid, 2.4s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 2617 mSDsluCounter, 9519 SdHoareTripleChecker+Invalid, 2.0s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 6879 mSDsCounter, 334 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 2006 IncrementalHoareTripleChecker+Invalid, 2340 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 334 mSolverCounterUnsat, 2640 mSDtfsCounter, 2006 mSolverCounterSat, 0.1s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 950 GetRequests, 848 SyntacticMatches, 4 SemanticMatches, 98 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 144 ImplicationChecksByTransitivity, 0.8s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=290occurred in iteration=18, InterpolantAutomatonStates: 117, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.3s AutomataMinimizationTime, 18 MinimizatonAttempts, 1546 StatesRemovedByMinimization, 14 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.2s SsaConstructionTime, 0.8s SatisfiabilityAnalysisTime, 8.1s InterpolantComputationTime, 2410 NumberOfCodeBlocks, 2410 NumberOfCodeBlocksAsserted, 20 NumberOfCheckSat, 2388 ConstructedInterpolants, 0 QuantifiedInterpolants, 7802 SizeOfPredicates, 1 NumberOfNonLiveVariables, 427 ConjunctsInSsa, 23 ConjunctsInUnsatCore, 20 InterpolantComputations, 17 PerfectInterpolantSequences, 8292/8400 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available RESULT: Ultimate could not prove your program: unable to determine feasibility of some traces [2024-10-11 13:15:06,115 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Forceful destruction successful, exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Using bit-precise analysis Retrying with bit-precise analysis ### Bit-precise run ### Calling Ultimate with: /root/.sdkman/candidates/java/current/bin/java -Dosgi.configuration.area=/storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-a_file-24.i -s /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Bitvector.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate-clean/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 1dbf57bc124875744eb5a4186252476f73fa3f14ae019c9a9da37b4d1a62cbf1 --- Real Ultimate output --- This is Ultimate 0.2.5-dev-84cfde4 [2024-10-11 13:15:08,346 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-10-11 13:15:08,445 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Bitvector.epf [2024-10-11 13:15:08,451 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-10-11 13:15:08,452 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-10-11 13:15:08,484 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-10-11 13:15:08,485 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-10-11 13:15:08,485 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-10-11 13:15:08,486 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-10-11 13:15:08,487 INFO L153 SettingsManager]: * Use memory slicer=true [2024-10-11 13:15:08,487 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-10-11 13:15:08,488 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-10-11 13:15:08,488 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-10-11 13:15:08,489 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-10-11 13:15:08,490 INFO L153 SettingsManager]: * Use SBE=true [2024-10-11 13:15:08,491 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-10-11 13:15:08,491 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-10-11 13:15:08,491 INFO L153 SettingsManager]: * sizeof long=4 [2024-10-11 13:15:08,492 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-10-11 13:15:08,492 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-10-11 13:15:08,492 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-10-11 13:15:08,496 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-10-11 13:15:08,497 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-10-11 13:15:08,497 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2024-10-11 13:15:08,497 INFO L153 SettingsManager]: * Use bitvectors instead of ints=true [2024-10-11 13:15:08,497 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-10-11 13:15:08,497 INFO L153 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2024-10-11 13:15:08,497 INFO L153 SettingsManager]: * sizeof long double=12 [2024-10-11 13:15:08,498 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-10-11 13:15:08,498 INFO L153 SettingsManager]: * Use constant arrays=true [2024-10-11 13:15:08,498 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-10-11 13:15:08,498 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-10-11 13:15:08,498 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-10-11 13:15:08,499 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-10-11 13:15:08,499 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-11 13:15:08,499 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-10-11 13:15:08,501 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-10-11 13:15:08,501 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-10-11 13:15:08,502 INFO L153 SettingsManager]: * Trace refinement strategy=WOLF [2024-10-11 13:15:08,502 INFO L153 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2024-10-11 13:15:08,502 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-10-11 13:15:08,503 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-10-11 13:15:08,503 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-10-11 13:15:08,503 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-10-11 13:15:08,504 INFO L153 SettingsManager]: * Logic for external solver=AUFBV [2024-10-11 13:15:08,504 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-clean/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-clean/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 -> 1dbf57bc124875744eb5a4186252476f73fa3f14ae019c9a9da37b4d1a62cbf1 [2024-10-11 13:15:08,864 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-10-11 13:15:08,893 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-10-11 13:15:08,897 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-10-11 13:15:08,898 INFO L270 PluginConnector]: Initializing CDTParser... [2024-10-11 13:15:08,899 INFO L274 PluginConnector]: CDTParser initialized [2024-10-11 13:15:08,901 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-a_file-24.i [2024-10-11 13:15:10,505 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-10-11 13:15:10,709 INFO L384 CDTParser]: Found 1 translation units. [2024-10-11 13:15:10,709 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-a_file-24.i [2024-10-11 13:15:10,718 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/data/1cd259d36/28d67fb326324ca3aba1749fefa5c2d3/FLAGd77ca4530 [2024-10-11 13:15:11,071 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/data/1cd259d36/28d67fb326324ca3aba1749fefa5c2d3 [2024-10-11 13:15:11,073 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-10-11 13:15:11,074 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-10-11 13:15:11,075 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-10-11 13:15:11,075 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-10-11 13:15:11,082 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-10-11 13:15:11,082 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 11.10 01:15:11" (1/1) ... [2024-10-11 13:15:11,083 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@62f67687 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 01:15:11, skipping insertion in model container [2024-10-11 13:15:11,083 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 11.10 01:15:11" (1/1) ... [2024-10-11 13:15:11,113 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-10-11 13:15:11,312 WARN L248 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-a_file-24.i[916,929] [2024-10-11 13:15:11,395 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-11 13:15:11,419 INFO L200 MainTranslator]: Completed pre-run [2024-10-11 13:15:11,430 WARN L248 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-a_file-24.i[916,929] [2024-10-11 13:15:11,470 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-11 13:15:11,492 INFO L204 MainTranslator]: Completed translation [2024-10-11 13:15:11,493 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 01:15:11 WrapperNode [2024-10-11 13:15:11,493 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-10-11 13:15:11,494 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-10-11 13:15:11,494 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-10-11 13:15:11,494 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-10-11 13:15:11,501 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 01:15:11" (1/1) ... [2024-10-11 13:15:11,530 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 01:15:11" (1/1) ... [2024-10-11 13:15:11,569 INFO L138 Inliner]: procedures = 33, calls = 157, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 460 [2024-10-11 13:15:11,570 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-10-11 13:15:11,571 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-10-11 13:15:11,571 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-10-11 13:15:11,571 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-10-11 13:15:11,581 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 01:15:11" (1/1) ... [2024-10-11 13:15:11,581 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 01:15:11" (1/1) ... [2024-10-11 13:15:11,587 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 01:15:11" (1/1) ... [2024-10-11 13:15:11,609 INFO L175 MemorySlicer]: Split 126 memory accesses to 6 slices as follows [2, 27, 23, 56, 7, 11]. 44 percent of accesses are in the largest equivalence class. The 16 initializations are split as follows [2, 4, 2, 5, 1, 2]. The 17 writes are split as follows [0, 5, 2, 7, 1, 2]. [2024-10-11 13:15:11,610 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 01:15:11" (1/1) ... [2024-10-11 13:15:11,610 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 01:15:11" (1/1) ... [2024-10-11 13:15:11,643 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 01:15:11" (1/1) ... [2024-10-11 13:15:11,651 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 01:15:11" (1/1) ... [2024-10-11 13:15:11,679 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 01:15:11" (1/1) ... [2024-10-11 13:15:11,686 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 01:15:11" (1/1) ... [2024-10-11 13:15:11,702 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-10-11 13:15:11,706 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-10-11 13:15:11,706 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-10-11 13:15:11,706 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-10-11 13:15:11,707 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 01:15:11" (1/1) ... [2024-10-11 13:15:11,713 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-11 13:15:11,726 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-11 13:15:11,739 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2024-10-11 13:15:11,745 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2024-10-11 13:15:11,784 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-10-11 13:15:11,784 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE1#0 [2024-10-11 13:15:11,784 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE1#1 [2024-10-11 13:15:11,785 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE1#2 [2024-10-11 13:15:11,785 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE1#3 [2024-10-11 13:15:11,785 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE1#4 [2024-10-11 13:15:11,785 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE1#5 [2024-10-11 13:15:11,785 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE2#0 [2024-10-11 13:15:11,785 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE2#1 [2024-10-11 13:15:11,785 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE2#2 [2024-10-11 13:15:11,785 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE2#3 [2024-10-11 13:15:11,785 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE2#4 [2024-10-11 13:15:11,786 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE2#5 [2024-10-11 13:15:11,786 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#0 [2024-10-11 13:15:11,786 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#1 [2024-10-11 13:15:11,786 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#2 [2024-10-11 13:15:11,786 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#3 [2024-10-11 13:15:11,786 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#4 [2024-10-11 13:15:11,786 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#5 [2024-10-11 13:15:11,786 INFO L130 BoogieDeclarations]: Found specification of procedure read~intFLOATTYPE4#0 [2024-10-11 13:15:11,786 INFO L130 BoogieDeclarations]: Found specification of procedure read~intFLOATTYPE4#1 [2024-10-11 13:15:11,787 INFO L130 BoogieDeclarations]: Found specification of procedure read~intFLOATTYPE4#2 [2024-10-11 13:15:11,787 INFO L130 BoogieDeclarations]: Found specification of procedure read~intFLOATTYPE4#3 [2024-10-11 13:15:11,787 INFO L130 BoogieDeclarations]: Found specification of procedure read~intFLOATTYPE4#4 [2024-10-11 13:15:11,787 INFO L130 BoogieDeclarations]: Found specification of procedure read~intFLOATTYPE4#5 [2024-10-11 13:15:11,787 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE2#0 [2024-10-11 13:15:11,787 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE2#1 [2024-10-11 13:15:11,787 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE2#2 [2024-10-11 13:15:11,787 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE2#3 [2024-10-11 13:15:11,787 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE2#4 [2024-10-11 13:15:11,787 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE2#5 [2024-10-11 13:15:11,788 INFO L130 BoogieDeclarations]: Found specification of procedure write~intFLOATTYPE4#0 [2024-10-11 13:15:11,788 INFO L130 BoogieDeclarations]: Found specification of procedure write~intFLOATTYPE4#1 [2024-10-11 13:15:11,788 INFO L130 BoogieDeclarations]: Found specification of procedure write~intFLOATTYPE4#2 [2024-10-11 13:15:11,788 INFO L130 BoogieDeclarations]: Found specification of procedure write~intFLOATTYPE4#3 [2024-10-11 13:15:11,788 INFO L130 BoogieDeclarations]: Found specification of procedure write~intFLOATTYPE4#4 [2024-10-11 13:15:11,788 INFO L130 BoogieDeclarations]: Found specification of procedure write~intFLOATTYPE4#5 [2024-10-11 13:15:11,788 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intFLOATTYPE4#0 [2024-10-11 13:15:11,788 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intFLOATTYPE4#1 [2024-10-11 13:15:11,788 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intFLOATTYPE4#2 [2024-10-11 13:15:11,789 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intFLOATTYPE4#3 [2024-10-11 13:15:11,789 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intFLOATTYPE4#4 [2024-10-11 13:15:11,789 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intFLOATTYPE4#5 [2024-10-11 13:15:11,789 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2024-10-11 13:15:11,789 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2024-10-11 13:15:11,789 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-10-11 13:15:11,789 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-10-11 13:15:11,789 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE1#0 [2024-10-11 13:15:11,790 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE1#1 [2024-10-11 13:15:11,790 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE1#2 [2024-10-11 13:15:11,790 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE1#3 [2024-10-11 13:15:11,790 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE1#4 [2024-10-11 13:15:11,790 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE1#5 [2024-10-11 13:15:11,790 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE2#0 [2024-10-11 13:15:11,790 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE2#1 [2024-10-11 13:15:11,790 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE2#2 [2024-10-11 13:15:11,790 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE2#3 [2024-10-11 13:15:11,791 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE2#4 [2024-10-11 13:15:11,791 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE2#5 [2024-10-11 13:15:11,947 INFO L238 CfgBuilder]: Building ICFG [2024-10-11 13:15:11,949 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-10-11 13:15:30,765 INFO L? ?]: Removed 124 outVars from TransFormulas that were not future-live. [2024-10-11 13:15:30,765 INFO L287 CfgBuilder]: Performing block encoding [2024-10-11 13:15:30,819 INFO L309 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-10-11 13:15:30,820 INFO L314 CfgBuilder]: Removed 1 assume(true) statements. [2024-10-11 13:15:30,821 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 11.10 01:15:30 BoogieIcfgContainer [2024-10-11 13:15:30,821 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-10-11 13:15:30,825 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-10-11 13:15:30,825 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-10-11 13:15:30,828 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-10-11 13:15:30,829 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 11.10 01:15:11" (1/3) ... [2024-10-11 13:15:30,830 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@e1a692b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 11.10 01:15:30, skipping insertion in model container [2024-10-11 13:15:30,830 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 01:15:11" (2/3) ... [2024-10-11 13:15:30,830 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@e1a692b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 11.10 01:15:30, skipping insertion in model container [2024-10-11 13:15:30,831 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 11.10 01:15:30" (3/3) ... [2024-10-11 13:15:30,832 INFO L112 eAbstractionObserver]: Analyzing ICFG hardness_variablewrapping_wrapper-a_file-24.i [2024-10-11 13:15:30,848 INFO L209 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-10-11 13:15:30,848 INFO L149 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-10-11 13:15:30,908 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-10-11 13:15:30,915 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;@7dd146c2, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-10-11 13:15:30,915 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-10-11 13:15:30,919 INFO L276 IsEmpty]: Start isEmpty. Operand has 94 states, 76 states have (on average 1.4342105263157894) internal successors, (109), 77 states have internal predecessors, (109), 15 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 15 states have call predecessors, (15), 15 states have call successors, (15) [2024-10-11 13:15:30,928 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 120 [2024-10-11 13:15:30,928 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 13:15:30,929 INFO L215 NwaCegarLoop]: trace histogram [15, 15, 15, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 13:15:30,930 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 13:15:30,934 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 13:15:30,934 INFO L85 PathProgramCache]: Analyzing trace with hash -339587267, now seen corresponding path program 1 times [2024-10-11 13:15:30,955 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-11 13:15:30,955 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [327428641] [2024-10-11 13:15:30,955 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 13:15:30,956 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-10-11 13:15:30,956 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-11 13:15:30,959 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-10-11 13:15:30,975 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (2)] Waiting until timeout for monitored process [2024-10-11 13:15:31,966 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:15:31,998 INFO L255 TraceCheckSpWp]: Trace formula consists of 257 conjuncts, 1 conjuncts are in the unsatisfiable core [2024-10-11 13:15:32,006 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-11 13:15:32,050 INFO L134 CoverageAnalysis]: Checked inductivity of 420 backedges. 220 proven. 0 refuted. 0 times theorem prover too weak. 200 trivial. 0 not checked. [2024-10-11 13:15:32,050 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-11 13:15:32,051 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-11 13:15:32,051 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [327428641] [2024-10-11 13:15:32,052 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [327428641] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 13:15:32,052 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 13:15:32,052 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-11 13:15:32,054 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1629889029] [2024-10-11 13:15:32,055 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 13:15:32,059 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-10-11 13:15:32,060 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-11 13:15:32,091 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-10-11 13:15:32,092 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-10-11 13:15:32,094 INFO L87 Difference]: Start difference. First operand has 94 states, 76 states have (on average 1.4342105263157894) internal successors, (109), 77 states have internal predecessors, (109), 15 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 15 states have call predecessors, (15), 15 states have call successors, (15) Second operand has 2 states, 2 states have (on average 25.5) internal successors, (51), 2 states have internal predecessors, (51), 2 states have call successors, (15), 2 states have call predecessors, (15), 2 states have return successors, (15), 2 states have call predecessors, (15), 2 states have call successors, (15) [2024-10-11 13:15:32,246 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 13:15:32,247 INFO L93 Difference]: Finished difference Result 185 states and 291 transitions. [2024-10-11 13:15:32,249 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-10-11 13:15:32,251 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 25.5) internal successors, (51), 2 states have internal predecessors, (51), 2 states have call successors, (15), 2 states have call predecessors, (15), 2 states have return successors, (15), 2 states have call predecessors, (15), 2 states have call successors, (15) Word has length 119 [2024-10-11 13:15:32,251 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 13:15:32,267 INFO L225 Difference]: With dead ends: 185 [2024-10-11 13:15:32,268 INFO L226 Difference]: Without dead ends: 92 [2024-10-11 13:15:32,272 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 118 GetRequests, 118 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-10-11 13:15:32,276 INFO L432 NwaCegarLoop]: 130 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 4 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 130 SdHoareTripleChecker+Invalid, 4 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 4 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-11 13:15:32,277 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 130 Invalid, 4 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 4 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-11 13:15:32,291 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 92 states. [2024-10-11 13:15:32,313 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 92 to 92. [2024-10-11 13:15:32,314 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 92 states, 75 states have (on average 1.3866666666666667) internal successors, (104), 75 states have internal predecessors, (104), 15 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 15 states have call predecessors, (15), 15 states have call successors, (15) [2024-10-11 13:15:32,319 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 92 states to 92 states and 134 transitions. [2024-10-11 13:15:32,323 INFO L78 Accepts]: Start accepts. Automaton has 92 states and 134 transitions. Word has length 119 [2024-10-11 13:15:32,323 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 13:15:32,323 INFO L471 AbstractCegarLoop]: Abstraction has 92 states and 134 transitions. [2024-10-11 13:15:32,324 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 25.5) internal successors, (51), 2 states have internal predecessors, (51), 2 states have call successors, (15), 2 states have call predecessors, (15), 2 states have return successors, (15), 2 states have call predecessors, (15), 2 states have call successors, (15) [2024-10-11 13:15:32,324 INFO L276 IsEmpty]: Start isEmpty. Operand 92 states and 134 transitions. [2024-10-11 13:15:32,326 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 120 [2024-10-11 13:15:32,326 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 13:15:32,326 INFO L215 NwaCegarLoop]: trace histogram [15, 15, 15, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 13:15:32,362 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (2)] Forceful destruction successful, exit code 0 [2024-10-11 13:15:32,527 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-10-11 13:15:32,528 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 13:15:32,528 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 13:15:32,528 INFO L85 PathProgramCache]: Analyzing trace with hash -393855625, now seen corresponding path program 1 times [2024-10-11 13:15:32,529 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-11 13:15:32,529 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1785509944] [2024-10-11 13:15:32,530 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 13:15:32,530 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-10-11 13:15:32,530 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-11 13:15:32,532 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-10-11 13:15:32,534 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (3)] Waiting until timeout for monitored process [2024-10-11 13:15:33,570 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:15:33,601 INFO L255 TraceCheckSpWp]: Trace formula consists of 257 conjuncts, 2 conjuncts are in the unsatisfiable core [2024-10-11 13:15:33,606 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-11 13:15:33,793 INFO L134 CoverageAnalysis]: Checked inductivity of 420 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 420 trivial. 0 not checked. [2024-10-11 13:15:33,797 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-11 13:15:33,798 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-11 13:15:33,798 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1785509944] [2024-10-11 13:15:33,798 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1785509944] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 13:15:33,798 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 13:15:33,800 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-11 13:15:33,801 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [180721491] [2024-10-11 13:15:33,801 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 13:15:33,802 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-11 13:15:33,802 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-11 13:15:33,803 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-11 13:15:33,803 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-11 13:15:33,806 INFO L87 Difference]: Start difference. First operand 92 states and 134 transitions. Second operand has 3 states, 3 states have (on average 15.666666666666666) internal successors, (47), 3 states have internal predecessors, (47), 1 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 1 states have call successors, (15) [2024-10-11 13:15:34,188 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 13:15:34,191 INFO L93 Difference]: Finished difference Result 184 states and 269 transitions. [2024-10-11 13:15:34,192 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-11 13:15:34,192 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 15.666666666666666) internal successors, (47), 3 states have internal predecessors, (47), 1 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 1 states have call successors, (15) Word has length 119 [2024-10-11 13:15:34,193 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 13:15:34,194 INFO L225 Difference]: With dead ends: 184 [2024-10-11 13:15:34,194 INFO L226 Difference]: Without dead ends: 93 [2024-10-11 13:15:34,195 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 118 GetRequests, 117 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-11 13:15:34,196 INFO L432 NwaCegarLoop]: 129 mSDtfsCounter, 0 mSDsluCounter, 124 mSDsCounter, 0 mSdLazyCounter, 14 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 253 SdHoareTripleChecker+Invalid, 14 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 14 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2024-10-11 13:15:34,197 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 253 Invalid, 14 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 14 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2024-10-11 13:15:34,197 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 93 states. [2024-10-11 13:15:34,215 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 93 to 93. [2024-10-11 13:15:34,215 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 93 states, 76 states have (on average 1.381578947368421) internal successors, (105), 76 states have internal predecessors, (105), 15 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 15 states have call predecessors, (15), 15 states have call successors, (15) [2024-10-11 13:15:34,217 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 93 states to 93 states and 135 transitions. [2024-10-11 13:15:34,219 INFO L78 Accepts]: Start accepts. Automaton has 93 states and 135 transitions. Word has length 119 [2024-10-11 13:15:34,222 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 13:15:34,222 INFO L471 AbstractCegarLoop]: Abstraction has 93 states and 135 transitions. [2024-10-11 13:15:34,222 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 15.666666666666666) internal successors, (47), 3 states have internal predecessors, (47), 1 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 1 states have call successors, (15) [2024-10-11 13:15:34,222 INFO L276 IsEmpty]: Start isEmpty. Operand 93 states and 135 transitions. [2024-10-11 13:15:34,225 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 120 [2024-10-11 13:15:34,225 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 13:15:34,225 INFO L215 NwaCegarLoop]: trace histogram [15, 15, 15, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 13:15:34,264 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (3)] Ended with exit code 0 [2024-10-11 13:15:34,426 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-10-11 13:15:34,427 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 13:15:34,427 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 13:15:34,428 INFO L85 PathProgramCache]: Analyzing trace with hash -175000907, now seen corresponding path program 1 times [2024-10-11 13:15:34,428 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-11 13:15:34,428 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1316123517] [2024-10-11 13:15:34,429 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 13:15:34,429 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-10-11 13:15:34,429 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-11 13:15:34,432 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-10-11 13:15:34,433 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (4)] Waiting until timeout for monitored process [2024-10-11 13:15:35,530 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:15:35,560 INFO L255 TraceCheckSpWp]: Trace formula consists of 259 conjuncts, 6 conjuncts are in the unsatisfiable core [2024-10-11 13:15:35,565 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-11 13:15:36,754 INFO L134 CoverageAnalysis]: Checked inductivity of 420 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 420 trivial. 0 not checked. [2024-10-11 13:15:36,754 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-11 13:15:36,754 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-11 13:15:36,755 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1316123517] [2024-10-11 13:15:36,755 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1316123517] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 13:15:36,755 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 13:15:36,755 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-10-11 13:15:36,755 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [906901628] [2024-10-11 13:15:36,756 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 13:15:36,756 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-10-11 13:15:36,757 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-11 13:15:36,757 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-10-11 13:15:36,758 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-10-11 13:15:36,758 INFO L87 Difference]: Start difference. First operand 93 states and 135 transitions. Second operand has 5 states, 5 states have (on average 9.4) internal successors, (47), 5 states have internal predecessors, (47), 1 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 1 states have call successors, (15) [2024-10-11 13:15:39,628 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 13:15:39,629 INFO L93 Difference]: Finished difference Result 273 states and 397 transitions. [2024-10-11 13:15:39,629 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-10-11 13:15:39,630 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 9.4) internal successors, (47), 5 states have internal predecessors, (47), 1 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 1 states have call successors, (15) Word has length 119 [2024-10-11 13:15:39,630 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 13:15:39,633 INFO L225 Difference]: With dead ends: 273 [2024-10-11 13:15:39,633 INFO L226 Difference]: Without dead ends: 181 [2024-10-11 13:15:39,634 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 119 GetRequests, 115 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2024-10-11 13:15:39,636 INFO L432 NwaCegarLoop]: 125 mSDtfsCounter, 120 mSDsluCounter, 329 mSDsCounter, 0 mSdLazyCounter, 113 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 120 SdHoareTripleChecker+Valid, 454 SdHoareTripleChecker+Invalid, 117 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 113 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.7s IncrementalHoareTripleChecker+Time [2024-10-11 13:15:39,637 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [120 Valid, 454 Invalid, 117 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 113 Invalid, 0 Unknown, 0 Unchecked, 2.7s Time] [2024-10-11 13:15:39,638 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 181 states. [2024-10-11 13:15:39,653 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 181 to 108. [2024-10-11 13:15:39,655 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 108 states, 91 states have (on average 1.3956043956043955) internal successors, (127), 91 states have internal predecessors, (127), 15 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 15 states have call predecessors, (15), 15 states have call successors, (15) [2024-10-11 13:15:39,657 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 108 states to 108 states and 157 transitions. [2024-10-11 13:15:39,658 INFO L78 Accepts]: Start accepts. Automaton has 108 states and 157 transitions. Word has length 119 [2024-10-11 13:15:39,659 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 13:15:39,659 INFO L471 AbstractCegarLoop]: Abstraction has 108 states and 157 transitions. [2024-10-11 13:15:39,659 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 9.4) internal successors, (47), 5 states have internal predecessors, (47), 1 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 1 states have call successors, (15) [2024-10-11 13:15:39,659 INFO L276 IsEmpty]: Start isEmpty. Operand 108 states and 157 transitions. [2024-10-11 13:15:39,661 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 120 [2024-10-11 13:15:39,661 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 13:15:39,662 INFO L215 NwaCegarLoop]: trace histogram [15, 15, 15, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 13:15:39,693 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (4)] Ended with exit code 0 [2024-10-11 13:15:39,862 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-10-11 13:15:39,863 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 13:15:39,863 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 13:15:39,864 INFO L85 PathProgramCache]: Analyzing trace with hash -1454864585, now seen corresponding path program 1 times [2024-10-11 13:15:39,864 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-11 13:15:39,864 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [844240846] [2024-10-11 13:15:39,865 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 13:15:39,865 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-10-11 13:15:39,865 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-11 13:15:39,868 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-10-11 13:15:39,869 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (5)] Waiting until timeout for monitored process [2024-10-11 13:15:40,903 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:15:40,942 INFO L255 TraceCheckSpWp]: Trace formula consists of 261 conjuncts, 4 conjuncts are in the unsatisfiable core [2024-10-11 13:15:40,946 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-11 13:15:41,609 INFO L134 CoverageAnalysis]: Checked inductivity of 420 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 420 trivial. 0 not checked. [2024-10-11 13:15:41,609 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-11 13:15:41,609 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-11 13:15:41,610 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [844240846] [2024-10-11 13:15:41,610 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [844240846] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 13:15:41,610 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 13:15:41,610 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-10-11 13:15:41,611 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [551495370] [2024-10-11 13:15:41,611 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 13:15:41,611 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-10-11 13:15:41,612 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-11 13:15:41,612 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-10-11 13:15:41,612 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-10-11 13:15:41,613 INFO L87 Difference]: Start difference. First operand 108 states and 157 transitions. Second operand has 5 states, 5 states have (on average 9.4) internal successors, (47), 5 states have internal predecessors, (47), 1 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 1 states have call successors, (15) [2024-10-11 13:15:42,549 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 13:15:42,549 INFO L93 Difference]: Finished difference Result 220 states and 320 transitions. [2024-10-11 13:15:42,549 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-10-11 13:15:42,549 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 9.4) internal successors, (47), 5 states have internal predecessors, (47), 1 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 1 states have call successors, (15) Word has length 119 [2024-10-11 13:15:42,550 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 13:15:42,551 INFO L225 Difference]: With dead ends: 220 [2024-10-11 13:15:42,551 INFO L226 Difference]: Without dead ends: 113 [2024-10-11 13:15:42,552 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 118 GetRequests, 115 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-10-11 13:15:42,553 INFO L432 NwaCegarLoop]: 125 mSDtfsCounter, 1 mSDsluCounter, 365 mSDsCounter, 0 mSdLazyCounter, 43 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 490 SdHoareTripleChecker+Invalid, 46 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 43 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.9s IncrementalHoareTripleChecker+Time [2024-10-11 13:15:42,553 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1 Valid, 490 Invalid, 46 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 43 Invalid, 0 Unknown, 0 Unchecked, 0.9s Time] [2024-10-11 13:15:42,554 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 113 states. [2024-10-11 13:15:42,564 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 113 to 112. [2024-10-11 13:15:42,565 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 112 states, 95 states have (on average 1.3789473684210527) internal successors, (131), 95 states have internal predecessors, (131), 15 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 15 states have call predecessors, (15), 15 states have call successors, (15) [2024-10-11 13:15:42,566 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 112 states to 112 states and 161 transitions. [2024-10-11 13:15:42,566 INFO L78 Accepts]: Start accepts. Automaton has 112 states and 161 transitions. Word has length 119 [2024-10-11 13:15:42,567 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 13:15:42,567 INFO L471 AbstractCegarLoop]: Abstraction has 112 states and 161 transitions. [2024-10-11 13:15:42,567 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 9.4) internal successors, (47), 5 states have internal predecessors, (47), 1 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 1 states have call successors, (15) [2024-10-11 13:15:42,567 INFO L276 IsEmpty]: Start isEmpty. Operand 112 states and 161 transitions. [2024-10-11 13:15:42,569 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 120 [2024-10-11 13:15:42,569 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 13:15:42,569 INFO L215 NwaCegarLoop]: trace histogram [15, 15, 15, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 13:15:42,602 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (5)] Ended with exit code 0 [2024-10-11 13:15:42,769 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-10-11 13:15:42,770 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 13:15:42,770 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 13:15:42,771 INFO L85 PathProgramCache]: Analyzing trace with hash 2030756085, now seen corresponding path program 1 times [2024-10-11 13:15:42,771 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-11 13:15:42,771 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [729558208] [2024-10-11 13:15:42,771 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 13:15:42,772 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-10-11 13:15:42,772 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-11 13:15:42,775 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-10-11 13:15:42,777 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (6)] Waiting until timeout for monitored process [2024-10-11 13:15:43,629 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:15:43,658 INFO L255 TraceCheckSpWp]: Trace formula consists of 258 conjuncts, 5 conjuncts are in the unsatisfiable core [2024-10-11 13:15:43,660 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-11 13:15:44,485 INFO L134 CoverageAnalysis]: Checked inductivity of 420 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 420 trivial. 0 not checked. [2024-10-11 13:15:44,485 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-11 13:15:44,485 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-11 13:15:44,486 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [729558208] [2024-10-11 13:15:44,486 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [729558208] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 13:15:44,486 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 13:15:44,486 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-10-11 13:15:44,486 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1626595802] [2024-10-11 13:15:44,486 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 13:15:44,487 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-10-11 13:15:44,487 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-11 13:15:44,487 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-10-11 13:15:44,488 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2024-10-11 13:15:44,488 INFO L87 Difference]: Start difference. First operand 112 states and 161 transitions. Second operand has 6 states, 6 states have (on average 7.833333333333333) internal successors, (47), 6 states have internal predecessors, (47), 1 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 1 states have call successors, (15) [2024-10-11 13:15:45,810 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 13:15:45,810 INFO L93 Difference]: Finished difference Result 226 states and 325 transitions. [2024-10-11 13:15:45,811 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-10-11 13:15:45,811 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 7.833333333333333) internal successors, (47), 6 states have internal predecessors, (47), 1 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 1 states have call successors, (15) Word has length 119 [2024-10-11 13:15:45,811 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 13:15:45,812 INFO L225 Difference]: With dead ends: 226 [2024-10-11 13:15:45,813 INFO L226 Difference]: Without dead ends: 115 [2024-10-11 13:15:45,813 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 118 GetRequests, 114 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2024-10-11 13:15:45,814 INFO L432 NwaCegarLoop]: 123 mSDtfsCounter, 1 mSDsluCounter, 480 mSDsCounter, 0 mSdLazyCounter, 63 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 603 SdHoareTripleChecker+Invalid, 66 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 63 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.3s IncrementalHoareTripleChecker+Time [2024-10-11 13:15:45,814 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1 Valid, 603 Invalid, 66 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 63 Invalid, 0 Unknown, 0 Unchecked, 1.3s Time] [2024-10-11 13:15:45,815 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 115 states. [2024-10-11 13:15:45,824 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 115 to 114. [2024-10-11 13:15:45,824 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 114 states, 97 states have (on average 1.3711340206185567) internal successors, (133), 97 states have internal predecessors, (133), 15 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 15 states have call predecessors, (15), 15 states have call successors, (15) [2024-10-11 13:15:45,829 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 114 states to 114 states and 163 transitions. [2024-10-11 13:15:45,829 INFO L78 Accepts]: Start accepts. Automaton has 114 states and 163 transitions. Word has length 119 [2024-10-11 13:15:45,829 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 13:15:45,830 INFO L471 AbstractCegarLoop]: Abstraction has 114 states and 163 transitions. [2024-10-11 13:15:45,830 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 7.833333333333333) internal successors, (47), 6 states have internal predecessors, (47), 1 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 1 states have call successors, (15) [2024-10-11 13:15:45,830 INFO L276 IsEmpty]: Start isEmpty. Operand 114 states and 163 transitions. [2024-10-11 13:15:45,831 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 120 [2024-10-11 13:15:45,831 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 13:15:45,832 INFO L215 NwaCegarLoop]: trace histogram [15, 15, 15, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 13:15:45,859 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (6)] Ended with exit code 0 [2024-10-11 13:15:46,032 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-10-11 13:15:46,033 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 13:15:46,033 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 13:15:46,034 INFO L85 PathProgramCache]: Analyzing trace with hash 2088014387, now seen corresponding path program 1 times [2024-10-11 13:15:46,034 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-11 13:15:46,034 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1558447084] [2024-10-11 13:15:46,035 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 13:15:46,035 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-10-11 13:15:46,035 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-11 13:15:46,036 INFO L229 MonitoredProcess]: Starting monitored process 7 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-10-11 13:15:46,037 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (7)] Waiting until timeout for monitored process [2024-10-11 13:15:46,984 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:15:47,010 INFO L255 TraceCheckSpWp]: Trace formula consists of 255 conjuncts, 6 conjuncts are in the unsatisfiable core [2024-10-11 13:15:47,013 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-11 13:15:48,137 INFO L134 CoverageAnalysis]: Checked inductivity of 420 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 420 trivial. 0 not checked. [2024-10-11 13:15:48,137 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-11 13:15:48,137 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-11 13:15:48,137 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1558447084] [2024-10-11 13:15:48,137 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1558447084] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 13:15:48,137 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 13:15:48,137 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-10-11 13:15:48,137 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [230807225] [2024-10-11 13:15:48,138 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 13:15:48,138 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-10-11 13:15:48,138 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-11 13:15:48,139 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-10-11 13:15:48,139 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2024-10-11 13:15:48,139 INFO L87 Difference]: Start difference. First operand 114 states and 163 transitions. Second operand has 7 states, 7 states have (on average 6.714285714285714) internal successors, (47), 7 states have internal predecessors, (47), 1 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 1 states have call successors, (15) [2024-10-11 13:15:49,829 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 13:15:49,829 INFO L93 Difference]: Finished difference Result 230 states and 329 transitions. [2024-10-11 13:15:49,830 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-10-11 13:15:49,830 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 6.714285714285714) internal successors, (47), 7 states have internal predecessors, (47), 1 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 1 states have call successors, (15) Word has length 119 [2024-10-11 13:15:49,831 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 13:15:49,831 INFO L225 Difference]: With dead ends: 230 [2024-10-11 13:15:49,831 INFO L226 Difference]: Without dead ends: 117 [2024-10-11 13:15:49,832 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 118 GetRequests, 113 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2024-10-11 13:15:49,833 INFO L432 NwaCegarLoop]: 122 mSDtfsCounter, 1 mSDsluCounter, 596 mSDsCounter, 0 mSdLazyCounter, 81 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 718 SdHoareTripleChecker+Invalid, 85 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 81 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.7s IncrementalHoareTripleChecker+Time [2024-10-11 13:15:49,833 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1 Valid, 718 Invalid, 85 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 81 Invalid, 0 Unknown, 0 Unchecked, 1.7s Time] [2024-10-11 13:15:49,834 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 117 states. [2024-10-11 13:15:49,839 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 117 to 116. [2024-10-11 13:15:49,839 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 116 states, 99 states have (on average 1.3636363636363635) internal successors, (135), 99 states have internal predecessors, (135), 15 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 15 states have call predecessors, (15), 15 states have call successors, (15) [2024-10-11 13:15:49,840 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 116 states to 116 states and 165 transitions. [2024-10-11 13:15:49,841 INFO L78 Accepts]: Start accepts. Automaton has 116 states and 165 transitions. Word has length 119 [2024-10-11 13:15:49,841 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 13:15:49,841 INFO L471 AbstractCegarLoop]: Abstraction has 116 states and 165 transitions. [2024-10-11 13:15:49,842 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 6.714285714285714) internal successors, (47), 7 states have internal predecessors, (47), 1 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 1 states have call successors, (15) [2024-10-11 13:15:49,842 INFO L276 IsEmpty]: Start isEmpty. Operand 116 states and 165 transitions. [2024-10-11 13:15:49,843 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 120 [2024-10-11 13:15:49,843 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 13:15:49,843 INFO L215 NwaCegarLoop]: trace histogram [15, 15, 15, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 13:15:49,876 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (7)] Ended with exit code 0 [2024-10-11 13:15:50,044 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 7 /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-10-11 13:15:50,044 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 13:15:50,044 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 13:15:50,045 INFO L85 PathProgramCache]: Analyzing trace with hash 2088073969, now seen corresponding path program 1 times [2024-10-11 13:15:50,045 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-11 13:15:50,045 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1160957630] [2024-10-11 13:15:50,045 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 13:15:50,046 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-10-11 13:15:50,046 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-11 13:15:50,047 INFO L229 MonitoredProcess]: Starting monitored process 8 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-10-11 13:15:50,048 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (8)] Waiting until timeout for monitored process [2024-10-11 13:15:51,299 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:15:51,343 INFO L255 TraceCheckSpWp]: Trace formula consists of 252 conjuncts, 18 conjuncts are in the unsatisfiable core [2024-10-11 13:15:51,348 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-11 13:16:03,062 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 121 treesize of output 61 [2024-10-11 13:16:04,614 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-10-11 13:16:04,615 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 148 treesize of output 58