./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-a_file-83.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version c7c6ca5d Calling Ultimate with: /root/.sdkman/candidates/java/11.0.12-open/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-a_file-83.i -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! call(reach_error())) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash f973a40b26aaa32bb1cc01afeff98c3363a14790c658d13c89361ba4409a62b2 --- Real Ultimate output --- This is Ultimate 0.2.5-?-c7c6ca5-m [2024-11-09 01:35:39,942 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-09 01:35:39,991 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2024-11-09 01:35:39,994 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-09 01:35:39,995 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-09 01:35:40,010 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-09 01:35:40,011 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-09 01:35:40,011 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-09 01:35:40,012 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-11-09 01:35:40,012 INFO L153 SettingsManager]: * Use memory slicer=true [2024-11-09 01:35:40,012 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-09 01:35:40,012 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-09 01:35:40,013 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-09 01:35:40,016 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-09 01:35:40,017 INFO L153 SettingsManager]: * Use SBE=true [2024-11-09 01:35:40,017 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-09 01:35:40,017 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-11-09 01:35:40,018 INFO L153 SettingsManager]: * sizeof long=4 [2024-11-09 01:35:40,018 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-11-09 01:35:40,018 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-11-09 01:35:40,018 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-09 01:35:40,019 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-11-09 01:35:40,019 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-09 01:35:40,019 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-11-09 01:35:40,019 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-09 01:35:40,019 INFO L153 SettingsManager]: * sizeof long double=12 [2024-11-09 01:35:40,020 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-11-09 01:35:40,020 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-09 01:35:40,020 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-11-09 01:35:40,020 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-09 01:35:40,021 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-09 01:35:40,021 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-09 01:35:40,021 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-09 01:35:40,021 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-09 01:35:40,021 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-09 01:35:40,022 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-11-09 01:35:40,022 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-11-09 01:35:40,022 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-11-09 01:35:40,022 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-09 01:35:40,022 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-11-09 01:35:40,023 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-11-09 01:35:40,023 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-11-09 01:35:40,024 INFO L153 SettingsManager]: * Looper check in Petri net analysis=SEMANTIC WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G ! call(reach_error())) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> f973a40b26aaa32bb1cc01afeff98c3363a14790c658d13c89361ba4409a62b2 [2024-11-09 01:35:40,233 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-09 01:35:40,260 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-09 01:35:40,263 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-09 01:35:40,264 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-09 01:35:40,265 INFO L274 PluginConnector]: CDTParser initialized [2024-11-09 01:35:40,266 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-a_file-83.i [2024-11-09 01:35:41,672 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-09 01:35:41,877 INFO L384 CDTParser]: Found 1 translation units. [2024-11-09 01:35:41,878 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-a_file-83.i [2024-11-09 01:35:41,887 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/3e564a8bc/fde88006f50343e98395ff541aa2c9f9/FLAG924051928 [2024-11-09 01:35:41,899 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/3e564a8bc/fde88006f50343e98395ff541aa2c9f9 [2024-11-09 01:35:41,901 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-09 01:35:41,902 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-09 01:35:41,903 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-09 01:35:41,903 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-09 01:35:41,908 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-09 01:35:41,909 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.11 01:35:41" (1/1) ... [2024-11-09 01:35:41,910 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@6724cd31 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 01:35:41, skipping insertion in model container [2024-11-09 01:35:41,910 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.11 01:35:41" (1/1) ... [2024-11-09 01:35:41,934 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-09 01:35:42,099 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-a_file-83.i[916,929] [2024-11-09 01:35:42,172 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-09 01:35:42,180 INFO L200 MainTranslator]: Completed pre-run [2024-11-09 01:35:42,192 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-a_file-83.i[916,929] [2024-11-09 01:35:42,236 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-09 01:35:42,254 INFO L204 MainTranslator]: Completed translation [2024-11-09 01:35:42,258 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 01:35:42 WrapperNode [2024-11-09 01:35:42,258 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-09 01:35:42,259 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-09 01:35:42,259 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-09 01:35:42,259 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-09 01:35:42,266 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 01:35:42" (1/1) ... [2024-11-09 01:35:42,280 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 01:35:42" (1/1) ... [2024-11-09 01:35:42,323 INFO L138 Inliner]: procedures = 29, calls = 158, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 520 [2024-11-09 01:35:42,324 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-09 01:35:42,324 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-09 01:35:42,325 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-09 01:35:42,325 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-09 01:35:42,334 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 01:35:42" (1/1) ... [2024-11-09 01:35:42,334 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 01:35:42" (1/1) ... [2024-11-09 01:35:42,340 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 01:35:42" (1/1) ... [2024-11-09 01:35:42,367 INFO L175 MemorySlicer]: Split 130 memory accesses to 7 slices as follows [2, 6, 47, 21, 5, 9, 40]. 36 percent of accesses are in the largest equivalence class. The 14 initializations are split as follows [2, 1, 5, 2, 1, 1, 2]. The 16 writes are split as follows [0, 1, 7, 2, 1, 1, 4]. [2024-11-09 01:35:42,367 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 01:35:42" (1/1) ... [2024-11-09 01:35:42,368 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 01:35:42" (1/1) ... [2024-11-09 01:35:42,385 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 01:35:42" (1/1) ... [2024-11-09 01:35:42,389 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 01:35:42" (1/1) ... [2024-11-09 01:35:42,392 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 01:35:42" (1/1) ... [2024-11-09 01:35:42,394 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 01:35:42" (1/1) ... [2024-11-09 01:35:42,399 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-09 01:35:42,400 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-11-09 01:35:42,400 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-11-09 01:35:42,400 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-11-09 01:35:42,401 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 01:35:42" (1/1) ... [2024-11-09 01:35:42,405 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-09 01:35:42,416 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-09 01:35:42,430 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2024-11-09 01:35:42,433 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2024-11-09 01:35:42,496 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-11-09 01:35:42,496 INFO L130 BoogieDeclarations]: Found specification of procedure read~real#0 [2024-11-09 01:35:42,496 INFO L130 BoogieDeclarations]: Found specification of procedure read~real#1 [2024-11-09 01:35:42,497 INFO L130 BoogieDeclarations]: Found specification of procedure read~real#2 [2024-11-09 01:35:42,497 INFO L130 BoogieDeclarations]: Found specification of procedure read~real#3 [2024-11-09 01:35:42,497 INFO L130 BoogieDeclarations]: Found specification of procedure read~real#4 [2024-11-09 01:35:42,497 INFO L130 BoogieDeclarations]: Found specification of procedure read~real#5 [2024-11-09 01:35:42,497 INFO L130 BoogieDeclarations]: Found specification of procedure read~real#6 [2024-11-09 01:35:42,497 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#0 [2024-11-09 01:35:42,497 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#1 [2024-11-09 01:35:42,498 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#2 [2024-11-09 01:35:42,498 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#3 [2024-11-09 01:35:42,498 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#4 [2024-11-09 01:35:42,498 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#5 [2024-11-09 01:35:42,498 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#6 [2024-11-09 01:35:42,498 INFO L130 BoogieDeclarations]: Found specification of procedure write~real#0 [2024-11-09 01:35:42,499 INFO L130 BoogieDeclarations]: Found specification of procedure write~real#1 [2024-11-09 01:35:42,499 INFO L130 BoogieDeclarations]: Found specification of procedure write~real#2 [2024-11-09 01:35:42,499 INFO L130 BoogieDeclarations]: Found specification of procedure write~real#3 [2024-11-09 01:35:42,499 INFO L130 BoogieDeclarations]: Found specification of procedure write~real#4 [2024-11-09 01:35:42,499 INFO L130 BoogieDeclarations]: Found specification of procedure write~real#5 [2024-11-09 01:35:42,499 INFO L130 BoogieDeclarations]: Found specification of procedure write~real#6 [2024-11-09 01:35:42,499 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#0 [2024-11-09 01:35:42,499 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#1 [2024-11-09 01:35:42,500 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#2 [2024-11-09 01:35:42,500 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#3 [2024-11-09 01:35:42,500 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#4 [2024-11-09 01:35:42,500 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#5 [2024-11-09 01:35:42,500 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#6 [2024-11-09 01:35:42,500 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~real#0 [2024-11-09 01:35:42,500 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~real#1 [2024-11-09 01:35:42,501 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~real#2 [2024-11-09 01:35:42,501 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~real#3 [2024-11-09 01:35:42,501 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~real#4 [2024-11-09 01:35:42,501 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~real#5 [2024-11-09 01:35:42,502 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~real#6 [2024-11-09 01:35:42,502 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2024-11-09 01:35:42,502 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2024-11-09 01:35:42,502 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-11-09 01:35:42,502 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#1 [2024-11-09 01:35:42,503 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#2 [2024-11-09 01:35:42,503 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#3 [2024-11-09 01:35:42,503 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#4 [2024-11-09 01:35:42,503 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#5 [2024-11-09 01:35:42,503 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#6 [2024-11-09 01:35:42,503 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-09 01:35:42,503 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-09 01:35:42,644 INFO L238 CfgBuilder]: Building ICFG [2024-11-09 01:35:42,646 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-09 01:35:43,219 INFO L? ?]: Removed 139 outVars from TransFormulas that were not future-live. [2024-11-09 01:35:43,221 INFO L287 CfgBuilder]: Performing block encoding [2024-11-09 01:35:43,238 INFO L311 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-09 01:35:43,238 INFO L316 CfgBuilder]: Removed 1 assume(true) statements. [2024-11-09 01:35:43,238 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.11 01:35:43 BoogieIcfgContainer [2024-11-09 01:35:43,239 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-11-09 01:35:43,241 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-11-09 01:35:43,241 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-11-09 01:35:43,244 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-11-09 01:35:43,244 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 09.11 01:35:41" (1/3) ... [2024-11-09 01:35:43,244 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2392db1b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 09.11 01:35:43, skipping insertion in model container [2024-11-09 01:35:43,245 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 01:35:42" (2/3) ... [2024-11-09 01:35:43,245 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2392db1b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 09.11 01:35:43, skipping insertion in model container [2024-11-09 01:35:43,245 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.11 01:35:43" (3/3) ... [2024-11-09 01:35:43,246 INFO L112 eAbstractionObserver]: Analyzing ICFG hardness_variablewrapping_wrapper-a_file-83.i [2024-11-09 01:35:43,259 INFO L214 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-11-09 01:35:43,260 INFO L154 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-11-09 01:35:43,314 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-09 01:35:43,322 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;@63f33ac1, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-09 01:35:43,322 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-11-09 01:35:43,329 INFO L276 IsEmpty]: Start isEmpty. Operand has 112 states, 98 states have (on average 1.469387755102041) internal successors, (144), 99 states have internal predecessors, (144), 11 states have call successors, (11), 1 states have call predecessors, (11), 1 states have return successors, (11), 11 states have call predecessors, (11), 11 states have call successors, (11) [2024-11-09 01:35:43,348 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 107 [2024-11-09 01:35:43,349 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 01:35:43,351 INFO L215 NwaCegarLoop]: trace histogram [11, 11, 11, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 01:35:43,351 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-09 01:35:43,357 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 01:35:43,358 INFO L85 PathProgramCache]: Analyzing trace with hash -614938600, now seen corresponding path program 1 times [2024-11-09 01:35:43,368 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 01:35:43,368 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [800385197] [2024-11-09 01:35:43,369 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 01:35:43,369 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 01:35:43,552 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:35:43,694 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-09 01:35:43,697 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:35:43,700 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-11-09 01:35:43,702 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:35:43,704 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2024-11-09 01:35:43,705 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:35:43,707 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-11-09 01:35:43,713 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:35:43,715 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2024-11-09 01:35:43,717 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:35:43,719 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2024-11-09 01:35:43,720 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:35:43,724 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2024-11-09 01:35:43,727 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:35:43,729 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 53 [2024-11-09 01:35:43,730 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:35:43,732 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2024-11-09 01:35:43,733 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:35:43,736 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2024-11-09 01:35:43,737 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:35:43,738 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2024-11-09 01:35:43,740 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:35:43,743 INFO L134 CoverageAnalysis]: Checked inductivity of 220 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 220 trivial. 0 not checked. [2024-11-09 01:35:43,745 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 01:35:43,746 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [800385197] [2024-11-09 01:35:43,746 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [800385197] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 01:35:43,746 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 01:35:43,747 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-09 01:35:43,748 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1451067880] [2024-11-09 01:35:43,748 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 01:35:43,753 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-11-09 01:35:43,753 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 01:35:43,771 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-11-09 01:35:43,772 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-11-09 01:35:43,775 INFO L87 Difference]: Start difference. First operand has 112 states, 98 states have (on average 1.469387755102041) internal successors, (144), 99 states have internal predecessors, (144), 11 states have call successors, (11), 1 states have call predecessors, (11), 1 states have return successors, (11), 11 states have call predecessors, (11), 11 states have call successors, (11) Second operand has 2 states, 2 states have (on average 27.0) internal successors, (54), 2 states have internal predecessors, (54), 2 states have call successors, (11), 1 states have call predecessors, (11), 1 states have return successors, (11), 1 states have call predecessors, (11), 2 states have call successors, (11) [2024-11-09 01:35:43,806 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 01:35:43,806 INFO L93 Difference]: Finished difference Result 217 states and 337 transitions. [2024-11-09 01:35:43,807 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-11-09 01:35:43,808 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 27.0) internal successors, (54), 2 states have internal predecessors, (54), 2 states have call successors, (11), 1 states have call predecessors, (11), 1 states have return successors, (11), 1 states have call predecessors, (11), 2 states have call successors, (11) Word has length 106 [2024-11-09 01:35:43,809 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 01:35:43,816 INFO L225 Difference]: With dead ends: 217 [2024-11-09 01:35:43,816 INFO L226 Difference]: Without dead ends: 108 [2024-11-09 01:35:43,820 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 35 GetRequests, 35 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-11-09 01:35:43,823 INFO L432 NwaCegarLoop]: 153 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 0 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 153 SdHoareTripleChecker+Invalid, 0 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 0 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-09 01:35:43,825 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 153 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-09 01:35:43,839 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 108 states. [2024-11-09 01:35:43,857 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 108 to 108. [2024-11-09 01:35:43,859 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 108 states, 95 states have (on average 1.3789473684210527) internal successors, (131), 95 states have internal predecessors, (131), 11 states have call successors, (11), 1 states have call predecessors, (11), 1 states have return successors, (11), 11 states have call predecessors, (11), 11 states have call successors, (11) [2024-11-09 01:35:43,861 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 108 states to 108 states and 153 transitions. [2024-11-09 01:35:43,863 INFO L78 Accepts]: Start accepts. Automaton has 108 states and 153 transitions. Word has length 106 [2024-11-09 01:35:43,863 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 01:35:43,864 INFO L471 AbstractCegarLoop]: Abstraction has 108 states and 153 transitions. [2024-11-09 01:35:43,864 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 27.0) internal successors, (54), 2 states have internal predecessors, (54), 2 states have call successors, (11), 1 states have call predecessors, (11), 1 states have return successors, (11), 1 states have call predecessors, (11), 2 states have call successors, (11) [2024-11-09 01:35:43,864 INFO L276 IsEmpty]: Start isEmpty. Operand 108 states and 153 transitions. [2024-11-09 01:35:43,867 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 107 [2024-11-09 01:35:43,867 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 01:35:43,867 INFO L215 NwaCegarLoop]: trace histogram [11, 11, 11, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 01:35:43,867 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-11-09 01:35:43,868 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-09 01:35:43,868 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 01:35:43,868 INFO L85 PathProgramCache]: Analyzing trace with hash 980575082, now seen corresponding path program 1 times [2024-11-09 01:35:43,868 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 01:35:43,869 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1342913748] [2024-11-09 01:35:43,869 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 01:35:43,869 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 01:35:43,905 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:35:44,061 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-09 01:35:44,062 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:35:44,066 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-11-09 01:35:44,068 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:35:44,071 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2024-11-09 01:35:44,073 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:35:44,077 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-11-09 01:35:44,081 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:35:44,085 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2024-11-09 01:35:44,089 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:35:44,091 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2024-11-09 01:35:44,094 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:35:44,096 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2024-11-09 01:35:44,099 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:35:44,101 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 53 [2024-11-09 01:35:44,102 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:35:44,104 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2024-11-09 01:35:44,105 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:35:44,107 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2024-11-09 01:35:44,108 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:35:44,109 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2024-11-09 01:35:44,111 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:35:44,113 INFO L134 CoverageAnalysis]: Checked inductivity of 220 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 220 trivial. 0 not checked. [2024-11-09 01:35:44,113 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 01:35:44,113 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1342913748] [2024-11-09 01:35:44,113 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1342913748] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 01:35:44,113 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 01:35:44,114 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-09 01:35:44,114 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1755877152] [2024-11-09 01:35:44,114 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 01:35:44,115 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-09 01:35:44,115 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 01:35:44,116 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-09 01:35:44,116 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-09 01:35:44,116 INFO L87 Difference]: Start difference. First operand 108 states and 153 transitions. Second operand has 4 states, 4 states have (on average 13.5) internal successors, (54), 4 states have internal predecessors, (54), 2 states have call successors, (11), 1 states have call predecessors, (11), 1 states have return successors, (11), 2 states have call predecessors, (11), 2 states have call successors, (11) [2024-11-09 01:35:44,162 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 01:35:44,165 INFO L93 Difference]: Finished difference Result 215 states and 306 transitions. [2024-11-09 01:35:44,166 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-09 01:35:44,166 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 13.5) internal successors, (54), 4 states have internal predecessors, (54), 2 states have call successors, (11), 1 states have call predecessors, (11), 1 states have return successors, (11), 2 states have call predecessors, (11), 2 states have call successors, (11) Word has length 106 [2024-11-09 01:35:44,166 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 01:35:44,167 INFO L225 Difference]: With dead ends: 215 [2024-11-09 01:35:44,167 INFO L226 Difference]: Without dead ends: 110 [2024-11-09 01:35:44,168 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 26 GetRequests, 24 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-09 01:35:44,169 INFO L432 NwaCegarLoop]: 151 mSDtfsCounter, 0 mSDsluCounter, 291 mSDsCounter, 0 mSdLazyCounter, 16 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 442 SdHoareTripleChecker+Invalid, 16 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 16 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-09 01:35:44,169 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 442 Invalid, 16 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 16 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-09 01:35:44,170 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 110 states. [2024-11-09 01:35:44,181 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 110 to 110. [2024-11-09 01:35:44,185 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 110 states, 97 states have (on average 1.3711340206185567) internal successors, (133), 97 states have internal predecessors, (133), 11 states have call successors, (11), 1 states have call predecessors, (11), 1 states have return successors, (11), 11 states have call predecessors, (11), 11 states have call successors, (11) [2024-11-09 01:35:44,186 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 110 states to 110 states and 155 transitions. [2024-11-09 01:35:44,186 INFO L78 Accepts]: Start accepts. Automaton has 110 states and 155 transitions. Word has length 106 [2024-11-09 01:35:44,187 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 01:35:44,187 INFO L471 AbstractCegarLoop]: Abstraction has 110 states and 155 transitions. [2024-11-09 01:35:44,187 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 13.5) internal successors, (54), 4 states have internal predecessors, (54), 2 states have call successors, (11), 1 states have call predecessors, (11), 1 states have return successors, (11), 2 states have call predecessors, (11), 2 states have call successors, (11) [2024-11-09 01:35:44,187 INFO L276 IsEmpty]: Start isEmpty. Operand 110 states and 155 transitions. [2024-11-09 01:35:44,193 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 107 [2024-11-09 01:35:44,193 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 01:35:44,194 INFO L215 NwaCegarLoop]: trace histogram [11, 11, 11, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 01:35:44,194 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-11-09 01:35:44,195 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-09 01:35:44,196 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 01:35:44,196 INFO L85 PathProgramCache]: Analyzing trace with hash 1751308648, now seen corresponding path program 1 times [2024-11-09 01:35:44,196 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 01:35:44,196 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1168513815] [2024-11-09 01:35:44,196 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 01:35:44,197 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 01:35:44,270 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:35:44,447 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-09 01:35:44,448 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:35:44,454 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-11-09 01:35:44,455 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:35:44,461 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2024-11-09 01:35:44,462 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:35:44,463 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-11-09 01:35:44,468 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:35:44,470 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2024-11-09 01:35:44,471 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:35:44,477 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2024-11-09 01:35:44,478 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:35:44,479 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2024-11-09 01:35:44,484 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:35:44,486 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 53 [2024-11-09 01:35:44,487 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:35:44,491 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2024-11-09 01:35:44,493 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:35:44,499 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2024-11-09 01:35:44,500 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:35:44,501 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2024-11-09 01:35:44,502 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:35:44,508 INFO L134 CoverageAnalysis]: Checked inductivity of 220 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 220 trivial. 0 not checked. [2024-11-09 01:35:44,508 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 01:35:44,508 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1168513815] [2024-11-09 01:35:44,509 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1168513815] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 01:35:44,509 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 01:35:44,509 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-09 01:35:44,509 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1625484665] [2024-11-09 01:35:44,513 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 01:35:44,514 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-09 01:35:44,514 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 01:35:44,514 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-09 01:35:44,514 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-09 01:35:44,515 INFO L87 Difference]: Start difference. First operand 110 states and 155 transitions. Second operand has 4 states, 4 states have (on average 13.5) internal successors, (54), 4 states have internal predecessors, (54), 1 states have call successors, (11), 1 states have call predecessors, (11), 1 states have return successors, (11), 1 states have call predecessors, (11), 1 states have call successors, (11) [2024-11-09 01:35:44,551 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 01:35:44,551 INFO L93 Difference]: Finished difference Result 220 states and 311 transitions. [2024-11-09 01:35:44,551 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-09 01:35:44,551 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 13.5) internal successors, (54), 4 states have internal predecessors, (54), 1 states have call successors, (11), 1 states have call predecessors, (11), 1 states have return successors, (11), 1 states have call predecessors, (11), 1 states have call successors, (11) Word has length 106 [2024-11-09 01:35:44,552 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 01:35:44,553 INFO L225 Difference]: With dead ends: 220 [2024-11-09 01:35:44,553 INFO L226 Difference]: Without dead ends: 113 [2024-11-09 01:35:44,553 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 26 GetRequests, 24 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-09 01:35:44,554 INFO L432 NwaCegarLoop]: 150 mSDtfsCounter, 1 mSDsluCounter, 289 mSDsCounter, 0 mSdLazyCounter, 18 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 439 SdHoareTripleChecker+Invalid, 19 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 18 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-09 01:35:44,554 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1 Valid, 439 Invalid, 19 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 18 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-09 01:35:44,555 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 113 states. [2024-11-09 01:35:44,562 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 113 to 112. [2024-11-09 01:35:44,563 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 112 states, 99 states have (on average 1.3636363636363635) internal successors, (135), 99 states have internal predecessors, (135), 11 states have call successors, (11), 1 states have call predecessors, (11), 1 states have return successors, (11), 11 states have call predecessors, (11), 11 states have call successors, (11) [2024-11-09 01:35:44,564 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 112 states to 112 states and 157 transitions. [2024-11-09 01:35:44,564 INFO L78 Accepts]: Start accepts. Automaton has 112 states and 157 transitions. Word has length 106 [2024-11-09 01:35:44,564 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 01:35:44,564 INFO L471 AbstractCegarLoop]: Abstraction has 112 states and 157 transitions. [2024-11-09 01:35:44,565 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 13.5) internal successors, (54), 4 states have internal predecessors, (54), 1 states have call successors, (11), 1 states have call predecessors, (11), 1 states have return successors, (11), 1 states have call predecessors, (11), 1 states have call successors, (11) [2024-11-09 01:35:44,565 INFO L276 IsEmpty]: Start isEmpty. Operand 112 states and 157 transitions. [2024-11-09 01:35:44,566 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 107 [2024-11-09 01:35:44,566 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 01:35:44,566 INFO L215 NwaCegarLoop]: trace histogram [11, 11, 11, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 01:35:44,566 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-11-09 01:35:44,566 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-09 01:35:44,566 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 01:35:44,566 INFO L85 PathProgramCache]: Analyzing trace with hash -1863600278, now seen corresponding path program 1 times [2024-11-09 01:35:44,567 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 01:35:44,567 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [956419116] [2024-11-09 01:35:44,567 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 01:35:44,567 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 01:35:44,600 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:35:44,691 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-09 01:35:44,692 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:35:44,694 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-11-09 01:35:44,695 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:35:44,697 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2024-11-09 01:35:44,698 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:35:44,701 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-11-09 01:35:44,704 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:35:44,706 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2024-11-09 01:35:44,708 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:35:44,710 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2024-11-09 01:35:44,711 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:35:44,712 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2024-11-09 01:35:44,713 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:35:44,715 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 53 [2024-11-09 01:35:44,716 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:35:44,718 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2024-11-09 01:35:44,720 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:35:44,722 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2024-11-09 01:35:44,724 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:35:44,725 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2024-11-09 01:35:44,727 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:35:44,729 INFO L134 CoverageAnalysis]: Checked inductivity of 220 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 220 trivial. 0 not checked. [2024-11-09 01:35:44,730 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 01:35:44,732 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [956419116] [2024-11-09 01:35:44,732 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [956419116] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 01:35:44,732 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 01:35:44,732 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-09 01:35:44,732 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1923739000] [2024-11-09 01:35:44,732 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 01:35:44,733 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-09 01:35:44,733 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 01:35:44,733 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-09 01:35:44,734 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-09 01:35:44,734 INFO L87 Difference]: Start difference. First operand 112 states and 157 transitions. Second operand has 4 states, 4 states have (on average 13.5) internal successors, (54), 4 states have internal predecessors, (54), 1 states have call successors, (11), 1 states have call predecessors, (11), 1 states have return successors, (11), 1 states have call predecessors, (11), 1 states have call successors, (11) [2024-11-09 01:35:44,758 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 01:35:44,760 INFO L93 Difference]: Finished difference Result 224 states and 315 transitions. [2024-11-09 01:35:44,761 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-09 01:35:44,761 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 13.5) internal successors, (54), 4 states have internal predecessors, (54), 1 states have call successors, (11), 1 states have call predecessors, (11), 1 states have return successors, (11), 1 states have call predecessors, (11), 1 states have call successors, (11) Word has length 106 [2024-11-09 01:35:44,762 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 01:35:44,764 INFO L225 Difference]: With dead ends: 224 [2024-11-09 01:35:44,764 INFO L226 Difference]: Without dead ends: 115 [2024-11-09 01:35:44,765 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 26 GetRequests, 24 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-09 01:35:44,766 INFO L432 NwaCegarLoop]: 150 mSDtfsCounter, 1 mSDsluCounter, 290 mSDsCounter, 0 mSdLazyCounter, 17 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 440 SdHoareTripleChecker+Invalid, 18 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 17 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-09 01:35:44,769 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1 Valid, 440 Invalid, 18 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 17 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-09 01:35:44,770 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 115 states. [2024-11-09 01:35:44,780 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 115 to 114. [2024-11-09 01:35:44,781 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 114 states, 101 states have (on average 1.3564356435643565) internal successors, (137), 101 states have internal predecessors, (137), 11 states have call successors, (11), 1 states have call predecessors, (11), 1 states have return successors, (11), 11 states have call predecessors, (11), 11 states have call successors, (11) [2024-11-09 01:35:44,782 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 114 states to 114 states and 159 transitions. [2024-11-09 01:35:44,782 INFO L78 Accepts]: Start accepts. Automaton has 114 states and 159 transitions. Word has length 106 [2024-11-09 01:35:44,783 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 01:35:44,783 INFO L471 AbstractCegarLoop]: Abstraction has 114 states and 159 transitions. [2024-11-09 01:35:44,784 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 13.5) internal successors, (54), 4 states have internal predecessors, (54), 1 states have call successors, (11), 1 states have call predecessors, (11), 1 states have return successors, (11), 1 states have call predecessors, (11), 1 states have call successors, (11) [2024-11-09 01:35:44,784 INFO L276 IsEmpty]: Start isEmpty. Operand 114 states and 159 transitions. [2024-11-09 01:35:44,785 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 107 [2024-11-09 01:35:44,789 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 01:35:44,789 INFO L215 NwaCegarLoop]: trace histogram [11, 11, 11, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 01:35:44,789 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2024-11-09 01:35:44,790 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-09 01:35:44,790 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 01:35:44,790 INFO L85 PathProgramCache]: Analyzing trace with hash -88592916, now seen corresponding path program 1 times [2024-11-09 01:35:44,790 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 01:35:44,790 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [286536619] [2024-11-09 01:35:44,790 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 01:35:44,791 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 01:35:44,837 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:35:44,923 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-09 01:35:44,924 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:35:44,925 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-11-09 01:35:44,927 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:35:44,928 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2024-11-09 01:35:44,929 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:35:44,931 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-11-09 01:35:44,932 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:35:44,934 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2024-11-09 01:35:44,935 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:35:44,936 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2024-11-09 01:35:44,938 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:35:44,940 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2024-11-09 01:35:44,941 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:35:44,942 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 53 [2024-11-09 01:35:44,943 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:35:44,944 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2024-11-09 01:35:44,945 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:35:44,947 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2024-11-09 01:35:44,948 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:35:44,950 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2024-11-09 01:35:44,951 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:35:44,953 INFO L134 CoverageAnalysis]: Checked inductivity of 220 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 220 trivial. 0 not checked. [2024-11-09 01:35:44,954 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 01:35:44,954 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [286536619] [2024-11-09 01:35:44,955 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [286536619] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 01:35:44,955 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 01:35:44,955 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-09 01:35:44,955 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [187116357] [2024-11-09 01:35:44,955 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 01:35:44,956 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-09 01:35:44,956 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 01:35:44,956 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-09 01:35:44,957 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-09 01:35:44,957 INFO L87 Difference]: Start difference. First operand 114 states and 159 transitions. Second operand has 4 states, 4 states have (on average 13.5) internal successors, (54), 4 states have internal predecessors, (54), 1 states have call successors, (11), 1 states have call predecessors, (11), 1 states have return successors, (11), 1 states have call predecessors, (11), 1 states have call successors, (11) [2024-11-09 01:35:44,981 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 01:35:44,982 INFO L93 Difference]: Finished difference Result 228 states and 319 transitions. [2024-11-09 01:35:44,983 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-09 01:35:44,983 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 13.5) internal successors, (54), 4 states have internal predecessors, (54), 1 states have call successors, (11), 1 states have call predecessors, (11), 1 states have return successors, (11), 1 states have call predecessors, (11), 1 states have call successors, (11) Word has length 106 [2024-11-09 01:35:44,984 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 01:35:44,984 INFO L225 Difference]: With dead ends: 228 [2024-11-09 01:35:44,985 INFO L226 Difference]: Without dead ends: 117 [2024-11-09 01:35:44,985 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 26 GetRequests, 24 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-09 01:35:44,986 INFO L432 NwaCegarLoop]: 150 mSDtfsCounter, 1 mSDsluCounter, 292 mSDsCounter, 0 mSdLazyCounter, 15 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 442 SdHoareTripleChecker+Invalid, 16 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 15 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-09 01:35:44,990 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1 Valid, 442 Invalid, 16 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 15 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-09 01:35:44,991 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 117 states. [2024-11-09 01:35:44,997 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 117 to 116. [2024-11-09 01:35:44,997 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 116 states, 103 states have (on average 1.3495145631067962) internal successors, (139), 103 states have internal predecessors, (139), 11 states have call successors, (11), 1 states have call predecessors, (11), 1 states have return successors, (11), 11 states have call predecessors, (11), 11 states have call successors, (11) [2024-11-09 01:35:44,998 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 116 states to 116 states and 161 transitions. [2024-11-09 01:35:44,998 INFO L78 Accepts]: Start accepts. Automaton has 116 states and 161 transitions. Word has length 106 [2024-11-09 01:35:44,998 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 01:35:44,998 INFO L471 AbstractCegarLoop]: Abstraction has 116 states and 161 transitions. [2024-11-09 01:35:44,999 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 13.5) internal successors, (54), 4 states have internal predecessors, (54), 1 states have call successors, (11), 1 states have call predecessors, (11), 1 states have return successors, (11), 1 states have call predecessors, (11), 1 states have call successors, (11) [2024-11-09 01:35:44,999 INFO L276 IsEmpty]: Start isEmpty. Operand 116 states and 161 transitions. [2024-11-09 01:35:45,002 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 107 [2024-11-09 01:35:45,002 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 01:35:45,002 INFO L215 NwaCegarLoop]: trace histogram [11, 11, 11, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 01:35:45,002 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2024-11-09 01:35:45,002 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-09 01:35:45,003 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 01:35:45,003 INFO L85 PathProgramCache]: Analyzing trace with hash -86745874, now seen corresponding path program 1 times [2024-11-09 01:35:45,003 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 01:35:45,003 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1771046256] [2024-11-09 01:35:45,003 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 01:35:45,003 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 01:35:45,040 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:35:45,213 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-09 01:35:45,215 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:35:45,217 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-11-09 01:35:45,218 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:35:45,220 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2024-11-09 01:35:45,220 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:35:45,222 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-11-09 01:35:45,223 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:35:45,224 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2024-11-09 01:35:45,225 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:35:45,226 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2024-11-09 01:35:45,227 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:35:45,229 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2024-11-09 01:35:45,230 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:35:45,231 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 53 [2024-11-09 01:35:45,232 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:35:45,233 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2024-11-09 01:35:45,234 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:35:45,236 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2024-11-09 01:35:45,237 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:35:45,238 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2024-11-09 01:35:45,239 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:35:45,240 INFO L134 CoverageAnalysis]: Checked inductivity of 220 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 220 trivial. 0 not checked. [2024-11-09 01:35:45,241 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 01:35:45,241 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1771046256] [2024-11-09 01:35:45,241 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1771046256] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 01:35:45,241 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 01:35:45,242 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-09 01:35:45,242 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1739331473] [2024-11-09 01:35:45,242 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 01:35:45,243 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-09 01:35:45,243 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 01:35:45,243 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-09 01:35:45,243 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-09 01:35:45,243 INFO L87 Difference]: Start difference. First operand 116 states and 161 transitions. Second operand has 4 states, 4 states have (on average 13.5) internal successors, (54), 4 states have internal predecessors, (54), 1 states have call successors, (11), 1 states have call predecessors, (11), 1 states have return successors, (11), 1 states have call predecessors, (11), 1 states have call successors, (11) [2024-11-09 01:35:45,294 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 01:35:45,294 INFO L93 Difference]: Finished difference Result 270 states and 376 transitions. [2024-11-09 01:35:45,294 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-09 01:35:45,295 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 13.5) internal successors, (54), 4 states have internal predecessors, (54), 1 states have call successors, (11), 1 states have call predecessors, (11), 1 states have return successors, (11), 1 states have call predecessors, (11), 1 states have call successors, (11) Word has length 106 [2024-11-09 01:35:45,295 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 01:35:45,296 INFO L225 Difference]: With dead ends: 270 [2024-11-09 01:35:45,296 INFO L226 Difference]: Without dead ends: 157 [2024-11-09 01:35:45,296 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 27 GetRequests, 24 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2024-11-09 01:35:45,297 INFO L432 NwaCegarLoop]: 198 mSDtfsCounter, 148 mSDsluCounter, 250 mSDsCounter, 0 mSdLazyCounter, 19 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 148 SdHoareTripleChecker+Valid, 448 SdHoareTripleChecker+Invalid, 19 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 19 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-09 01:35:45,298 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [148 Valid, 448 Invalid, 19 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 19 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-09 01:35:45,298 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 157 states. [2024-11-09 01:35:45,302 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 157 to 116. [2024-11-09 01:35:45,302 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 116 states, 103 states have (on average 1.3398058252427185) internal successors, (138), 103 states have internal predecessors, (138), 11 states have call successors, (11), 1 states have call predecessors, (11), 1 states have return successors, (11), 11 states have call predecessors, (11), 11 states have call successors, (11) [2024-11-09 01:35:45,303 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 116 states to 116 states and 160 transitions. [2024-11-09 01:35:45,303 INFO L78 Accepts]: Start accepts. Automaton has 116 states and 160 transitions. Word has length 106 [2024-11-09 01:35:45,303 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 01:35:45,303 INFO L471 AbstractCegarLoop]: Abstraction has 116 states and 160 transitions. [2024-11-09 01:35:45,304 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 13.5) internal successors, (54), 4 states have internal predecessors, (54), 1 states have call successors, (11), 1 states have call predecessors, (11), 1 states have return successors, (11), 1 states have call predecessors, (11), 1 states have call successors, (11) [2024-11-09 01:35:45,304 INFO L276 IsEmpty]: Start isEmpty. Operand 116 states and 160 transitions. [2024-11-09 01:35:45,304 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 108 [2024-11-09 01:35:45,305 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 01:35:45,305 INFO L215 NwaCegarLoop]: trace histogram [11, 11, 11, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 01:35:45,305 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2024-11-09 01:35:45,305 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-09 01:35:45,305 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 01:35:45,305 INFO L85 PathProgramCache]: Analyzing trace with hash -754573524, now seen corresponding path program 1 times [2024-11-09 01:35:45,305 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 01:35:45,306 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1428208218] [2024-11-09 01:35:45,306 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 01:35:45,306 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 01:35:45,337 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:35:45,464 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-09 01:35:45,465 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:35:45,466 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-11-09 01:35:45,468 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:35:45,469 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2024-11-09 01:35:45,470 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:35:45,471 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-11-09 01:35:45,472 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:35:45,473 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2024-11-09 01:35:45,474 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:35:45,475 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2024-11-09 01:35:45,476 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:35:45,477 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2024-11-09 01:35:45,478 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:35:45,479 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 53 [2024-11-09 01:35:45,480 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:35:45,481 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2024-11-09 01:35:45,482 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:35:45,483 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2024-11-09 01:35:45,483 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:35:45,484 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2024-11-09 01:35:45,484 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:35:45,486 INFO L134 CoverageAnalysis]: Checked inductivity of 220 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 220 trivial. 0 not checked. [2024-11-09 01:35:45,487 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 01:35:45,487 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1428208218] [2024-11-09 01:35:45,487 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1428208218] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 01:35:45,487 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 01:35:45,487 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-09 01:35:45,487 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [196144932] [2024-11-09 01:35:45,487 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 01:35:45,488 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-09 01:35:45,488 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 01:35:45,488 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-09 01:35:45,488 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-11-09 01:35:45,489 INFO L87 Difference]: Start difference. First operand 116 states and 160 transitions. Second operand has 5 states, 5 states have (on average 11.0) internal successors, (55), 5 states have internal predecessors, (55), 1 states have call successors, (11), 1 states have call predecessors, (11), 1 states have return successors, (11), 1 states have call predecessors, (11), 1 states have call successors, (11) [2024-11-09 01:35:45,555 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 01:35:45,556 INFO L93 Difference]: Finished difference Result 231 states and 320 transitions. [2024-11-09 01:35:45,556 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-09 01:35:45,557 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 11.0) internal successors, (55), 5 states have internal predecessors, (55), 1 states have call successors, (11), 1 states have call predecessors, (11), 1 states have return successors, (11), 1 states have call predecessors, (11), 1 states have call successors, (11) Word has length 107 [2024-11-09 01:35:45,557 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 01:35:45,558 INFO L225 Difference]: With dead ends: 231 [2024-11-09 01:35:45,558 INFO L226 Difference]: Without dead ends: 118 [2024-11-09 01:35:45,559 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 28 GetRequests, 24 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2024-11-09 01:35:45,559 INFO L432 NwaCegarLoop]: 145 mSDtfsCounter, 3 mSDsluCounter, 398 mSDsCounter, 0 mSdLazyCounter, 60 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3 SdHoareTripleChecker+Valid, 543 SdHoareTripleChecker+Invalid, 60 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 60 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-09 01:35:45,560 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [3 Valid, 543 Invalid, 60 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 60 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-09 01:35:45,560 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 118 states. [2024-11-09 01:35:45,567 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 118 to 118. [2024-11-09 01:35:45,567 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 118 states, 105 states have (on average 1.3333333333333333) internal successors, (140), 105 states have internal predecessors, (140), 11 states have call successors, (11), 1 states have call predecessors, (11), 1 states have return successors, (11), 11 states have call predecessors, (11), 11 states have call successors, (11) [2024-11-09 01:35:45,571 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 118 states to 118 states and 162 transitions. [2024-11-09 01:35:45,571 INFO L78 Accepts]: Start accepts. Automaton has 118 states and 162 transitions. Word has length 107 [2024-11-09 01:35:45,571 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 01:35:45,572 INFO L471 AbstractCegarLoop]: Abstraction has 118 states and 162 transitions. [2024-11-09 01:35:45,572 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 11.0) internal successors, (55), 5 states have internal predecessors, (55), 1 states have call successors, (11), 1 states have call predecessors, (11), 1 states have return successors, (11), 1 states have call predecessors, (11), 1 states have call successors, (11) [2024-11-09 01:35:45,572 INFO L276 IsEmpty]: Start isEmpty. Operand 118 states and 162 transitions. [2024-11-09 01:35:45,573 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 109 [2024-11-09 01:35:45,573 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 01:35:45,573 INFO L215 NwaCegarLoop]: trace histogram [11, 11, 11, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 01:35:45,573 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2024-11-09 01:35:45,573 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-09 01:35:45,573 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 01:35:45,574 INFO L85 PathProgramCache]: Analyzing trace with hash 465517384, now seen corresponding path program 1 times [2024-11-09 01:35:45,574 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 01:35:45,574 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1892061608] [2024-11-09 01:35:45,574 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 01:35:45,574 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 01:35:45,701 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:35:46,155 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-09 01:35:46,157 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:35:46,158 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-11-09 01:35:46,158 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:35:46,159 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2024-11-09 01:35:46,160 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:35:46,160 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-11-09 01:35:46,161 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:35:46,161 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2024-11-09 01:35:46,162 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:35:46,163 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2024-11-09 01:35:46,163 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:35:46,164 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2024-11-09 01:35:46,165 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:35:46,165 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 53 [2024-11-09 01:35:46,166 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:35:46,166 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2024-11-09 01:35:46,167 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:35:46,168 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2024-11-09 01:35:46,168 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:35:46,169 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2024-11-09 01:35:46,170 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:35:46,171 INFO L134 CoverageAnalysis]: Checked inductivity of 220 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 220 trivial. 0 not checked. [2024-11-09 01:35:46,171 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 01:35:46,171 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1892061608] [2024-11-09 01:35:46,171 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1892061608] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 01:35:46,171 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 01:35:46,171 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-11-09 01:35:46,171 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1713456038] [2024-11-09 01:35:46,171 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 01:35:46,172 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-11-09 01:35:46,172 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 01:35:46,172 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-11-09 01:35:46,172 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2024-11-09 01:35:46,172 INFO L87 Difference]: Start difference. First operand 118 states and 162 transitions. Second operand has 7 states, 6 states have (on average 9.333333333333334) internal successors, (56), 7 states have internal predecessors, (56), 2 states have call successors, (11), 1 states have call predecessors, (11), 1 states have return successors, (11), 1 states have call predecessors, (11), 2 states have call successors, (11) [2024-11-09 01:35:46,365 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 01:35:46,366 INFO L93 Difference]: Finished difference Result 330 states and 454 transitions. [2024-11-09 01:35:46,366 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-11-09 01:35:46,367 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 6 states have (on average 9.333333333333334) internal successors, (56), 7 states have internal predecessors, (56), 2 states have call successors, (11), 1 states have call predecessors, (11), 1 states have return successors, (11), 1 states have call predecessors, (11), 2 states have call successors, (11) Word has length 108 [2024-11-09 01:35:46,367 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 01:35:46,368 INFO L225 Difference]: With dead ends: 330 [2024-11-09 01:35:46,368 INFO L226 Difference]: Without dead ends: 215 [2024-11-09 01:35:46,368 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 34 GetRequests, 26 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-11-09 01:35:46,369 INFO L432 NwaCegarLoop]: 174 mSDtfsCounter, 110 mSDsluCounter, 780 mSDsCounter, 0 mSdLazyCounter, 151 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 111 SdHoareTripleChecker+Valid, 954 SdHoareTripleChecker+Invalid, 151 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 151 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-09 01:35:46,369 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [111 Valid, 954 Invalid, 151 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 151 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-09 01:35:46,369 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 215 states. [2024-11-09 01:35:46,381 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 215 to 212. [2024-11-09 01:35:46,384 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 212 states, 192 states have (on average 1.34375) internal successors, (258), 193 states have internal predecessors, (258), 17 states have call successors, (17), 2 states have call predecessors, (17), 2 states have return successors, (17), 16 states have call predecessors, (17), 17 states have call successors, (17) [2024-11-09 01:35:46,385 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 212 states to 212 states and 292 transitions. [2024-11-09 01:35:46,385 INFO L78 Accepts]: Start accepts. Automaton has 212 states and 292 transitions. Word has length 108 [2024-11-09 01:35:46,387 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 01:35:46,387 INFO L471 AbstractCegarLoop]: Abstraction has 212 states and 292 transitions. [2024-11-09 01:35:46,387 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 6 states have (on average 9.333333333333334) internal successors, (56), 7 states have internal predecessors, (56), 2 states have call successors, (11), 1 states have call predecessors, (11), 1 states have return successors, (11), 1 states have call predecessors, (11), 2 states have call successors, (11) [2024-11-09 01:35:46,387 INFO L276 IsEmpty]: Start isEmpty. Operand 212 states and 292 transitions. [2024-11-09 01:35:46,388 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 109 [2024-11-09 01:35:46,388 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 01:35:46,388 INFO L215 NwaCegarLoop]: trace histogram [11, 11, 11, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 01:35:46,388 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2024-11-09 01:35:46,388 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-09 01:35:46,388 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 01:35:46,388 INFO L85 PathProgramCache]: Analyzing trace with hash -555550970, now seen corresponding path program 1 times [2024-11-09 01:35:46,388 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 01:35:46,389 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [520890125] [2024-11-09 01:35:46,389 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 01:35:46,389 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 01:35:46,458 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unknown [2024-11-09 01:35:46,466 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [198357509] [2024-11-09 01:35:46,466 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 01:35:46,466 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-09 01:35:46,467 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-09 01:35:46,468 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-09 01:35:46,469 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2024-11-09 01:35:46,756 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:35:46,760 INFO L255 TraceCheckSpWp]: Trace formula consists of 409 conjuncts, 34 conjuncts are in the unsatisfiable core [2024-11-09 01:35:46,776 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-09 01:35:47,071 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 1 [2024-11-09 01:35:47,171 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 25 treesize of output 13 [2024-11-09 01:35:47,325 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-09 01:35:47,325 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 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 54 treesize of output 32 [2024-11-09 01:35:47,509 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 17 [2024-11-09 01:35:47,573 INFO L134 CoverageAnalysis]: Checked inductivity of 220 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 220 trivial. 0 not checked. [2024-11-09 01:35:47,573 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-09 01:35:47,573 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 01:35:47,573 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [520890125] [2024-11-09 01:35:47,574 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2024-11-09 01:35:47,574 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [198357509] [2024-11-09 01:35:47,574 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [198357509] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 01:35:47,574 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 01:35:47,574 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2024-11-09 01:35:47,574 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1337469381] [2024-11-09 01:35:47,575 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 01:35:47,575 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2024-11-09 01:35:47,575 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 01:35:47,575 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2024-11-09 01:35:47,576 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=83, Unknown=0, NotChecked=0, Total=110 [2024-11-09 01:35:47,576 INFO L87 Difference]: Start difference. First operand 212 states and 292 transitions. Second operand has 11 states, 11 states have (on average 5.090909090909091) internal successors, (56), 10 states have internal predecessors, (56), 1 states have call successors, (11), 1 states have call predecessors, (11), 1 states have return successors, (11), 1 states have call predecessors, (11), 1 states have call successors, (11) [2024-11-09 01:35:48,286 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 01:35:48,286 INFO L93 Difference]: Finished difference Result 601 states and 828 transitions. [2024-11-09 01:35:48,287 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-11-09 01:35:48,287 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 11 states have (on average 5.090909090909091) internal successors, (56), 10 states have internal predecessors, (56), 1 states have call successors, (11), 1 states have call predecessors, (11), 1 states have return successors, (11), 1 states have call predecessors, (11), 1 states have call successors, (11) Word has length 108 [2024-11-09 01:35:48,287 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 01:35:48,289 INFO L225 Difference]: With dead ends: 601 [2024-11-09 01:35:48,290 INFO L226 Difference]: Without dead ends: 392 [2024-11-09 01:35:48,290 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 109 GetRequests, 98 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 25 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=39, Invalid=117, Unknown=0, NotChecked=0, Total=156 [2024-11-09 01:35:48,291 INFO L432 NwaCegarLoop]: 113 mSDtfsCounter, 176 mSDsluCounter, 685 mSDsCounter, 0 mSdLazyCounter, 493 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 176 SdHoareTripleChecker+Valid, 798 SdHoareTripleChecker+Invalid, 494 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 493 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2024-11-09 01:35:48,291 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [176 Valid, 798 Invalid, 494 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 493 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2024-11-09 01:35:48,291 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 392 states. [2024-11-09 01:35:48,299 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 392 to 272. [2024-11-09 01:35:48,300 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 272 states, 240 states have (on average 1.3416666666666666) internal successors, (322), 241 states have internal predecessors, (322), 28 states have call successors, (28), 3 states have call predecessors, (28), 3 states have return successors, (28), 27 states have call predecessors, (28), 28 states have call successors, (28) [2024-11-09 01:35:48,300 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 272 states to 272 states and 378 transitions. [2024-11-09 01:35:48,301 INFO L78 Accepts]: Start accepts. Automaton has 272 states and 378 transitions. Word has length 108 [2024-11-09 01:35:48,301 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 01:35:48,301 INFO L471 AbstractCegarLoop]: Abstraction has 272 states and 378 transitions. [2024-11-09 01:35:48,301 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 5.090909090909091) internal successors, (56), 10 states have internal predecessors, (56), 1 states have call successors, (11), 1 states have call predecessors, (11), 1 states have return successors, (11), 1 states have call predecessors, (11), 1 states have call successors, (11) [2024-11-09 01:35:48,301 INFO L276 IsEmpty]: Start isEmpty. Operand 272 states and 378 transitions. [2024-11-09 01:35:48,302 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 109 [2024-11-09 01:35:48,302 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 01:35:48,302 INFO L215 NwaCegarLoop]: trace histogram [11, 11, 11, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 01:35:48,321 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2024-11-09 01:35:48,502 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8,2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-09 01:35:48,504 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-09 01:35:48,504 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 01:35:48,504 INFO L85 PathProgramCache]: Analyzing trace with hash -2143898872, now seen corresponding path program 1 times [2024-11-09 01:35:48,504 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 01:35:48,504 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1553423295] [2024-11-09 01:35:48,504 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 01:35:48,504 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 01:35:48,548 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unknown [2024-11-09 01:35:48,549 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [269429946] [2024-11-09 01:35:48,549 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 01:35:48,550 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-09 01:35:48,550 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-09 01:35:48,551 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-09 01:35:48,552 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2024-11-09 01:35:48,827 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:35:48,830 INFO L255 TraceCheckSpWp]: Trace formula consists of 407 conjuncts, 30 conjuncts are in the unsatisfiable core [2024-11-09 01:35:48,835 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-09 01:35:48,864 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-09 01:35:48,864 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 17 treesize of output 7 [2024-11-09 01:35:48,988 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 3 [2024-11-09 01:35:49,077 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 45 treesize of output 29 [2024-11-09 01:35:49,099 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 35 treesize of output 23 [2024-11-09 01:35:49,185 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 17 [2024-11-09 01:35:49,233 INFO L134 CoverageAnalysis]: Checked inductivity of 220 backedges. 0 proven. 120 refuted. 0 times theorem prover too weak. 100 trivial. 0 not checked. [2024-11-09 01:35:49,233 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-09 01:35:49,483 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 7 [2024-11-09 01:35:49,606 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 44 treesize of output 36 [2024-11-09 01:35:49,689 INFO L134 CoverageAnalysis]: Checked inductivity of 220 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 220 trivial. 0 not checked. [2024-11-09 01:35:49,689 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 01:35:49,690 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1553423295] [2024-11-09 01:35:49,690 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2024-11-09 01:35:49,690 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [269429946] [2024-11-09 01:35:49,690 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [269429946] provided 1 perfect and 1 imperfect interpolant sequences [2024-11-09 01:35:49,690 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-11-09 01:35:49,690 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [11] total 19 [2024-11-09 01:35:49,690 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1783518497] [2024-11-09 01:35:49,690 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 01:35:49,690 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-11-09 01:35:49,690 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 01:35:49,691 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-11-09 01:35:49,691 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=73, Invalid=269, Unknown=0, NotChecked=0, Total=342 [2024-11-09 01:35:49,691 INFO L87 Difference]: Start difference. First operand 272 states and 378 transitions. Second operand has 9 states, 9 states have (on average 6.222222222222222) internal successors, (56), 9 states have internal predecessors, (56), 1 states have call successors, (11), 1 states have call predecessors, (11), 1 states have return successors, (11), 1 states have call predecessors, (11), 1 states have call successors, (11) [2024-11-09 01:35:50,379 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 01:35:50,380 INFO L93 Difference]: Finished difference Result 627 states and 867 transitions. [2024-11-09 01:35:50,380 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-11-09 01:35:50,380 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 6.222222222222222) internal successors, (56), 9 states have internal predecessors, (56), 1 states have call successors, (11), 1 states have call predecessors, (11), 1 states have return successors, (11), 1 states have call predecessors, (11), 1 states have call successors, (11) Word has length 108 [2024-11-09 01:35:50,380 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 01:35:50,382 INFO L225 Difference]: With dead ends: 627 [2024-11-09 01:35:50,382 INFO L226 Difference]: Without dead ends: 418 [2024-11-09 01:35:50,383 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 218 GetRequests, 197 SyntacticMatches, 0 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 105 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=113, Invalid=393, Unknown=0, NotChecked=0, Total=506 [2024-11-09 01:35:50,383 INFO L432 NwaCegarLoop]: 150 mSDtfsCounter, 224 mSDsluCounter, 831 mSDsCounter, 0 mSdLazyCounter, 323 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 224 SdHoareTripleChecker+Valid, 981 SdHoareTripleChecker+Invalid, 326 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 323 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2024-11-09 01:35:50,383 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [224 Valid, 981 Invalid, 326 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 323 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2024-11-09 01:35:50,384 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 418 states. [2024-11-09 01:35:50,391 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 418 to 288. [2024-11-09 01:35:50,392 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 288 states, 256 states have (on average 1.3515625) internal successors, (346), 257 states have internal predecessors, (346), 28 states have call successors, (28), 3 states have call predecessors, (28), 3 states have return successors, (28), 27 states have call predecessors, (28), 28 states have call successors, (28) [2024-11-09 01:35:50,392 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 288 states to 288 states and 402 transitions. [2024-11-09 01:35:50,393 INFO L78 Accepts]: Start accepts. Automaton has 288 states and 402 transitions. Word has length 108 [2024-11-09 01:35:50,393 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 01:35:50,393 INFO L471 AbstractCegarLoop]: Abstraction has 288 states and 402 transitions. [2024-11-09 01:35:50,393 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 6.222222222222222) internal successors, (56), 9 states have internal predecessors, (56), 1 states have call successors, (11), 1 states have call predecessors, (11), 1 states have return successors, (11), 1 states have call predecessors, (11), 1 states have call successors, (11) [2024-11-09 01:35:50,393 INFO L276 IsEmpty]: Start isEmpty. Operand 288 states and 402 transitions. [2024-11-09 01:35:50,394 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 109 [2024-11-09 01:35:50,394 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 01:35:50,394 INFO L215 NwaCegarLoop]: trace histogram [11, 11, 11, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 01:35:50,408 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Ended with exit code 0 [2024-11-09 01:35:50,594 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable9 [2024-11-09 01:35:50,595 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-09 01:35:50,595 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 01:35:50,595 INFO L85 PathProgramCache]: Analyzing trace with hash -1338496313, now seen corresponding path program 1 times [2024-11-09 01:35:50,595 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 01:35:50,595 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1042279709] [2024-11-09 01:35:50,595 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 01:35:50,595 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 01:35:50,617 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:35:50,913 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-09 01:35:50,914 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:35:50,915 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-11-09 01:35:50,915 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:35:50,917 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2024-11-09 01:35:50,917 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:35:50,918 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-11-09 01:35:50,918 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:35:50,919 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2024-11-09 01:35:50,920 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:35:50,921 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2024-11-09 01:35:50,922 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:35:50,924 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2024-11-09 01:35:50,924 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:35:50,926 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 53 [2024-11-09 01:35:50,926 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:35:50,927 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2024-11-09 01:35:50,928 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:35:50,930 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2024-11-09 01:35:50,931 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:35:50,932 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2024-11-09 01:35:50,933 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:35:50,934 INFO L134 CoverageAnalysis]: Checked inductivity of 220 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 220 trivial. 0 not checked. [2024-11-09 01:35:50,934 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 01:35:50,935 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1042279709] [2024-11-09 01:35:50,935 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1042279709] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 01:35:50,935 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 01:35:50,935 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-09 01:35:50,935 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2103857406] [2024-11-09 01:35:50,935 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 01:35:50,935 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-09 01:35:50,935 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 01:35:50,936 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-09 01:35:50,936 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-11-09 01:35:50,936 INFO L87 Difference]: Start difference. First operand 288 states and 402 transitions. Second operand has 5 states, 5 states have (on average 11.2) internal successors, (56), 5 states have internal predecessors, (56), 2 states have call successors, (11), 1 states have call predecessors, (11), 1 states have return successors, (11), 2 states have call predecessors, (11), 2 states have call successors, (11) [2024-11-09 01:35:51,099 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 01:35:51,099 INFO L93 Difference]: Finished difference Result 514 states and 716 transitions. [2024-11-09 01:35:51,100 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-09 01:35:51,100 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 11.2) internal successors, (56), 5 states have internal predecessors, (56), 2 states have call successors, (11), 1 states have call predecessors, (11), 1 states have return successors, (11), 2 states have call predecessors, (11), 2 states have call successors, (11) Word has length 108 [2024-11-09 01:35:51,100 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 01:35:51,101 INFO L225 Difference]: With dead ends: 514 [2024-11-09 01:35:51,102 INFO L226 Difference]: Without dead ends: 288 [2024-11-09 01:35:51,102 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 32 GetRequests, 27 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2024-11-09 01:35:51,102 INFO L432 NwaCegarLoop]: 183 mSDtfsCounter, 256 mSDsluCounter, 169 mSDsCounter, 0 mSdLazyCounter, 113 mSolverCounterSat, 25 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 256 SdHoareTripleChecker+Valid, 352 SdHoareTripleChecker+Invalid, 138 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 25 IncrementalHoareTripleChecker+Valid, 113 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-09 01:35:51,103 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [256 Valid, 352 Invalid, 138 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [25 Valid, 113 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-09 01:35:51,103 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 288 states. [2024-11-09 01:35:51,114 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 288 to 288. [2024-11-09 01:35:51,114 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 288 states, 256 states have (on average 1.34375) internal successors, (344), 257 states have internal predecessors, (344), 28 states have call successors, (28), 3 states have call predecessors, (28), 3 states have return successors, (28), 27 states have call predecessors, (28), 28 states have call successors, (28) [2024-11-09 01:35:51,115 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 288 states to 288 states and 400 transitions. [2024-11-09 01:35:51,115 INFO L78 Accepts]: Start accepts. Automaton has 288 states and 400 transitions. Word has length 108 [2024-11-09 01:35:51,115 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 01:35:51,116 INFO L471 AbstractCegarLoop]: Abstraction has 288 states and 400 transitions. [2024-11-09 01:35:51,116 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 11.2) internal successors, (56), 5 states have internal predecessors, (56), 2 states have call successors, (11), 1 states have call predecessors, (11), 1 states have return successors, (11), 2 states have call predecessors, (11), 2 states have call successors, (11) [2024-11-09 01:35:51,116 INFO L276 IsEmpty]: Start isEmpty. Operand 288 states and 400 transitions. [2024-11-09 01:35:51,117 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 109 [2024-11-09 01:35:51,117 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 01:35:51,117 INFO L215 NwaCegarLoop]: trace histogram [11, 11, 11, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 01:35:51,117 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2024-11-09 01:35:51,117 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-09 01:35:51,117 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 01:35:51,118 INFO L85 PathProgramCache]: Analyzing trace with hash -43955706, now seen corresponding path program 1 times [2024-11-09 01:35:51,118 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 01:35:51,118 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1140526483] [2024-11-09 01:35:51,118 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 01:35:51,118 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 01:35:51,162 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unknown [2024-11-09 01:35:51,164 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [498376205] [2024-11-09 01:35:51,164 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 01:35:51,164 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-09 01:35:51,164 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-09 01:35:51,166 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-09 01:35:51,166 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2024-11-09 01:35:51,379 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:35:51,382 INFO L255 TraceCheckSpWp]: Trace formula consists of 409 conjuncts, 34 conjuncts are in the unsatisfiable core [2024-11-09 01:35:51,387 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-09 01:35:51,517 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 1 [2024-11-09 01:35:51,570 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 25 treesize of output 13 [2024-11-09 01:35:51,665 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-09 01:35:51,666 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 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 54 treesize of output 43 [2024-11-09 01:35:51,828 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-09 01:35:51,829 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 40 treesize of output 22 [2024-11-09 01:35:51,832 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 15 [2024-11-09 01:35:51,879 INFO L134 CoverageAnalysis]: Checked inductivity of 220 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 220 trivial. 0 not checked. [2024-11-09 01:35:51,880 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-09 01:35:51,880 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 01:35:51,880 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1140526483] [2024-11-09 01:35:51,880 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2024-11-09 01:35:51,880 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [498376205] [2024-11-09 01:35:51,880 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [498376205] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 01:35:51,880 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 01:35:51,880 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2024-11-09 01:35:51,880 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [480900995] [2024-11-09 01:35:51,881 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 01:35:51,881 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2024-11-09 01:35:51,881 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 01:35:51,881 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2024-11-09 01:35:51,881 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=83, Unknown=0, NotChecked=0, Total=110 [2024-11-09 01:35:51,882 INFO L87 Difference]: Start difference. First operand 288 states and 400 transitions. Second operand has 11 states, 11 states have (on average 5.090909090909091) internal successors, (56), 10 states have internal predecessors, (56), 1 states have call successors, (11), 1 states have call predecessors, (11), 1 states have return successors, (11), 1 states have call predecessors, (11), 1 states have call successors, (11) [2024-11-09 01:35:52,564 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 01:35:52,564 INFO L93 Difference]: Finished difference Result 644 states and 889 transitions. [2024-11-09 01:35:52,565 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-11-09 01:35:52,565 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 11 states have (on average 5.090909090909091) internal successors, (56), 10 states have internal predecessors, (56), 1 states have call successors, (11), 1 states have call predecessors, (11), 1 states have return successors, (11), 1 states have call predecessors, (11), 1 states have call successors, (11) Word has length 108 [2024-11-09 01:35:52,565 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 01:35:52,566 INFO L225 Difference]: With dead ends: 644 [2024-11-09 01:35:52,566 INFO L226 Difference]: Without dead ends: 418 [2024-11-09 01:35:52,567 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 109 GetRequests, 98 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 25 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=39, Invalid=117, Unknown=0, NotChecked=0, Total=156 [2024-11-09 01:35:52,567 INFO L432 NwaCegarLoop]: 166 mSDtfsCounter, 261 mSDsluCounter, 752 mSDsCounter, 0 mSdLazyCounter, 455 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 261 SdHoareTripleChecker+Valid, 918 SdHoareTripleChecker+Invalid, 456 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 455 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2024-11-09 01:35:52,567 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [261 Valid, 918 Invalid, 456 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 455 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2024-11-09 01:35:52,568 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 418 states. [2024-11-09 01:35:52,576 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 418 to 304. [2024-11-09 01:35:52,577 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 304 states, 272 states have (on average 1.349264705882353) internal successors, (367), 273 states have internal predecessors, (367), 28 states have call successors, (28), 3 states have call predecessors, (28), 3 states have return successors, (28), 27 states have call predecessors, (28), 28 states have call successors, (28) [2024-11-09 01:35:52,577 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 304 states to 304 states and 423 transitions. [2024-11-09 01:35:52,578 INFO L78 Accepts]: Start accepts. Automaton has 304 states and 423 transitions. Word has length 108 [2024-11-09 01:35:52,578 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 01:35:52,578 INFO L471 AbstractCegarLoop]: Abstraction has 304 states and 423 transitions. [2024-11-09 01:35:52,578 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 5.090909090909091) internal successors, (56), 10 states have internal predecessors, (56), 1 states have call successors, (11), 1 states have call predecessors, (11), 1 states have return successors, (11), 1 states have call predecessors, (11), 1 states have call successors, (11) [2024-11-09 01:35:52,578 INFO L276 IsEmpty]: Start isEmpty. Operand 304 states and 423 transitions. [2024-11-09 01:35:52,579 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 109 [2024-11-09 01:35:52,579 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 01:35:52,579 INFO L215 NwaCegarLoop]: trace histogram [11, 11, 11, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 01:35:52,594 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Ended with exit code 0 [2024-11-09 01:35:52,780 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-09 01:35:52,781 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-09 01:35:52,781 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 01:35:52,781 INFO L85 PathProgramCache]: Analyzing trace with hash -1065024060, now seen corresponding path program 1 times [2024-11-09 01:35:52,781 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 01:35:52,781 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [792996285] [2024-11-09 01:35:52,781 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 01:35:52,782 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 01:35:52,829 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:35:53,340 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-09 01:35:53,342 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:35:53,343 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-11-09 01:35:53,343 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:35:53,344 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2024-11-09 01:35:53,345 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:35:53,345 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-11-09 01:35:53,346 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:35:53,346 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2024-11-09 01:35:53,347 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:35:53,348 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2024-11-09 01:35:53,348 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:35:53,349 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2024-11-09 01:35:53,350 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:35:53,351 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 53 [2024-11-09 01:35:53,351 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:35:53,352 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2024-11-09 01:35:53,352 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:35:53,353 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2024-11-09 01:35:53,354 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:35:53,354 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2024-11-09 01:35:53,355 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:35:53,356 INFO L134 CoverageAnalysis]: Checked inductivity of 220 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 220 trivial. 0 not checked. [2024-11-09 01:35:53,356 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 01:35:53,356 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [792996285] [2024-11-09 01:35:53,356 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [792996285] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 01:35:53,356 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 01:35:53,356 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-11-09 01:35:53,358 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1593482799] [2024-11-09 01:35:53,358 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 01:35:53,358 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-11-09 01:35:53,358 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 01:35:53,359 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-11-09 01:35:53,359 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2024-11-09 01:35:53,359 INFO L87 Difference]: Start difference. First operand 304 states and 423 transitions. Second operand has 7 states, 6 states have (on average 9.333333333333334) internal successors, (56), 7 states have internal predecessors, (56), 2 states have call successors, (11), 1 states have call predecessors, (11), 1 states have return successors, (11), 1 states have call predecessors, (11), 2 states have call successors, (11) [2024-11-09 01:35:53,542 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 01:35:53,542 INFO L93 Difference]: Finished difference Result 633 states and 876 transitions. [2024-11-09 01:35:53,543 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-11-09 01:35:53,543 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 6 states have (on average 9.333333333333334) internal successors, (56), 7 states have internal predecessors, (56), 2 states have call successors, (11), 1 states have call predecessors, (11), 1 states have return successors, (11), 1 states have call predecessors, (11), 2 states have call successors, (11) Word has length 108 [2024-11-09 01:35:53,543 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 01:35:53,545 INFO L225 Difference]: With dead ends: 633 [2024-11-09 01:35:53,545 INFO L226 Difference]: Without dead ends: 407 [2024-11-09 01:35:53,545 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 36 GetRequests, 28 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=23, Invalid=67, Unknown=0, NotChecked=0, Total=90 [2024-11-09 01:35:53,546 INFO L432 NwaCegarLoop]: 235 mSDtfsCounter, 118 mSDsluCounter, 989 mSDsCounter, 0 mSdLazyCounter, 185 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 119 SdHoareTripleChecker+Valid, 1224 SdHoareTripleChecker+Invalid, 185 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 185 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-09 01:35:53,546 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [119 Valid, 1224 Invalid, 185 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 185 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-09 01:35:53,546 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 407 states. [2024-11-09 01:35:53,558 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 407 to 404. [2024-11-09 01:35:53,559 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 404 states, 362 states have (on average 1.3453038674033149) internal successors, (487), 364 states have internal predecessors, (487), 37 states have call successors, (37), 4 states have call predecessors, (37), 4 states have return successors, (37), 35 states have call predecessors, (37), 37 states have call successors, (37) [2024-11-09 01:35:53,560 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 404 states to 404 states and 561 transitions. [2024-11-09 01:35:53,560 INFO L78 Accepts]: Start accepts. Automaton has 404 states and 561 transitions. Word has length 108 [2024-11-09 01:35:53,560 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 01:35:53,561 INFO L471 AbstractCegarLoop]: Abstraction has 404 states and 561 transitions. [2024-11-09 01:35:53,561 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 6 states have (on average 9.333333333333334) internal successors, (56), 7 states have internal predecessors, (56), 2 states have call successors, (11), 1 states have call predecessors, (11), 1 states have return successors, (11), 1 states have call predecessors, (11), 2 states have call successors, (11) [2024-11-09 01:35:53,561 INFO L276 IsEmpty]: Start isEmpty. Operand 404 states and 561 transitions. [2024-11-09 01:35:53,562 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 109 [2024-11-09 01:35:53,562 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 01:35:53,562 INFO L215 NwaCegarLoop]: trace histogram [11, 11, 11, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 01:35:53,562 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2024-11-09 01:35:53,562 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-09 01:35:53,562 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 01:35:53,562 INFO L85 PathProgramCache]: Analyzing trace with hash -1632303608, now seen corresponding path program 1 times [2024-11-09 01:35:53,562 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 01:35:53,562 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1754629687] [2024-11-09 01:35:53,562 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 01:35:53,562 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 01:35:53,623 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unknown [2024-11-09 01:35:53,625 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [719513832] [2024-11-09 01:35:53,625 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 01:35:53,625 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-09 01:35:53,625 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-09 01:35:53,628 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-09 01:35:53,637 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2024-11-09 01:35:53,963 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:35:53,969 INFO L255 TraceCheckSpWp]: Trace formula consists of 407 conjuncts, 33 conjuncts are in the unsatisfiable core [2024-11-09 01:35:53,974 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-09 01:35:53,997 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 9 treesize of output 3 [2024-11-09 01:35:54,137 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 3 [2024-11-09 01:35:54,251 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 45 treesize of output 40 [2024-11-09 01:35:54,288 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 48 treesize of output 30 [2024-11-09 01:35:54,337 INFO L134 CoverageAnalysis]: Checked inductivity of 220 backedges. 0 proven. 120 refuted. 0 times theorem prover too weak. 100 trivial. 0 not checked. [2024-11-09 01:35:54,338 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-09 01:35:54,809 INFO L134 CoverageAnalysis]: Checked inductivity of 220 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 220 trivial. 0 not checked. [2024-11-09 01:35:54,809 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 01:35:54,809 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1754629687] [2024-11-09 01:35:54,810 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2024-11-09 01:35:54,810 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [719513832] [2024-11-09 01:35:54,810 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [719513832] provided 1 perfect and 1 imperfect interpolant sequences [2024-11-09 01:35:54,810 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-11-09 01:35:54,810 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [9] total 17 [2024-11-09 01:35:54,810 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [175211676] [2024-11-09 01:35:54,810 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 01:35:54,810 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-11-09 01:35:54,810 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 01:35:54,811 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-11-09 01:35:54,811 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=59, Invalid=213, Unknown=0, NotChecked=0, Total=272 [2024-11-09 01:35:54,811 INFO L87 Difference]: Start difference. First operand 404 states and 561 transitions. Second operand has 9 states, 9 states have (on average 6.222222222222222) internal successors, (56), 9 states have internal predecessors, (56), 1 states have call successors, (11), 1 states have call predecessors, (11), 1 states have return successors, (11), 1 states have call predecessors, (11), 1 states have call successors, (11) [2024-11-09 01:35:55,446 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 01:35:55,446 INFO L93 Difference]: Finished difference Result 858 states and 1184 transitions. [2024-11-09 01:35:55,446 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-11-09 01:35:55,447 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 6.222222222222222) internal successors, (56), 9 states have internal predecessors, (56), 1 states have call successors, (11), 1 states have call predecessors, (11), 1 states have return successors, (11), 1 states have call predecessors, (11), 1 states have call successors, (11) Word has length 108 [2024-11-09 01:35:55,447 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 01:35:55,450 INFO L225 Difference]: With dead ends: 858 [2024-11-09 01:35:55,450 INFO L226 Difference]: Without dead ends: 532 [2024-11-09 01:35:55,451 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 218 GetRequests, 199 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 71 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=100, Invalid=320, Unknown=0, NotChecked=0, Total=420 [2024-11-09 01:35:55,451 INFO L432 NwaCegarLoop]: 226 mSDtfsCounter, 375 mSDsluCounter, 803 mSDsCounter, 0 mSdLazyCounter, 266 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 375 SdHoareTripleChecker+Valid, 1029 SdHoareTripleChecker+Invalid, 270 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 266 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2024-11-09 01:35:55,451 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [375 Valid, 1029 Invalid, 270 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 266 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2024-11-09 01:35:55,452 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 532 states. [2024-11-09 01:35:55,465 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 532 to 419. [2024-11-09 01:35:55,466 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 419 states, 377 states have (on average 1.3501326259946949) internal successors, (509), 379 states have internal predecessors, (509), 37 states have call successors, (37), 4 states have call predecessors, (37), 4 states have return successors, (37), 35 states have call predecessors, (37), 37 states have call successors, (37) [2024-11-09 01:35:55,467 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 419 states to 419 states and 583 transitions. [2024-11-09 01:35:55,467 INFO L78 Accepts]: Start accepts. Automaton has 419 states and 583 transitions. Word has length 108 [2024-11-09 01:35:55,468 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 01:35:55,468 INFO L471 AbstractCegarLoop]: Abstraction has 419 states and 583 transitions. [2024-11-09 01:35:55,468 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 6.222222222222222) internal successors, (56), 9 states have internal predecessors, (56), 1 states have call successors, (11), 1 states have call predecessors, (11), 1 states have return successors, (11), 1 states have call predecessors, (11), 1 states have call successors, (11) [2024-11-09 01:35:55,468 INFO L276 IsEmpty]: Start isEmpty. Operand 419 states and 583 transitions. [2024-11-09 01:35:55,469 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 109 [2024-11-09 01:35:55,469 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 01:35:55,469 INFO L215 NwaCegarLoop]: trace histogram [11, 11, 11, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 01:35:55,486 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Forceful destruction successful, exit code 0 [2024-11-09 01:35:55,669 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13,5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-09 01:35:55,670 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-09 01:35:55,670 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 01:35:55,671 INFO L85 PathProgramCache]: Analyzing trace with hash 830652424, now seen corresponding path program 1 times [2024-11-09 01:35:55,671 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 01:35:55,671 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1283837875] [2024-11-09 01:35:55,674 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 01:35:55,674 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 01:35:55,729 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unknown [2024-11-09 01:35:55,731 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [339203679] [2024-11-09 01:35:55,731 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 01:35:55,731 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-09 01:35:55,731 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-09 01:35:55,733 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-09 01:35:55,734 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2024-11-09 01:35:55,910 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:35:55,914 INFO L255 TraceCheckSpWp]: Trace formula consists of 407 conjuncts, 11 conjuncts are in the unsatisfiable core [2024-11-09 01:35:55,917 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-09 01:35:56,061 INFO L134 CoverageAnalysis]: Checked inductivity of 220 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 220 trivial. 0 not checked. [2024-11-09 01:35:56,061 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-09 01:35:56,061 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 01:35:56,062 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1283837875] [2024-11-09 01:35:56,062 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2024-11-09 01:35:56,062 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [339203679] [2024-11-09 01:35:56,062 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [339203679] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 01:35:56,062 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 01:35:56,062 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-11-09 01:35:56,062 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [456043466] [2024-11-09 01:35:56,062 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 01:35:56,062 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-11-09 01:35:56,063 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 01:35:56,063 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-11-09 01:35:56,065 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2024-11-09 01:35:56,065 INFO L87 Difference]: Start difference. First operand 419 states and 583 transitions. Second operand has 7 states, 7 states have (on average 8.0) internal successors, (56), 6 states have internal predecessors, (56), 1 states have call successors, (11), 1 states have call predecessors, (11), 1 states have return successors, (11), 1 states have call predecessors, (11), 1 states have call successors, (11) [2024-11-09 01:35:56,320 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 01:35:56,320 INFO L93 Difference]: Finished difference Result 1138 states and 1571 transitions. [2024-11-09 01:35:56,323 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-11-09 01:35:56,323 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 8.0) internal successors, (56), 6 states have internal predecessors, (56), 1 states have call successors, (11), 1 states have call predecessors, (11), 1 states have return successors, (11), 1 states have call predecessors, (11), 1 states have call successors, (11) Word has length 108 [2024-11-09 01:35:56,323 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 01:35:56,326 INFO L225 Difference]: With dead ends: 1138 [2024-11-09 01:35:56,326 INFO L226 Difference]: Without dead ends: 796 [2024-11-09 01:35:56,327 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 109 GetRequests, 102 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=23, Invalid=49, Unknown=0, NotChecked=0, Total=72 [2024-11-09 01:35:56,328 INFO L432 NwaCegarLoop]: 124 mSDtfsCounter, 207 mSDsluCounter, 544 mSDsCounter, 0 mSdLazyCounter, 236 mSolverCounterSat, 24 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 207 SdHoareTripleChecker+Valid, 668 SdHoareTripleChecker+Invalid, 260 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 24 IncrementalHoareTripleChecker+Valid, 236 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-11-09 01:35:56,329 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [207 Valid, 668 Invalid, 260 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [24 Valid, 236 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-11-09 01:35:56,330 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 796 states. [2024-11-09 01:35:56,343 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 796 to 472. [2024-11-09 01:35:56,343 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 472 states, 430 states have (on average 1.3488372093023255) internal successors, (580), 432 states have internal predecessors, (580), 37 states have call successors, (37), 4 states have call predecessors, (37), 4 states have return successors, (37), 35 states have call predecessors, (37), 37 states have call successors, (37) [2024-11-09 01:35:56,345 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 472 states to 472 states and 654 transitions. [2024-11-09 01:35:56,345 INFO L78 Accepts]: Start accepts. Automaton has 472 states and 654 transitions. Word has length 108 [2024-11-09 01:35:56,345 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 01:35:56,345 INFO L471 AbstractCegarLoop]: Abstraction has 472 states and 654 transitions. [2024-11-09 01:35:56,345 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 8.0) internal successors, (56), 6 states have internal predecessors, (56), 1 states have call successors, (11), 1 states have call predecessors, (11), 1 states have return successors, (11), 1 states have call predecessors, (11), 1 states have call successors, (11) [2024-11-09 01:35:56,345 INFO L276 IsEmpty]: Start isEmpty. Operand 472 states and 654 transitions. [2024-11-09 01:35:56,346 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 109 [2024-11-09 01:35:56,346 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 01:35:56,346 INFO L215 NwaCegarLoop]: trace histogram [11, 11, 11, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 01:35:56,365 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Ended with exit code 0 [2024-11-09 01:35:56,550 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable14 [2024-11-09 01:35:56,551 INFO L396 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-09 01:35:56,553 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 01:35:56,554 INFO L85 PathProgramCache]: Analyzing trace with hash -757695478, now seen corresponding path program 1 times [2024-11-09 01:35:56,554 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 01:35:56,554 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [742931106] [2024-11-09 01:35:56,554 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 01:35:56,554 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 01:35:56,611 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:35:57,493 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-09 01:35:57,494 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:35:57,495 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-11-09 01:35:57,496 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:35:57,497 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2024-11-09 01:35:57,497 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:35:57,498 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-11-09 01:35:57,498 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:35:57,499 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2024-11-09 01:35:57,499 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:35:57,500 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2024-11-09 01:35:57,501 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:35:57,501 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2024-11-09 01:35:57,502 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:35:57,502 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 53 [2024-11-09 01:35:57,503 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:35:57,504 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2024-11-09 01:35:57,506 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:35:57,535 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2024-11-09 01:35:57,537 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:35:57,538 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2024-11-09 01:35:57,543 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:35:57,567 INFO L134 CoverageAnalysis]: Checked inductivity of 220 backedges. 51 proven. 3 refuted. 0 times theorem prover too weak. 166 trivial. 0 not checked. [2024-11-09 01:35:57,567 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 01:35:57,567 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [742931106] [2024-11-09 01:35:57,567 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [742931106] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-09 01:35:57,567 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [248461812] [2024-11-09 01:35:57,567 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 01:35:57,568 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-09 01:35:57,568 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-09 01:35:57,570 INFO L229 MonitoredProcess]: Starting monitored process 7 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-09 01:35:57,575 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Waiting until timeout for monitored process [2024-11-09 01:35:57,877 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:35:57,879 INFO L255 TraceCheckSpWp]: Trace formula consists of 405 conjuncts, 23 conjuncts are in the unsatisfiable core [2024-11-09 01:35:57,883 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-09 01:35:57,952 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 1 [2024-11-09 01:35:57,975 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 3 [2024-11-09 01:35:58,041 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 42 treesize of output 26 [2024-11-09 01:35:58,105 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 22 [2024-11-09 01:35:58,108 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 18 [2024-11-09 01:35:58,175 INFO L134 CoverageAnalysis]: Checked inductivity of 220 backedges. 0 proven. 72 refuted. 0 times theorem prover too weak. 148 trivial. 0 not checked. [2024-11-09 01:35:58,176 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-09 01:35:58,430 INFO L134 CoverageAnalysis]: Checked inductivity of 220 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 220 trivial. 0 not checked. [2024-11-09 01:35:58,431 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [248461812] provided 1 perfect and 1 imperfect interpolant sequences [2024-11-09 01:35:58,431 INFO L185 FreeRefinementEngine]: Found 1 perfect and 2 imperfect interpolant sequences. [2024-11-09 01:35:58,431 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [12, 8] total 21 [2024-11-09 01:35:58,431 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1455935534] [2024-11-09 01:35:58,431 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 01:35:58,431 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-11-09 01:35:58,431 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 01:35:58,432 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-11-09 01:35:58,433 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=77, Invalid=343, Unknown=0, NotChecked=0, Total=420 [2024-11-09 01:35:58,433 INFO L87 Difference]: Start difference. First operand 472 states and 654 transitions. Second operand has 7 states, 7 states have (on average 8.0) internal successors, (56), 7 states have internal predecessors, (56), 1 states have call successors, (11), 1 states have call predecessors, (11), 1 states have return successors, (11), 1 states have call predecessors, (11), 1 states have call successors, (11) [2024-11-09 01:35:58,928 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 01:35:58,928 INFO L93 Difference]: Finished difference Result 878 states and 1214 transitions. [2024-11-09 01:35:58,929 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-11-09 01:35:58,929 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 8.0) internal successors, (56), 7 states have internal predecessors, (56), 1 states have call successors, (11), 1 states have call predecessors, (11), 1 states have return successors, (11), 1 states have call predecessors, (11), 1 states have call successors, (11) Word has length 108 [2024-11-09 01:35:58,929 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 01:35:58,931 INFO L225 Difference]: With dead ends: 878 [2024-11-09 01:35:58,931 INFO L226 Difference]: Without dead ends: 536 [2024-11-09 01:35:58,932 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 255 GetRequests, 230 SyntacticMatches, 2 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 161 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=110, Invalid=490, Unknown=0, NotChecked=0, Total=600 [2024-11-09 01:35:58,932 INFO L432 NwaCegarLoop]: 223 mSDtfsCounter, 130 mSDsluCounter, 831 mSDsCounter, 0 mSdLazyCounter, 258 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 136 SdHoareTripleChecker+Valid, 1054 SdHoareTripleChecker+Invalid, 261 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 258 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2024-11-09 01:35:58,932 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [136 Valid, 1054 Invalid, 261 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 258 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2024-11-09 01:35:58,933 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 536 states. [2024-11-09 01:35:58,944 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 536 to 462. [2024-11-09 01:35:58,944 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 462 states, 420 states have (on average 1.3476190476190477) internal successors, (566), 422 states have internal predecessors, (566), 37 states have call successors, (37), 4 states have call predecessors, (37), 4 states have return successors, (37), 35 states have call predecessors, (37), 37 states have call successors, (37) [2024-11-09 01:35:58,946 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 462 states to 462 states and 640 transitions. [2024-11-09 01:35:58,946 INFO L78 Accepts]: Start accepts. Automaton has 462 states and 640 transitions. Word has length 108 [2024-11-09 01:35:58,946 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 01:35:58,946 INFO L471 AbstractCegarLoop]: Abstraction has 462 states and 640 transitions. [2024-11-09 01:35:58,947 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 8.0) internal successors, (56), 7 states have internal predecessors, (56), 1 states have call successors, (11), 1 states have call predecessors, (11), 1 states have return successors, (11), 1 states have call predecessors, (11), 1 states have call successors, (11) [2024-11-09 01:35:58,947 INFO L276 IsEmpty]: Start isEmpty. Operand 462 states and 640 transitions. [2024-11-09 01:35:58,947 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 109 [2024-11-09 01:35:58,947 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 01:35:58,948 INFO L215 NwaCegarLoop]: trace histogram [11, 11, 11, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 01:35:58,962 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Forceful destruction successful, exit code 0 [2024-11-09 01:35:59,151 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 7 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable15 [2024-11-09 01:35:59,152 INFO L396 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-09 01:35:59,152 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 01:35:59,152 INFO L85 PathProgramCache]: Analyzing trace with hash -246100214, now seen corresponding path program 1 times [2024-11-09 01:35:59,152 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 01:35:59,152 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1839897437] [2024-11-09 01:35:59,152 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 01:35:59,152 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 01:35:59,211 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:35:59,809 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-09 01:35:59,809 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:35:59,810 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-11-09 01:35:59,811 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:35:59,811 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2024-11-09 01:35:59,812 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:35:59,820 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-11-09 01:35:59,821 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:35:59,821 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2024-11-09 01:35:59,822 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:35:59,822 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2024-11-09 01:35:59,823 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:35:59,828 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2024-11-09 01:35:59,829 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:35:59,829 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 53 [2024-11-09 01:35:59,830 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:35:59,830 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2024-11-09 01:35:59,831 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:35:59,835 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2024-11-09 01:35:59,836 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:35:59,837 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2024-11-09 01:35:59,837 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:35:59,838 INFO L134 CoverageAnalysis]: Checked inductivity of 220 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 220 trivial. 0 not checked. [2024-11-09 01:35:59,841 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 01:35:59,841 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1839897437] [2024-11-09 01:35:59,841 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1839897437] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 01:35:59,841 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 01:35:59,841 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-11-09 01:35:59,841 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [460756120] [2024-11-09 01:35:59,841 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 01:35:59,842 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-11-09 01:35:59,842 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 01:35:59,842 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-11-09 01:35:59,842 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2024-11-09 01:35:59,842 INFO L87 Difference]: Start difference. First operand 462 states and 640 transitions. Second operand has 8 states, 7 states have (on average 8.0) internal successors, (56), 8 states have internal predecessors, (56), 2 states have call successors, (11), 1 states have call predecessors, (11), 1 states have return successors, (11), 1 states have call predecessors, (11), 2 states have call successors, (11) [2024-11-09 01:36:00,179 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 01:36:00,179 INFO L93 Difference]: Finished difference Result 870 states and 1203 transitions. [2024-11-09 01:36:00,180 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-11-09 01:36:00,180 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 7 states have (on average 8.0) internal successors, (56), 8 states have internal predecessors, (56), 2 states have call successors, (11), 1 states have call predecessors, (11), 1 states have return successors, (11), 1 states have call predecessors, (11), 2 states have call successors, (11) Word has length 108 [2024-11-09 01:36:00,180 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 01:36:00,182 INFO L225 Difference]: With dead ends: 870 [2024-11-09 01:36:00,182 INFO L226 Difference]: Without dead ends: 526 [2024-11-09 01:36:00,183 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 34 GetRequests, 27 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=20, Invalid=52, Unknown=0, NotChecked=0, Total=72 [2024-11-09 01:36:00,183 INFO L432 NwaCegarLoop]: 225 mSDtfsCounter, 101 mSDsluCounter, 788 mSDsCounter, 0 mSdLazyCounter, 250 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 102 SdHoareTripleChecker+Valid, 1013 SdHoareTripleChecker+Invalid, 251 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 250 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2024-11-09 01:36:00,183 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [102 Valid, 1013 Invalid, 251 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 250 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2024-11-09 01:36:00,184 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 526 states. [2024-11-09 01:36:00,211 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 526 to 452. [2024-11-09 01:36:00,211 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 452 states, 410 states have (on average 1.3463414634146342) internal successors, (552), 412 states have internal predecessors, (552), 37 states have call successors, (37), 4 states have call predecessors, (37), 4 states have return successors, (37), 35 states have call predecessors, (37), 37 states have call successors, (37) [2024-11-09 01:36:00,212 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 452 states to 452 states and 626 transitions. [2024-11-09 01:36:00,213 INFO L78 Accepts]: Start accepts. Automaton has 452 states and 626 transitions. Word has length 108 [2024-11-09 01:36:00,213 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 01:36:00,213 INFO L471 AbstractCegarLoop]: Abstraction has 452 states and 626 transitions. [2024-11-09 01:36:00,213 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 7 states have (on average 8.0) internal successors, (56), 8 states have internal predecessors, (56), 2 states have call successors, (11), 1 states have call predecessors, (11), 1 states have return successors, (11), 1 states have call predecessors, (11), 2 states have call successors, (11) [2024-11-09 01:36:00,213 INFO L276 IsEmpty]: Start isEmpty. Operand 452 states and 626 transitions. [2024-11-09 01:36:00,215 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 110 [2024-11-09 01:36:00,216 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 01:36:00,216 INFO L215 NwaCegarLoop]: trace histogram [11, 11, 11, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 01:36:00,216 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2024-11-09 01:36:00,216 INFO L396 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-09 01:36:00,216 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 01:36:00,216 INFO L85 PathProgramCache]: Analyzing trace with hash -872905945, now seen corresponding path program 1 times [2024-11-09 01:36:00,216 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 01:36:00,216 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [29822551] [2024-11-09 01:36:00,216 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 01:36:00,216 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 01:36:00,278 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unknown [2024-11-09 01:36:00,280 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1385546812] [2024-11-09 01:36:00,281 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 01:36:00,281 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-09 01:36:00,281 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-09 01:36:00,283 INFO L229 MonitoredProcess]: Starting monitored process 8 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-09 01:36:00,285 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Waiting until timeout for monitored process [2024-11-09 01:36:00,542 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:36:00,545 INFO L255 TraceCheckSpWp]: Trace formula consists of 411 conjuncts, 7 conjuncts are in the unsatisfiable core [2024-11-09 01:36:00,547 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-09 01:36:00,601 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-09 01:36:00,601 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 19 treesize of output 9 [2024-11-09 01:36:00,690 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 7 [2024-11-09 01:36:00,724 INFO L134 CoverageAnalysis]: Checked inductivity of 220 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 220 trivial. 0 not checked. [2024-11-09 01:36:00,724 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-09 01:36:00,725 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 01:36:00,725 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [29822551] [2024-11-09 01:36:00,725 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2024-11-09 01:36:00,725 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1385546812] [2024-11-09 01:36:00,725 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1385546812] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 01:36:00,725 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 01:36:00,725 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-11-09 01:36:00,725 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [931609866] [2024-11-09 01:36:00,725 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 01:36:00,725 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-09 01:36:00,725 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 01:36:00,726 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-09 01:36:00,726 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2024-11-09 01:36:00,726 INFO L87 Difference]: Start difference. First operand 452 states and 626 transitions. Second operand has 6 states, 6 states have (on average 9.5) internal successors, (57), 6 states have internal predecessors, (57), 1 states have call successors, (11), 1 states have call predecessors, (11), 1 states have return successors, (11), 1 states have call predecessors, (11), 1 states have call successors, (11) [2024-11-09 01:36:00,983 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 01:36:00,983 INFO L93 Difference]: Finished difference Result 1022 states and 1411 transitions. [2024-11-09 01:36:00,986 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-09 01:36:00,986 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 9.5) internal successors, (57), 6 states have internal predecessors, (57), 1 states have call successors, (11), 1 states have call predecessors, (11), 1 states have return successors, (11), 1 states have call predecessors, (11), 1 states have call successors, (11) Word has length 109 [2024-11-09 01:36:00,986 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 01:36:00,988 INFO L225 Difference]: With dead ends: 1022 [2024-11-09 01:36:00,988 INFO L226 Difference]: Without dead ends: 676 [2024-11-09 01:36:00,989 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 109 GetRequests, 104 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2024-11-09 01:36:00,990 INFO L432 NwaCegarLoop]: 217 mSDtfsCounter, 129 mSDsluCounter, 627 mSDsCounter, 0 mSdLazyCounter, 130 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 129 SdHoareTripleChecker+Valid, 844 SdHoareTripleChecker+Invalid, 131 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 130 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-11-09 01:36:00,990 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [129 Valid, 844 Invalid, 131 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 130 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-11-09 01:36:00,991 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 676 states. [2024-11-09 01:36:01,009 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 676 to 672. [2024-11-09 01:36:01,010 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 672 states, 607 states have (on average 1.3393739703459637) internal successors, (813), 611 states have internal predecessors, (813), 57 states have call successors, (57), 7 states have call predecessors, (57), 7 states have return successors, (57), 53 states have call predecessors, (57), 57 states have call successors, (57) [2024-11-09 01:36:01,012 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 672 states to 672 states and 927 transitions. [2024-11-09 01:36:01,013 INFO L78 Accepts]: Start accepts. Automaton has 672 states and 927 transitions. Word has length 109 [2024-11-09 01:36:01,013 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 01:36:01,013 INFO L471 AbstractCegarLoop]: Abstraction has 672 states and 927 transitions. [2024-11-09 01:36:01,013 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 9.5) internal successors, (57), 6 states have internal predecessors, (57), 1 states have call successors, (11), 1 states have call predecessors, (11), 1 states have return successors, (11), 1 states have call predecessors, (11), 1 states have call successors, (11) [2024-11-09 01:36:01,013 INFO L276 IsEmpty]: Start isEmpty. Operand 672 states and 927 transitions. [2024-11-09 01:36:01,014 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 110 [2024-11-09 01:36:01,014 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 01:36:01,014 INFO L215 NwaCegarLoop]: trace histogram [11, 11, 11, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 01:36:01,033 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Ended with exit code 0 [2024-11-09 01:36:01,214 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17,8 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-09 01:36:01,215 INFO L396 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-09 01:36:01,215 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 01:36:01,215 INFO L85 PathProgramCache]: Analyzing trace with hash -850273691, now seen corresponding path program 1 times [2024-11-09 01:36:01,219 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 01:36:01,219 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1241034014] [2024-11-09 01:36:01,219 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 01:36:01,220 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 01:36:01,295 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unknown [2024-11-09 01:36:01,306 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1109366683] [2024-11-09 01:36:01,306 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 01:36:01,306 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-09 01:36:01,306 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-09 01:36:01,309 INFO L229 MonitoredProcess]: Starting monitored process 9 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-09 01:36:01,313 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Waiting until timeout for monitored process [2024-11-09 01:36:01,672 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:36:01,678 INFO L255 TraceCheckSpWp]: Trace formula consists of 409 conjuncts, 18 conjuncts are in the unsatisfiable core [2024-11-09 01:36:01,681 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-09 01:36:01,724 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 1 [2024-11-09 01:36:01,767 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 17 treesize of output 17 [2024-11-09 01:36:01,862 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-09 01:36:01,862 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 34 treesize of output 12 [2024-11-09 01:36:01,872 INFO L134 CoverageAnalysis]: Checked inductivity of 220 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 220 trivial. 0 not checked. [2024-11-09 01:36:01,873 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-09 01:36:01,873 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 01:36:01,873 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1241034014] [2024-11-09 01:36:01,873 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2024-11-09 01:36:01,873 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1109366683] [2024-11-09 01:36:01,873 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1109366683] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 01:36:01,873 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 01:36:01,873 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-11-09 01:36:01,874 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1341011111] [2024-11-09 01:36:01,874 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 01:36:01,875 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-11-09 01:36:01,875 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 01:36:01,875 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-11-09 01:36:01,877 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=37, Unknown=0, NotChecked=0, Total=56 [2024-11-09 01:36:01,877 INFO L87 Difference]: Start difference. First operand 672 states and 927 transitions. Second operand has 8 states, 8 states have (on average 7.125) internal successors, (57), 7 states have internal predecessors, (57), 1 states have call successors, (11), 1 states have call predecessors, (11), 1 states have return successors, (11), 1 states have call predecessors, (11), 1 states have call successors, (11) [2024-11-09 01:36:02,260 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 01:36:02,260 INFO L93 Difference]: Finished difference Result 1520 states and 2088 transitions. [2024-11-09 01:36:02,260 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-11-09 01:36:02,261 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 7.125) internal successors, (57), 7 states have internal predecessors, (57), 1 states have call successors, (11), 1 states have call predecessors, (11), 1 states have return successors, (11), 1 states have call predecessors, (11), 1 states have call successors, (11) Word has length 109 [2024-11-09 01:36:02,261 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 01:36:02,264 INFO L225 Difference]: With dead ends: 1520 [2024-11-09 01:36:02,264 INFO L226 Difference]: Without dead ends: 978 [2024-11-09 01:36:02,266 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 113 GetRequests, 102 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=51, Invalid=105, Unknown=0, NotChecked=0, Total=156 [2024-11-09 01:36:02,266 INFO L432 NwaCegarLoop]: 195 mSDtfsCounter, 215 mSDsluCounter, 799 mSDsCounter, 0 mSdLazyCounter, 262 mSolverCounterSat, 24 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 215 SdHoareTripleChecker+Valid, 994 SdHoareTripleChecker+Invalid, 286 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 24 IncrementalHoareTripleChecker+Valid, 262 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2024-11-09 01:36:02,266 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [215 Valid, 994 Invalid, 286 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [24 Valid, 262 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2024-11-09 01:36:02,267 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 978 states. [2024-11-09 01:36:02,291 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 978 to 680. [2024-11-09 01:36:02,292 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 680 states, 615 states have (on average 1.338211382113821) internal successors, (823), 619 states have internal predecessors, (823), 57 states have call successors, (57), 7 states have call predecessors, (57), 7 states have return successors, (57), 53 states have call predecessors, (57), 57 states have call successors, (57) [2024-11-09 01:36:02,298 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 680 states to 680 states and 937 transitions. [2024-11-09 01:36:02,299 INFO L78 Accepts]: Start accepts. Automaton has 680 states and 937 transitions. Word has length 109 [2024-11-09 01:36:02,299 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 01:36:02,299 INFO L471 AbstractCegarLoop]: Abstraction has 680 states and 937 transitions. [2024-11-09 01:36:02,300 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 7.125) internal successors, (57), 7 states have internal predecessors, (57), 1 states have call successors, (11), 1 states have call predecessors, (11), 1 states have return successors, (11), 1 states have call predecessors, (11), 1 states have call successors, (11) [2024-11-09 01:36:02,300 INFO L276 IsEmpty]: Start isEmpty. Operand 680 states and 937 transitions. [2024-11-09 01:36:02,301 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 111 [2024-11-09 01:36:02,301 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 01:36:02,301 INFO L215 NwaCegarLoop]: trace histogram [11, 11, 11, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 01:36:02,316 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Forceful destruction successful, exit code 0 [2024-11-09 01:36:02,502 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18,9 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-09 01:36:02,503 INFO L396 AbstractCegarLoop]: === Iteration 20 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-09 01:36:02,503 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 01:36:02,504 INFO L85 PathProgramCache]: Analyzing trace with hash 1000110820, now seen corresponding path program 1 times [2024-11-09 01:36:02,504 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 01:36:02,504 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [742433738] [2024-11-09 01:36:02,504 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 01:36:02,504 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 01:36:02,523 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:36:02,621 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-09 01:36:02,622 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:36:02,625 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-11-09 01:36:02,626 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:36:02,627 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2024-11-09 01:36:02,627 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:36:02,628 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-11-09 01:36:02,628 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:36:02,629 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2024-11-09 01:36:02,630 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:36:02,630 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2024-11-09 01:36:02,630 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:36:02,632 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2024-11-09 01:36:02,632 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:36:02,633 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 53 [2024-11-09 01:36:02,633 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:36:02,634 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2024-11-09 01:36:02,634 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:36:02,635 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2024-11-09 01:36:02,635 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:36:02,636 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2024-11-09 01:36:02,636 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:36:02,637 INFO L134 CoverageAnalysis]: Checked inductivity of 220 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 220 trivial. 0 not checked. [2024-11-09 01:36:02,638 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 01:36:02,638 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [742433738] [2024-11-09 01:36:02,638 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [742433738] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 01:36:02,638 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 01:36:02,638 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-09 01:36:02,639 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [935520410] [2024-11-09 01:36:02,639 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 01:36:02,639 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-09 01:36:02,639 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 01:36:02,639 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-09 01:36:02,640 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-11-09 01:36:02,640 INFO L87 Difference]: Start difference. First operand 680 states and 937 transitions. Second operand has 5 states, 5 states have (on average 11.6) internal successors, (58), 5 states have internal predecessors, (58), 1 states have call successors, (11), 1 states have call predecessors, (11), 1 states have return successors, (11), 1 states have call predecessors, (11), 1 states have call successors, (11) [2024-11-09 01:36:02,758 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 01:36:02,759 INFO L93 Difference]: Finished difference Result 1686 states and 2324 transitions. [2024-11-09 01:36:02,759 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-09 01:36:02,759 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 11.6) internal successors, (58), 5 states have internal predecessors, (58), 1 states have call successors, (11), 1 states have call predecessors, (11), 1 states have return successors, (11), 1 states have call predecessors, (11), 1 states have call successors, (11) Word has length 110 [2024-11-09 01:36:02,760 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 01:36:02,764 INFO L225 Difference]: With dead ends: 1686 [2024-11-09 01:36:02,764 INFO L226 Difference]: Without dead ends: 1144 [2024-11-09 01:36:02,766 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 28 GetRequests, 24 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2024-11-09 01:36:02,766 INFO L432 NwaCegarLoop]: 193 mSDtfsCounter, 115 mSDsluCounter, 482 mSDsCounter, 0 mSdLazyCounter, 96 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 115 SdHoareTripleChecker+Valid, 675 SdHoareTripleChecker+Invalid, 97 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 96 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-09 01:36:02,766 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [115 Valid, 675 Invalid, 97 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 96 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-09 01:36:02,769 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1144 states. [2024-11-09 01:36:02,797 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1144 to 804. [2024-11-09 01:36:02,799 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 804 states, 739 states have (on average 1.3396481732070364) internal successors, (990), 743 states have internal predecessors, (990), 57 states have call successors, (57), 7 states have call predecessors, (57), 7 states have return successors, (57), 53 states have call predecessors, (57), 57 states have call successors, (57) [2024-11-09 01:36:02,801 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 804 states to 804 states and 1104 transitions. [2024-11-09 01:36:02,802 INFO L78 Accepts]: Start accepts. Automaton has 804 states and 1104 transitions. Word has length 110 [2024-11-09 01:36:02,802 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 01:36:02,802 INFO L471 AbstractCegarLoop]: Abstraction has 804 states and 1104 transitions. [2024-11-09 01:36:02,802 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 11.6) internal successors, (58), 5 states have internal predecessors, (58), 1 states have call successors, (11), 1 states have call predecessors, (11), 1 states have return successors, (11), 1 states have call predecessors, (11), 1 states have call successors, (11) [2024-11-09 01:36:02,803 INFO L276 IsEmpty]: Start isEmpty. Operand 804 states and 1104 transitions. [2024-11-09 01:36:02,803 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 111 [2024-11-09 01:36:02,804 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 01:36:02,804 INFO L215 NwaCegarLoop]: trace histogram [11, 11, 11, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 01:36:02,804 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19 [2024-11-09 01:36:02,804 INFO L396 AbstractCegarLoop]: === Iteration 21 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-09 01:36:02,804 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 01:36:02,804 INFO L85 PathProgramCache]: Analyzing trace with hash 1577254390, now seen corresponding path program 1 times [2024-11-09 01:36:02,804 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 01:36:02,805 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1936622783] [2024-11-09 01:36:02,805 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 01:36:02,805 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 01:36:02,824 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:36:02,857 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-09 01:36:02,858 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:36:02,858 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-11-09 01:36:02,859 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:36:02,859 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2024-11-09 01:36:02,860 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:36:02,860 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-11-09 01:36:02,861 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:36:02,861 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2024-11-09 01:36:02,862 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:36:02,862 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2024-11-09 01:36:02,864 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:36:02,865 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2024-11-09 01:36:02,865 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:36:02,866 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 53 [2024-11-09 01:36:02,866 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:36:02,866 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2024-11-09 01:36:02,867 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:36:02,868 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2024-11-09 01:36:02,868 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:36:02,869 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2024-11-09 01:36:02,869 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:36:02,870 INFO L134 CoverageAnalysis]: Checked inductivity of 220 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 220 trivial. 0 not checked. [2024-11-09 01:36:02,870 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 01:36:02,870 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1936622783] [2024-11-09 01:36:02,870 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1936622783] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 01:36:02,871 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 01:36:02,871 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-09 01:36:02,871 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [893238096] [2024-11-09 01:36:02,871 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 01:36:02,871 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-09 01:36:02,871 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 01:36:02,872 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-09 01:36:02,872 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-09 01:36:02,872 INFO L87 Difference]: Start difference. First operand 804 states and 1104 transitions. Second operand has 3 states, 3 states have (on average 19.333333333333332) internal successors, (58), 3 states have internal predecessors, (58), 1 states have call successors, (11), 1 states have call predecessors, (11), 1 states have return successors, (11), 1 states have call predecessors, (11), 1 states have call successors, (11) [2024-11-09 01:36:02,892 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 01:36:02,892 INFO L93 Difference]: Finished difference Result 1430 states and 1967 transitions. [2024-11-09 01:36:02,893 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-09 01:36:02,893 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 19.333333333333332) internal successors, (58), 3 states have internal predecessors, (58), 1 states have call successors, (11), 1 states have call predecessors, (11), 1 states have return successors, (11), 1 states have call predecessors, (11), 1 states have call successors, (11) Word has length 110 [2024-11-09 01:36:02,893 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 01:36:02,896 INFO L225 Difference]: With dead ends: 1430 [2024-11-09 01:36:02,897 INFO L226 Difference]: Without dead ends: 784 [2024-11-09 01:36:02,898 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 25 GetRequests, 24 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-09 01:36:02,899 INFO L432 NwaCegarLoop]: 147 mSDtfsCounter, 0 mSDsluCounter, 143 mSDsCounter, 0 mSdLazyCounter, 5 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 290 SdHoareTripleChecker+Invalid, 5 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 5 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-09 01:36:02,901 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 290 Invalid, 5 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 5 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-09 01:36:02,902 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 784 states. [2024-11-09 01:36:02,924 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 784 to 784. [2024-11-09 01:36:02,925 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 784 states, 719 states have (on average 1.3351877607788596) internal successors, (960), 723 states have internal predecessors, (960), 57 states have call successors, (57), 7 states have call predecessors, (57), 7 states have return successors, (57), 53 states have call predecessors, (57), 57 states have call successors, (57) [2024-11-09 01:36:02,927 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 784 states to 784 states and 1074 transitions. [2024-11-09 01:36:02,928 INFO L78 Accepts]: Start accepts. Automaton has 784 states and 1074 transitions. Word has length 110 [2024-11-09 01:36:02,928 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 01:36:02,928 INFO L471 AbstractCegarLoop]: Abstraction has 784 states and 1074 transitions. [2024-11-09 01:36:02,928 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 19.333333333333332) internal successors, (58), 3 states have internal predecessors, (58), 1 states have call successors, (11), 1 states have call predecessors, (11), 1 states have return successors, (11), 1 states have call predecessors, (11), 1 states have call successors, (11) [2024-11-09 01:36:02,929 INFO L276 IsEmpty]: Start isEmpty. Operand 784 states and 1074 transitions. [2024-11-09 01:36:02,929 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 111 [2024-11-09 01:36:02,929 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 01:36:02,930 INFO L215 NwaCegarLoop]: trace histogram [11, 11, 11, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 01:36:02,930 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20 [2024-11-09 01:36:02,930 INFO L396 AbstractCegarLoop]: === Iteration 22 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-09 01:36:02,930 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 01:36:02,930 INFO L85 PathProgramCache]: Analyzing trace with hash 188582893, now seen corresponding path program 1 times [2024-11-09 01:36:02,931 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 01:36:02,931 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1812652622] [2024-11-09 01:36:02,931 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 01:36:02,931 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 01:36:02,958 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:36:03,140 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-09 01:36:03,141 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:36:03,141 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-11-09 01:36:03,142 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:36:03,143 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2024-11-09 01:36:03,143 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:36:03,145 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-11-09 01:36:03,146 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:36:03,146 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2024-11-09 01:36:03,147 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:36:03,147 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2024-11-09 01:36:03,148 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:36:03,148 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2024-11-09 01:36:03,149 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:36:03,149 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 53 [2024-11-09 01:36:03,150 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:36:03,150 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2024-11-09 01:36:03,151 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:36:03,151 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2024-11-09 01:36:03,152 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:36:03,180 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2024-11-09 01:36:03,181 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:36:03,184 INFO L134 CoverageAnalysis]: Checked inductivity of 220 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 220 trivial. 0 not checked. [2024-11-09 01:36:03,184 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 01:36:03,184 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1812652622] [2024-11-09 01:36:03,184 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1812652622] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 01:36:03,184 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 01:36:03,184 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-11-09 01:36:03,185 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [540789642] [2024-11-09 01:36:03,185 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 01:36:03,185 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-09 01:36:03,185 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 01:36:03,186 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-09 01:36:03,186 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2024-11-09 01:36:03,186 INFO L87 Difference]: Start difference. First operand 784 states and 1074 transitions. Second operand has 6 states, 5 states have (on average 11.6) internal successors, (58), 6 states have internal predecessors, (58), 2 states have call successors, (11), 1 states have call predecessors, (11), 1 states have return successors, (11), 1 states have call predecessors, (11), 2 states have call successors, (11) [2024-11-09 01:36:03,248 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 01:36:03,249 INFO L93 Difference]: Finished difference Result 1372 states and 1888 transitions. [2024-11-09 01:36:03,250 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-09 01:36:03,250 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 11.6) internal successors, (58), 6 states have internal predecessors, (58), 2 states have call successors, (11), 1 states have call predecessors, (11), 1 states have return successors, (11), 1 states have call predecessors, (11), 2 states have call successors, (11) Word has length 110 [2024-11-09 01:36:03,250 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 01:36:03,253 INFO L225 Difference]: With dead ends: 1372 [2024-11-09 01:36:03,254 INFO L226 Difference]: Without dead ends: 746 [2024-11-09 01:36:03,256 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 30 GetRequests, 25 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-11-09 01:36:03,257 INFO L432 NwaCegarLoop]: 143 mSDtfsCounter, 134 mSDsluCounter, 410 mSDsCounter, 0 mSdLazyCounter, 29 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 135 SdHoareTripleChecker+Valid, 553 SdHoareTripleChecker+Invalid, 31 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 29 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-09 01:36:03,258 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [135 Valid, 553 Invalid, 31 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 29 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-09 01:36:03,259 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 746 states. [2024-11-09 01:36:03,288 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 746 to 744. [2024-11-09 01:36:03,289 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 744 states, 679 states have (on average 1.3343151693667157) internal successors, (906), 683 states have internal predecessors, (906), 57 states have call successors, (57), 7 states have call predecessors, (57), 7 states have return successors, (57), 53 states have call predecessors, (57), 57 states have call successors, (57) [2024-11-09 01:36:03,292 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 744 states to 744 states and 1020 transitions. [2024-11-09 01:36:03,292 INFO L78 Accepts]: Start accepts. Automaton has 744 states and 1020 transitions. Word has length 110 [2024-11-09 01:36:03,293 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 01:36:03,293 INFO L471 AbstractCegarLoop]: Abstraction has 744 states and 1020 transitions. [2024-11-09 01:36:03,293 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 11.6) internal successors, (58), 6 states have internal predecessors, (58), 2 states have call successors, (11), 1 states have call predecessors, (11), 1 states have return successors, (11), 1 states have call predecessors, (11), 2 states have call successors, (11) [2024-11-09 01:36:03,293 INFO L276 IsEmpty]: Start isEmpty. Operand 744 states and 1020 transitions. [2024-11-09 01:36:03,294 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 111 [2024-11-09 01:36:03,294 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 01:36:03,294 INFO L215 NwaCegarLoop]: trace histogram [11, 11, 11, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 01:36:03,294 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable21 [2024-11-09 01:36:03,295 INFO L396 AbstractCegarLoop]: === Iteration 23 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-09 01:36:03,295 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 01:36:03,295 INFO L85 PathProgramCache]: Analyzing trace with hash 1659459177, now seen corresponding path program 1 times [2024-11-09 01:36:03,295 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 01:36:03,295 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [219144438] [2024-11-09 01:36:03,295 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 01:36:03,295 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 01:36:03,339 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unknown [2024-11-09 01:36:03,341 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [40939086] [2024-11-09 01:36:03,341 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 01:36:03,342 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-09 01:36:03,342 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-09 01:36:03,343 INFO L229 MonitoredProcess]: Starting monitored process 10 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-09 01:36:03,352 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Waiting until timeout for monitored process [2024-11-09 01:36:03,751 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:36:03,759 INFO L255 TraceCheckSpWp]: Trace formula consists of 414 conjuncts, 38 conjuncts are in the unsatisfiable core [2024-11-09 01:36:03,763 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-09 01:36:03,772 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 9 treesize of output 3 [2024-11-09 01:36:03,813 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 1 [2024-11-09 01:36:03,831 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 1 [2024-11-09 01:36:03,879 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 17 treesize of output 17 [2024-11-09 01:36:03,965 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 45 treesize of output 29 [2024-11-09 01:36:04,142 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 33 treesize of output 25 [2024-11-09 01:36:04,146 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 29 treesize of output 21 [2024-11-09 01:36:04,178 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-09 01:36:04,178 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 42 treesize of output 20 [2024-11-09 01:36:04,198 INFO L134 CoverageAnalysis]: Checked inductivity of 220 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 220 trivial. 0 not checked. [2024-11-09 01:36:04,198 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-09 01:36:04,198 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 01:36:04,198 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [219144438] [2024-11-09 01:36:04,198 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2024-11-09 01:36:04,198 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [40939086] [2024-11-09 01:36:04,198 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [40939086] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 01:36:04,198 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 01:36:04,198 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-11-09 01:36:04,198 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1482880580] [2024-11-09 01:36:04,198 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 01:36:04,199 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-11-09 01:36:04,199 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 01:36:04,199 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-11-09 01:36:04,199 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=52, Unknown=0, NotChecked=0, Total=72 [2024-11-09 01:36:04,199 INFO L87 Difference]: Start difference. First operand 744 states and 1020 transitions. Second operand has 9 states, 9 states have (on average 6.444444444444445) internal successors, (58), 8 states have internal predecessors, (58), 1 states have call successors, (11), 1 states have call predecessors, (11), 1 states have return successors, (11), 1 states have call predecessors, (11), 1 states have call successors, (11) [2024-11-09 01:36:04,821 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 01:36:04,822 INFO L93 Difference]: Finished difference Result 1603 states and 2187 transitions. [2024-11-09 01:36:04,822 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-11-09 01:36:04,822 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 6.444444444444445) internal successors, (58), 8 states have internal predecessors, (58), 1 states have call successors, (11), 1 states have call predecessors, (11), 1 states have return successors, (11), 1 states have call predecessors, (11), 1 states have call successors, (11) Word has length 110 [2024-11-09 01:36:04,823 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 01:36:04,826 INFO L225 Difference]: With dead ends: 1603 [2024-11-09 01:36:04,826 INFO L226 Difference]: Without dead ends: 1017 [2024-11-09 01:36:04,827 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 114 GetRequests, 102 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 15 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=50, Invalid=132, Unknown=0, NotChecked=0, Total=182 [2024-11-09 01:36:04,828 INFO L432 NwaCegarLoop]: 139 mSDtfsCounter, 287 mSDsluCounter, 725 mSDsCounter, 0 mSdLazyCounter, 313 mSolverCounterSat, 25 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 287 SdHoareTripleChecker+Valid, 864 SdHoareTripleChecker+Invalid, 338 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 25 IncrementalHoareTripleChecker+Valid, 313 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2024-11-09 01:36:04,828 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [287 Valid, 864 Invalid, 338 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [25 Valid, 313 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2024-11-09 01:36:04,829 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1017 states. [2024-11-09 01:36:04,849 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1017 to 759. [2024-11-09 01:36:04,850 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 759 states, 694 states have (on average 1.3342939481268012) internal successors, (926), 698 states have internal predecessors, (926), 57 states have call successors, (57), 7 states have call predecessors, (57), 7 states have return successors, (57), 53 states have call predecessors, (57), 57 states have call successors, (57) [2024-11-09 01:36:04,852 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 759 states to 759 states and 1040 transitions. [2024-11-09 01:36:04,853 INFO L78 Accepts]: Start accepts. Automaton has 759 states and 1040 transitions. Word has length 110 [2024-11-09 01:36:04,853 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 01:36:04,853 INFO L471 AbstractCegarLoop]: Abstraction has 759 states and 1040 transitions. [2024-11-09 01:36:04,853 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 6.444444444444445) internal successors, (58), 8 states have internal predecessors, (58), 1 states have call successors, (11), 1 states have call predecessors, (11), 1 states have return successors, (11), 1 states have call predecessors, (11), 1 states have call successors, (11) [2024-11-09 01:36:04,853 INFO L276 IsEmpty]: Start isEmpty. Operand 759 states and 1040 transitions. [2024-11-09 01:36:04,854 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 111 [2024-11-09 01:36:04,854 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 01:36:04,854 INFO L215 NwaCegarLoop]: trace histogram [11, 11, 11, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 01:36:04,869 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Ended with exit code 0 [2024-11-09 01:36:05,055 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable22,10 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-09 01:36:05,056 INFO L396 AbstractCegarLoop]: === Iteration 24 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-09 01:36:05,056 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 01:36:05,057 INFO L85 PathProgramCache]: Analyzing trace with hash 71111275, now seen corresponding path program 1 times [2024-11-09 01:36:05,057 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 01:36:05,057 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [75935488] [2024-11-09 01:36:05,057 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 01:36:05,057 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 01:36:05,104 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unknown [2024-11-09 01:36:05,109 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1688435105] [2024-11-09 01:36:05,109 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 01:36:05,109 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-09 01:36:05,110 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-09 01:36:05,113 INFO L229 MonitoredProcess]: Starting monitored process 11 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-09 01:36:05,115 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Waiting until timeout for monitored process [2024-11-09 01:36:05,435 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:36:05,438 INFO L255 TraceCheckSpWp]: Trace formula consists of 412 conjuncts, 24 conjuncts are in the unsatisfiable core [2024-11-09 01:36:05,448 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-09 01:36:05,461 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 9 treesize of output 3 [2024-11-09 01:36:05,505 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 1 [2024-11-09 01:36:05,569 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 17 treesize of output 17 [2024-11-09 01:36:05,726 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-09 01:36:05,726 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 34 treesize of output 12 [2024-11-09 01:36:05,739 INFO L134 CoverageAnalysis]: Checked inductivity of 220 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 220 trivial. 0 not checked. [2024-11-09 01:36:05,744 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-09 01:36:05,744 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 01:36:05,744 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [75935488] [2024-11-09 01:36:05,744 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2024-11-09 01:36:05,745 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1688435105] [2024-11-09 01:36:05,745 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1688435105] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 01:36:05,745 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 01:36:05,745 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-11-09 01:36:05,745 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1706741641] [2024-11-09 01:36:05,745 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 01:36:05,745 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-11-09 01:36:05,745 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 01:36:05,746 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-11-09 01:36:05,746 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=37, Unknown=0, NotChecked=0, Total=56 [2024-11-09 01:36:05,746 INFO L87 Difference]: Start difference. First operand 759 states and 1040 transitions. Second operand has 8 states, 8 states have (on average 7.25) internal successors, (58), 7 states have internal predecessors, (58), 1 states have call successors, (11), 1 states have call predecessors, (11), 1 states have return successors, (11), 1 states have call predecessors, (11), 1 states have call successors, (11) [2024-11-09 01:36:06,028 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 01:36:06,029 INFO L93 Difference]: Finished difference Result 1589 states and 2170 transitions. [2024-11-09 01:36:06,029 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-11-09 01:36:06,029 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 7.25) internal successors, (58), 7 states have internal predecessors, (58), 1 states have call successors, (11), 1 states have call predecessors, (11), 1 states have return successors, (11), 1 states have call predecessors, (11), 1 states have call successors, (11) Word has length 110 [2024-11-09 01:36:06,030 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 01:36:06,033 INFO L225 Difference]: With dead ends: 1589 [2024-11-09 01:36:06,055 INFO L226 Difference]: Without dead ends: 979 [2024-11-09 01:36:06,056 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 114 GetRequests, 103 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=51, Invalid=105, Unknown=0, NotChecked=0, Total=156 [2024-11-09 01:36:06,056 INFO L432 NwaCegarLoop]: 142 mSDtfsCounter, 362 mSDsluCounter, 570 mSDsCounter, 0 mSdLazyCounter, 197 mSolverCounterSat, 24 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 362 SdHoareTripleChecker+Valid, 712 SdHoareTripleChecker+Invalid, 221 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 24 IncrementalHoareTripleChecker+Valid, 197 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-11-09 01:36:06,056 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [362 Valid, 712 Invalid, 221 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [24 Valid, 197 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-11-09 01:36:06,057 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 979 states. [2024-11-09 01:36:06,093 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 979 to 749. [2024-11-09 01:36:06,095 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 749 states, 684 states have (on average 1.3289473684210527) internal successors, (909), 688 states have internal predecessors, (909), 57 states have call successors, (57), 7 states have call predecessors, (57), 7 states have return successors, (57), 53 states have call predecessors, (57), 57 states have call successors, (57) [2024-11-09 01:36:06,100 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 749 states to 749 states and 1023 transitions. [2024-11-09 01:36:06,101 INFO L78 Accepts]: Start accepts. Automaton has 749 states and 1023 transitions. Word has length 110 [2024-11-09 01:36:06,101 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 01:36:06,101 INFO L471 AbstractCegarLoop]: Abstraction has 749 states and 1023 transitions. [2024-11-09 01:36:06,101 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 7.25) internal successors, (58), 7 states have internal predecessors, (58), 1 states have call successors, (11), 1 states have call predecessors, (11), 1 states have return successors, (11), 1 states have call predecessors, (11), 1 states have call successors, (11) [2024-11-09 01:36:06,101 INFO L276 IsEmpty]: Start isEmpty. Operand 749 states and 1023 transitions. [2024-11-09 01:36:06,106 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 111 [2024-11-09 01:36:06,106 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 01:36:06,106 INFO L215 NwaCegarLoop]: trace histogram [11, 11, 11, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 01:36:06,138 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Ended with exit code 0 [2024-11-09 01:36:06,307 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 11 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable23 [2024-11-09 01:36:06,307 INFO L396 AbstractCegarLoop]: === Iteration 25 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-09 01:36:06,308 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 01:36:06,308 INFO L85 PathProgramCache]: Analyzing trace with hash -1591807511, now seen corresponding path program 1 times [2024-11-09 01:36:06,308 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 01:36:06,308 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1860056350] [2024-11-09 01:36:06,308 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 01:36:06,308 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 01:36:06,385 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unknown [2024-11-09 01:36:06,387 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1590869566] [2024-11-09 01:36:06,390 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 01:36:06,390 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-09 01:36:06,391 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-09 01:36:06,392 INFO L229 MonitoredProcess]: Starting monitored process 12 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-09 01:36:06,396 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Waiting until timeout for monitored process [2024-11-09 01:36:06,713 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:36:06,716 INFO L255 TraceCheckSpWp]: Trace formula consists of 414 conjuncts, 36 conjuncts are in the unsatisfiable core [2024-11-09 01:36:06,720 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-09 01:36:06,723 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 1 [2024-11-09 01:36:06,726 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 1 [2024-11-09 01:36:06,734 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 17 treesize of output 17 [2024-11-09 01:36:06,779 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 47 treesize of output 42 [2024-11-09 01:36:06,952 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-09 01:36:06,952 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 50 treesize of output 32 [2024-11-09 01:36:06,998 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-09 01:36:06,998 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 48 treesize of output 26 [2024-11-09 01:36:07,069 INFO L134 CoverageAnalysis]: Checked inductivity of 220 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 220 trivial. 0 not checked. [2024-11-09 01:36:07,070 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-09 01:36:07,070 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 01:36:07,070 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1860056350] [2024-11-09 01:36:07,070 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2024-11-09 01:36:07,070 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1590869566] [2024-11-09 01:36:07,070 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1590869566] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 01:36:07,070 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 01:36:07,070 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-11-09 01:36:07,073 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [907375380] [2024-11-09 01:36:07,073 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 01:36:07,073 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-11-09 01:36:07,073 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 01:36:07,073 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-11-09 01:36:07,074 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2024-11-09 01:36:07,074 INFO L87 Difference]: Start difference. First operand 749 states and 1023 transitions. Second operand has 7 states, 7 states have (on average 8.285714285714286) internal successors, (58), 7 states have internal predecessors, (58), 1 states have call successors, (11), 1 states have call predecessors, (11), 1 states have return successors, (11), 1 states have call predecessors, (11), 1 states have call successors, (11) [2024-11-09 01:36:07,619 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 01:36:07,620 INFO L93 Difference]: Finished difference Result 1335 states and 1827 transitions. [2024-11-09 01:36:07,620 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-11-09 01:36:07,621 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 8.285714285714286) internal successors, (58), 7 states have internal predecessors, (58), 1 states have call successors, (11), 1 states have call predecessors, (11), 1 states have return successors, (11), 1 states have call predecessors, (11), 1 states have call successors, (11) Word has length 110 [2024-11-09 01:36:07,621 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 01:36:07,624 INFO L225 Difference]: With dead ends: 1335 [2024-11-09 01:36:07,624 INFO L226 Difference]: Without dead ends: 749 [2024-11-09 01:36:07,625 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 111 GetRequests, 104 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=22, Invalid=50, Unknown=0, NotChecked=0, Total=72 [2024-11-09 01:36:07,626 INFO L432 NwaCegarLoop]: 210 mSDtfsCounter, 90 mSDsluCounter, 842 mSDsCounter, 0 mSdLazyCounter, 275 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 90 SdHoareTripleChecker+Valid, 1052 SdHoareTripleChecker+Invalid, 276 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 275 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2024-11-09 01:36:07,626 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [90 Valid, 1052 Invalid, 276 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 275 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2024-11-09 01:36:07,627 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 749 states. [2024-11-09 01:36:07,645 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 749 to 746. [2024-11-09 01:36:07,647 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 746 states, 681 states have (on average 1.327459618208517) internal successors, (904), 685 states have internal predecessors, (904), 57 states have call successors, (57), 7 states have call predecessors, (57), 7 states have return successors, (57), 53 states have call predecessors, (57), 57 states have call successors, (57) [2024-11-09 01:36:07,648 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 746 states to 746 states and 1018 transitions. [2024-11-09 01:36:07,649 INFO L78 Accepts]: Start accepts. Automaton has 746 states and 1018 transitions. Word has length 110 [2024-11-09 01:36:07,649 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 01:36:07,649 INFO L471 AbstractCegarLoop]: Abstraction has 746 states and 1018 transitions. [2024-11-09 01:36:07,649 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 8.285714285714286) internal successors, (58), 7 states have internal predecessors, (58), 1 states have call successors, (11), 1 states have call predecessors, (11), 1 states have return successors, (11), 1 states have call predecessors, (11), 1 states have call successors, (11) [2024-11-09 01:36:07,649 INFO L276 IsEmpty]: Start isEmpty. Operand 746 states and 1018 transitions. [2024-11-09 01:36:07,650 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 112 [2024-11-09 01:36:07,650 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 01:36:07,650 INFO L215 NwaCegarLoop]: trace histogram [11, 11, 11, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 01:36:07,667 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Ended with exit code 0 [2024-11-09 01:36:07,850 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 12 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable24 [2024-11-09 01:36:07,851 INFO L396 AbstractCegarLoop]: === Iteration 26 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-09 01:36:07,851 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 01:36:07,851 INFO L85 PathProgramCache]: Analyzing trace with hash 1239417475, now seen corresponding path program 1 times [2024-11-09 01:36:07,853 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 01:36:07,853 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [951811110] [2024-11-09 01:36:07,853 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 01:36:07,854 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 01:36:07,960 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unknown [2024-11-09 01:36:07,962 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1259918742] [2024-11-09 01:36:07,962 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 01:36:07,962 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-09 01:36:07,962 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-09 01:36:07,964 INFO L229 MonitoredProcess]: Starting monitored process 13 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-09 01:36:07,965 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (13)] Waiting until timeout for monitored process [2024-11-09 01:36:08,335 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-09 01:36:08,336 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-11-09 01:36:08,441 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-09 01:36:08,544 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-11-09 01:36:08,544 INFO L325 BasicCegarLoop]: Counterexample is feasible [2024-11-09 01:36:08,545 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2024-11-09 01:36:08,565 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (13)] Ended with exit code 0 [2024-11-09 01:36:08,750 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 13 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable25 [2024-11-09 01:36:08,754 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, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 01:36:08,841 INFO L170 ceAbstractionStarter]: Computing trace abstraction results [2024-11-09 01:36:08,852 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 09.11 01:36:08 BoogieIcfgContainer [2024-11-09 01:36:08,852 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2024-11-09 01:36:08,852 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2024-11-09 01:36:08,852 INFO L270 PluginConnector]: Initializing Witness Printer... [2024-11-09 01:36:08,852 INFO L274 PluginConnector]: Witness Printer initialized [2024-11-09 01:36:08,853 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.11 01:35:43" (3/4) ... [2024-11-09 01:36:08,855 INFO L145 WitnessPrinter]: No result that supports witness generation found [2024-11-09 01:36:08,856 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2024-11-09 01:36:08,860 INFO L158 Benchmark]: Toolchain (without parser) took 26953.97ms. Allocated memory was 230.7MB in the beginning and 559.9MB in the end (delta: 329.3MB). Free memory was 162.2MB in the beginning and 264.4MB in the end (delta: -102.1MB). Peak memory consumption was 229.0MB. Max. memory is 16.1GB. [2024-11-09 01:36:08,861 INFO L158 Benchmark]: CDTParser took 0.25ms. Allocated memory is still 115.3MB. Free memory is still 45.7MB. There was no memory consumed. Max. memory is 16.1GB. [2024-11-09 01:36:08,861 INFO L158 Benchmark]: CACSL2BoogieTranslator took 355.09ms. Allocated memory is still 230.7MB. Free memory was 161.8MB in the beginning and 145.4MB in the end (delta: 16.5MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. [2024-11-09 01:36:08,861 INFO L158 Benchmark]: Boogie Procedure Inliner took 64.91ms. Allocated memory is still 230.7MB. Free memory was 145.4MB in the beginning and 140.9MB in the end (delta: 4.5MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. [2024-11-09 01:36:08,861 INFO L158 Benchmark]: Boogie Preprocessor took 74.93ms. Allocated memory is still 230.7MB. Free memory was 140.5MB in the beginning and 135.0MB in the end (delta: 5.5MB). Peak memory consumption was 6.3MB. Max. memory is 16.1GB. [2024-11-09 01:36:08,861 INFO L158 Benchmark]: RCFGBuilder took 838.84ms. Allocated memory is still 230.7MB. Free memory was 134.6MB in the beginning and 187.7MB in the end (delta: -53.1MB). Peak memory consumption was 38.3MB. Max. memory is 16.1GB. [2024-11-09 01:36:08,861 INFO L158 Benchmark]: TraceAbstraction took 25611.00ms. Allocated memory was 230.7MB in the beginning and 559.9MB in the end (delta: 329.3MB). Free memory was 186.6MB in the beginning and 265.4MB in the end (delta: -78.8MB). Peak memory consumption was 251.5MB. Max. memory is 16.1GB. [2024-11-09 01:36:08,861 INFO L158 Benchmark]: Witness Printer took 3.58ms. Allocated memory is still 559.9MB. Free memory was 265.4MB in the beginning and 264.4MB in the end (delta: 1.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2024-11-09 01:36:08,862 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.25ms. Allocated memory is still 115.3MB. Free memory is still 45.7MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 355.09ms. Allocated memory is still 230.7MB. Free memory was 161.8MB in the beginning and 145.4MB in the end (delta: 16.5MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 64.91ms. Allocated memory is still 230.7MB. Free memory was 145.4MB in the beginning and 140.9MB in the end (delta: 4.5MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. * Boogie Preprocessor took 74.93ms. Allocated memory is still 230.7MB. Free memory was 140.5MB in the beginning and 135.0MB in the end (delta: 5.5MB). Peak memory consumption was 6.3MB. Max. memory is 16.1GB. * RCFGBuilder took 838.84ms. Allocated memory is still 230.7MB. Free memory was 134.6MB in the beginning and 187.7MB in the end (delta: -53.1MB). Peak memory consumption was 38.3MB. Max. memory is 16.1GB. * TraceAbstraction took 25611.00ms. Allocated memory was 230.7MB in the beginning and 559.9MB in the end (delta: 329.3MB). Free memory was 186.6MB in the beginning and 265.4MB in the end (delta: -78.8MB). Peak memory consumption was 251.5MB. Max. memory is 16.1GB. * Witness Printer took 3.58ms. Allocated memory is still 559.9MB. Free memory was 265.4MB in the beginning and 264.4MB 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 someBinaryDOUBLEComparisonOperation at line 95, overapproximation of bitwiseOr at line 58. Possible FailurePath: [L21] unsigned char isInitial = 0; [L22-L24] unsigned char BOOL_unsigned_char_Array_0[1] = { 0 }; [L22-L24] unsigned char BOOL_unsigned_char_Array_0[1] = { 0 }; [L25-L27] double double_Array_0[5] = { 24.8, 0.8, 127.625, 128.75, 1.5 }; [L25-L27] double double_Array_0[5] = { 24.8, 0.8, 127.625, 128.75, 1.5 }; [L25-L27] double double_Array_0[5] = { 24.8, 0.8, 127.625, 128.75, 1.5 }; [L25-L27] double double_Array_0[5] = { 24.8, 0.8, 127.625, 128.75, 1.5 }; [L25-L27] double double_Array_0[5] = { 24.8, 0.8, 127.625, 128.75, 1.5 }; [L25-L27] double double_Array_0[5] = { 24.8, 0.8, 127.625, 128.75, 1.5 }; [L28-L30] signed char signed_char_Array_0[2] = { 5, 64 }; [L28-L30] signed char signed_char_Array_0[2] = { 5, 64 }; [L28-L30] signed char signed_char_Array_0[2] = { 5, 64 }; [L31-L33] signed short int signed_short_int_Array_0[1] = { -128 }; [L31-L33] signed short int signed_short_int_Array_0[1] = { -128 }; [L34-L36] unsigned char unsigned_char_Array_0[1] = { 4 }; [L34-L36] unsigned char unsigned_char_Array_0[1] = { 4 }; [L37-L39] unsigned short int unsigned_short_int_Array_0[2] = { 25, 128 }; [L37-L39] unsigned short int unsigned_short_int_Array_0[2] = { 25, 128 }; [L37-L39] unsigned short int unsigned_short_int_Array_0[2] = { 25, 128 }; [L40] unsigned short int last_1_unsigned_short_int_Array_0_1_ = 128; VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, isInitial=0, last_1_unsigned_short_int_Array_0_1_=128, signed_char_Array_0={6:0}, signed_short_int_Array_0={7:0}, unsigned_char_Array_0={8:0}, unsigned_short_int_Array_0={9:0}] [L99] isInitial = 1 [L100] FCALL initially() [L101] COND TRUE 1 [L102] CALL updateLastVariables() [L92] EXPR unsigned_short_int_Array_0[1] [L92] last_1_unsigned_short_int_Array_0_1_ = unsigned_short_int_Array_0[1] [L102] RET updateLastVariables() [L103] CALL updateVariables() [L73] BOOL_unsigned_char_Array_0[0] = __VERIFIER_nondet_uchar() [L74] EXPR BOOL_unsigned_char_Array_0[0] VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, isInitial=1, last_1_unsigned_short_int_Array_0_1_=128, signed_char_Array_0={6:0}, signed_short_int_Array_0={7:0}, unsigned_char_Array_0={8:0}, unsigned_short_int_Array_0={9:0}] [L74] CALL assume_abort_if_not(BOOL_unsigned_char_Array_0[0] >= 0) VAL [BOOL_unsigned_char_Array_0={4:0}, \old(cond)=1, double_Array_0={5:0}, isInitial=1, last_1_unsigned_short_int_Array_0_1_=128, signed_char_Array_0={6:0}, signed_short_int_Array_0={7:0}, unsigned_char_Array_0={8:0}, unsigned_short_int_Array_0={9:0}] [L20] COND FALSE !(!cond) VAL [BOOL_unsigned_char_Array_0={4:0}, \old(cond)=1, double_Array_0={5:0}, isInitial=1, last_1_unsigned_short_int_Array_0_1_=128, signed_char_Array_0={6:0}, signed_short_int_Array_0={7:0}, unsigned_char_Array_0={8:0}, unsigned_short_int_Array_0={9:0}] [L74] RET assume_abort_if_not(BOOL_unsigned_char_Array_0[0] >= 0) VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, isInitial=1, last_1_unsigned_short_int_Array_0_1_=128, signed_char_Array_0={6:0}, signed_short_int_Array_0={7:0}, unsigned_char_Array_0={8:0}, unsigned_short_int_Array_0={9:0}] [L75] EXPR BOOL_unsigned_char_Array_0[0] VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, isInitial=1, last_1_unsigned_short_int_Array_0_1_=128, signed_char_Array_0={6:0}, signed_short_int_Array_0={7:0}, unsigned_char_Array_0={8:0}, unsigned_short_int_Array_0={9:0}] [L75] CALL assume_abort_if_not(BOOL_unsigned_char_Array_0[0] <= 1) VAL [BOOL_unsigned_char_Array_0={4:0}, \old(cond)=1, double_Array_0={5:0}, isInitial=1, last_1_unsigned_short_int_Array_0_1_=128, signed_char_Array_0={6:0}, signed_short_int_Array_0={7:0}, unsigned_char_Array_0={8:0}, unsigned_short_int_Array_0={9:0}] [L20] COND FALSE !(!cond) VAL [BOOL_unsigned_char_Array_0={4:0}, \old(cond)=1, double_Array_0={5:0}, isInitial=1, last_1_unsigned_short_int_Array_0_1_=128, signed_char_Array_0={6:0}, signed_short_int_Array_0={7:0}, unsigned_char_Array_0={8:0}, unsigned_short_int_Array_0={9:0}] [L75] RET assume_abort_if_not(BOOL_unsigned_char_Array_0[0] <= 1) VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, isInitial=1, last_1_unsigned_short_int_Array_0_1_=128, signed_char_Array_0={6:0}, signed_short_int_Array_0={7:0}, unsigned_char_Array_0={8:0}, unsigned_short_int_Array_0={9:0}] [L76] double_Array_0[1] = __VERIFIER_nondet_double() [L77] EXPR double_Array_0[1] [L77] EXPR double_Array_0[1] >= -461168.6018427382800e+13F && double_Array_0[1] <= -1.0e-20F VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, isInitial=1, last_1_unsigned_short_int_Array_0_1_=128, signed_char_Array_0={6:0}, signed_short_int_Array_0={7:0}, unsigned_char_Array_0={8:0}, unsigned_short_int_Array_0={9:0}] [L77] EXPR double_Array_0[1] >= -461168.6018427382800e+13F && double_Array_0[1] <= -1.0e-20F [L77] EXPR double_Array_0[1] [L77] EXPR double_Array_0[1] >= -461168.6018427382800e+13F && double_Array_0[1] <= -1.0e-20F VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, isInitial=1, last_1_unsigned_short_int_Array_0_1_=128, signed_char_Array_0={6:0}, signed_short_int_Array_0={7:0}, unsigned_char_Array_0={8:0}, unsigned_short_int_Array_0={9:0}] [L77] EXPR (double_Array_0[1] >= -461168.6018427382800e+13F && double_Array_0[1] <= -1.0e-20F) || (double_Array_0[1] <= 4611686.018427382800e+12F && double_Array_0[1] >= 1.0e-20F ) VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, isInitial=1, last_1_unsigned_short_int_Array_0_1_=128, signed_char_Array_0={6:0}, signed_short_int_Array_0={7:0}, unsigned_char_Array_0={8:0}, unsigned_short_int_Array_0={9:0}] [L77] EXPR (double_Array_0[1] >= -461168.6018427382800e+13F && double_Array_0[1] <= -1.0e-20F) || (double_Array_0[1] <= 4611686.018427382800e+12F && double_Array_0[1] >= 1.0e-20F ) VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, isInitial=1, last_1_unsigned_short_int_Array_0_1_=128, signed_char_Array_0={6:0}, signed_short_int_Array_0={7:0}, unsigned_char_Array_0={8:0}, unsigned_short_int_Array_0={9:0}] [L77] CALL assume_abort_if_not((double_Array_0[1] >= -461168.6018427382800e+13F && double_Array_0[1] <= -1.0e-20F) || (double_Array_0[1] <= 4611686.018427382800e+12F && double_Array_0[1] >= 1.0e-20F )) VAL [BOOL_unsigned_char_Array_0={4:0}, \old(cond)=1, double_Array_0={5:0}, isInitial=1, last_1_unsigned_short_int_Array_0_1_=128, signed_char_Array_0={6:0}, signed_short_int_Array_0={7:0}, unsigned_char_Array_0={8:0}, unsigned_short_int_Array_0={9:0}] [L20] COND FALSE !(!cond) VAL [BOOL_unsigned_char_Array_0={4:0}, \old(cond)=1, double_Array_0={5:0}, isInitial=1, last_1_unsigned_short_int_Array_0_1_=128, signed_char_Array_0={6:0}, signed_short_int_Array_0={7:0}, unsigned_char_Array_0={8:0}, unsigned_short_int_Array_0={9:0}] [L77] RET assume_abort_if_not((double_Array_0[1] >= -461168.6018427382800e+13F && double_Array_0[1] <= -1.0e-20F) || (double_Array_0[1] <= 4611686.018427382800e+12F && double_Array_0[1] >= 1.0e-20F )) VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, isInitial=1, last_1_unsigned_short_int_Array_0_1_=128, signed_char_Array_0={6:0}, signed_short_int_Array_0={7:0}, unsigned_char_Array_0={8:0}, unsigned_short_int_Array_0={9:0}] [L78] double_Array_0[3] = __VERIFIER_nondet_double() [L79] EXPR double_Array_0[3] [L79] EXPR double_Array_0[3] >= -461168.6018427382800e+13F && double_Array_0[3] <= -1.0e-20F VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, isInitial=1, last_1_unsigned_short_int_Array_0_1_=128, signed_char_Array_0={6:0}, signed_short_int_Array_0={7:0}, unsigned_char_Array_0={8:0}, unsigned_short_int_Array_0={9:0}] [L79] EXPR double_Array_0[3] >= -461168.6018427382800e+13F && double_Array_0[3] <= -1.0e-20F [L79] EXPR double_Array_0[3] [L79] EXPR double_Array_0[3] >= -461168.6018427382800e+13F && double_Array_0[3] <= -1.0e-20F VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, isInitial=1, last_1_unsigned_short_int_Array_0_1_=128, signed_char_Array_0={6:0}, signed_short_int_Array_0={7:0}, unsigned_char_Array_0={8:0}, unsigned_short_int_Array_0={9:0}] [L79] EXPR (double_Array_0[3] >= -461168.6018427382800e+13F && double_Array_0[3] <= -1.0e-20F) || (double_Array_0[3] <= 4611686.018427382800e+12F && double_Array_0[3] >= 1.0e-20F ) VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, isInitial=1, last_1_unsigned_short_int_Array_0_1_=128, signed_char_Array_0={6:0}, signed_short_int_Array_0={7:0}, unsigned_char_Array_0={8:0}, unsigned_short_int_Array_0={9:0}] [L79] EXPR (double_Array_0[3] >= -461168.6018427382800e+13F && double_Array_0[3] <= -1.0e-20F) || (double_Array_0[3] <= 4611686.018427382800e+12F && double_Array_0[3] >= 1.0e-20F ) VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, isInitial=1, last_1_unsigned_short_int_Array_0_1_=128, signed_char_Array_0={6:0}, signed_short_int_Array_0={7:0}, unsigned_char_Array_0={8:0}, unsigned_short_int_Array_0={9:0}] [L79] CALL assume_abort_if_not((double_Array_0[3] >= -461168.6018427382800e+13F && double_Array_0[3] <= -1.0e-20F) || (double_Array_0[3] <= 4611686.018427382800e+12F && double_Array_0[3] >= 1.0e-20F )) VAL [BOOL_unsigned_char_Array_0={4:0}, \old(cond)=1, double_Array_0={5:0}, isInitial=1, last_1_unsigned_short_int_Array_0_1_=128, signed_char_Array_0={6:0}, signed_short_int_Array_0={7:0}, unsigned_char_Array_0={8:0}, unsigned_short_int_Array_0={9:0}] [L20] COND FALSE !(!cond) VAL [BOOL_unsigned_char_Array_0={4:0}, \old(cond)=1, double_Array_0={5:0}, isInitial=1, last_1_unsigned_short_int_Array_0_1_=128, signed_char_Array_0={6:0}, signed_short_int_Array_0={7:0}, unsigned_char_Array_0={8:0}, unsigned_short_int_Array_0={9:0}] [L79] RET assume_abort_if_not((double_Array_0[3] >= -461168.6018427382800e+13F && double_Array_0[3] <= -1.0e-20F) || (double_Array_0[3] <= 4611686.018427382800e+12F && double_Array_0[3] >= 1.0e-20F )) VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, isInitial=1, last_1_unsigned_short_int_Array_0_1_=128, signed_char_Array_0={6:0}, signed_short_int_Array_0={7:0}, unsigned_char_Array_0={8:0}, unsigned_short_int_Array_0={9:0}] [L80] signed_char_Array_0[0] = __VERIFIER_nondet_char() [L81] EXPR signed_char_Array_0[0] VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, isInitial=1, last_1_unsigned_short_int_Array_0_1_=128, signed_char_Array_0={6:0}, signed_short_int_Array_0={7:0}, unsigned_char_Array_0={8:0}, unsigned_short_int_Array_0={9:0}] [L81] CALL assume_abort_if_not(signed_char_Array_0[0] >= -127) VAL [BOOL_unsigned_char_Array_0={4:0}, \old(cond)=1, double_Array_0={5:0}, isInitial=1, last_1_unsigned_short_int_Array_0_1_=128, signed_char_Array_0={6:0}, signed_short_int_Array_0={7:0}, unsigned_char_Array_0={8:0}, unsigned_short_int_Array_0={9:0}] [L20] COND FALSE !(!cond) VAL [BOOL_unsigned_char_Array_0={4:0}, \old(cond)=1, double_Array_0={5:0}, isInitial=1, last_1_unsigned_short_int_Array_0_1_=128, signed_char_Array_0={6:0}, signed_short_int_Array_0={7:0}, unsigned_char_Array_0={8:0}, unsigned_short_int_Array_0={9:0}] [L81] RET assume_abort_if_not(signed_char_Array_0[0] >= -127) VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, isInitial=1, last_1_unsigned_short_int_Array_0_1_=128, signed_char_Array_0={6:0}, signed_short_int_Array_0={7:0}, unsigned_char_Array_0={8:0}, unsigned_short_int_Array_0={9:0}] [L82] EXPR signed_char_Array_0[0] VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, isInitial=1, last_1_unsigned_short_int_Array_0_1_=128, signed_char_Array_0={6:0}, signed_short_int_Array_0={7:0}, unsigned_char_Array_0={8:0}, unsigned_short_int_Array_0={9:0}] [L82] CALL assume_abort_if_not(signed_char_Array_0[0] <= 126) VAL [BOOL_unsigned_char_Array_0={4:0}, \old(cond)=1, double_Array_0={5:0}, isInitial=1, last_1_unsigned_short_int_Array_0_1_=128, signed_char_Array_0={6:0}, signed_short_int_Array_0={7:0}, unsigned_char_Array_0={8:0}, unsigned_short_int_Array_0={9:0}] [L20] COND FALSE !(!cond) VAL [BOOL_unsigned_char_Array_0={4:0}, \old(cond)=1, double_Array_0={5:0}, isInitial=1, last_1_unsigned_short_int_Array_0_1_=128, signed_char_Array_0={6:0}, signed_short_int_Array_0={7:0}, unsigned_char_Array_0={8:0}, unsigned_short_int_Array_0={9:0}] [L82] RET assume_abort_if_not(signed_char_Array_0[0] <= 126) VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, isInitial=1, last_1_unsigned_short_int_Array_0_1_=128, signed_char_Array_0={6:0}, signed_short_int_Array_0={7:0}, unsigned_char_Array_0={8:0}, unsigned_short_int_Array_0={9:0}] [L83] unsigned_char_Array_0[0] = __VERIFIER_nondet_uchar() [L84] EXPR unsigned_char_Array_0[0] VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, isInitial=1, last_1_unsigned_short_int_Array_0_1_=128, signed_char_Array_0={6:0}, signed_short_int_Array_0={7:0}, unsigned_char_Array_0={8:0}, unsigned_short_int_Array_0={9:0}] [L84] CALL assume_abort_if_not(unsigned_char_Array_0[0] >= 0) VAL [BOOL_unsigned_char_Array_0={4:0}, \old(cond)=1, double_Array_0={5:0}, isInitial=1, last_1_unsigned_short_int_Array_0_1_=128, signed_char_Array_0={6:0}, signed_short_int_Array_0={7:0}, unsigned_char_Array_0={8:0}, unsigned_short_int_Array_0={9:0}] [L20] COND FALSE !(!cond) VAL [BOOL_unsigned_char_Array_0={4:0}, \old(cond)=1, double_Array_0={5:0}, isInitial=1, last_1_unsigned_short_int_Array_0_1_=128, signed_char_Array_0={6:0}, signed_short_int_Array_0={7:0}, unsigned_char_Array_0={8:0}, unsigned_short_int_Array_0={9:0}] [L84] RET assume_abort_if_not(unsigned_char_Array_0[0] >= 0) VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, isInitial=1, last_1_unsigned_short_int_Array_0_1_=128, signed_char_Array_0={6:0}, signed_short_int_Array_0={7:0}, unsigned_char_Array_0={8:0}, unsigned_short_int_Array_0={9:0}] [L85] EXPR unsigned_char_Array_0[0] VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, isInitial=1, last_1_unsigned_short_int_Array_0_1_=128, signed_char_Array_0={6:0}, signed_short_int_Array_0={7:0}, unsigned_char_Array_0={8:0}, unsigned_short_int_Array_0={9:0}] [L85] CALL assume_abort_if_not(unsigned_char_Array_0[0] <= 255) VAL [BOOL_unsigned_char_Array_0={4:0}, \old(cond)=1, double_Array_0={5:0}, isInitial=1, last_1_unsigned_short_int_Array_0_1_=128, signed_char_Array_0={6:0}, signed_short_int_Array_0={7:0}, unsigned_char_Array_0={8:0}, unsigned_short_int_Array_0={9:0}] [L20] COND FALSE !(!cond) VAL [BOOL_unsigned_char_Array_0={4:0}, \old(cond)=1, double_Array_0={5:0}, isInitial=1, last_1_unsigned_short_int_Array_0_1_=128, signed_char_Array_0={6:0}, signed_short_int_Array_0={7:0}, unsigned_char_Array_0={8:0}, unsigned_short_int_Array_0={9:0}] [L85] RET assume_abort_if_not(unsigned_char_Array_0[0] <= 255) VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, isInitial=1, last_1_unsigned_short_int_Array_0_1_=128, signed_char_Array_0={6:0}, signed_short_int_Array_0={7:0}, unsigned_char_Array_0={8:0}, unsigned_short_int_Array_0={9:0}] [L86] EXPR unsigned_char_Array_0[0] VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, isInitial=1, last_1_unsigned_short_int_Array_0_1_=128, signed_char_Array_0={6:0}, signed_short_int_Array_0={7:0}, unsigned_char_Array_0={8:0}, unsigned_short_int_Array_0={9:0}] [L86] CALL assume_abort_if_not(unsigned_char_Array_0[0] != 0) VAL [BOOL_unsigned_char_Array_0={4:0}, \old(cond)=1, double_Array_0={5:0}, isInitial=1, last_1_unsigned_short_int_Array_0_1_=128, signed_char_Array_0={6:0}, signed_short_int_Array_0={7:0}, unsigned_char_Array_0={8:0}, unsigned_short_int_Array_0={9:0}] [L20] COND FALSE !(!cond) VAL [BOOL_unsigned_char_Array_0={4:0}, \old(cond)=1, double_Array_0={5:0}, isInitial=1, last_1_unsigned_short_int_Array_0_1_=128, signed_char_Array_0={6:0}, signed_short_int_Array_0={7:0}, unsigned_char_Array_0={8:0}, unsigned_short_int_Array_0={9:0}] [L86] RET assume_abort_if_not(unsigned_char_Array_0[0] != 0) VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, isInitial=1, last_1_unsigned_short_int_Array_0_1_=128, signed_char_Array_0={6:0}, signed_short_int_Array_0={7:0}, unsigned_char_Array_0={8:0}, unsigned_short_int_Array_0={9:0}] [L87] unsigned_short_int_Array_0[0] = __VERIFIER_nondet_ushort() [L88] EXPR unsigned_short_int_Array_0[0] VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, isInitial=1, last_1_unsigned_short_int_Array_0_1_=128, signed_char_Array_0={6:0}, signed_short_int_Array_0={7:0}, unsigned_char_Array_0={8:0}, unsigned_short_int_Array_0={9:0}] [L88] CALL assume_abort_if_not(unsigned_short_int_Array_0[0] >= 0) VAL [BOOL_unsigned_char_Array_0={4:0}, \old(cond)=1, double_Array_0={5:0}, isInitial=1, last_1_unsigned_short_int_Array_0_1_=128, signed_char_Array_0={6:0}, signed_short_int_Array_0={7:0}, unsigned_char_Array_0={8:0}, unsigned_short_int_Array_0={9:0}] [L20] COND FALSE !(!cond) VAL [BOOL_unsigned_char_Array_0={4:0}, \old(cond)=1, double_Array_0={5:0}, isInitial=1, last_1_unsigned_short_int_Array_0_1_=128, signed_char_Array_0={6:0}, signed_short_int_Array_0={7:0}, unsigned_char_Array_0={8:0}, unsigned_short_int_Array_0={9:0}] [L88] RET assume_abort_if_not(unsigned_short_int_Array_0[0] >= 0) VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, isInitial=1, last_1_unsigned_short_int_Array_0_1_=128, signed_char_Array_0={6:0}, signed_short_int_Array_0={7:0}, unsigned_char_Array_0={8:0}, unsigned_short_int_Array_0={9:0}] [L89] EXPR unsigned_short_int_Array_0[0] VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, isInitial=1, last_1_unsigned_short_int_Array_0_1_=128, signed_char_Array_0={6:0}, signed_short_int_Array_0={7:0}, unsigned_char_Array_0={8:0}, unsigned_short_int_Array_0={9:0}] [L89] CALL assume_abort_if_not(unsigned_short_int_Array_0[0] <= 65534) VAL [BOOL_unsigned_char_Array_0={4:0}, \old(cond)=1, double_Array_0={5:0}, isInitial=1, last_1_unsigned_short_int_Array_0_1_=128, signed_char_Array_0={6:0}, signed_short_int_Array_0={7:0}, unsigned_char_Array_0={8:0}, unsigned_short_int_Array_0={9:0}] [L20] COND FALSE !(!cond) VAL [BOOL_unsigned_char_Array_0={4:0}, \old(cond)=1, double_Array_0={5:0}, isInitial=1, last_1_unsigned_short_int_Array_0_1_=128, signed_char_Array_0={6:0}, signed_short_int_Array_0={7:0}, unsigned_char_Array_0={8:0}, unsigned_short_int_Array_0={9:0}] [L89] RET assume_abort_if_not(unsigned_short_int_Array_0[0] <= 65534) VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, isInitial=1, last_1_unsigned_short_int_Array_0_1_=128, signed_char_Array_0={6:0}, signed_short_int_Array_0={7:0}, unsigned_char_Array_0={8:0}, unsigned_short_int_Array_0={9:0}] [L103] RET updateVariables() [L104] CALL step() [L44] signed_short_int_Array_0[0] = 200 [L45] EXPR signed_char_Array_0[0] [L45] signed_char_Array_0[1] = signed_char_Array_0[0] [L46] EXPR double_Array_0[1] [L46] double_Array_0[4] = double_Array_0[1] [L47] EXPR unsigned_short_int_Array_0[0] [L47] EXPR unsigned_char_Array_0[0] [L47] signed long int stepLocal_0 = unsigned_short_int_Array_0[0] / unsigned_char_Array_0[0]; [L48] BOOL_unsigned_char_Array_0[0] VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, isInitial=1, last_1_unsigned_short_int_Array_0_1_=128, signed_char_Array_0={6:0}, signed_short_int_Array_0={7:0}, unsigned_char_Array_0={8:0}, unsigned_short_int_Array_0={9:0}] [L48] COND FALSE !(BOOL_unsigned_char_Array_0[0]) [L51] EXPR signed_char_Array_0[1] VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, isInitial=1, last_1_unsigned_short_int_Array_0_1_=128, signed_char_Array_0={6:0}, signed_short_int_Array_0={7:0}, unsigned_char_Array_0={8:0}, unsigned_short_int_Array_0={9:0}] [L51] EXPR (((last_1_unsigned_short_int_Array_0_1_ * signed_char_Array_0[1])) < ((~ last_1_unsigned_short_int_Array_0_1_))) ? ((last_1_unsigned_short_int_Array_0_1_ * signed_char_Array_0[1])) : ((~ last_1_unsigned_short_int_Array_0_1_)) [L51] EXPR (((last_1_unsigned_short_int_Array_0_1_ * signed_char_Array_0[1])) < ((~ last_1_unsigned_short_int_Array_0_1_))) ? ((last_1_unsigned_short_int_Array_0_1_ * signed_char_Array_0[1])) : ((~ last_1_unsigned_short_int_Array_0_1_)) VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, isInitial=1, last_1_unsigned_short_int_Array_0_1_=128, signed_char_Array_0={6:0}, signed_short_int_Array_0={7:0}, stepLocal_0=0, unsigned_char_Array_0={8:0}, unsigned_short_int_Array_0={9:0}] [L51] COND TRUE stepLocal_0 >= (((((last_1_unsigned_short_int_Array_0_1_ * signed_char_Array_0[1])) < ((~ last_1_unsigned_short_int_Array_0_1_))) ? ((last_1_unsigned_short_int_Array_0_1_ * signed_char_Array_0[1])) : ((~ last_1_unsigned_short_int_Array_0_1_)))) [L52] EXPR unsigned_char_Array_0[0] [L52] unsigned_short_int_Array_0[1] = unsigned_char_Array_0[0] [L57] EXPR unsigned_short_int_Array_0[0] [L57] EXPR unsigned_short_int_Array_0[1] [L57] signed long int stepLocal_2 = unsigned_short_int_Array_0[0] + unsigned_short_int_Array_0[1]; [L58] EXPR signed_short_int_Array_0[0] [L58] EXPR signed_char_Array_0[1] VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, isInitial=1, last_1_unsigned_short_int_Array_0_1_=128, signed_char_Array_0={6:0}, signed_short_int_Array_0={7:0}, unsigned_char_Array_0={8:0}, unsigned_short_int_Array_0={9:0}] [L58] EXPR signed_short_int_Array_0[0] ^ signed_char_Array_0[1] VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, isInitial=1, last_1_unsigned_short_int_Array_0_1_=128, signed_char_Array_0={6:0}, signed_short_int_Array_0={7:0}, stepLocal_2=3, unsigned_char_Array_0={8:0}, unsigned_short_int_Array_0={9:0}] [L58] signed long int stepLocal_1 = signed_short_int_Array_0[0] ^ signed_char_Array_0[1]; [L59] EXPR signed_char_Array_0[1] VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, isInitial=1, last_1_unsigned_short_int_Array_0_1_=128, signed_char_Array_0={6:0}, signed_short_int_Array_0={7:0}, unsigned_char_Array_0={8:0}, unsigned_short_int_Array_0={9:0}] [L59] COND FALSE !(signed_char_Array_0[1] <= stepLocal_2) [L66] EXPR double_Array_0[1] [L66] double_Array_0[2] = double_Array_0[1] [L68] EXPR signed_char_Array_0[1] [L68] EXPR signed_char_Array_0[1] VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, isInitial=1, last_1_unsigned_short_int_Array_0_1_=128, signed_char_Array_0={6:0}, signed_short_int_Array_0={7:0}, unsigned_char_Array_0={8:0}, unsigned_short_int_Array_0={9:0}] [L68] COND FALSE !(signed_char_Array_0[1] > signed_char_Array_0[1]) [L104] RET step() [L105] CALL, EXPR property() [L95] EXPR BOOL_unsigned_char_Array_0[0] VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, isInitial=1, last_1_unsigned_short_int_Array_0_1_=128, signed_char_Array_0={6:0}, signed_short_int_Array_0={7:0}, unsigned_char_Array_0={8:0}, unsigned_short_int_Array_0={9:0}] [L95] EXPR BOOL_unsigned_char_Array_0[0] ? (unsigned_short_int_Array_0[1] == ((unsigned short int) (((((((unsigned_short_int_Array_0[0]) < 0 ) ? -(unsigned_short_int_Array_0[0]) : (unsigned_short_int_Array_0[0]))) < 0 ) ? -((((unsigned_short_int_Array_0[0]) < 0 ) ? -(unsigned_short_int_Array_0[0]) : (unsigned_short_int_Array_0[0]))) : ((((unsigned_short_int_Array_0[0]) < 0 ) ? -(unsigned_short_int_Array_0[0]) : (unsigned_short_int_Array_0[0]))))))) : (((unsigned_short_int_Array_0[0] / unsigned_char_Array_0[0]) >= (((((last_1_unsigned_short_int_Array_0_1_ * signed_char_Array_0[1])) < ((~ last_1_unsigned_short_int_Array_0_1_))) ? ((last_1_unsigned_short_int_Array_0_1_ * signed_char_Array_0[1])) : ((~ last_1_unsigned_short_int_Array_0_1_))))) ? (unsigned_short_int_Array_0[1] == ((unsigned short int) unsigned_char_Array_0[0])) : (unsigned_short_int_Array_0[1] == ((unsigned short int) unsigned_short_int_Array_0[0]))) [L95] EXPR unsigned_short_int_Array_0[0] [L95] EXPR unsigned_char_Array_0[0] [L95] EXPR signed_char_Array_0[1] VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, isInitial=1, last_1_unsigned_short_int_Array_0_1_=128, signed_char_Array_0={6:0}, signed_short_int_Array_0={7:0}, unsigned_char_Array_0={8:0}, unsigned_short_int_Array_0={9:0}] [L95] EXPR (((last_1_unsigned_short_int_Array_0_1_ * signed_char_Array_0[1])) < ((~ last_1_unsigned_short_int_Array_0_1_))) ? ((last_1_unsigned_short_int_Array_0_1_ * signed_char_Array_0[1])) : ((~ last_1_unsigned_short_int_Array_0_1_)) [L95] EXPR (((last_1_unsigned_short_int_Array_0_1_ * signed_char_Array_0[1])) < ((~ last_1_unsigned_short_int_Array_0_1_))) ? ((last_1_unsigned_short_int_Array_0_1_ * signed_char_Array_0[1])) : ((~ last_1_unsigned_short_int_Array_0_1_)) VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, isInitial=1, last_1_unsigned_short_int_Array_0_1_=128, signed_char_Array_0={6:0}, signed_short_int_Array_0={7:0}, unsigned_char_Array_0={8:0}, unsigned_short_int_Array_0={9:0}] [L95] EXPR ((unsigned_short_int_Array_0[0] / unsigned_char_Array_0[0]) >= (((((last_1_unsigned_short_int_Array_0_1_ * signed_char_Array_0[1])) < ((~ last_1_unsigned_short_int_Array_0_1_))) ? ((last_1_unsigned_short_int_Array_0_1_ * signed_char_Array_0[1])) : ((~ last_1_unsigned_short_int_Array_0_1_))))) ? (unsigned_short_int_Array_0[1] == ((unsigned short int) unsigned_char_Array_0[0])) : (unsigned_short_int_Array_0[1] == ((unsigned short int) unsigned_short_int_Array_0[0])) [L95] EXPR unsigned_short_int_Array_0[1] [L95] EXPR unsigned_char_Array_0[0] [L95] EXPR ((unsigned_short_int_Array_0[0] / unsigned_char_Array_0[0]) >= (((((last_1_unsigned_short_int_Array_0_1_ * signed_char_Array_0[1])) < ((~ last_1_unsigned_short_int_Array_0_1_))) ? ((last_1_unsigned_short_int_Array_0_1_ * signed_char_Array_0[1])) : ((~ last_1_unsigned_short_int_Array_0_1_))))) ? (unsigned_short_int_Array_0[1] == ((unsigned short int) unsigned_char_Array_0[0])) : (unsigned_short_int_Array_0[1] == ((unsigned short int) unsigned_short_int_Array_0[0])) VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, isInitial=1, last_1_unsigned_short_int_Array_0_1_=128, signed_char_Array_0={6:0}, signed_short_int_Array_0={7:0}, unsigned_char_Array_0={8:0}, unsigned_short_int_Array_0={9:0}] [L95] EXPR BOOL_unsigned_char_Array_0[0] ? (unsigned_short_int_Array_0[1] == ((unsigned short int) (((((((unsigned_short_int_Array_0[0]) < 0 ) ? -(unsigned_short_int_Array_0[0]) : (unsigned_short_int_Array_0[0]))) < 0 ) ? -((((unsigned_short_int_Array_0[0]) < 0 ) ? -(unsigned_short_int_Array_0[0]) : (unsigned_short_int_Array_0[0]))) : ((((unsigned_short_int_Array_0[0]) < 0 ) ? -(unsigned_short_int_Array_0[0]) : (unsigned_short_int_Array_0[0]))))))) : (((unsigned_short_int_Array_0[0] / unsigned_char_Array_0[0]) >= (((((last_1_unsigned_short_int_Array_0_1_ * signed_char_Array_0[1])) < ((~ last_1_unsigned_short_int_Array_0_1_))) ? ((last_1_unsigned_short_int_Array_0_1_ * signed_char_Array_0[1])) : ((~ last_1_unsigned_short_int_Array_0_1_))))) ? (unsigned_short_int_Array_0[1] == ((unsigned short int) unsigned_char_Array_0[0])) : (unsigned_short_int_Array_0[1] == ((unsigned short int) unsigned_short_int_Array_0[0]))) VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, isInitial=1, last_1_unsigned_short_int_Array_0_1_=128, signed_char_Array_0={6:0}, signed_short_int_Array_0={7:0}, unsigned_char_Array_0={8:0}, unsigned_short_int_Array_0={9:0}] [L95] EXPR (BOOL_unsigned_char_Array_0[0] ? (unsigned_short_int_Array_0[1] == ((unsigned short int) (((((((unsigned_short_int_Array_0[0]) < 0 ) ? -(unsigned_short_int_Array_0[0]) : (unsigned_short_int_Array_0[0]))) < 0 ) ? -((((unsigned_short_int_Array_0[0]) < 0 ) ? -(unsigned_short_int_Array_0[0]) : (unsigned_short_int_Array_0[0]))) : ((((unsigned_short_int_Array_0[0]) < 0 ) ? -(unsigned_short_int_Array_0[0]) : (unsigned_short_int_Array_0[0]))))))) : (((unsigned_short_int_Array_0[0] / unsigned_char_Array_0[0]) >= (((((last_1_unsigned_short_int_Array_0_1_ * signed_char_Array_0[1])) < ((~ last_1_unsigned_short_int_Array_0_1_))) ? ((last_1_unsigned_short_int_Array_0_1_ * signed_char_Array_0[1])) : ((~ last_1_unsigned_short_int_Array_0_1_))))) ? (unsigned_short_int_Array_0[1] == ((unsigned short int) unsigned_char_Array_0[0])) : (unsigned_short_int_Array_0[1] == ((unsigned short int) unsigned_short_int_Array_0[0])))) && ((signed_char_Array_0[1] <= (unsigned_short_int_Array_0[0] + unsigned_short_int_Array_0[1])) ? ((unsigned_short_int_Array_0[1] == (signed_short_int_Array_0[0] ^ signed_char_Array_0[1])) ? (double_Array_0[2] == ((double) (((((double_Array_0[1]) < 0 ) ? -(double_Array_0[1]) : (double_Array_0[1]))) + double_Array_0[3]))) : (double_Array_0[2] == ((double) double_Array_0[3]))) : (double_Array_0[2] == ((double) double_Array_0[1]))) VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, isInitial=1, last_1_unsigned_short_int_Array_0_1_=128, signed_char_Array_0={6:0}, signed_short_int_Array_0={7:0}, unsigned_char_Array_0={8:0}, unsigned_short_int_Array_0={9:0}] [L95] EXPR (BOOL_unsigned_char_Array_0[0] ? (unsigned_short_int_Array_0[1] == ((unsigned short int) (((((((unsigned_short_int_Array_0[0]) < 0 ) ? -(unsigned_short_int_Array_0[0]) : (unsigned_short_int_Array_0[0]))) < 0 ) ? -((((unsigned_short_int_Array_0[0]) < 0 ) ? -(unsigned_short_int_Array_0[0]) : (unsigned_short_int_Array_0[0]))) : ((((unsigned_short_int_Array_0[0]) < 0 ) ? -(unsigned_short_int_Array_0[0]) : (unsigned_short_int_Array_0[0]))))))) : (((unsigned_short_int_Array_0[0] / unsigned_char_Array_0[0]) >= (((((last_1_unsigned_short_int_Array_0_1_ * signed_char_Array_0[1])) < ((~ last_1_unsigned_short_int_Array_0_1_))) ? ((last_1_unsigned_short_int_Array_0_1_ * signed_char_Array_0[1])) : ((~ last_1_unsigned_short_int_Array_0_1_))))) ? (unsigned_short_int_Array_0[1] == ((unsigned short int) unsigned_char_Array_0[0])) : (unsigned_short_int_Array_0[1] == ((unsigned short int) unsigned_short_int_Array_0[0])))) && ((signed_char_Array_0[1] <= (unsigned_short_int_Array_0[0] + unsigned_short_int_Array_0[1])) ? ((unsigned_short_int_Array_0[1] == (signed_short_int_Array_0[0] ^ signed_char_Array_0[1])) ? (double_Array_0[2] == ((double) (((((double_Array_0[1]) < 0 ) ? -(double_Array_0[1]) : (double_Array_0[1]))) + double_Array_0[3]))) : (double_Array_0[2] == ((double) double_Array_0[3]))) : (double_Array_0[2] == ((double) double_Array_0[1]))) [L95] EXPR signed_char_Array_0[1] [L95] EXPR unsigned_short_int_Array_0[0] [L95] EXPR unsigned_short_int_Array_0[1] VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, isInitial=1, last_1_unsigned_short_int_Array_0_1_=128, signed_char_Array_0={6:0}, signed_short_int_Array_0={7:0}, unsigned_char_Array_0={8:0}, unsigned_short_int_Array_0={9:0}] [L95] EXPR (signed_char_Array_0[1] <= (unsigned_short_int_Array_0[0] + unsigned_short_int_Array_0[1])) ? ((unsigned_short_int_Array_0[1] == (signed_short_int_Array_0[0] ^ signed_char_Array_0[1])) ? (double_Array_0[2] == ((double) (((((double_Array_0[1]) < 0 ) ? -(double_Array_0[1]) : (double_Array_0[1]))) + double_Array_0[3]))) : (double_Array_0[2] == ((double) double_Array_0[3]))) : (double_Array_0[2] == ((double) double_Array_0[1])) [L95] EXPR double_Array_0[2] [L95] EXPR double_Array_0[1] [L95] EXPR (signed_char_Array_0[1] <= (unsigned_short_int_Array_0[0] + unsigned_short_int_Array_0[1])) ? ((unsigned_short_int_Array_0[1] == (signed_short_int_Array_0[0] ^ signed_char_Array_0[1])) ? (double_Array_0[2] == ((double) (((((double_Array_0[1]) < 0 ) ? -(double_Array_0[1]) : (double_Array_0[1]))) + double_Array_0[3]))) : (double_Array_0[2] == ((double) double_Array_0[3]))) : (double_Array_0[2] == ((double) double_Array_0[1])) VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, isInitial=1, last_1_unsigned_short_int_Array_0_1_=128, signed_char_Array_0={6:0}, signed_short_int_Array_0={7:0}, unsigned_char_Array_0={8:0}, unsigned_short_int_Array_0={9:0}] [L95] EXPR (BOOL_unsigned_char_Array_0[0] ? (unsigned_short_int_Array_0[1] == ((unsigned short int) (((((((unsigned_short_int_Array_0[0]) < 0 ) ? -(unsigned_short_int_Array_0[0]) : (unsigned_short_int_Array_0[0]))) < 0 ) ? -((((unsigned_short_int_Array_0[0]) < 0 ) ? -(unsigned_short_int_Array_0[0]) : (unsigned_short_int_Array_0[0]))) : ((((unsigned_short_int_Array_0[0]) < 0 ) ? -(unsigned_short_int_Array_0[0]) : (unsigned_short_int_Array_0[0]))))))) : (((unsigned_short_int_Array_0[0] / unsigned_char_Array_0[0]) >= (((((last_1_unsigned_short_int_Array_0_1_ * signed_char_Array_0[1])) < ((~ last_1_unsigned_short_int_Array_0_1_))) ? ((last_1_unsigned_short_int_Array_0_1_ * signed_char_Array_0[1])) : ((~ last_1_unsigned_short_int_Array_0_1_))))) ? (unsigned_short_int_Array_0[1] == ((unsigned short int) unsigned_char_Array_0[0])) : (unsigned_short_int_Array_0[1] == ((unsigned short int) unsigned_short_int_Array_0[0])))) && ((signed_char_Array_0[1] <= (unsigned_short_int_Array_0[0] + unsigned_short_int_Array_0[1])) ? ((unsigned_short_int_Array_0[1] == (signed_short_int_Array_0[0] ^ signed_char_Array_0[1])) ? (double_Array_0[2] == ((double) (((((double_Array_0[1]) < 0 ) ? -(double_Array_0[1]) : (double_Array_0[1]))) + double_Array_0[3]))) : (double_Array_0[2] == ((double) double_Array_0[3]))) : (double_Array_0[2] == ((double) double_Array_0[1]))) VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, isInitial=1, last_1_unsigned_short_int_Array_0_1_=128, signed_char_Array_0={6:0}, signed_short_int_Array_0={7:0}, unsigned_char_Array_0={8:0}, unsigned_short_int_Array_0={9:0}] [L95] EXPR ((BOOL_unsigned_char_Array_0[0] ? (unsigned_short_int_Array_0[1] == ((unsigned short int) (((((((unsigned_short_int_Array_0[0]) < 0 ) ? -(unsigned_short_int_Array_0[0]) : (unsigned_short_int_Array_0[0]))) < 0 ) ? -((((unsigned_short_int_Array_0[0]) < 0 ) ? -(unsigned_short_int_Array_0[0]) : (unsigned_short_int_Array_0[0]))) : ((((unsigned_short_int_Array_0[0]) < 0 ) ? -(unsigned_short_int_Array_0[0]) : (unsigned_short_int_Array_0[0]))))))) : (((unsigned_short_int_Array_0[0] / unsigned_char_Array_0[0]) >= (((((last_1_unsigned_short_int_Array_0_1_ * signed_char_Array_0[1])) < ((~ last_1_unsigned_short_int_Array_0_1_))) ? ((last_1_unsigned_short_int_Array_0_1_ * signed_char_Array_0[1])) : ((~ last_1_unsigned_short_int_Array_0_1_))))) ? (unsigned_short_int_Array_0[1] == ((unsigned short int) unsigned_char_Array_0[0])) : (unsigned_short_int_Array_0[1] == ((unsigned short int) unsigned_short_int_Array_0[0])))) && ((signed_char_Array_0[1] <= (unsigned_short_int_Array_0[0] + unsigned_short_int_Array_0[1])) ? ((unsigned_short_int_Array_0[1] == (signed_short_int_Array_0[0] ^ signed_char_Array_0[1])) ? (double_Array_0[2] == ((double) (((((double_Array_0[1]) < 0 ) ? -(double_Array_0[1]) : (double_Array_0[1]))) + double_Array_0[3]))) : (double_Array_0[2] == ((double) double_Array_0[3]))) : (double_Array_0[2] == ((double) double_Array_0[1])))) && ((signed_char_Array_0[1] > signed_char_Array_0[1]) ? (double_Array_0[0] == ((double) ((((double_Array_0[3]) < (double_Array_0[1])) ? (double_Array_0[3]) : (double_Array_0[1]))))) : 1) VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, isInitial=1, last_1_unsigned_short_int_Array_0_1_=128, signed_char_Array_0={6:0}, signed_short_int_Array_0={7:0}, unsigned_char_Array_0={8:0}, unsigned_short_int_Array_0={9:0}] [L95] EXPR ((BOOL_unsigned_char_Array_0[0] ? (unsigned_short_int_Array_0[1] == ((unsigned short int) (((((((unsigned_short_int_Array_0[0]) < 0 ) ? -(unsigned_short_int_Array_0[0]) : (unsigned_short_int_Array_0[0]))) < 0 ) ? -((((unsigned_short_int_Array_0[0]) < 0 ) ? -(unsigned_short_int_Array_0[0]) : (unsigned_short_int_Array_0[0]))) : ((((unsigned_short_int_Array_0[0]) < 0 ) ? -(unsigned_short_int_Array_0[0]) : (unsigned_short_int_Array_0[0]))))))) : (((unsigned_short_int_Array_0[0] / unsigned_char_Array_0[0]) >= (((((last_1_unsigned_short_int_Array_0_1_ * signed_char_Array_0[1])) < ((~ last_1_unsigned_short_int_Array_0_1_))) ? ((last_1_unsigned_short_int_Array_0_1_ * signed_char_Array_0[1])) : ((~ last_1_unsigned_short_int_Array_0_1_))))) ? (unsigned_short_int_Array_0[1] == ((unsigned short int) unsigned_char_Array_0[0])) : (unsigned_short_int_Array_0[1] == ((unsigned short int) unsigned_short_int_Array_0[0])))) && ((signed_char_Array_0[1] <= (unsigned_short_int_Array_0[0] + unsigned_short_int_Array_0[1])) ? ((unsigned_short_int_Array_0[1] == (signed_short_int_Array_0[0] ^ signed_char_Array_0[1])) ? (double_Array_0[2] == ((double) (((((double_Array_0[1]) < 0 ) ? -(double_Array_0[1]) : (double_Array_0[1]))) + double_Array_0[3]))) : (double_Array_0[2] == ((double) double_Array_0[3]))) : (double_Array_0[2] == ((double) double_Array_0[1])))) && ((signed_char_Array_0[1] > signed_char_Array_0[1]) ? (double_Array_0[0] == ((double) ((((double_Array_0[3]) < (double_Array_0[1])) ? (double_Array_0[3]) : (double_Array_0[1]))))) : 1) VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, isInitial=1, last_1_unsigned_short_int_Array_0_1_=128, signed_char_Array_0={6:0}, signed_short_int_Array_0={7:0}, unsigned_char_Array_0={8:0}, unsigned_short_int_Array_0={9:0}] [L95] EXPR (((BOOL_unsigned_char_Array_0[0] ? (unsigned_short_int_Array_0[1] == ((unsigned short int) (((((((unsigned_short_int_Array_0[0]) < 0 ) ? -(unsigned_short_int_Array_0[0]) : (unsigned_short_int_Array_0[0]))) < 0 ) ? -((((unsigned_short_int_Array_0[0]) < 0 ) ? -(unsigned_short_int_Array_0[0]) : (unsigned_short_int_Array_0[0]))) : ((((unsigned_short_int_Array_0[0]) < 0 ) ? -(unsigned_short_int_Array_0[0]) : (unsigned_short_int_Array_0[0]))))))) : (((unsigned_short_int_Array_0[0] / unsigned_char_Array_0[0]) >= (((((last_1_unsigned_short_int_Array_0_1_ * signed_char_Array_0[1])) < ((~ last_1_unsigned_short_int_Array_0_1_))) ? ((last_1_unsigned_short_int_Array_0_1_ * signed_char_Array_0[1])) : ((~ last_1_unsigned_short_int_Array_0_1_))))) ? (unsigned_short_int_Array_0[1] == ((unsigned short int) unsigned_char_Array_0[0])) : (unsigned_short_int_Array_0[1] == ((unsigned short int) unsigned_short_int_Array_0[0])))) && ((signed_char_Array_0[1] <= (unsigned_short_int_Array_0[0] + unsigned_short_int_Array_0[1])) ? ((unsigned_short_int_Array_0[1] == (signed_short_int_Array_0[0] ^ signed_char_Array_0[1])) ? (double_Array_0[2] == ((double) (((((double_Array_0[1]) < 0 ) ? -(double_Array_0[1]) : (double_Array_0[1]))) + double_Array_0[3]))) : (double_Array_0[2] == ((double) double_Array_0[3]))) : (double_Array_0[2] == ((double) double_Array_0[1])))) && ((signed_char_Array_0[1] > signed_char_Array_0[1]) ? (double_Array_0[0] == ((double) ((((double_Array_0[3]) < (double_Array_0[1])) ? (double_Array_0[3]) : (double_Array_0[1]))))) : 1)) && (signed_short_int_Array_0[0] == ((signed short int) 200)) VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, isInitial=1, last_1_unsigned_short_int_Array_0_1_=128, signed_char_Array_0={6:0}, signed_short_int_Array_0={7:0}, unsigned_char_Array_0={8:0}, unsigned_short_int_Array_0={9:0}] [L95] EXPR (((BOOL_unsigned_char_Array_0[0] ? (unsigned_short_int_Array_0[1] == ((unsigned short int) (((((((unsigned_short_int_Array_0[0]) < 0 ) ? -(unsigned_short_int_Array_0[0]) : (unsigned_short_int_Array_0[0]))) < 0 ) ? -((((unsigned_short_int_Array_0[0]) < 0 ) ? -(unsigned_short_int_Array_0[0]) : (unsigned_short_int_Array_0[0]))) : ((((unsigned_short_int_Array_0[0]) < 0 ) ? -(unsigned_short_int_Array_0[0]) : (unsigned_short_int_Array_0[0]))))))) : (((unsigned_short_int_Array_0[0] / unsigned_char_Array_0[0]) >= (((((last_1_unsigned_short_int_Array_0_1_ * signed_char_Array_0[1])) < ((~ last_1_unsigned_short_int_Array_0_1_))) ? ((last_1_unsigned_short_int_Array_0_1_ * signed_char_Array_0[1])) : ((~ last_1_unsigned_short_int_Array_0_1_))))) ? (unsigned_short_int_Array_0[1] == ((unsigned short int) unsigned_char_Array_0[0])) : (unsigned_short_int_Array_0[1] == ((unsigned short int) unsigned_short_int_Array_0[0])))) && ((signed_char_Array_0[1] <= (unsigned_short_int_Array_0[0] + unsigned_short_int_Array_0[1])) ? ((unsigned_short_int_Array_0[1] == (signed_short_int_Array_0[0] ^ signed_char_Array_0[1])) ? (double_Array_0[2] == ((double) (((((double_Array_0[1]) < 0 ) ? -(double_Array_0[1]) : (double_Array_0[1]))) + double_Array_0[3]))) : (double_Array_0[2] == ((double) double_Array_0[3]))) : (double_Array_0[2] == ((double) double_Array_0[1])))) && ((signed_char_Array_0[1] > signed_char_Array_0[1]) ? (double_Array_0[0] == ((double) ((((double_Array_0[3]) < (double_Array_0[1])) ? (double_Array_0[3]) : (double_Array_0[1]))))) : 1)) && (signed_short_int_Array_0[0] == ((signed short int) 200)) VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, isInitial=1, last_1_unsigned_short_int_Array_0_1_=128, signed_char_Array_0={6:0}, signed_short_int_Array_0={7:0}, unsigned_char_Array_0={8:0}, unsigned_short_int_Array_0={9:0}] [L95] EXPR ((((BOOL_unsigned_char_Array_0[0] ? (unsigned_short_int_Array_0[1] == ((unsigned short int) (((((((unsigned_short_int_Array_0[0]) < 0 ) ? -(unsigned_short_int_Array_0[0]) : (unsigned_short_int_Array_0[0]))) < 0 ) ? -((((unsigned_short_int_Array_0[0]) < 0 ) ? -(unsigned_short_int_Array_0[0]) : (unsigned_short_int_Array_0[0]))) : ((((unsigned_short_int_Array_0[0]) < 0 ) ? -(unsigned_short_int_Array_0[0]) : (unsigned_short_int_Array_0[0]))))))) : (((unsigned_short_int_Array_0[0] / unsigned_char_Array_0[0]) >= (((((last_1_unsigned_short_int_Array_0_1_ * signed_char_Array_0[1])) < ((~ last_1_unsigned_short_int_Array_0_1_))) ? ((last_1_unsigned_short_int_Array_0_1_ * signed_char_Array_0[1])) : ((~ last_1_unsigned_short_int_Array_0_1_))))) ? (unsigned_short_int_Array_0[1] == ((unsigned short int) unsigned_char_Array_0[0])) : (unsigned_short_int_Array_0[1] == ((unsigned short int) unsigned_short_int_Array_0[0])))) && ((signed_char_Array_0[1] <= (unsigned_short_int_Array_0[0] + unsigned_short_int_Array_0[1])) ? ((unsigned_short_int_Array_0[1] == (signed_short_int_Array_0[0] ^ signed_char_Array_0[1])) ? (double_Array_0[2] == ((double) (((((double_Array_0[1]) < 0 ) ? -(double_Array_0[1]) : (double_Array_0[1]))) + double_Array_0[3]))) : (double_Array_0[2] == ((double) double_Array_0[3]))) : (double_Array_0[2] == ((double) double_Array_0[1])))) && ((signed_char_Array_0[1] > signed_char_Array_0[1]) ? (double_Array_0[0] == ((double) ((((double_Array_0[3]) < (double_Array_0[1])) ? (double_Array_0[3]) : (double_Array_0[1]))))) : 1)) && (signed_short_int_Array_0[0] == ((signed short int) 200))) && (signed_char_Array_0[1] == ((signed char) signed_char_Array_0[0])) VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, isInitial=1, last_1_unsigned_short_int_Array_0_1_=128, signed_char_Array_0={6:0}, signed_short_int_Array_0={7:0}, unsigned_char_Array_0={8:0}, unsigned_short_int_Array_0={9:0}] [L95] EXPR ((((BOOL_unsigned_char_Array_0[0] ? (unsigned_short_int_Array_0[1] == ((unsigned short int) (((((((unsigned_short_int_Array_0[0]) < 0 ) ? -(unsigned_short_int_Array_0[0]) : (unsigned_short_int_Array_0[0]))) < 0 ) ? -((((unsigned_short_int_Array_0[0]) < 0 ) ? -(unsigned_short_int_Array_0[0]) : (unsigned_short_int_Array_0[0]))) : ((((unsigned_short_int_Array_0[0]) < 0 ) ? -(unsigned_short_int_Array_0[0]) : (unsigned_short_int_Array_0[0]))))))) : (((unsigned_short_int_Array_0[0] / unsigned_char_Array_0[0]) >= (((((last_1_unsigned_short_int_Array_0_1_ * signed_char_Array_0[1])) < ((~ last_1_unsigned_short_int_Array_0_1_))) ? ((last_1_unsigned_short_int_Array_0_1_ * signed_char_Array_0[1])) : ((~ last_1_unsigned_short_int_Array_0_1_))))) ? (unsigned_short_int_Array_0[1] == ((unsigned short int) unsigned_char_Array_0[0])) : (unsigned_short_int_Array_0[1] == ((unsigned short int) unsigned_short_int_Array_0[0])))) && ((signed_char_Array_0[1] <= (unsigned_short_int_Array_0[0] + unsigned_short_int_Array_0[1])) ? ((unsigned_short_int_Array_0[1] == (signed_short_int_Array_0[0] ^ signed_char_Array_0[1])) ? (double_Array_0[2] == ((double) (((((double_Array_0[1]) < 0 ) ? -(double_Array_0[1]) : (double_Array_0[1]))) + double_Array_0[3]))) : (double_Array_0[2] == ((double) double_Array_0[3]))) : (double_Array_0[2] == ((double) double_Array_0[1])))) && ((signed_char_Array_0[1] > signed_char_Array_0[1]) ? (double_Array_0[0] == ((double) ((((double_Array_0[3]) < (double_Array_0[1])) ? (double_Array_0[3]) : (double_Array_0[1]))))) : 1)) && (signed_short_int_Array_0[0] == ((signed short int) 200))) && (signed_char_Array_0[1] == ((signed char) signed_char_Array_0[0])) VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, isInitial=1, last_1_unsigned_short_int_Array_0_1_=128, signed_char_Array_0={6:0}, signed_short_int_Array_0={7:0}, unsigned_char_Array_0={8:0}, unsigned_short_int_Array_0={9:0}] [L95] EXPR (((((BOOL_unsigned_char_Array_0[0] ? (unsigned_short_int_Array_0[1] == ((unsigned short int) (((((((unsigned_short_int_Array_0[0]) < 0 ) ? -(unsigned_short_int_Array_0[0]) : (unsigned_short_int_Array_0[0]))) < 0 ) ? -((((unsigned_short_int_Array_0[0]) < 0 ) ? -(unsigned_short_int_Array_0[0]) : (unsigned_short_int_Array_0[0]))) : ((((unsigned_short_int_Array_0[0]) < 0 ) ? -(unsigned_short_int_Array_0[0]) : (unsigned_short_int_Array_0[0]))))))) : (((unsigned_short_int_Array_0[0] / unsigned_char_Array_0[0]) >= (((((last_1_unsigned_short_int_Array_0_1_ * signed_char_Array_0[1])) < ((~ last_1_unsigned_short_int_Array_0_1_))) ? ((last_1_unsigned_short_int_Array_0_1_ * signed_char_Array_0[1])) : ((~ last_1_unsigned_short_int_Array_0_1_))))) ? (unsigned_short_int_Array_0[1] == ((unsigned short int) unsigned_char_Array_0[0])) : (unsigned_short_int_Array_0[1] == ((unsigned short int) unsigned_short_int_Array_0[0])))) && ((signed_char_Array_0[1] <= (unsigned_short_int_Array_0[0] + unsigned_short_int_Array_0[1])) ? ((unsigned_short_int_Array_0[1] == (signed_short_int_Array_0[0] ^ signed_char_Array_0[1])) ? (double_Array_0[2] == ((double) (((((double_Array_0[1]) < 0 ) ? -(double_Array_0[1]) : (double_Array_0[1]))) + double_Array_0[3]))) : (double_Array_0[2] == ((double) double_Array_0[3]))) : (double_Array_0[2] == ((double) double_Array_0[1])))) && ((signed_char_Array_0[1] > signed_char_Array_0[1]) ? (double_Array_0[0] == ((double) ((((double_Array_0[3]) < (double_Array_0[1])) ? (double_Array_0[3]) : (double_Array_0[1]))))) : 1)) && (signed_short_int_Array_0[0] == ((signed short int) 200))) && (signed_char_Array_0[1] == ((signed char) signed_char_Array_0[0]))) && (double_Array_0[4] == ((double) double_Array_0[1])) VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, isInitial=1, last_1_unsigned_short_int_Array_0_1_=128, signed_char_Array_0={6:0}, signed_short_int_Array_0={7:0}, unsigned_char_Array_0={8:0}, unsigned_short_int_Array_0={9:0}] [L95] EXPR (((((BOOL_unsigned_char_Array_0[0] ? (unsigned_short_int_Array_0[1] == ((unsigned short int) (((((((unsigned_short_int_Array_0[0]) < 0 ) ? -(unsigned_short_int_Array_0[0]) : (unsigned_short_int_Array_0[0]))) < 0 ) ? -((((unsigned_short_int_Array_0[0]) < 0 ) ? -(unsigned_short_int_Array_0[0]) : (unsigned_short_int_Array_0[0]))) : ((((unsigned_short_int_Array_0[0]) < 0 ) ? -(unsigned_short_int_Array_0[0]) : (unsigned_short_int_Array_0[0]))))))) : (((unsigned_short_int_Array_0[0] / unsigned_char_Array_0[0]) >= (((((last_1_unsigned_short_int_Array_0_1_ * signed_char_Array_0[1])) < ((~ last_1_unsigned_short_int_Array_0_1_))) ? ((last_1_unsigned_short_int_Array_0_1_ * signed_char_Array_0[1])) : ((~ last_1_unsigned_short_int_Array_0_1_))))) ? (unsigned_short_int_Array_0[1] == ((unsigned short int) unsigned_char_Array_0[0])) : (unsigned_short_int_Array_0[1] == ((unsigned short int) unsigned_short_int_Array_0[0])))) && ((signed_char_Array_0[1] <= (unsigned_short_int_Array_0[0] + unsigned_short_int_Array_0[1])) ? ((unsigned_short_int_Array_0[1] == (signed_short_int_Array_0[0] ^ signed_char_Array_0[1])) ? (double_Array_0[2] == ((double) (((((double_Array_0[1]) < 0 ) ? -(double_Array_0[1]) : (double_Array_0[1]))) + double_Array_0[3]))) : (double_Array_0[2] == ((double) double_Array_0[3]))) : (double_Array_0[2] == ((double) double_Array_0[1])))) && ((signed_char_Array_0[1] > signed_char_Array_0[1]) ? (double_Array_0[0] == ((double) ((((double_Array_0[3]) < (double_Array_0[1])) ? (double_Array_0[3]) : (double_Array_0[1]))))) : 1)) && (signed_short_int_Array_0[0] == ((signed short int) 200))) && (signed_char_Array_0[1] == ((signed char) signed_char_Array_0[0]))) && (double_Array_0[4] == ((double) double_Array_0[1])) VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, isInitial=1, last_1_unsigned_short_int_Array_0_1_=128, signed_char_Array_0={6:0}, signed_short_int_Array_0={7:0}, unsigned_char_Array_0={8:0}, unsigned_short_int_Array_0={9:0}] [L95-L96] return (((((BOOL_unsigned_char_Array_0[0] ? (unsigned_short_int_Array_0[1] == ((unsigned short int) (((((((unsigned_short_int_Array_0[0]) < 0 ) ? -(unsigned_short_int_Array_0[0]) : (unsigned_short_int_Array_0[0]))) < 0 ) ? -((((unsigned_short_int_Array_0[0]) < 0 ) ? -(unsigned_short_int_Array_0[0]) : (unsigned_short_int_Array_0[0]))) : ((((unsigned_short_int_Array_0[0]) < 0 ) ? -(unsigned_short_int_Array_0[0]) : (unsigned_short_int_Array_0[0]))))))) : (((unsigned_short_int_Array_0[0] / unsigned_char_Array_0[0]) >= (((((last_1_unsigned_short_int_Array_0_1_ * signed_char_Array_0[1])) < ((~ last_1_unsigned_short_int_Array_0_1_))) ? ((last_1_unsigned_short_int_Array_0_1_ * signed_char_Array_0[1])) : ((~ last_1_unsigned_short_int_Array_0_1_))))) ? (unsigned_short_int_Array_0[1] == ((unsigned short int) unsigned_char_Array_0[0])) : (unsigned_short_int_Array_0[1] == ((unsigned short int) unsigned_short_int_Array_0[0])))) && ((signed_char_Array_0[1] <= (unsigned_short_int_Array_0[0] + unsigned_short_int_Array_0[1])) ? ((unsigned_short_int_Array_0[1] == (signed_short_int_Array_0[0] ^ signed_char_Array_0[1])) ? (double_Array_0[2] == ((double) (((((double_Array_0[1]) < 0 ) ? -(double_Array_0[1]) : (double_Array_0[1]))) + double_Array_0[3]))) : (double_Array_0[2] == ((double) double_Array_0[3]))) : (double_Array_0[2] == ((double) double_Array_0[1])))) && ((signed_char_Array_0[1] > signed_char_Array_0[1]) ? (double_Array_0[0] == ((double) ((((double_Array_0[3]) < (double_Array_0[1])) ? (double_Array_0[3]) : (double_Array_0[1]))))) : 1)) && (signed_short_int_Array_0[0] == ((signed short int) 200))) && (signed_char_Array_0[1] == ((signed char) signed_char_Array_0[0]))) && (double_Array_0[4] == ((double) double_Array_0[1])) ; [L105] RET, EXPR property() [L105] CALL __VERIFIER_assert(property()) [L19] COND TRUE !(cond) VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, isInitial=1, last_1_unsigned_short_int_Array_0_1_=128, signed_char_Array_0={6:0}, signed_short_int_Array_0={7:0}, unsigned_char_Array_0={8:0}, unsigned_short_int_Array_0={9:0}] [L19] reach_error() VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, isInitial=1, last_1_unsigned_short_int_Array_0_1_=128, signed_char_Array_0={6:0}, signed_short_int_Array_0={7:0}, unsigned_char_Array_0={8:0}, unsigned_short_int_Array_0={9:0}] - StatisticsResult: Ultimate Automizer benchmark data CFG has 2 procedures, 112 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 25.5s, OverallIterations: 26, TraceHistogramMax: 11, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.1s, AutomataDifference: 7.1s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 3454 SdHoareTripleChecker+Valid, 5.4s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 3444 mSDsluCounter, 17882 SdHoareTripleChecker+Invalid, 4.6s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 13580 mSDsCounter, 143 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 4182 IncrementalHoareTripleChecker+Invalid, 4325 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 143 mSolverCounterUnsat, 4302 mSDtfsCounter, 4182 mSolverCounterSat, 0.1s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 1992 GetRequests, 1799 SyntacticMatches, 2 SemanticMatches, 191 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 439 ImplicationChecksByTransitivity, 2.8s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=804occurred in iteration=20, InterpolantAutomatonStates: 163, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.5s AutomataMinimizationTime, 25 MinimizatonAttempts, 2134 StatesRemovedByMinimization, 20 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.5s SsaConstructionTime, 2.7s SatisfiabilityAnalysisTime, 9.7s InterpolantComputationTime, 4119 NumberOfCodeBlocks, 4119 NumberOfCodeBlocksAsserted, 38 NumberOfCheckSat, 3104 ConstructedInterpolants, 11 QuantifiedInterpolants, 14607 SizeOfPredicates, 103 NumberOfNonLiveVariables, 4504 ConjunctsInSsa, 288 ConjunctsInUnsatCore, 29 InterpolantComputations, 25 PerfectInterpolantSequences, 6065/6380 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-11-09 01:36:08,987 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Ended with 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/11.0.12-open/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-a_file-83.i -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Bitvector.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! call(reach_error())) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash f973a40b26aaa32bb1cc01afeff98c3363a14790c658d13c89361ba4409a62b2 --- Real Ultimate output --- This is Ultimate 0.2.5-?-c7c6ca5-m [2024-11-09 01:36:11,105 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-09 01:36:11,174 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Bitvector.epf [2024-11-09 01:36:11,180 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-09 01:36:11,181 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-09 01:36:11,209 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-09 01:36:11,210 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-09 01:36:11,210 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-09 01:36:11,211 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-11-09 01:36:11,211 INFO L153 SettingsManager]: * Use memory slicer=true [2024-11-09 01:36:11,211 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-09 01:36:11,212 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-09 01:36:11,212 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-09 01:36:11,212 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-09 01:36:11,214 INFO L153 SettingsManager]: * Use SBE=true [2024-11-09 01:36:11,215 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-09 01:36:11,215 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-11-09 01:36:11,215 INFO L153 SettingsManager]: * sizeof long=4 [2024-11-09 01:36:11,215 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-11-09 01:36:11,216 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-09 01:36:11,216 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-11-09 01:36:11,217 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-09 01:36:11,217 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-11-09 01:36:11,220 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2024-11-09 01:36:11,221 INFO L153 SettingsManager]: * Use bitvectors instead of ints=true [2024-11-09 01:36:11,221 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-09 01:36:11,221 INFO L153 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2024-11-09 01:36:11,221 INFO L153 SettingsManager]: * sizeof long double=12 [2024-11-09 01:36:11,222 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-11-09 01:36:11,222 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-09 01:36:11,222 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-11-09 01:36:11,222 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-09 01:36:11,230 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-09 01:36:11,231 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-09 01:36:11,231 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-09 01:36:11,231 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-09 01:36:11,231 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-09 01:36:11,232 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-11-09 01:36:11,232 INFO L153 SettingsManager]: * Trace refinement strategy=WOLF [2024-11-09 01:36:11,232 INFO L153 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2024-11-09 01:36:11,232 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-09 01:36:11,234 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-11-09 01:36:11,234 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-11-09 01:36:11,234 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-11-09 01:36:11,234 INFO L153 SettingsManager]: * Looper check in Petri net analysis=SEMANTIC WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G ! call(reach_error())) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> f973a40b26aaa32bb1cc01afeff98c3363a14790c658d13c89361ba4409a62b2 [2024-11-09 01:36:11,501 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-09 01:36:11,523 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-09 01:36:11,525 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-09 01:36:11,526 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-09 01:36:11,526 INFO L274 PluginConnector]: CDTParser initialized [2024-11-09 01:36:11,527 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-a_file-83.i [2024-11-09 01:36:12,989 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-09 01:36:13,191 INFO L384 CDTParser]: Found 1 translation units. [2024-11-09 01:36:13,191 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-a_file-83.i [2024-11-09 01:36:13,208 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/892121633/43fdce39b8b046129788cf6b958594ee/FLAG207b224fa [2024-11-09 01:36:13,567 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/892121633/43fdce39b8b046129788cf6b958594ee [2024-11-09 01:36:13,569 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-09 01:36:13,570 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-09 01:36:13,572 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-09 01:36:13,572 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-09 01:36:13,576 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-09 01:36:13,577 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.11 01:36:13" (1/1) ... [2024-11-09 01:36:13,577 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@5ff95950 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 01:36:13, skipping insertion in model container [2024-11-09 01:36:13,577 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.11 01:36:13" (1/1) ... [2024-11-09 01:36:13,595 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-09 01:36:13,764 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-a_file-83.i[916,929] [2024-11-09 01:36:13,858 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-09 01:36:13,875 INFO L200 MainTranslator]: Completed pre-run [2024-11-09 01:36:13,888 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-a_file-83.i[916,929] [2024-11-09 01:36:13,941 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-09 01:36:13,968 INFO L204 MainTranslator]: Completed translation [2024-11-09 01:36:13,968 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 01:36:13 WrapperNode [2024-11-09 01:36:13,968 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-09 01:36:13,969 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-09 01:36:13,969 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-09 01:36:13,970 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-09 01:36:13,975 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 01:36:13" (1/1) ... [2024-11-09 01:36:13,992 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 01:36:13" (1/1) ... [2024-11-09 01:36:14,040 INFO L138 Inliner]: procedures = 33, calls = 158, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 498 [2024-11-09 01:36:14,044 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-09 01:36:14,045 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-09 01:36:14,045 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-09 01:36:14,045 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-09 01:36:14,054 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 01:36:13" (1/1) ... [2024-11-09 01:36:14,055 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 01:36:13" (1/1) ... [2024-11-09 01:36:14,062 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 01:36:13" (1/1) ... [2024-11-09 01:36:14,092 INFO L175 MemorySlicer]: Split 130 memory accesses to 7 slices as follows [2, 6, 47, 21, 5, 9, 40]. 36 percent of accesses are in the largest equivalence class. The 14 initializations are split as follows [2, 1, 5, 2, 1, 1, 2]. The 16 writes are split as follows [0, 1, 7, 2, 1, 1, 4]. [2024-11-09 01:36:14,094 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 01:36:13" (1/1) ... [2024-11-09 01:36:14,094 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 01:36:13" (1/1) ... [2024-11-09 01:36:14,121 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 01:36:13" (1/1) ... [2024-11-09 01:36:14,128 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 01:36:13" (1/1) ... [2024-11-09 01:36:14,135 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 01:36:13" (1/1) ... [2024-11-09 01:36:14,154 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 01:36:13" (1/1) ... [2024-11-09 01:36:14,163 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-09 01:36:14,168 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-11-09 01:36:14,168 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-11-09 01:36:14,168 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-11-09 01:36:14,169 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 01:36:13" (1/1) ... [2024-11-09 01:36:14,175 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-09 01:36:14,187 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-09 01:36:14,203 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2024-11-09 01:36:14,206 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2024-11-09 01:36:14,243 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-11-09 01:36:14,243 INFO L130 BoogieDeclarations]: Found specification of procedure read~intFLOATTYPE8#0 [2024-11-09 01:36:14,243 INFO L130 BoogieDeclarations]: Found specification of procedure read~intFLOATTYPE8#1 [2024-11-09 01:36:14,243 INFO L130 BoogieDeclarations]: Found specification of procedure read~intFLOATTYPE8#2 [2024-11-09 01:36:14,243 INFO L130 BoogieDeclarations]: Found specification of procedure read~intFLOATTYPE8#3 [2024-11-09 01:36:14,243 INFO L130 BoogieDeclarations]: Found specification of procedure read~intFLOATTYPE8#4 [2024-11-09 01:36:14,244 INFO L130 BoogieDeclarations]: Found specification of procedure read~intFLOATTYPE8#5 [2024-11-09 01:36:14,244 INFO L130 BoogieDeclarations]: Found specification of procedure read~intFLOATTYPE8#6 [2024-11-09 01:36:14,244 INFO L130 BoogieDeclarations]: Found specification of procedure write~intFLOATTYPE8#0 [2024-11-09 01:36:14,244 INFO L130 BoogieDeclarations]: Found specification of procedure write~intFLOATTYPE8#1 [2024-11-09 01:36:14,244 INFO L130 BoogieDeclarations]: Found specification of procedure write~intFLOATTYPE8#2 [2024-11-09 01:36:14,244 INFO L130 BoogieDeclarations]: Found specification of procedure write~intFLOATTYPE8#3 [2024-11-09 01:36:14,244 INFO L130 BoogieDeclarations]: Found specification of procedure write~intFLOATTYPE8#4 [2024-11-09 01:36:14,245 INFO L130 BoogieDeclarations]: Found specification of procedure write~intFLOATTYPE8#5 [2024-11-09 01:36:14,245 INFO L130 BoogieDeclarations]: Found specification of procedure write~intFLOATTYPE8#6 [2024-11-09 01:36:14,245 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE1#0 [2024-11-09 01:36:14,245 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE1#1 [2024-11-09 01:36:14,245 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE1#2 [2024-11-09 01:36:14,245 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE1#3 [2024-11-09 01:36:14,245 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE1#4 [2024-11-09 01:36:14,246 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE1#5 [2024-11-09 01:36:14,246 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE1#6 [2024-11-09 01:36:14,246 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE2#0 [2024-11-09 01:36:14,246 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE2#1 [2024-11-09 01:36:14,246 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE2#2 [2024-11-09 01:36:14,246 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE2#3 [2024-11-09 01:36:14,246 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE2#4 [2024-11-09 01:36:14,247 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE2#5 [2024-11-09 01:36:14,247 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE2#6 [2024-11-09 01:36:14,247 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#0 [2024-11-09 01:36:14,247 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#1 [2024-11-09 01:36:14,247 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#2 [2024-11-09 01:36:14,247 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#3 [2024-11-09 01:36:14,247 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#4 [2024-11-09 01:36:14,247 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#5 [2024-11-09 01:36:14,248 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#6 [2024-11-09 01:36:14,248 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intFLOATTYPE8#0 [2024-11-09 01:36:14,248 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intFLOATTYPE8#1 [2024-11-09 01:36:14,248 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intFLOATTYPE8#2 [2024-11-09 01:36:14,248 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intFLOATTYPE8#3 [2024-11-09 01:36:14,248 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intFLOATTYPE8#4 [2024-11-09 01:36:14,248 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intFLOATTYPE8#5 [2024-11-09 01:36:14,248 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intFLOATTYPE8#6 [2024-11-09 01:36:14,249 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE2#0 [2024-11-09 01:36:14,249 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE2#1 [2024-11-09 01:36:14,249 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE2#2 [2024-11-09 01:36:14,249 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE2#3 [2024-11-09 01:36:14,249 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE2#4 [2024-11-09 01:36:14,249 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE2#5 [2024-11-09 01:36:14,249 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE2#6 [2024-11-09 01:36:14,249 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2024-11-09 01:36:14,249 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2024-11-09 01:36:14,249 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-09 01:36:14,249 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-09 01:36:14,249 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE1#0 [2024-11-09 01:36:14,249 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE1#1 [2024-11-09 01:36:14,249 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE1#2 [2024-11-09 01:36:14,249 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE1#3 [2024-11-09 01:36:14,250 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE1#4 [2024-11-09 01:36:14,250 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE1#5 [2024-11-09 01:36:14,250 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE1#6 [2024-11-09 01:36:14,250 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE2#0 [2024-11-09 01:36:14,250 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE2#1 [2024-11-09 01:36:14,250 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE2#2 [2024-11-09 01:36:14,250 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE2#3 [2024-11-09 01:36:14,250 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE2#4 [2024-11-09 01:36:14,250 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE2#5 [2024-11-09 01:36:14,250 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE2#6 [2024-11-09 01:36:14,415 INFO L238 CfgBuilder]: Building ICFG [2024-11-09 01:36:14,417 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-09 01:36:15,310 INFO L? ?]: Removed 129 outVars from TransFormulas that were not future-live. [2024-11-09 01:36:15,310 INFO L287 CfgBuilder]: Performing block encoding [2024-11-09 01:36:15,334 INFO L311 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-09 01:36:15,335 INFO L316 CfgBuilder]: Removed 1 assume(true) statements. [2024-11-09 01:36:15,336 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.11 01:36:15 BoogieIcfgContainer [2024-11-09 01:36:15,336 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-11-09 01:36:15,338 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-11-09 01:36:15,338 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-11-09 01:36:15,340 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-11-09 01:36:15,341 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 09.11 01:36:13" (1/3) ... [2024-11-09 01:36:15,341 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5c685dc3 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 09.11 01:36:15, skipping insertion in model container [2024-11-09 01:36:15,341 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 01:36:13" (2/3) ... [2024-11-09 01:36:15,342 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5c685dc3 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 09.11 01:36:15, skipping insertion in model container [2024-11-09 01:36:15,342 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.11 01:36:15" (3/3) ... [2024-11-09 01:36:15,343 INFO L112 eAbstractionObserver]: Analyzing ICFG hardness_variablewrapping_wrapper-a_file-83.i [2024-11-09 01:36:15,359 INFO L214 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-11-09 01:36:15,359 INFO L154 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-11-09 01:36:15,418 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-09 01:36:15,427 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;@5fe3a4ed, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-09 01:36:15,427 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-11-09 01:36:15,432 INFO L276 IsEmpty]: Start isEmpty. Operand has 103 states, 89 states have (on average 1.449438202247191) internal successors, (129), 90 states have internal predecessors, (129), 11 states have call successors, (11), 1 states have call predecessors, (11), 1 states have return successors, (11), 11 states have call predecessors, (11), 11 states have call successors, (11) [2024-11-09 01:36:15,443 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 105 [2024-11-09 01:36:15,443 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 01:36:15,444 INFO L215 NwaCegarLoop]: trace histogram [11, 11, 11, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 01:36:15,445 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-09 01:36:15,450 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 01:36:15,451 INFO L85 PathProgramCache]: Analyzing trace with hash -1405385952, now seen corresponding path program 1 times [2024-11-09 01:36:15,468 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-09 01:36:15,469 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1121255570] [2024-11-09 01:36:15,469 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 01:36:15,470 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-11-09 01:36:15,470 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-09 01:36:15,474 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/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-11-09 01:36:15,476 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/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-11-09 01:36:15,787 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:36:15,799 INFO L255 TraceCheckSpWp]: Trace formula consists of 256 conjuncts, 1 conjuncts are in the unsatisfiable core [2024-11-09 01:36:15,823 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-09 01:36:15,851 INFO L134 CoverageAnalysis]: Checked inductivity of 220 backedges. 104 proven. 0 refuted. 0 times theorem prover too weak. 116 trivial. 0 not checked. [2024-11-09 01:36:15,851 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-09 01:36:15,852 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-09 01:36:15,852 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1121255570] [2024-11-09 01:36:15,852 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1121255570] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 01:36:15,852 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 01:36:15,852 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-09 01:36:15,858 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [410591171] [2024-11-09 01:36:15,858 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 01:36:15,863 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-11-09 01:36:15,863 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-09 01:36:15,882 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-11-09 01:36:15,883 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-11-09 01:36:15,886 INFO L87 Difference]: Start difference. First operand has 103 states, 89 states have (on average 1.449438202247191) internal successors, (129), 90 states have internal predecessors, (129), 11 states have call successors, (11), 1 states have call predecessors, (11), 1 states have return successors, (11), 11 states have call predecessors, (11), 11 states have call successors, (11) Second operand has 2 states, 2 states have (on average 28.0) internal successors, (56), 2 states have internal predecessors, (56), 2 states have call successors, (11), 2 states have call predecessors, (11), 2 states have return successors, (11), 2 states have call predecessors, (11), 2 states have call successors, (11) [2024-11-09 01:36:15,913 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 01:36:15,913 INFO L93 Difference]: Finished difference Result 199 states and 307 transitions. [2024-11-09 01:36:15,915 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-11-09 01:36:15,917 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 28.0) internal successors, (56), 2 states have internal predecessors, (56), 2 states have call successors, (11), 2 states have call predecessors, (11), 2 states have return successors, (11), 2 states have call predecessors, (11), 2 states have call successors, (11) Word has length 104 [2024-11-09 01:36:15,917 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 01:36:15,925 INFO L225 Difference]: With dead ends: 199 [2024-11-09 01:36:15,926 INFO L226 Difference]: Without dead ends: 99 [2024-11-09 01:36:15,930 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 103 GetRequests, 103 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-11-09 01:36:15,933 INFO L432 NwaCegarLoop]: 138 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 0 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 138 SdHoareTripleChecker+Invalid, 0 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 0 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-09 01:36:15,936 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 138 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-09 01:36:15,949 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 99 states. [2024-11-09 01:36:15,964 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 99 to 99. [2024-11-09 01:36:15,966 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 99 states, 86 states have (on average 1.3488372093023255) internal successors, (116), 86 states have internal predecessors, (116), 11 states have call successors, (11), 1 states have call predecessors, (11), 1 states have return successors, (11), 11 states have call predecessors, (11), 11 states have call successors, (11) [2024-11-09 01:36:15,967 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 99 states to 99 states and 138 transitions. [2024-11-09 01:36:15,970 INFO L78 Accepts]: Start accepts. Automaton has 99 states and 138 transitions. Word has length 104 [2024-11-09 01:36:15,970 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 01:36:15,970 INFO L471 AbstractCegarLoop]: Abstraction has 99 states and 138 transitions. [2024-11-09 01:36:15,971 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 28.0) internal successors, (56), 2 states have internal predecessors, (56), 2 states have call successors, (11), 2 states have call predecessors, (11), 2 states have return successors, (11), 2 states have call predecessors, (11), 2 states have call successors, (11) [2024-11-09 01:36:15,971 INFO L276 IsEmpty]: Start isEmpty. Operand 99 states and 138 transitions. [2024-11-09 01:36:15,975 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 105 [2024-11-09 01:36:15,976 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 01:36:15,976 INFO L215 NwaCegarLoop]: trace histogram [11, 11, 11, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 01:36:15,987 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/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)] Ended with exit code 0 [2024-11-09 01:36:16,180 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate/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-11-09 01:36:16,182 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-09 01:36:16,183 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 01:36:16,183 INFO L85 PathProgramCache]: Analyzing trace with hash 491244274, now seen corresponding path program 1 times [2024-11-09 01:36:16,184 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-09 01:36:16,184 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1994338430] [2024-11-09 01:36:16,184 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 01:36:16,184 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-11-09 01:36:16,184 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-09 01:36:16,187 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/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-11-09 01:36:16,188 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/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-11-09 01:36:16,537 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:36:16,549 INFO L255 TraceCheckSpWp]: Trace formula consists of 256 conjuncts, 3 conjuncts are in the unsatisfiable core [2024-11-09 01:36:16,554 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-09 01:36:16,592 INFO L134 CoverageAnalysis]: Checked inductivity of 220 backedges. 72 proven. 0 refuted. 0 times theorem prover too weak. 148 trivial. 0 not checked. [2024-11-09 01:36:16,592 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-09 01:36:16,593 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-09 01:36:16,593 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1994338430] [2024-11-09 01:36:16,593 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1994338430] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 01:36:16,593 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 01:36:16,593 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-09 01:36:16,593 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1229278125] [2024-11-09 01:36:16,594 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 01:36:16,595 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-09 01:36:16,595 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-09 01:36:16,596 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-09 01:36:16,596 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-09 01:36:16,596 INFO L87 Difference]: Start difference. First operand 99 states and 138 transitions. Second operand has 4 states, 4 states have (on average 13.75) internal successors, (55), 4 states have internal predecessors, (55), 2 states have call successors, (11), 2 states have call predecessors, (11), 2 states have return successors, (11), 2 states have call predecessors, (11), 2 states have call successors, (11) [2024-11-09 01:36:16,695 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 01:36:16,696 INFO L93 Difference]: Finished difference Result 197 states and 276 transitions. [2024-11-09 01:36:16,699 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-09 01:36:16,699 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 13.75) internal successors, (55), 4 states have internal predecessors, (55), 2 states have call successors, (11), 2 states have call predecessors, (11), 2 states have return successors, (11), 2 states have call predecessors, (11), 2 states have call successors, (11) Word has length 104 [2024-11-09 01:36:16,700 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 01:36:16,701 INFO L225 Difference]: With dead ends: 197 [2024-11-09 01:36:16,701 INFO L226 Difference]: Without dead ends: 101 [2024-11-09 01:36:16,701 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 103 GetRequests, 101 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-09 01:36:16,702 INFO L432 NwaCegarLoop]: 136 mSDtfsCounter, 0 mSDsluCounter, 261 mSDsCounter, 0 mSdLazyCounter, 16 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 397 SdHoareTripleChecker+Invalid, 16 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 16 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-09 01:36:16,703 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 397 Invalid, 16 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 16 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-09 01:36:16,704 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 101 states. [2024-11-09 01:36:16,710 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 101 to 101. [2024-11-09 01:36:16,711 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 101 states, 88 states have (on average 1.3409090909090908) internal successors, (118), 88 states have internal predecessors, (118), 11 states have call successors, (11), 1 states have call predecessors, (11), 1 states have return successors, (11), 11 states have call predecessors, (11), 11 states have call successors, (11) [2024-11-09 01:36:16,712 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 101 states to 101 states and 140 transitions. [2024-11-09 01:36:16,713 INFO L78 Accepts]: Start accepts. Automaton has 101 states and 140 transitions. Word has length 104 [2024-11-09 01:36:16,714 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 01:36:16,714 INFO L471 AbstractCegarLoop]: Abstraction has 101 states and 140 transitions. [2024-11-09 01:36:16,714 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 13.75) internal successors, (55), 4 states have internal predecessors, (55), 2 states have call successors, (11), 2 states have call predecessors, (11), 2 states have return successors, (11), 2 states have call predecessors, (11), 2 states have call successors, (11) [2024-11-09 01:36:16,714 INFO L276 IsEmpty]: Start isEmpty. Operand 101 states and 140 transitions. [2024-11-09 01:36:16,716 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 105 [2024-11-09 01:36:16,716 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 01:36:16,716 INFO L215 NwaCegarLoop]: trace histogram [11, 11, 11, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 01:36:16,729 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/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-11-09 01:36:16,920 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/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-11-09 01:36:16,921 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-09 01:36:16,922 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 01:36:16,922 INFO L85 PathProgramCache]: Analyzing trace with hash 1077520496, now seen corresponding path program 1 times [2024-11-09 01:36:16,922 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-09 01:36:16,923 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1165556858] [2024-11-09 01:36:16,923 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 01:36:16,923 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-11-09 01:36:16,923 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-09 01:36:16,929 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/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-11-09 01:36:16,931 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/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-11-09 01:36:17,275 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:36:17,288 INFO L255 TraceCheckSpWp]: Trace formula consists of 258 conjuncts, 7 conjuncts are in the unsatisfiable core [2024-11-09 01:36:17,293 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-09 01:36:17,414 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 9 [2024-11-09 01:36:17,600 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-09 01:36:17,601 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 19 treesize of output 9 [2024-11-09 01:36:17,607 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 19 [2024-11-09 01:36:17,648 INFO L134 CoverageAnalysis]: Checked inductivity of 220 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 220 trivial. 0 not checked. [2024-11-09 01:36:17,648 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-09 01:36:17,648 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-09 01:36:17,648 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1165556858] [2024-11-09 01:36:17,648 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1165556858] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 01:36:17,648 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 01:36:17,648 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-11-09 01:36:17,648 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1212526884] [2024-11-09 01:36:17,648 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 01:36:17,649 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-11-09 01:36:17,649 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-09 01:36:17,649 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-11-09 01:36:17,649 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2024-11-09 01:36:17,650 INFO L87 Difference]: Start difference. First operand 101 states and 140 transitions. Second operand has 7 states, 7 states have (on average 7.428571428571429) internal successors, (52), 6 states have internal predecessors, (52), 1 states have call successors, (11), 1 states have call predecessors, (11), 1 states have return successors, (11), 1 states have call predecessors, (11), 1 states have call successors, (11) [2024-11-09 01:36:18,472 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 01:36:18,473 INFO L93 Difference]: Finished difference Result 387 states and 540 transitions. [2024-11-09 01:36:18,475 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-11-09 01:36:18,475 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 7.428571428571429) internal successors, (52), 6 states have internal predecessors, (52), 1 states have call successors, (11), 1 states have call predecessors, (11), 1 states have return successors, (11), 1 states have call predecessors, (11), 1 states have call successors, (11) Word has length 104 [2024-11-09 01:36:18,475 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 01:36:18,477 INFO L225 Difference]: With dead ends: 387 [2024-11-09 01:36:18,477 INFO L226 Difference]: Without dead ends: 289 [2024-11-09 01:36:18,478 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 108 GetRequests, 98 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=39, Invalid=93, Unknown=0, NotChecked=0, Total=132 [2024-11-09 01:36:18,479 INFO L432 NwaCegarLoop]: 221 mSDtfsCounter, 262 mSDsluCounter, 842 mSDsCounter, 0 mSdLazyCounter, 211 mSolverCounterSat, 25 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 262 SdHoareTripleChecker+Valid, 1063 SdHoareTripleChecker+Invalid, 236 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 25 IncrementalHoareTripleChecker+Valid, 211 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2024-11-09 01:36:18,481 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [262 Valid, 1063 Invalid, 236 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [25 Valid, 211 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2024-11-09 01:36:18,482 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 289 states. [2024-11-09 01:36:18,495 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 289 to 147. [2024-11-09 01:36:18,495 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 147 states, 122 states have (on average 1.319672131147541) internal successors, (161), 122 states have internal predecessors, (161), 22 states have call successors, (22), 2 states have call predecessors, (22), 2 states have return successors, (22), 22 states have call predecessors, (22), 22 states have call successors, (22) [2024-11-09 01:36:18,497 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 147 states to 147 states and 205 transitions. [2024-11-09 01:36:18,498 INFO L78 Accepts]: Start accepts. Automaton has 147 states and 205 transitions. Word has length 104 [2024-11-09 01:36:18,498 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 01:36:18,498 INFO L471 AbstractCegarLoop]: Abstraction has 147 states and 205 transitions. [2024-11-09 01:36:18,499 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 7.428571428571429) internal successors, (52), 6 states have internal predecessors, (52), 1 states have call successors, (11), 1 states have call predecessors, (11), 1 states have return successors, (11), 1 states have call predecessors, (11), 1 states have call successors, (11) [2024-11-09 01:36:18,499 INFO L276 IsEmpty]: Start isEmpty. Operand 147 states and 205 transitions. [2024-11-09 01:36:18,501 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 105 [2024-11-09 01:36:18,502 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 01:36:18,502 INFO L215 NwaCegarLoop]: trace histogram [11, 11, 11, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 01:36:18,513 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/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-11-09 01:36:18,702 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 /storage/repos/ultimate/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-11-09 01:36:18,703 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-09 01:36:18,703 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 01:36:18,703 INFO L85 PathProgramCache]: Analyzing trace with hash 1218069106, now seen corresponding path program 1 times [2024-11-09 01:36:18,704 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-09 01:36:18,704 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [702630055] [2024-11-09 01:36:18,704 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 01:36:18,704 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-11-09 01:36:18,704 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-09 01:36:18,711 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate/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-11-09 01:36:18,714 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/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-11-09 01:36:19,070 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:36:19,082 INFO L255 TraceCheckSpWp]: Trace formula consists of 257 conjuncts, 7 conjuncts are in the unsatisfiable core [2024-11-09 01:36:19,086 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-09 01:36:19,111 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 9 [2024-11-09 01:36:19,277 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-09 01:36:19,278 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 19 treesize of output 9 [2024-11-09 01:36:19,383 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 29 treesize of output 17 [2024-11-09 01:36:19,466 INFO L134 CoverageAnalysis]: Checked inductivity of 220 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 220 trivial. 0 not checked. [2024-11-09 01:36:19,467 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-09 01:36:19,467 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-09 01:36:19,467 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [702630055] [2024-11-09 01:36:19,467 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [702630055] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 01:36:19,467 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 01:36:19,467 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-11-09 01:36:19,467 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2018469472] [2024-11-09 01:36:19,468 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 01:36:19,468 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-11-09 01:36:19,468 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-09 01:36:19,469 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-11-09 01:36:19,469 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2024-11-09 01:36:19,469 INFO L87 Difference]: Start difference. First operand 147 states and 205 transitions. Second operand has 7 states, 7 states have (on average 7.428571428571429) internal successors, (52), 6 states have internal predecessors, (52), 1 states have call successors, (11), 1 states have call predecessors, (11), 1 states have return successors, (11), 1 states have call predecessors, (11), 1 states have call successors, (11) [2024-11-09 01:36:21,112 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 01:36:21,112 INFO L93 Difference]: Finished difference Result 344 states and 478 transitions. [2024-11-09 01:36:21,114 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-11-09 01:36:21,114 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 7.428571428571429) internal successors, (52), 6 states have internal predecessors, (52), 1 states have call successors, (11), 1 states have call predecessors, (11), 1 states have return successors, (11), 1 states have call predecessors, (11), 1 states have call successors, (11) Word has length 104 [2024-11-09 01:36:21,114 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 01:36:21,115 INFO L225 Difference]: With dead ends: 344 [2024-11-09 01:36:21,116 INFO L226 Difference]: Without dead ends: 246 [2024-11-09 01:36:21,116 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 106 GetRequests, 98 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=29, Invalid=61, Unknown=0, NotChecked=0, Total=90 [2024-11-09 01:36:21,117 INFO L432 NwaCegarLoop]: 111 mSDtfsCounter, 269 mSDsluCounter, 460 mSDsCounter, 0 mSdLazyCounter, 192 mSolverCounterSat, 49 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 269 SdHoareTripleChecker+Valid, 571 SdHoareTripleChecker+Invalid, 241 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 49 IncrementalHoareTripleChecker+Valid, 192 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.5s IncrementalHoareTripleChecker+Time [2024-11-09 01:36:21,117 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [269 Valid, 571 Invalid, 241 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [49 Valid, 192 Invalid, 0 Unknown, 0 Unchecked, 1.5s Time] [2024-11-09 01:36:21,118 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 246 states. [2024-11-09 01:36:21,140 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 246 to 164. [2024-11-09 01:36:21,140 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 164 states, 139 states have (on average 1.3237410071942446) internal successors, (184), 139 states have internal predecessors, (184), 22 states have call successors, (22), 2 states have call predecessors, (22), 2 states have return successors, (22), 22 states have call predecessors, (22), 22 states have call successors, (22) [2024-11-09 01:36:21,141 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 164 states to 164 states and 228 transitions. [2024-11-09 01:36:21,142 INFO L78 Accepts]: Start accepts. Automaton has 164 states and 228 transitions. Word has length 104 [2024-11-09 01:36:21,142 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 01:36:21,142 INFO L471 AbstractCegarLoop]: Abstraction has 164 states and 228 transitions. [2024-11-09 01:36:21,142 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 7.428571428571429) internal successors, (52), 6 states have internal predecessors, (52), 1 states have call successors, (11), 1 states have call predecessors, (11), 1 states have return successors, (11), 1 states have call predecessors, (11), 1 states have call successors, (11) [2024-11-09 01:36:21,142 INFO L276 IsEmpty]: Start isEmpty. Operand 164 states and 228 transitions. [2024-11-09 01:36:21,143 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 105 [2024-11-09 01:36:21,144 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 01:36:21,144 INFO L215 NwaCegarLoop]: trace histogram [11, 11, 11, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 01:36:21,162 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/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-11-09 01:36:21,344 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 /storage/repos/ultimate/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-11-09 01:36:21,344 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-09 01:36:21,345 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 01:36:21,345 INFO L85 PathProgramCache]: Analyzing trace with hash -370278796, now seen corresponding path program 1 times [2024-11-09 01:36:21,345 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-09 01:36:21,346 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1793094767] [2024-11-09 01:36:21,346 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 01:36:21,346 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-11-09 01:36:21,346 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-09 01:36:21,348 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate/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-11-09 01:36:21,352 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/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-11-09 01:36:21,633 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:36:21,645 INFO L255 TraceCheckSpWp]: Trace formula consists of 256 conjuncts, 7 conjuncts are in the unsatisfiable core [2024-11-09 01:36:21,648 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-09 01:36:21,741 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 11 [2024-11-09 01:36:21,870 INFO L134 CoverageAnalysis]: Checked inductivity of 220 backedges. 90 proven. 6 refuted. 0 times theorem prover too weak. 124 trivial. 0 not checked. [2024-11-09 01:36:21,870 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-09 01:36:22,103 INFO L134 CoverageAnalysis]: Checked inductivity of 220 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 220 trivial. 0 not checked. [2024-11-09 01:36:22,104 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-09 01:36:22,104 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1793094767] [2024-11-09 01:36:22,104 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1793094767] provided 1 perfect and 1 imperfect interpolant sequences [2024-11-09 01:36:22,104 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-11-09 01:36:22,104 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [8] total 9 [2024-11-09 01:36:22,104 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1077103000] [2024-11-09 01:36:22,104 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 01:36:22,105 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-09 01:36:22,105 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-09 01:36:22,105 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-09 01:36:22,106 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2024-11-09 01:36:22,106 INFO L87 Difference]: Start difference. First operand 164 states and 228 transitions. Second operand has 3 states, 3 states have (on average 17.333333333333332) internal successors, (52), 3 states have internal predecessors, (52), 1 states have call successors, (11), 1 states have call predecessors, (11), 1 states have return successors, (11), 1 states have call predecessors, (11), 1 states have call successors, (11) [2024-11-09 01:36:22,223 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 01:36:22,223 INFO L93 Difference]: Finished difference Result 263 states and 367 transitions. [2024-11-09 01:36:22,225 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-09 01:36:22,226 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 17.333333333333332) internal successors, (52), 3 states have internal predecessors, (52), 1 states have call successors, (11), 1 states have call predecessors, (11), 1 states have return successors, (11), 1 states have call predecessors, (11), 1 states have call successors, (11) Word has length 104 [2024-11-09 01:36:22,226 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 01:36:22,227 INFO L225 Difference]: With dead ends: 263 [2024-11-09 01:36:22,227 INFO L226 Difference]: Without dead ends: 165 [2024-11-09 01:36:22,228 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 206 GetRequests, 199 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2024-11-09 01:36:22,228 INFO L432 NwaCegarLoop]: 137 mSDtfsCounter, 0 mSDsluCounter, 130 mSDsCounter, 0 mSdLazyCounter, 8 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 267 SdHoareTripleChecker+Invalid, 8 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 8 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-09 01:36:22,229 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 267 Invalid, 8 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 8 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-09 01:36:22,229 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 165 states. [2024-11-09 01:36:22,238 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 165 to 165. [2024-11-09 01:36:22,238 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 165 states, 140 states have (on average 1.3214285714285714) internal successors, (185), 140 states have internal predecessors, (185), 22 states have call successors, (22), 2 states have call predecessors, (22), 2 states have return successors, (22), 22 states have call predecessors, (22), 22 states have call successors, (22) [2024-11-09 01:36:22,239 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 165 states to 165 states and 229 transitions. [2024-11-09 01:36:22,240 INFO L78 Accepts]: Start accepts. Automaton has 165 states and 229 transitions. Word has length 104 [2024-11-09 01:36:22,240 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 01:36:22,240 INFO L471 AbstractCegarLoop]: Abstraction has 165 states and 229 transitions. [2024-11-09 01:36:22,240 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 17.333333333333332) internal successors, (52), 3 states have internal predecessors, (52), 1 states have call successors, (11), 1 states have call predecessors, (11), 1 states have return successors, (11), 1 states have call predecessors, (11), 1 states have call successors, (11) [2024-11-09 01:36:22,241 INFO L276 IsEmpty]: Start isEmpty. Operand 165 states and 229 transitions. [2024-11-09 01:36:22,241 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 105 [2024-11-09 01:36:22,242 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 01:36:22,242 INFO L215 NwaCegarLoop]: trace histogram [11, 11, 11, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 01:36:22,256 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/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-11-09 01:36:22,445 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 /storage/repos/ultimate/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-11-09 01:36:22,446 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-09 01:36:22,446 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 01:36:22,447 INFO L85 PathProgramCache]: Analyzing trace with hash 650789558, now seen corresponding path program 1 times [2024-11-09 01:36:22,447 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-09 01:36:22,447 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1178740667] [2024-11-09 01:36:22,447 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 01:36:22,447 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-11-09 01:36:22,448 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-09 01:36:22,449 INFO L229 MonitoredProcess]: Starting monitored process 7 with /storage/repos/ultimate/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-11-09 01:36:22,450 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/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-11-09 01:36:22,799 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:36:22,810 INFO L255 TraceCheckSpWp]: Trace formula consists of 256 conjuncts, 4 conjuncts are in the unsatisfiable core [2024-11-09 01:36:22,812 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-09 01:36:22,840 INFO L134 CoverageAnalysis]: Checked inductivity of 220 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 220 trivial. 0 not checked. [2024-11-09 01:36:22,840 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-09 01:36:22,840 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-09 01:36:22,841 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1178740667] [2024-11-09 01:36:22,841 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1178740667] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 01:36:22,841 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 01:36:22,841 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-09 01:36:22,841 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [574173711] [2024-11-09 01:36:22,841 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 01:36:22,842 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-09 01:36:22,842 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-09 01:36:22,842 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-09 01:36:22,842 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-11-09 01:36:22,842 INFO L87 Difference]: Start difference. First operand 165 states and 229 transitions. Second operand has 5 states, 5 states have (on average 10.4) internal successors, (52), 5 states have internal predecessors, (52), 1 states have call successors, (11), 1 states have call predecessors, (11), 1 states have return successors, (11), 1 states have call predecessors, (11), 1 states have call successors, (11) [2024-11-09 01:36:22,882 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 01:36:22,883 INFO L93 Difference]: Finished difference Result 269 states and 374 transitions. [2024-11-09 01:36:22,884 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-09 01:36:22,884 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 10.4) internal successors, (52), 5 states have internal predecessors, (52), 1 states have call successors, (11), 1 states have call predecessors, (11), 1 states have return successors, (11), 1 states have call predecessors, (11), 1 states have call successors, (11) Word has length 104 [2024-11-09 01:36:22,884 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 01:36:22,885 INFO L225 Difference]: With dead ends: 269 [2024-11-09 01:36:22,885 INFO L226 Difference]: Without dead ends: 170 [2024-11-09 01:36:22,886 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 103 GetRequests, 100 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-11-09 01:36:22,886 INFO L432 NwaCegarLoop]: 133 mSDtfsCounter, 1 mSDsluCounter, 383 mSDsCounter, 0 mSdLazyCounter, 33 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 516 SdHoareTripleChecker+Invalid, 36 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 33 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-09 01:36:22,888 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1 Valid, 516 Invalid, 36 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 33 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-09 01:36:22,889 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 170 states. [2024-11-09 01:36:22,904 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 170 to 169. [2024-11-09 01:36:22,905 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 169 states, 144 states have (on average 1.3125) internal successors, (189), 144 states have internal predecessors, (189), 22 states have call successors, (22), 2 states have call predecessors, (22), 2 states have return successors, (22), 22 states have call predecessors, (22), 22 states have call successors, (22) [2024-11-09 01:36:22,905 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 169 states to 169 states and 233 transitions. [2024-11-09 01:36:22,906 INFO L78 Accepts]: Start accepts. Automaton has 169 states and 233 transitions. Word has length 104 [2024-11-09 01:36:22,906 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 01:36:22,906 INFO L471 AbstractCegarLoop]: Abstraction has 169 states and 233 transitions. [2024-11-09 01:36:22,906 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 10.4) internal successors, (52), 5 states have internal predecessors, (52), 1 states have call successors, (11), 1 states have call predecessors, (11), 1 states have return successors, (11), 1 states have call predecessors, (11), 1 states have call successors, (11) [2024-11-09 01:36:22,906 INFO L276 IsEmpty]: Start isEmpty. Operand 169 states and 233 transitions. [2024-11-09 01:36:22,907 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 105 [2024-11-09 01:36:22,907 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 01:36:22,907 INFO L215 NwaCegarLoop]: trace histogram [11, 11, 11, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 01:36:22,923 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/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)] Forceful destruction successful, exit code 0 [2024-11-09 01:36:23,113 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 7 /storage/repos/ultimate/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-11-09 01:36:23,113 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-09 01:36:23,114 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 01:36:23,114 INFO L85 PathProgramCache]: Analyzing trace with hash 1330847928, now seen corresponding path program 1 times [2024-11-09 01:36:23,114 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-09 01:36:23,114 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [431727188] [2024-11-09 01:36:23,114 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 01:36:23,114 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-11-09 01:36:23,114 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-09 01:36:23,116 INFO L229 MonitoredProcess]: Starting monitored process 8 with /storage/repos/ultimate/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-11-09 01:36:23,117 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/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-11-09 01:36:23,453 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:36:23,469 INFO L255 TraceCheckSpWp]: Trace formula consists of 254 conjuncts, 5 conjuncts are in the unsatisfiable core [2024-11-09 01:36:23,470 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-09 01:36:23,533 INFO L134 CoverageAnalysis]: Checked inductivity of 220 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 220 trivial. 0 not checked. [2024-11-09 01:36:23,533 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-09 01:36:23,533 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-09 01:36:23,533 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [431727188] [2024-11-09 01:36:23,533 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [431727188] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 01:36:23,533 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 01:36:23,534 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-11-09 01:36:23,534 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [728928095] [2024-11-09 01:36:23,534 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 01:36:23,534 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-09 01:36:23,534 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-09 01:36:23,535 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-09 01:36:23,535 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2024-11-09 01:36:23,535 INFO L87 Difference]: Start difference. First operand 169 states and 233 transitions. Second operand has 6 states, 6 states have (on average 8.666666666666666) internal successors, (52), 6 states have internal predecessors, (52), 1 states have call successors, (11), 1 states have call predecessors, (11), 1 states have return successors, (11), 1 states have call predecessors, (11), 1 states have call successors, (11) [2024-11-09 01:36:23,593 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 01:36:23,593 INFO L93 Difference]: Finished difference Result 275 states and 379 transitions. [2024-11-09 01:36:23,594 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-09 01:36:23,594 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 8.666666666666666) internal successors, (52), 6 states have internal predecessors, (52), 1 states have call successors, (11), 1 states have call predecessors, (11), 1 states have return successors, (11), 1 states have call predecessors, (11), 1 states have call successors, (11) Word has length 104 [2024-11-09 01:36:23,594 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 01:36:23,595 INFO L225 Difference]: With dead ends: 275 [2024-11-09 01:36:23,595 INFO L226 Difference]: Without dead ends: 172 [2024-11-09 01:36:23,596 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 103 GetRequests, 99 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2024-11-09 01:36:23,596 INFO L432 NwaCegarLoop]: 131 mSDtfsCounter, 1 mSDsluCounter, 504 mSDsCounter, 0 mSdLazyCounter, 51 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 635 SdHoareTripleChecker+Invalid, 54 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 51 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-09 01:36:23,597 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1 Valid, 635 Invalid, 54 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 51 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-09 01:36:23,598 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 172 states. [2024-11-09 01:36:23,608 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 172 to 171. [2024-11-09 01:36:23,608 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 171 states, 146 states have (on average 1.3082191780821917) internal successors, (191), 146 states have internal predecessors, (191), 22 states have call successors, (22), 2 states have call predecessors, (22), 2 states have return successors, (22), 22 states have call predecessors, (22), 22 states have call successors, (22) [2024-11-09 01:36:23,612 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 171 states to 171 states and 235 transitions. [2024-11-09 01:36:23,612 INFO L78 Accepts]: Start accepts. Automaton has 171 states and 235 transitions. Word has length 104 [2024-11-09 01:36:23,612 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 01:36:23,612 INFO L471 AbstractCegarLoop]: Abstraction has 171 states and 235 transitions. [2024-11-09 01:36:23,612 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 8.666666666666666) internal successors, (52), 6 states have internal predecessors, (52), 1 states have call successors, (11), 1 states have call predecessors, (11), 1 states have return successors, (11), 1 states have call predecessors, (11), 1 states have call successors, (11) [2024-11-09 01:36:23,613 INFO L276 IsEmpty]: Start isEmpty. Operand 171 states and 235 transitions. [2024-11-09 01:36:23,614 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 105 [2024-11-09 01:36:23,614 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 01:36:23,614 INFO L215 NwaCegarLoop]: trace histogram [11, 11, 11, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 01:36:23,624 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/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)] Ended with exit code 0 [2024-11-09 01:36:23,818 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 8 /storage/repos/ultimate/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-11-09 01:36:23,819 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-09 01:36:23,819 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 01:36:23,820 INFO L85 PathProgramCache]: Analyzing trace with hash -1189112006, now seen corresponding path program 1 times [2024-11-09 01:36:23,820 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-09 01:36:23,820 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [966282683] [2024-11-09 01:36:23,820 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 01:36:23,820 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-11-09 01:36:23,820 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-09 01:36:23,823 INFO L229 MonitoredProcess]: Starting monitored process 9 with /storage/repos/ultimate/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-11-09 01:36:23,823 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/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 (9)] Waiting until timeout for monitored process [2024-11-09 01:36:24,053 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:36:24,065 INFO L255 TraceCheckSpWp]: Trace formula consists of 251 conjuncts, 6 conjuncts are in the unsatisfiable core [2024-11-09 01:36:24,067 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-09 01:36:24,098 INFO L134 CoverageAnalysis]: Checked inductivity of 220 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 220 trivial. 0 not checked. [2024-11-09 01:36:24,098 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-09 01:36:24,098 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-09 01:36:24,098 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [966282683] [2024-11-09 01:36:24,098 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [966282683] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 01:36:24,098 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 01:36:24,098 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-11-09 01:36:24,099 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [156389850] [2024-11-09 01:36:24,099 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 01:36:24,099 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-11-09 01:36:24,099 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-09 01:36:24,100 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-11-09 01:36:24,100 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2024-11-09 01:36:24,100 INFO L87 Difference]: Start difference. First operand 171 states and 235 transitions. Second operand has 7 states, 7 states have (on average 7.428571428571429) internal successors, (52), 7 states have internal predecessors, (52), 1 states have call successors, (11), 1 states have call predecessors, (11), 1 states have return successors, (11), 1 states have call predecessors, (11), 1 states have call successors, (11) [2024-11-09 01:36:24,153 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 01:36:24,153 INFO L93 Difference]: Finished difference Result 279 states and 383 transitions. [2024-11-09 01:36:24,153 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-11-09 01:36:24,154 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 7.428571428571429) internal successors, (52), 7 states have internal predecessors, (52), 1 states have call successors, (11), 1 states have call predecessors, (11), 1 states have return successors, (11), 1 states have call predecessors, (11), 1 states have call successors, (11) Word has length 104 [2024-11-09 01:36:24,154 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 01:36:24,155 INFO L225 Difference]: With dead ends: 279 [2024-11-09 01:36:24,155 INFO L226 Difference]: Without dead ends: 174 [2024-11-09 01:36:24,155 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 103 GetRequests, 98 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2024-11-09 01:36:24,156 INFO L432 NwaCegarLoop]: 129 mSDtfsCounter, 1 mSDsluCounter, 626 mSDsCounter, 0 mSdLazyCounter, 68 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 755 SdHoareTripleChecker+Invalid, 72 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 68 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-09 01:36:24,156 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1 Valid, 755 Invalid, 72 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 68 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-09 01:36:24,156 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 174 states. [2024-11-09 01:36:24,161 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 174 to 173. [2024-11-09 01:36:24,162 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 173 states, 148 states have (on average 1.304054054054054) internal successors, (193), 148 states have internal predecessors, (193), 22 states have call successors, (22), 2 states have call predecessors, (22), 2 states have return successors, (22), 22 states have call predecessors, (22), 22 states have call successors, (22) [2024-11-09 01:36:24,163 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 173 states to 173 states and 237 transitions. [2024-11-09 01:36:24,163 INFO L78 Accepts]: Start accepts. Automaton has 173 states and 237 transitions. Word has length 104 [2024-11-09 01:36:24,163 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 01:36:24,163 INFO L471 AbstractCegarLoop]: Abstraction has 173 states and 237 transitions. [2024-11-09 01:36:24,163 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 7.428571428571429) internal successors, (52), 7 states have internal predecessors, (52), 1 states have call successors, (11), 1 states have call predecessors, (11), 1 states have return successors, (11), 1 states have call predecessors, (11), 1 states have call successors, (11) [2024-11-09 01:36:24,164 INFO L276 IsEmpty]: Start isEmpty. Operand 173 states and 237 transitions. [2024-11-09 01:36:24,164 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 105 [2024-11-09 01:36:24,164 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 01:36:24,165 INFO L215 NwaCegarLoop]: trace histogram [11, 11, 11, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 01:36:24,174 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/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 (9)] Forceful destruction successful, exit code 0 [2024-11-09 01:36:24,368 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 /storage/repos/ultimate/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-11-09 01:36:24,369 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-09 01:36:24,369 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 01:36:24,369 INFO L85 PathProgramCache]: Analyzing trace with hash -1187264964, now seen corresponding path program 1 times [2024-11-09 01:36:24,370 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-09 01:36:24,370 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [233663794] [2024-11-09 01:36:24,370 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 01:36:24,370 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-11-09 01:36:24,370 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-09 01:36:24,371 INFO L229 MonitoredProcess]: Starting monitored process 10 with /storage/repos/ultimate/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-11-09 01:36:24,374 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/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 (10)] Waiting until timeout for monitored process [2024-11-09 01:36:24,647 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:36:24,658 INFO L255 TraceCheckSpWp]: Trace formula consists of 248 conjuncts, 11 conjuncts are in the unsatisfiable core [2024-11-09 01:36:24,662 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-09 01:36:24,671 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 20 treesize of output 16 [2024-11-09 01:36:24,792 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 63 treesize of output 51 [2024-11-09 01:36:24,797 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-09 01:36:24,797 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 72 treesize of output 44 [2024-11-09 01:36:24,830 INFO L134 CoverageAnalysis]: Checked inductivity of 220 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 220 trivial. 0 not checked. [2024-11-09 01:36:24,830 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-09 01:36:24,831 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-09 01:36:24,831 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [233663794] [2024-11-09 01:36:24,831 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [233663794] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 01:36:24,831 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 01:36:24,831 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-11-09 01:36:24,831 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [343011864] [2024-11-09 01:36:24,831 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 01:36:24,831 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-11-09 01:36:24,832 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-09 01:36:24,832 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-11-09 01:36:24,832 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2024-11-09 01:36:24,832 INFO L87 Difference]: Start difference. First operand 173 states and 237 transitions. Second operand has 8 states, 8 states have (on average 6.5) internal successors, (52), 8 states have internal predecessors, (52), 1 states have call successors, (11), 1 states have call predecessors, (11), 1 states have return successors, (11), 1 states have call predecessors, (11), 1 states have call successors, (11) [2024-11-09 01:36:25,673 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 01:36:25,673 INFO L93 Difference]: Finished difference Result 464 states and 630 transitions. [2024-11-09 01:36:25,673 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2024-11-09 01:36:25,673 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 6.5) internal successors, (52), 8 states have internal predecessors, (52), 1 states have call successors, (11), 1 states have call predecessors, (11), 1 states have return successors, (11), 1 states have call predecessors, (11), 1 states have call successors, (11) Word has length 104 [2024-11-09 01:36:25,675 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 01:36:25,676 INFO L225 Difference]: With dead ends: 464 [2024-11-09 01:36:25,676 INFO L226 Difference]: Without dead ends: 357 [2024-11-09 01:36:25,677 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 109 GetRequests, 97 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 21 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=45, Invalid=137, Unknown=0, NotChecked=0, Total=182 [2024-11-09 01:36:25,677 INFO L432 NwaCegarLoop]: 227 mSDtfsCounter, 196 mSDsluCounter, 1124 mSDsCounter, 0 mSdLazyCounter, 269 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 196 SdHoareTripleChecker+Valid, 1351 SdHoareTripleChecker+Invalid, 270 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 269 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2024-11-09 01:36:25,678 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [196 Valid, 1351 Invalid, 270 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 269 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2024-11-09 01:36:25,678 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 357 states. [2024-11-09 01:36:25,687 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 357 to 270. [2024-11-09 01:36:25,688 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 270 states, 238 states have (on average 1.315126050420168) internal successors, (313), 239 states have internal predecessors, (313), 28 states have call successors, (28), 3 states have call predecessors, (28), 3 states have return successors, (28), 27 states have call predecessors, (28), 28 states have call successors, (28) [2024-11-09 01:36:25,688 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 270 states to 270 states and 369 transitions. [2024-11-09 01:36:25,689 INFO L78 Accepts]: Start accepts. Automaton has 270 states and 369 transitions. Word has length 104 [2024-11-09 01:36:25,689 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 01:36:25,689 INFO L471 AbstractCegarLoop]: Abstraction has 270 states and 369 transitions. [2024-11-09 01:36:25,689 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 6.5) internal successors, (52), 8 states have internal predecessors, (52), 1 states have call successors, (11), 1 states have call predecessors, (11), 1 states have return successors, (11), 1 states have call predecessors, (11), 1 states have call successors, (11) [2024-11-09 01:36:25,689 INFO L276 IsEmpty]: Start isEmpty. Operand 270 states and 369 transitions. [2024-11-09 01:36:25,690 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 105 [2024-11-09 01:36:25,690 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 01:36:25,690 INFO L215 NwaCegarLoop]: trace histogram [11, 11, 11, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 01:36:25,701 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/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 (10)] Ended with exit code 0 [2024-11-09 01:36:25,891 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 10 /storage/repos/ultimate/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-11-09 01:36:25,891 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-09 01:36:25,892 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 01:36:25,892 INFO L85 PathProgramCache]: Analyzing trace with hash -1321278470, now seen corresponding path program 1 times [2024-11-09 01:36:25,892 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-09 01:36:25,892 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1042000633] [2024-11-09 01:36:25,892 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 01:36:25,892 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-11-09 01:36:25,893 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-09 01:36:25,895 INFO L229 MonitoredProcess]: Starting monitored process 11 with /storage/repos/ultimate/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-11-09 01:36:25,896 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/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 (11)] Waiting until timeout for monitored process [2024-11-09 01:36:26,127 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:36:26,139 INFO L255 TraceCheckSpWp]: Trace formula consists of 248 conjuncts, 7 conjuncts are in the unsatisfiable core [2024-11-09 01:36:26,141 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-09 01:36:26,197 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 13 [2024-11-09 01:36:26,216 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 24 treesize of output 16 [2024-11-09 01:36:26,570 INFO L134 CoverageAnalysis]: Checked inductivity of 220 backedges. 90 proven. 6 refuted. 0 times theorem prover too weak. 124 trivial. 0 not checked. [2024-11-09 01:36:26,571 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-09 01:36:26,663 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 15 [2024-11-09 01:36:26,734 INFO L134 CoverageAnalysis]: Checked inductivity of 220 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 220 trivial. 0 not checked. [2024-11-09 01:36:26,734 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-09 01:36:26,734 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1042000633] [2024-11-09 01:36:26,734 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1042000633] provided 1 perfect and 1 imperfect interpolant sequences [2024-11-09 01:36:26,734 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-11-09 01:36:26,734 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [8] total 10 [2024-11-09 01:36:26,734 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [319120696] [2024-11-09 01:36:26,735 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 01:36:26,735 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-09 01:36:26,735 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-09 01:36:26,735 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-09 01:36:26,735 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=69, Unknown=0, NotChecked=0, Total=90 [2024-11-09 01:36:26,736 INFO L87 Difference]: Start difference. First operand 270 states and 369 transitions. Second operand has 4 states, 4 states have (on average 13.0) internal successors, (52), 4 states have internal predecessors, (52), 1 states have call successors, (11), 1 states have call predecessors, (11), 1 states have return successors, (11), 1 states have call predecessors, (11), 1 states have call successors, (11) [2024-11-09 01:36:26,858 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 01:36:26,859 INFO L93 Difference]: Finished difference Result 483 states and 662 transitions. [2024-11-09 01:36:26,859 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-09 01:36:26,859 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 13.0) internal successors, (52), 4 states have internal predecessors, (52), 1 states have call successors, (11), 1 states have call predecessors, (11), 1 states have return successors, (11), 1 states have call predecessors, (11), 1 states have call successors, (11) Word has length 104 [2024-11-09 01:36:26,860 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 01:36:26,862 INFO L225 Difference]: With dead ends: 483 [2024-11-09 01:36:26,866 INFO L226 Difference]: Without dead ends: 281 [2024-11-09 01:36:26,867 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 207 GetRequests, 198 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=26, Invalid=84, Unknown=0, NotChecked=0, Total=110 [2024-11-09 01:36:26,868 INFO L432 NwaCegarLoop]: 151 mSDtfsCounter, 25 mSDsluCounter, 268 mSDsCounter, 0 mSdLazyCounter, 15 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 25 SdHoareTripleChecker+Valid, 419 SdHoareTripleChecker+Invalid, 15 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 15 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-09 01:36:26,868 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [25 Valid, 419 Invalid, 15 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 15 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-09 01:36:26,869 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 281 states. [2024-11-09 01:36:26,880 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 281 to 271. [2024-11-09 01:36:26,881 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 271 states, 239 states have (on average 1.3096234309623431) internal successors, (313), 240 states have internal predecessors, (313), 28 states have call successors, (28), 3 states have call predecessors, (28), 3 states have return successors, (28), 27 states have call predecessors, (28), 28 states have call successors, (28) [2024-11-09 01:36:26,882 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 271 states to 271 states and 369 transitions. [2024-11-09 01:36:26,882 INFO L78 Accepts]: Start accepts. Automaton has 271 states and 369 transitions. Word has length 104 [2024-11-09 01:36:26,882 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 01:36:26,882 INFO L471 AbstractCegarLoop]: Abstraction has 271 states and 369 transitions. [2024-11-09 01:36:26,883 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 13.0) internal successors, (52), 4 states have internal predecessors, (52), 1 states have call successors, (11), 1 states have call predecessors, (11), 1 states have return successors, (11), 1 states have call predecessors, (11), 1 states have call successors, (11) [2024-11-09 01:36:26,883 INFO L276 IsEmpty]: Start isEmpty. Operand 271 states and 369 transitions. [2024-11-09 01:36:26,883 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 106 [2024-11-09 01:36:26,883 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 01:36:26,884 INFO L215 NwaCegarLoop]: trace histogram [11, 11, 11, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 01:36:26,894 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/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 (11)] Forceful destruction successful, exit code 0 [2024-11-09 01:36:27,087 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 11 /storage/repos/ultimate/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-11-09 01:36:27,088 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-09 01:36:27,088 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 01:36:27,088 INFO L85 PathProgramCache]: Analyzing trace with hash 843459302, now seen corresponding path program 1 times [2024-11-09 01:36:27,089 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-09 01:36:27,089 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [311051535] [2024-11-09 01:36:27,089 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 01:36:27,089 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-11-09 01:36:27,089 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-09 01:36:27,092 INFO L229 MonitoredProcess]: Starting monitored process 12 with /storage/repos/ultimate/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-11-09 01:36:27,093 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/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 (12)] Waiting until timeout for monitored process [2024-11-09 01:36:27,419 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:36:27,434 INFO L255 TraceCheckSpWp]: Trace formula consists of 252 conjuncts, 12 conjuncts are in the unsatisfiable core [2024-11-09 01:36:27,438 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-09 01:36:27,456 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 9 [2024-11-09 01:36:27,960 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 11 [2024-11-09 01:36:28,058 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 37 treesize of output 25 [2024-11-09 01:36:28,102 INFO L134 CoverageAnalysis]: Checked inductivity of 220 backedges. 90 proven. 6 refuted. 0 times theorem prover too weak. 124 trivial. 0 not checked. [2024-11-09 01:36:28,102 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-09 01:36:30,040 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 41 treesize of output 29 [2024-11-09 01:36:30,113 INFO L134 CoverageAnalysis]: Checked inductivity of 220 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 220 trivial. 0 not checked. [2024-11-09 01:36:30,113 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-09 01:36:30,113 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [311051535] [2024-11-09 01:36:30,113 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [311051535] provided 1 perfect and 1 imperfect interpolant sequences [2024-11-09 01:36:30,113 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-11-09 01:36:30,113 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [11] total 16 [2024-11-09 01:36:30,114 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [121704146] [2024-11-09 01:36:30,114 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 01:36:30,114 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-09 01:36:30,114 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-09 01:36:30,115 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-09 01:36:30,115 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=47, Invalid=193, Unknown=0, NotChecked=0, Total=240 [2024-11-09 01:36:30,115 INFO L87 Difference]: Start difference. First operand 271 states and 369 transitions. Second operand has 6 states, 6 states have (on average 8.833333333333334) internal successors, (53), 6 states have internal predecessors, (53), 1 states have call successors, (11), 1 states have call predecessors, (11), 1 states have return successors, (11), 1 states have call predecessors, (11), 1 states have call successors, (11) [2024-11-09 01:36:34,193 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 01:36:34,193 INFO L93 Difference]: Finished difference Result 579 states and 786 transitions. [2024-11-09 01:36:34,200 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-11-09 01:36:34,200 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 8.833333333333334) internal successors, (53), 6 states have internal predecessors, (53), 1 states have call successors, (11), 1 states have call predecessors, (11), 1 states have return successors, (11), 1 states have call predecessors, (11), 1 states have call successors, (11) Word has length 105 [2024-11-09 01:36:34,200 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 01:36:34,202 INFO L225 Difference]: With dead ends: 579 [2024-11-09 01:36:34,202 INFO L226 Difference]: Without dead ends: 385 [2024-11-09 01:36:34,202 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 210 GetRequests, 194 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 54 ImplicationChecksByTransitivity, 2.6s TimeCoverageRelationStatistics Valid=61, Invalid=245, Unknown=0, NotChecked=0, Total=306 [2024-11-09 01:36:34,203 INFO L432 NwaCegarLoop]: 167 mSDtfsCounter, 62 mSDsluCounter, 537 mSDsCounter, 0 mSdLazyCounter, 108 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 3.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 62 SdHoareTripleChecker+Valid, 704 SdHoareTripleChecker+Invalid, 109 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 108 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 3.3s IncrementalHoareTripleChecker+Time [2024-11-09 01:36:34,203 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [62 Valid, 704 Invalid, 109 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 108 Invalid, 0 Unknown, 0 Unchecked, 3.3s Time] [2024-11-09 01:36:34,204 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 385 states. [2024-11-09 01:36:34,213 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 385 to 295. [2024-11-09 01:36:34,214 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 295 states, 263 states have (on average 1.3346007604562737) internal successors, (351), 264 states have internal predecessors, (351), 28 states have call successors, (28), 3 states have call predecessors, (28), 3 states have return successors, (28), 27 states have call predecessors, (28), 28 states have call successors, (28) [2024-11-09 01:36:34,215 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 295 states to 295 states and 407 transitions. [2024-11-09 01:36:34,216 INFO L78 Accepts]: Start accepts. Automaton has 295 states and 407 transitions. Word has length 105 [2024-11-09 01:36:34,217 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 01:36:34,217 INFO L471 AbstractCegarLoop]: Abstraction has 295 states and 407 transitions. [2024-11-09 01:36:34,218 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 8.833333333333334) internal successors, (53), 6 states have internal predecessors, (53), 1 states have call successors, (11), 1 states have call predecessors, (11), 1 states have return successors, (11), 1 states have call predecessors, (11), 1 states have call successors, (11) [2024-11-09 01:36:34,218 INFO L276 IsEmpty]: Start isEmpty. Operand 295 states and 407 transitions. [2024-11-09 01:36:34,218 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 106 [2024-11-09 01:36:34,218 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 01:36:34,220 INFO L215 NwaCegarLoop]: trace histogram [11, 11, 11, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 01:36:34,232 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/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 (12)] Ended with exit code 0 [2024-11-09 01:36:34,423 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 12 /storage/repos/ultimate/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-11-09 01:36:34,424 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-09 01:36:34,424 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 01:36:34,424 INFO L85 PathProgramCache]: Analyzing trace with hash 2005076266, now seen corresponding path program 1 times [2024-11-09 01:36:34,425 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-09 01:36:34,425 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [222286103] [2024-11-09 01:36:34,425 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 01:36:34,425 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-11-09 01:36:34,425 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-09 01:36:34,428 INFO L229 MonitoredProcess]: Starting monitored process 13 with /storage/repos/ultimate/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-11-09 01:36:34,429 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/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 (13)] Waiting until timeout for monitored process [2024-11-09 01:36:34,671 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:36:34,683 INFO L255 TraceCheckSpWp]: Trace formula consists of 252 conjuncts, 12 conjuncts are in the unsatisfiable core [2024-11-09 01:36:34,686 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-09 01:36:34,704 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 9 [2024-11-09 01:36:34,927 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 13 [2024-11-09 01:36:34,930 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 24 treesize of output 16 [2024-11-09 01:36:35,344 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 37 treesize of output 25 [2024-11-09 01:36:35,515 INFO L134 CoverageAnalysis]: Checked inductivity of 220 backedges. 90 proven. 6 refuted. 0 times theorem prover too weak. 124 trivial. 0 not checked. [2024-11-09 01:36:35,516 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-09 01:36:35,821 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 32 treesize of output 20 [2024-11-09 01:36:35,966 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 18 [2024-11-09 01:36:36,043 INFO L134 CoverageAnalysis]: Checked inductivity of 220 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 220 trivial. 0 not checked. [2024-11-09 01:36:36,043 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-09 01:36:36,043 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [222286103] [2024-11-09 01:36:36,043 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [222286103] provided 1 perfect and 1 imperfect interpolant sequences [2024-11-09 01:36:36,043 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-11-09 01:36:36,043 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [10] total 14 [2024-11-09 01:36:36,043 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [455067781] [2024-11-09 01:36:36,044 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 01:36:36,044 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-09 01:36:36,044 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-09 01:36:36,044 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-09 01:36:36,044 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=37, Invalid=145, Unknown=0, NotChecked=0, Total=182 [2024-11-09 01:36:36,045 INFO L87 Difference]: Start difference. First operand 295 states and 407 transitions. Second operand has 5 states, 5 states have (on average 10.6) internal successors, (53), 5 states have internal predecessors, (53), 1 states have call successors, (11), 1 states have call predecessors, (11), 1 states have return successors, (11), 1 states have call predecessors, (11), 1 states have call successors, (11) [2024-11-09 01:36:36,967 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 01:36:36,970 INFO L93 Difference]: Finished difference Result 501 states and 690 transitions. [2024-11-09 01:36:36,972 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-09 01:36:36,972 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 10.6) internal successors, (53), 5 states have internal predecessors, (53), 1 states have call successors, (11), 1 states have call predecessors, (11), 1 states have return successors, (11), 1 states have call predecessors, (11), 1 states have call successors, (11) Word has length 105 [2024-11-09 01:36:36,972 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 01:36:36,974 INFO L225 Difference]: With dead ends: 501 [2024-11-09 01:36:36,974 INFO L226 Difference]: Without dead ends: 281 [2024-11-09 01:36:36,975 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 210 GetRequests, 196 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 38 ImplicationChecksByTransitivity, 1.2s TimeCoverageRelationStatistics Valid=48, Invalid=192, Unknown=0, NotChecked=0, Total=240 [2024-11-09 01:36:36,975 INFO L432 NwaCegarLoop]: 149 mSDtfsCounter, 26 mSDsluCounter, 394 mSDsCounter, 0 mSdLazyCounter, 35 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 26 SdHoareTripleChecker+Valid, 543 SdHoareTripleChecker+Invalid, 36 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 35 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2024-11-09 01:36:36,975 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [26 Valid, 543 Invalid, 36 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 35 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2024-11-09 01:36:36,977 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 281 states. [2024-11-09 01:36:36,987 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 281 to 281. [2024-11-09 01:36:36,988 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 281 states, 249 states have (on average 1.3172690763052208) internal successors, (328), 250 states have internal predecessors, (328), 28 states have call successors, (28), 3 states have call predecessors, (28), 3 states have return successors, (28), 27 states have call predecessors, (28), 28 states have call successors, (28) [2024-11-09 01:36:36,989 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 281 states to 281 states and 384 transitions. [2024-11-09 01:36:36,989 INFO L78 Accepts]: Start accepts. Automaton has 281 states and 384 transitions. Word has length 105 [2024-11-09 01:36:36,990 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 01:36:36,990 INFO L471 AbstractCegarLoop]: Abstraction has 281 states and 384 transitions. [2024-11-09 01:36:36,990 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 10.6) internal successors, (53), 5 states have internal predecessors, (53), 1 states have call successors, (11), 1 states have call predecessors, (11), 1 states have return successors, (11), 1 states have call predecessors, (11), 1 states have call successors, (11) [2024-11-09 01:36:36,990 INFO L276 IsEmpty]: Start isEmpty. Operand 281 states and 384 transitions. [2024-11-09 01:36:36,991 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 106 [2024-11-09 01:36:36,991 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 01:36:36,991 INFO L215 NwaCegarLoop]: trace histogram [11, 11, 11, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 01:36:37,001 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/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 (13)] Ended with exit code 0 [2024-11-09 01:36:37,191 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 13 /storage/repos/ultimate/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-11-09 01:36:37,192 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-09 01:36:37,192 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 01:36:37,192 INFO L85 PathProgramCache]: Analyzing trace with hash 905498916, now seen corresponding path program 1 times [2024-11-09 01:36:37,193 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-09 01:36:37,193 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1414606303] [2024-11-09 01:36:37,193 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 01:36:37,193 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-11-09 01:36:37,193 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-09 01:36:37,199 INFO L229 MonitoredProcess]: Starting monitored process 14 with /storage/repos/ultimate/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-11-09 01:36:37,202 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/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 (14)] Waiting until timeout for monitored process [2024-11-09 01:36:37,466 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:36:37,477 INFO L255 TraceCheckSpWp]: Trace formula consists of 251 conjuncts, 6 conjuncts are in the unsatisfiable core [2024-11-09 01:36:37,479 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-09 01:36:37,495 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 9 [2024-11-09 01:36:37,752 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 28 treesize of output 16 [2024-11-09 01:36:37,822 INFO L134 CoverageAnalysis]: Checked inductivity of 220 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 220 trivial. 0 not checked. [2024-11-09 01:36:37,822 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-09 01:36:37,822 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-09 01:36:37,822 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1414606303] [2024-11-09 01:36:37,822 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1414606303] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 01:36:37,823 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 01:36:37,823 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-11-09 01:36:37,823 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [829662205] [2024-11-09 01:36:37,823 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 01:36:37,823 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-11-09 01:36:37,823 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-09 01:36:37,824 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-11-09 01:36:37,824 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2024-11-09 01:36:37,824 INFO L87 Difference]: Start difference. First operand 281 states and 384 transitions. Second operand has 7 states, 7 states have (on average 7.571428571428571) internal successors, (53), 6 states have internal predecessors, (53), 1 states have call successors, (11), 1 states have call predecessors, (11), 1 states have return successors, (11), 1 states have call predecessors, (11), 1 states have call successors, (11) [2024-11-09 01:36:39,566 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 01:36:39,566 INFO L93 Difference]: Finished difference Result 652 states and 884 transitions. [2024-11-09 01:36:39,567 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-11-09 01:36:39,568 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 7.571428571428571) internal successors, (53), 6 states have internal predecessors, (53), 1 states have call successors, (11), 1 states have call predecessors, (11), 1 states have return successors, (11), 1 states have call predecessors, (11), 1 states have call successors, (11) Word has length 105 [2024-11-09 01:36:39,568 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 01:36:39,569 INFO L225 Difference]: With dead ends: 652 [2024-11-09 01:36:39,569 INFO L226 Difference]: Without dead ends: 446 [2024-11-09 01:36:39,570 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 108 GetRequests, 99 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=35, Invalid=75, Unknown=0, NotChecked=0, Total=110 [2024-11-09 01:36:39,571 INFO L432 NwaCegarLoop]: 119 mSDtfsCounter, 210 mSDsluCounter, 534 mSDsCounter, 0 mSdLazyCounter, 192 mSolverCounterSat, 48 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 210 SdHoareTripleChecker+Valid, 653 SdHoareTripleChecker+Invalid, 240 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 48 IncrementalHoareTripleChecker+Valid, 192 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.5s IncrementalHoareTripleChecker+Time [2024-11-09 01:36:39,571 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [210 Valid, 653 Invalid, 240 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [48 Valid, 192 Invalid, 0 Unknown, 0 Unchecked, 1.5s Time] [2024-11-09 01:36:39,572 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 446 states. [2024-11-09 01:36:39,579 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 446 to 284. [2024-11-09 01:36:39,580 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 284 states, 252 states have (on average 1.3214285714285714) internal successors, (333), 253 states have internal predecessors, (333), 28 states have call successors, (28), 3 states have call predecessors, (28), 3 states have return successors, (28), 27 states have call predecessors, (28), 28 states have call successors, (28) [2024-11-09 01:36:39,581 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 284 states to 284 states and 389 transitions. [2024-11-09 01:36:39,581 INFO L78 Accepts]: Start accepts. Automaton has 284 states and 389 transitions. Word has length 105 [2024-11-09 01:36:39,581 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 01:36:39,581 INFO L471 AbstractCegarLoop]: Abstraction has 284 states and 389 transitions. [2024-11-09 01:36:39,582 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 7.571428571428571) internal successors, (53), 6 states have internal predecessors, (53), 1 states have call successors, (11), 1 states have call predecessors, (11), 1 states have return successors, (11), 1 states have call predecessors, (11), 1 states have call successors, (11) [2024-11-09 01:36:39,582 INFO L276 IsEmpty]: Start isEmpty. Operand 284 states and 389 transitions. [2024-11-09 01:36:39,582 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 107 [2024-11-09 01:36:39,582 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 01:36:39,583 INFO L215 NwaCegarLoop]: trace histogram [11, 11, 11, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 01:36:39,592 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/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 (14)] Forceful destruction successful, exit code 0 [2024-11-09 01:36:39,783 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 14 /storage/repos/ultimate/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-11-09 01:36:39,784 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-09 01:36:39,784 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 01:36:39,784 INFO L85 PathProgramCache]: Analyzing trace with hash -933273785, now seen corresponding path program 1 times [2024-11-09 01:36:39,785 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-09 01:36:39,785 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [49551641] [2024-11-09 01:36:39,785 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 01:36:39,785 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-11-09 01:36:39,785 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-09 01:36:39,787 INFO L229 MonitoredProcess]: Starting monitored process 15 with /storage/repos/ultimate/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-11-09 01:36:39,788 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/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 (15)] Waiting until timeout for monitored process [2024-11-09 01:36:40,195 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:36:40,208 INFO L255 TraceCheckSpWp]: Trace formula consists of 256 conjuncts, 22 conjuncts are in the unsatisfiable core [2024-11-09 01:36:40,211 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-09 01:36:40,246 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 8 treesize of output 1 [2024-11-09 01:36:40,517 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-09 01:36:40,518 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 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 133 treesize of output 79 [2024-11-09 01:36:45,756 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-09 01:36:45,756 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 153 treesize of output 105 [2024-11-09 01:36:53,997 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-09 01:36:53,998 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 6 select indices, 6 select index equivalence classes, 0 disjoint index pairs (out of 15 index pairs), introduced 6 new quantified variables, introduced 15 case distinctions, treesize of input 230 treesize of output 152 [2024-11-09 01:36:54,577 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-09 01:36:54,577 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 8 select indices, 8 select index equivalence classes, 0 disjoint index pairs (out of 28 index pairs), introduced 8 new quantified variables, introduced 28 case distinctions, treesize of input 438 treesize of output 150 [2024-11-09 01:36:54,703 INFO L134 CoverageAnalysis]: Checked inductivity of 220 backedges. 32 proven. 72 refuted. 0 times theorem prover too weak. 116 trivial. 0 not checked. [2024-11-09 01:36:54,703 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-09 01:36:55,021 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-09 01:36:55,021 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [49551641] [2024-11-09 01:36:55,021 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [49551641] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-09 01:36:55,021 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [1126512374] [2024-11-09 01:36:55,021 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 01:36:55,022 INFO L173 SolverBuilder]: Constructing external solver with command: cvc4 --incremental --print-success --lang smt [2024-11-09 01:36:55,022 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 [2024-11-09 01:36:55,027 INFO L229 MonitoredProcess]: Starting monitored process 16 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (exit command is (exit), workingDir is null) [2024-11-09 01:36:55,031 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (16)] Waiting until timeout for monitored process [2024-11-09 01:36:56,459 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:36:56,473 INFO L255 TraceCheckSpWp]: Trace formula consists of 256 conjuncts, 26 conjuncts are in the unsatisfiable core [2024-11-09 01:36:56,477 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-09 01:36:56,610 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 17 [2024-11-09 01:37:05,446 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-09 01:37:05,446 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 6 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 124 treesize of output 71