/usr/lib/jvm/java-1.11.0-openjdk-amd64/bin/java -Xmx8000000000 -Xss4m -jar ./plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata ./data -s ../../../trunk/examples/settings/default/automizer/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.use.bitabs.translation true -tc ../../../trunk/examples/toolchains/AutomizerCInline.xml -i ../../../trunk/examples/svcomp/hardness-nfm22/hardness_variablewrapping_wrapper-a_file-15.i -------------------------------------------------------------------------------- This is Ultimate 0.2.4-tmp.fs.bitabs-eval-d9c3e40-m [2023-12-19 14:58:30,358 INFO L188 SettingsManager]: Resetting all preferences to default values... [2023-12-19 14:58:30,431 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/default/automizer/svcomp-Reach-32bit-Automizer_Default.epf [2023-12-19 14:58:30,436 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2023-12-19 14:58:30,437 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2023-12-19 14:58:30,460 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2023-12-19 14:58:30,460 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2023-12-19 14:58:30,461 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2023-12-19 14:58:30,461 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2023-12-19 14:58:30,464 INFO L153 SettingsManager]: * Use memory slicer=true [2023-12-19 14:58:30,464 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2023-12-19 14:58:30,464 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2023-12-19 14:58:30,465 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2023-12-19 14:58:30,466 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2023-12-19 14:58:30,466 INFO L153 SettingsManager]: * Use SBE=true [2023-12-19 14:58:30,466 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2023-12-19 14:58:30,466 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2023-12-19 14:58:30,466 INFO L153 SettingsManager]: * sizeof long=4 [2023-12-19 14:58:30,466 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2023-12-19 14:58:30,467 INFO L153 SettingsManager]: * sizeof POINTER=4 [2023-12-19 14:58:30,467 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2023-12-19 14:58:30,468 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2023-12-19 14:58:30,468 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2023-12-19 14:58:30,468 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2023-12-19 14:58:30,468 INFO L153 SettingsManager]: * Allow undefined functions=false [2023-12-19 14:58:30,468 INFO L153 SettingsManager]: * sizeof long double=12 [2023-12-19 14:58:30,469 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2023-12-19 14:58:30,469 INFO L153 SettingsManager]: * Use constant arrays=true [2023-12-19 14:58:30,469 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2023-12-19 14:58:30,469 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2023-12-19 14:58:30,470 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2023-12-19 14:58:30,470 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2023-12-19 14:58:30,470 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2023-12-19 14:58:30,470 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2023-12-19 14:58:30,471 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2023-12-19 14:58:30,471 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2023-12-19 14:58:30,471 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2023-12-19 14:58:30,471 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2023-12-19 14:58:30,471 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2023-12-19 14:58:30,471 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2023-12-19 14:58:30,471 INFO L153 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2023-12-19 14:58:30,472 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2023-12-19 14:58:30,472 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2023-12-19 14:58:30,472 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: Use bitabs translation -> true [2023-12-19 14:58:30,653 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2023-12-19 14:58:30,671 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2023-12-19 14:58:30,673 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2023-12-19 14:58:30,674 INFO L270 PluginConnector]: Initializing CDTParser... [2023-12-19 14:58:30,674 INFO L274 PluginConnector]: CDTParser initialized [2023-12-19 14:58:30,675 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/hardness-nfm22/hardness_variablewrapping_wrapper-a_file-15.i [2023-12-19 14:58:31,635 INFO L533 CDTParser]: Created temporary CDT project at NULL [2023-12-19 14:58:31,788 INFO L384 CDTParser]: Found 1 translation units. [2023-12-19 14:58:31,788 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/hardness-nfm22/hardness_variablewrapping_wrapper-a_file-15.i [2023-12-19 14:58:31,795 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/1a87bab85/4c04df267b634e4cb3968663aab2e416/FLAG8de61361f [2023-12-19 14:58:31,806 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/1a87bab85/4c04df267b634e4cb3968663aab2e416 [2023-12-19 14:58:31,808 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2023-12-19 14:58:31,809 INFO L133 ToolchainWalker]: Walking toolchain with 5 elements. [2023-12-19 14:58:31,810 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2023-12-19 14:58:31,810 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2023-12-19 14:58:31,828 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2023-12-19 14:58:31,829 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 19.12 02:58:31" (1/1) ... [2023-12-19 14:58:31,830 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@425cd065 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.12 02:58:31, skipping insertion in model container [2023-12-19 14:58:31,830 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 19.12 02:58:31" (1/1) ... [2023-12-19 14:58:31,859 INFO L177 MainTranslator]: Built tables and reachable declarations [2023-12-19 14:58:31,950 WARN L239 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/hardness-nfm22/hardness_variablewrapping_wrapper-a_file-15.i[916,929] [2023-12-19 14:58:31,986 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-12-19 14:58:31,994 INFO L202 MainTranslator]: Completed pre-run [2023-12-19 14:58:32,002 WARN L239 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/hardness-nfm22/hardness_variablewrapping_wrapper-a_file-15.i[916,929] [2023-12-19 14:58:32,027 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-12-19 14:58:32,039 INFO L206 MainTranslator]: Completed translation [2023-12-19 14:58:32,039 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.12 02:58:32 WrapperNode [2023-12-19 14:58:32,039 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2023-12-19 14:58:32,040 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2023-12-19 14:58:32,040 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2023-12-19 14:58:32,040 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2023-12-19 14:58:32,045 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.12 02:58:32" (1/1) ... [2023-12-19 14:58:32,054 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.12 02:58:32" (1/1) ... [2023-12-19 14:58:32,082 INFO L138 Inliner]: procedures = 29, calls = 155, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 501 [2023-12-19 14:58:32,082 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2023-12-19 14:58:32,083 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2023-12-19 14:58:32,083 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2023-12-19 14:58:32,083 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2023-12-19 14:58:32,090 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.12 02:58:32" (1/1) ... [2023-12-19 14:58:32,091 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.12 02:58:32" (1/1) ... [2023-12-19 14:58:32,096 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.12 02:58:32" (1/1) ... [2023-12-19 14:58:32,118 INFO L175 MemorySlicer]: Split 127 memory accesses to 6 slices as follows [2, 16, 51, 25, 10, 23]. 40 percent of accesses are in the largest equivalence class. The 14 initializations are split as follows [2, 2, 5, 2, 1, 2]. The 16 writes are split as follows [0, 2, 6, 4, 1, 3]. [2023-12-19 14:58:32,118 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.12 02:58:32" (1/1) ... [2023-12-19 14:58:32,118 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.12 02:58:32" (1/1) ... [2023-12-19 14:58:32,144 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.12 02:58:32" (1/1) ... [2023-12-19 14:58:32,148 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.12 02:58:32" (1/1) ... [2023-12-19 14:58:32,150 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.12 02:58:32" (1/1) ... [2023-12-19 14:58:32,152 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.12 02:58:32" (1/1) ... [2023-12-19 14:58:32,155 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2023-12-19 14:58:32,156 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2023-12-19 14:58:32,156 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2023-12-19 14:58:32,156 INFO L274 PluginConnector]: RCFGBuilder initialized [2023-12-19 14:58:32,157 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.12 02:58:32" (1/1) ... [2023-12-19 14:58:32,176 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2023-12-19 14:58:32,185 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-12-19 14:58:32,202 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) [2023-12-19 14:58:32,225 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 [2023-12-19 14:58:32,233 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2023-12-19 14:58:32,233 INFO L130 BoogieDeclarations]: Found specification of procedure read~real#0 [2023-12-19 14:58:32,234 INFO L130 BoogieDeclarations]: Found specification of procedure read~real#1 [2023-12-19 14:58:32,234 INFO L130 BoogieDeclarations]: Found specification of procedure read~real#2 [2023-12-19 14:58:32,234 INFO L130 BoogieDeclarations]: Found specification of procedure read~real#3 [2023-12-19 14:58:32,234 INFO L130 BoogieDeclarations]: Found specification of procedure read~real#4 [2023-12-19 14:58:32,235 INFO L130 BoogieDeclarations]: Found specification of procedure read~real#5 [2023-12-19 14:58:32,236 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#0 [2023-12-19 14:58:32,236 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#1 [2023-12-19 14:58:32,236 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#2 [2023-12-19 14:58:32,236 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#3 [2023-12-19 14:58:32,236 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#4 [2023-12-19 14:58:32,236 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#5 [2023-12-19 14:58:32,236 INFO L130 BoogieDeclarations]: Found specification of procedure write~real#0 [2023-12-19 14:58:32,237 INFO L130 BoogieDeclarations]: Found specification of procedure write~real#1 [2023-12-19 14:58:32,237 INFO L130 BoogieDeclarations]: Found specification of procedure write~real#2 [2023-12-19 14:58:32,237 INFO L130 BoogieDeclarations]: Found specification of procedure write~real#3 [2023-12-19 14:58:32,237 INFO L130 BoogieDeclarations]: Found specification of procedure write~real#4 [2023-12-19 14:58:32,237 INFO L130 BoogieDeclarations]: Found specification of procedure write~real#5 [2023-12-19 14:58:32,237 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#0 [2023-12-19 14:58:32,237 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#1 [2023-12-19 14:58:32,238 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#2 [2023-12-19 14:58:32,238 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#3 [2023-12-19 14:58:32,238 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#4 [2023-12-19 14:58:32,239 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#5 [2023-12-19 14:58:32,239 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~real#0 [2023-12-19 14:58:32,239 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~real#1 [2023-12-19 14:58:32,240 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~real#2 [2023-12-19 14:58:32,241 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~real#3 [2023-12-19 14:58:32,241 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~real#4 [2023-12-19 14:58:32,241 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~real#5 [2023-12-19 14:58:32,241 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2023-12-19 14:58:32,241 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2023-12-19 14:58:32,241 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2023-12-19 14:58:32,241 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#1 [2023-12-19 14:58:32,241 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#2 [2023-12-19 14:58:32,241 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#3 [2023-12-19 14:58:32,241 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#4 [2023-12-19 14:58:32,244 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#5 [2023-12-19 14:58:32,244 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2023-12-19 14:58:32,244 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2023-12-19 14:58:32,391 INFO L241 CfgBuilder]: Building ICFG [2023-12-19 14:58:32,393 INFO L267 CfgBuilder]: Building CFG for each procedure with an implementation [2023-12-19 14:58:32,709 INFO L282 CfgBuilder]: Performing block encoding [2023-12-19 14:58:32,773 INFO L304 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2023-12-19 14:58:32,773 INFO L309 CfgBuilder]: Removed 1 assume(true) statements. [2023-12-19 14:58:32,774 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 19.12 02:58:32 BoogieIcfgContainer [2023-12-19 14:58:32,774 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2023-12-19 14:58:32,775 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2023-12-19 14:58:32,775 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2023-12-19 14:58:32,777 INFO L274 PluginConnector]: TraceAbstraction initialized [2023-12-19 14:58:32,778 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 19.12 02:58:31" (1/3) ... [2023-12-19 14:58:32,778 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@32764bb0 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 19.12 02:58:32, skipping insertion in model container [2023-12-19 14:58:32,778 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.12 02:58:32" (2/3) ... [2023-12-19 14:58:32,778 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@32764bb0 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 19.12 02:58:32, skipping insertion in model container [2023-12-19 14:58:32,778 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 19.12 02:58:32" (3/3) ... [2023-12-19 14:58:32,779 INFO L112 eAbstractionObserver]: Analyzing ICFG hardness_variablewrapping_wrapper-a_file-15.i [2023-12-19 14:58:32,792 INFO L204 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2023-12-19 14:58:32,793 INFO L163 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2023-12-19 14:58:32,830 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2023-12-19 14:58:32,836 INFO L357 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, mHoare=true, 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;@49203c28, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2023-12-19 14:58:32,836 INFO L358 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2023-12-19 14:58:32,839 INFO L276 IsEmpty]: Start isEmpty. Operand has 106 states, 91 states have (on average 1.4835164835164836) internal successors, (135), 92 states have internal predecessors, (135), 12 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 12 states have call predecessors, (12), 12 states have call successors, (12) [2023-12-19 14:58:32,848 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 111 [2023-12-19 14:58:32,848 INFO L187 NwaCegarLoop]: Found error trace [2023-12-19 14:58:32,849 INFO L195 NwaCegarLoop]: trace histogram [12, 12, 12, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-19 14:58:32,849 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-19 14:58:32,852 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-19 14:58:32,853 INFO L85 PathProgramCache]: Analyzing trace with hash -1666154856, now seen corresponding path program 1 times [2023-12-19 14:58:32,859 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-19 14:58:32,859 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [807617049] [2023-12-19 14:58:32,859 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-19 14:58:32,860 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-19 14:58:32,977 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 14:58:33,087 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-12-19 14:58:33,089 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 14:58:33,095 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2023-12-19 14:58:33,097 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 14:58:33,099 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2023-12-19 14:58:33,101 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 14:58:33,102 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2023-12-19 14:58:33,103 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 14:58:33,106 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2023-12-19 14:58:33,107 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 14:58:33,110 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2023-12-19 14:58:33,111 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 14:58:33,113 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2023-12-19 14:58:33,114 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 14:58:33,116 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2023-12-19 14:58:33,117 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 14:58:33,119 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2023-12-19 14:58:33,120 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 14:58:33,123 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2023-12-19 14:58:33,129 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 14:58:33,133 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2023-12-19 14:58:33,135 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 14:58:33,143 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 80 [2023-12-19 14:58:33,145 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 14:58:33,153 INFO L134 CoverageAnalysis]: Checked inductivity of 264 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 264 trivial. 0 not checked. [2023-12-19 14:58:33,153 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-19 14:58:33,153 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [807617049] [2023-12-19 14:58:33,154 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [807617049] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-19 14:58:33,154 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-19 14:58:33,154 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-12-19 14:58:33,156 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [750430445] [2023-12-19 14:58:33,156 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-19 14:58:33,161 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2023-12-19 14:58:33,161 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-19 14:58:33,189 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2023-12-19 14:58:33,189 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2023-12-19 14:58:33,192 INFO L87 Difference]: Start difference. First operand has 106 states, 91 states have (on average 1.4835164835164836) internal successors, (135), 92 states have internal predecessors, (135), 12 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 12 states have call predecessors, (12), 12 states have call successors, (12) Second operand has 2 states, 2 states have (on average 26.5) internal successors, (53), 2 states have internal predecessors, (53), 2 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 2 states have call successors, (12) [2023-12-19 14:58:33,236 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-19 14:58:33,236 INFO L93 Difference]: Finished difference Result 209 states and 328 transitions. [2023-12-19 14:58:33,238 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2023-12-19 14:58:33,239 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 26.5) internal successors, (53), 2 states have internal predecessors, (53), 2 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 2 states have call successors, (12) Word has length 110 [2023-12-19 14:58:33,239 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-19 14:58:33,245 INFO L225 Difference]: With dead ends: 209 [2023-12-19 14:58:33,245 INFO L226 Difference]: Without dead ends: 104 [2023-12-19 14:58:33,248 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 38 GetRequests, 38 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2023-12-19 14:58:33,252 INFO L413 NwaCegarLoop]: 148 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 4 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 148 SdHoareTripleChecker+Invalid, 4 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 4 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-12-19 14:58:33,253 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 148 Invalid, 4 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 4 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-12-19 14:58:33,267 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 104 states. [2023-12-19 14:58:33,290 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 104 to 104. [2023-12-19 14:58:33,291 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 104 states, 90 states have (on average 1.4222222222222223) internal successors, (128), 90 states have internal predecessors, (128), 12 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 12 states have call predecessors, (12), 12 states have call successors, (12) [2023-12-19 14:58:33,298 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 104 states to 104 states and 152 transitions. [2023-12-19 14:58:33,299 INFO L78 Accepts]: Start accepts. Automaton has 104 states and 152 transitions. Word has length 110 [2023-12-19 14:58:33,299 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-19 14:58:33,299 INFO L495 AbstractCegarLoop]: Abstraction has 104 states and 152 transitions. [2023-12-19 14:58:33,300 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 26.5) internal successors, (53), 2 states have internal predecessors, (53), 2 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 2 states have call successors, (12) [2023-12-19 14:58:33,300 INFO L276 IsEmpty]: Start isEmpty. Operand 104 states and 152 transitions. [2023-12-19 14:58:33,307 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 111 [2023-12-19 14:58:33,308 INFO L187 NwaCegarLoop]: Found error trace [2023-12-19 14:58:33,308 INFO L195 NwaCegarLoop]: trace histogram [12, 12, 12, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-19 14:58:33,308 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2023-12-19 14:58:33,309 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-19 14:58:33,309 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-19 14:58:33,309 INFO L85 PathProgramCache]: Analyzing trace with hash -1359425398, now seen corresponding path program 1 times [2023-12-19 14:58:33,309 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-19 14:58:33,310 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1037602289] [2023-12-19 14:58:33,310 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-19 14:58:33,310 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-19 14:58:33,369 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 14:58:33,529 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-12-19 14:58:33,531 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 14:58:33,535 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2023-12-19 14:58:33,536 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 14:58:33,542 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2023-12-19 14:58:33,543 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 14:58:33,554 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2023-12-19 14:58:33,555 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 14:58:33,558 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2023-12-19 14:58:33,559 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 14:58:33,561 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2023-12-19 14:58:33,561 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 14:58:33,562 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2023-12-19 14:58:33,563 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 14:58:33,564 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2023-12-19 14:58:33,564 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 14:58:33,565 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2023-12-19 14:58:33,566 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 14:58:33,567 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2023-12-19 14:58:33,568 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 14:58:33,570 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2023-12-19 14:58:33,570 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 14:58:33,572 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 80 [2023-12-19 14:58:33,573 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 14:58:33,578 INFO L134 CoverageAnalysis]: Checked inductivity of 264 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 264 trivial. 0 not checked. [2023-12-19 14:58:33,578 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-19 14:58:33,578 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1037602289] [2023-12-19 14:58:33,578 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1037602289] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-19 14:58:33,578 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-19 14:58:33,578 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-12-19 14:58:33,579 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1274032733] [2023-12-19 14:58:33,579 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-19 14:58:33,580 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-12-19 14:58:33,583 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-19 14:58:33,584 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-12-19 14:58:33,584 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-12-19 14:58:33,584 INFO L87 Difference]: Start difference. First operand 104 states and 152 transitions. Second operand has 4 states, 4 states have (on average 13.25) internal successors, (53), 4 states have internal predecessors, (53), 2 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 2 states have call predecessors, (12), 2 states have call successors, (12) [2023-12-19 14:58:33,653 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-19 14:58:33,653 INFO L93 Difference]: Finished difference Result 213 states and 312 transitions. [2023-12-19 14:58:33,653 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-12-19 14:58:33,654 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 13.25) internal successors, (53), 4 states have internal predecessors, (53), 2 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 2 states have call predecessors, (12), 2 states have call successors, (12) Word has length 110 [2023-12-19 14:58:33,654 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-19 14:58:33,657 INFO L225 Difference]: With dead ends: 213 [2023-12-19 14:58:33,657 INFO L226 Difference]: Without dead ends: 110 [2023-12-19 14:58:33,660 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 29 GetRequests, 26 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2023-12-19 14:58:33,661 INFO L413 NwaCegarLoop]: 149 mSDtfsCounter, 10 mSDsluCounter, 287 mSDsCounter, 0 mSdLazyCounter, 24 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 11 SdHoareTripleChecker+Valid, 436 SdHoareTripleChecker+Invalid, 25 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 24 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-12-19 14:58:33,677 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [11 Valid, 436 Invalid, 25 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 24 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-12-19 14:58:33,680 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 110 states. [2023-12-19 14:58:33,691 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 110 to 106. [2023-12-19 14:58:33,691 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 106 states, 92 states have (on average 1.4130434782608696) internal successors, (130), 92 states have internal predecessors, (130), 12 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 12 states have call predecessors, (12), 12 states have call successors, (12) [2023-12-19 14:58:33,692 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 106 states to 106 states and 154 transitions. [2023-12-19 14:58:33,692 INFO L78 Accepts]: Start accepts. Automaton has 106 states and 154 transitions. Word has length 110 [2023-12-19 14:58:33,692 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-19 14:58:33,693 INFO L495 AbstractCegarLoop]: Abstraction has 106 states and 154 transitions. [2023-12-19 14:58:33,693 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 13.25) internal successors, (53), 4 states have internal predecessors, (53), 2 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 2 states have call predecessors, (12), 2 states have call successors, (12) [2023-12-19 14:58:33,693 INFO L276 IsEmpty]: Start isEmpty. Operand 106 states and 154 transitions. [2023-12-19 14:58:33,694 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 111 [2023-12-19 14:58:33,694 INFO L187 NwaCegarLoop]: Found error trace [2023-12-19 14:58:33,694 INFO L195 NwaCegarLoop]: trace histogram [12, 12, 12, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-19 14:58:33,694 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2023-12-19 14:58:33,694 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-19 14:58:33,695 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-19 14:58:33,695 INFO L85 PathProgramCache]: Analyzing trace with hash -627457972, now seen corresponding path program 1 times [2023-12-19 14:58:33,695 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-19 14:58:33,695 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2049417866] [2023-12-19 14:58:33,695 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-19 14:58:33,695 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-19 14:58:33,742 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 14:58:33,790 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-12-19 14:58:33,791 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 14:58:33,793 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2023-12-19 14:58:33,793 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 14:58:33,794 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2023-12-19 14:58:33,795 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 14:58:33,795 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2023-12-19 14:58:33,796 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 14:58:33,797 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2023-12-19 14:58:33,798 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 14:58:33,799 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2023-12-19 14:58:33,799 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 14:58:33,800 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2023-12-19 14:58:33,801 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 14:58:33,801 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2023-12-19 14:58:33,802 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 14:58:33,803 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2023-12-19 14:58:33,804 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 14:58:33,804 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2023-12-19 14:58:33,810 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 14:58:33,812 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2023-12-19 14:58:33,813 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 14:58:33,815 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 80 [2023-12-19 14:58:33,816 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 14:58:33,819 INFO L134 CoverageAnalysis]: Checked inductivity of 264 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 264 trivial. 0 not checked. [2023-12-19 14:58:33,819 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-19 14:58:33,820 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2049417866] [2023-12-19 14:58:33,820 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2049417866] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-19 14:58:33,820 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-19 14:58:33,820 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-12-19 14:58:33,820 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [330980947] [2023-12-19 14:58:33,820 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-19 14:58:33,821 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-12-19 14:58:33,821 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-19 14:58:33,822 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-12-19 14:58:33,824 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-12-19 14:58:33,825 INFO L87 Difference]: Start difference. First operand 106 states and 154 transitions. Second operand has 3 states, 3 states have (on average 17.666666666666668) internal successors, (53), 3 states have internal predecessors, (53), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) [2023-12-19 14:58:33,854 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-19 14:58:33,855 INFO L93 Difference]: Finished difference Result 212 states and 309 transitions. [2023-12-19 14:58:33,855 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-12-19 14:58:33,855 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 17.666666666666668) internal successors, (53), 3 states have internal predecessors, (53), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) Word has length 110 [2023-12-19 14:58:33,856 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-19 14:58:33,857 INFO L225 Difference]: With dead ends: 212 [2023-12-19 14:58:33,857 INFO L226 Difference]: Without dead ends: 107 [2023-12-19 14:58:33,859 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 27 GetRequests, 26 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-12-19 14:58:33,862 INFO L413 NwaCegarLoop]: 147 mSDtfsCounter, 0 mSDsluCounter, 142 mSDsCounter, 0 mSdLazyCounter, 14 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 289 SdHoareTripleChecker+Invalid, 14 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 14 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-12-19 14:58:33,863 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 289 Invalid, 14 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 14 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-12-19 14:58:33,865 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 107 states. [2023-12-19 14:58:33,874 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 107 to 107. [2023-12-19 14:58:33,875 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 107 states, 93 states have (on average 1.4086021505376345) internal successors, (131), 93 states have internal predecessors, (131), 12 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 12 states have call predecessors, (12), 12 states have call successors, (12) [2023-12-19 14:58:33,876 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 107 states to 107 states and 155 transitions. [2023-12-19 14:58:33,876 INFO L78 Accepts]: Start accepts. Automaton has 107 states and 155 transitions. Word has length 110 [2023-12-19 14:58:33,876 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-19 14:58:33,877 INFO L495 AbstractCegarLoop]: Abstraction has 107 states and 155 transitions. [2023-12-19 14:58:33,877 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 17.666666666666668) internal successors, (53), 3 states have internal predecessors, (53), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) [2023-12-19 14:58:33,877 INFO L276 IsEmpty]: Start isEmpty. Operand 107 states and 155 transitions. [2023-12-19 14:58:33,878 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 111 [2023-12-19 14:58:33,878 INFO L187 NwaCegarLoop]: Found error trace [2023-12-19 14:58:33,878 INFO L195 NwaCegarLoop]: trace histogram [12, 12, 12, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-19 14:58:33,879 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2023-12-19 14:58:33,879 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-19 14:58:33,880 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-19 14:58:33,880 INFO L85 PathProgramCache]: Analyzing trace with hash 1673364618, now seen corresponding path program 1 times [2023-12-19 14:58:33,880 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-19 14:58:33,880 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1979213647] [2023-12-19 14:58:33,880 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-19 14:58:33,880 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-19 14:58:33,914 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 14:58:33,958 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-12-19 14:58:33,960 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 14:58:33,961 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2023-12-19 14:58:33,964 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 14:58:33,968 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2023-12-19 14:58:33,970 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 14:58:33,976 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2023-12-19 14:58:33,978 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 14:58:33,981 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2023-12-19 14:58:33,982 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 14:58:33,985 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2023-12-19 14:58:33,986 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 14:58:33,987 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2023-12-19 14:58:33,988 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 14:58:33,989 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2023-12-19 14:58:33,989 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 14:58:33,990 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2023-12-19 14:58:33,991 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 14:58:33,996 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2023-12-19 14:58:33,998 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 14:58:33,999 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2023-12-19 14:58:34,001 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 14:58:34,003 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 80 [2023-12-19 14:58:34,005 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 14:58:34,007 INFO L134 CoverageAnalysis]: Checked inductivity of 264 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 264 trivial. 0 not checked. [2023-12-19 14:58:34,007 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-19 14:58:34,007 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1979213647] [2023-12-19 14:58:34,007 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1979213647] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-19 14:58:34,008 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-19 14:58:34,008 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-12-19 14:58:34,008 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1217047197] [2023-12-19 14:58:34,008 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-19 14:58:34,009 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-12-19 14:58:34,009 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-19 14:58:34,010 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-12-19 14:58:34,010 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-12-19 14:58:34,010 INFO L87 Difference]: Start difference. First operand 107 states and 155 transitions. Second operand has 3 states, 3 states have (on average 17.666666666666668) internal successors, (53), 3 states have internal predecessors, (53), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) [2023-12-19 14:58:34,044 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-19 14:58:34,044 INFO L93 Difference]: Finished difference Result 237 states and 344 transitions. [2023-12-19 14:58:34,045 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-12-19 14:58:34,046 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 17.666666666666668) internal successors, (53), 3 states have internal predecessors, (53), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) Word has length 110 [2023-12-19 14:58:34,046 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-19 14:58:34,047 INFO L225 Difference]: With dead ends: 237 [2023-12-19 14:58:34,047 INFO L226 Difference]: Without dead ends: 131 [2023-12-19 14:58:34,047 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 27 GetRequests, 26 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-12-19 14:58:34,048 INFO L413 NwaCegarLoop]: 179 mSDtfsCounter, 39 mSDsluCounter, 137 mSDsCounter, 0 mSdLazyCounter, 14 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 39 SdHoareTripleChecker+Valid, 316 SdHoareTripleChecker+Invalid, 15 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 14 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-12-19 14:58:34,048 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [39 Valid, 316 Invalid, 15 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 14 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-12-19 14:58:34,049 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 131 states. [2023-12-19 14:58:34,052 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 131 to 108. [2023-12-19 14:58:34,053 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 108 states, 94 states have (on average 1.4042553191489362) internal successors, (132), 94 states have internal predecessors, (132), 12 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 12 states have call predecessors, (12), 12 states have call successors, (12) [2023-12-19 14:58:34,053 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 108 states to 108 states and 156 transitions. [2023-12-19 14:58:34,053 INFO L78 Accepts]: Start accepts. Automaton has 108 states and 156 transitions. Word has length 110 [2023-12-19 14:58:34,054 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-19 14:58:34,054 INFO L495 AbstractCegarLoop]: Abstraction has 108 states and 156 transitions. [2023-12-19 14:58:34,054 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 17.666666666666668) internal successors, (53), 3 states have internal predecessors, (53), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) [2023-12-19 14:58:34,054 INFO L276 IsEmpty]: Start isEmpty. Operand 108 states and 156 transitions. [2023-12-19 14:58:34,055 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 111 [2023-12-19 14:58:34,055 INFO L187 NwaCegarLoop]: Found error trace [2023-12-19 14:58:34,056 INFO L195 NwaCegarLoop]: trace histogram [12, 12, 12, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-19 14:58:34,056 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2023-12-19 14:58:34,056 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-19 14:58:34,056 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-19 14:58:34,056 INFO L85 PathProgramCache]: Analyzing trace with hash -1920538100, now seen corresponding path program 1 times [2023-12-19 14:58:34,057 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-19 14:58:34,057 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [249090575] [2023-12-19 14:58:34,057 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-19 14:58:34,057 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-19 14:58:34,099 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 14:58:34,411 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-12-19 14:58:34,412 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 14:58:34,414 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2023-12-19 14:58:34,416 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 14:58:34,417 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2023-12-19 14:58:34,418 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 14:58:34,419 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2023-12-19 14:58:34,420 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 14:58:34,421 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2023-12-19 14:58:34,422 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 14:58:34,423 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2023-12-19 14:58:34,424 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 14:58:34,425 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2023-12-19 14:58:34,426 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 14:58:34,427 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2023-12-19 14:58:34,428 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 14:58:34,428 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2023-12-19 14:58:34,429 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 14:58:34,430 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2023-12-19 14:58:34,431 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 14:58:34,432 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2023-12-19 14:58:34,433 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 14:58:34,434 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 80 [2023-12-19 14:58:34,435 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 14:58:34,437 INFO L134 CoverageAnalysis]: Checked inductivity of 264 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 264 trivial. 0 not checked. [2023-12-19 14:58:34,437 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-19 14:58:34,437 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [249090575] [2023-12-19 14:58:34,438 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [249090575] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-19 14:58:34,439 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-19 14:58:34,439 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-12-19 14:58:34,439 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1507890113] [2023-12-19 14:58:34,439 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-19 14:58:34,439 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-12-19 14:58:34,439 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-19 14:58:34,440 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-12-19 14:58:34,440 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2023-12-19 14:58:34,440 INFO L87 Difference]: Start difference. First operand 108 states and 156 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, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) [2023-12-19 14:58:34,587 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-19 14:58:34,587 INFO L93 Difference]: Finished difference Result 322 states and 464 transitions. [2023-12-19 14:58:34,588 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2023-12-19 14:58:34,588 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, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) Word has length 110 [2023-12-19 14:58:34,588 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-19 14:58:34,590 INFO L225 Difference]: With dead ends: 322 [2023-12-19 14:58:34,590 INFO L226 Difference]: Without dead ends: 215 [2023-12-19 14:58:34,591 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 33 GetRequests, 27 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2023-12-19 14:58:34,591 INFO L413 NwaCegarLoop]: 239 mSDtfsCounter, 166 mSDsluCounter, 587 mSDsCounter, 0 mSdLazyCounter, 90 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 166 SdHoareTripleChecker+Valid, 826 SdHoareTripleChecker+Invalid, 92 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 90 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-12-19 14:58:34,591 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [166 Valid, 826 Invalid, 92 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 90 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-12-19 14:58:34,592 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 215 states. [2023-12-19 14:58:34,598 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 215 to 191. [2023-12-19 14:58:34,599 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 191 states, 168 states have (on average 1.4047619047619047) internal successors, (236), 169 states have internal predecessors, (236), 20 states have call successors, (20), 2 states have call predecessors, (20), 2 states have return successors, (20), 19 states have call predecessors, (20), 20 states have call successors, (20) [2023-12-19 14:58:34,603 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 191 states to 191 states and 276 transitions. [2023-12-19 14:58:34,603 INFO L78 Accepts]: Start accepts. Automaton has 191 states and 276 transitions. Word has length 110 [2023-12-19 14:58:34,604 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-19 14:58:34,604 INFO L495 AbstractCegarLoop]: Abstraction has 191 states and 276 transitions. [2023-12-19 14:58:34,604 INFO L496 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, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) [2023-12-19 14:58:34,604 INFO L276 IsEmpty]: Start isEmpty. Operand 191 states and 276 transitions. [2023-12-19 14:58:34,606 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 112 [2023-12-19 14:58:34,607 INFO L187 NwaCegarLoop]: Found error trace [2023-12-19 14:58:34,607 INFO L195 NwaCegarLoop]: trace histogram [12, 12, 12, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-19 14:58:34,607 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2023-12-19 14:58:34,607 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-19 14:58:34,607 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-19 14:58:34,608 INFO L85 PathProgramCache]: Analyzing trace with hash 968016930, now seen corresponding path program 1 times [2023-12-19 14:58:34,609 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-19 14:58:34,610 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1944489351] [2023-12-19 14:58:34,611 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-19 14:58:34,611 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-19 14:58:34,654 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 14:58:34,741 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-12-19 14:58:34,742 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 14:58:34,745 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2023-12-19 14:58:34,745 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 14:58:34,747 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2023-12-19 14:58:34,748 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 14:58:34,749 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2023-12-19 14:58:34,755 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 14:58:34,757 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2023-12-19 14:58:34,758 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 14:58:34,760 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2023-12-19 14:58:34,761 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 14:58:34,776 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2023-12-19 14:58:34,777 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 14:58:34,780 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2023-12-19 14:58:34,781 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 14:58:34,782 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2023-12-19 14:58:34,783 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 14:58:34,785 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2023-12-19 14:58:34,785 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 14:58:34,787 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2023-12-19 14:58:34,788 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 14:58:34,791 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 80 [2023-12-19 14:58:34,794 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 14:58:34,796 INFO L134 CoverageAnalysis]: Checked inductivity of 264 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 264 trivial. 0 not checked. [2023-12-19 14:58:34,796 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-19 14:58:34,796 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1944489351] [2023-12-19 14:58:34,796 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1944489351] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-19 14:58:34,796 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-19 14:58:34,796 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-12-19 14:58:34,796 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [602269748] [2023-12-19 14:58:34,796 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-19 14:58:34,797 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-12-19 14:58:34,797 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-19 14:58:34,797 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-12-19 14:58:34,797 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-12-19 14:58:34,797 INFO L87 Difference]: Start difference. First operand 191 states and 276 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, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) [2023-12-19 14:58:34,850 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-19 14:58:34,851 INFO L93 Difference]: Finished difference Result 613 states and 887 transitions. [2023-12-19 14:58:34,851 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-12-19 14:58:34,851 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, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) Word has length 111 [2023-12-19 14:58:34,851 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-19 14:58:34,855 INFO L225 Difference]: With dead ends: 613 [2023-12-19 14:58:34,855 INFO L226 Difference]: Without dead ends: 423 [2023-12-19 14:58:34,855 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 28 GetRequests, 25 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2023-12-19 14:58:34,857 INFO L413 NwaCegarLoop]: 142 mSDtfsCounter, 176 mSDsluCounter, 307 mSDsCounter, 0 mSdLazyCounter, 31 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 176 SdHoareTripleChecker+Valid, 449 SdHoareTripleChecker+Invalid, 34 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 31 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-12-19 14:58:34,858 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [176 Valid, 449 Invalid, 34 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 31 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-12-19 14:58:34,860 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 423 states. [2023-12-19 14:58:34,896 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 423 to 373. [2023-12-19 14:58:34,897 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 373 states, 328 states have (on average 1.4054878048780488) internal successors, (461), 330 states have internal predecessors, (461), 40 states have call successors, (40), 4 states have call predecessors, (40), 4 states have return successors, (40), 38 states have call predecessors, (40), 40 states have call successors, (40) [2023-12-19 14:58:34,899 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 373 states to 373 states and 541 transitions. [2023-12-19 14:58:34,899 INFO L78 Accepts]: Start accepts. Automaton has 373 states and 541 transitions. Word has length 111 [2023-12-19 14:58:34,900 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-19 14:58:34,900 INFO L495 AbstractCegarLoop]: Abstraction has 373 states and 541 transitions. [2023-12-19 14:58:34,900 INFO L496 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, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) [2023-12-19 14:58:34,900 INFO L276 IsEmpty]: Start isEmpty. Operand 373 states and 541 transitions. [2023-12-19 14:58:34,901 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 113 [2023-12-19 14:58:34,901 INFO L187 NwaCegarLoop]: Found error trace [2023-12-19 14:58:34,902 INFO L195 NwaCegarLoop]: trace histogram [12, 12, 12, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-19 14:58:34,902 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2023-12-19 14:58:34,902 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-19 14:58:34,902 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-19 14:58:34,902 INFO L85 PathProgramCache]: Analyzing trace with hash -1986392456, now seen corresponding path program 1 times [2023-12-19 14:58:34,903 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-19 14:58:34,903 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1784739641] [2023-12-19 14:58:34,903 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-19 14:58:34,903 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-19 14:58:34,936 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 14:58:35,032 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-12-19 14:58:35,034 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 14:58:35,036 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2023-12-19 14:58:35,038 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 14:58:35,039 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2023-12-19 14:58:35,040 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 14:58:35,041 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2023-12-19 14:58:35,042 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 14:58:35,043 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2023-12-19 14:58:35,044 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 14:58:35,045 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2023-12-19 14:58:35,047 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 14:58:35,049 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2023-12-19 14:58:35,050 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 14:58:35,052 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2023-12-19 14:58:35,053 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 14:58:35,055 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2023-12-19 14:58:35,057 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 14:58:35,058 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2023-12-19 14:58:35,059 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 14:58:35,060 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2023-12-19 14:58:35,061 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 14:58:35,063 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 80 [2023-12-19 14:58:35,064 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 14:58:35,066 INFO L134 CoverageAnalysis]: Checked inductivity of 264 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 264 trivial. 0 not checked. [2023-12-19 14:58:35,066 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-19 14:58:35,066 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1784739641] [2023-12-19 14:58:35,066 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1784739641] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-19 14:58:35,066 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-19 14:58:35,066 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-12-19 14:58:35,066 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1267777776] [2023-12-19 14:58:35,067 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-19 14:58:35,067 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-12-19 14:58:35,067 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-19 14:58:35,067 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-12-19 14:58:35,067 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-12-19 14:58:35,068 INFO L87 Difference]: Start difference. First operand 373 states and 541 transitions. Second operand has 4 states, 4 states have (on average 13.75) internal successors, (55), 4 states have internal predecessors, (55), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) [2023-12-19 14:58:35,117 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-19 14:58:35,118 INFO L93 Difference]: Finished difference Result 749 states and 1085 transitions. [2023-12-19 14:58:35,118 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-12-19 14:58:35,118 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), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) Word has length 112 [2023-12-19 14:58:35,118 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-19 14:58:35,120 INFO L225 Difference]: With dead ends: 749 [2023-12-19 14:58:35,120 INFO L226 Difference]: Without dead ends: 377 [2023-12-19 14:58:35,121 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 28 GetRequests, 25 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2023-12-19 14:58:35,122 INFO L413 NwaCegarLoop]: 151 mSDtfsCounter, 105 mSDsluCounter, 289 mSDsCounter, 0 mSdLazyCounter, 34 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 105 SdHoareTripleChecker+Valid, 440 SdHoareTripleChecker+Invalid, 36 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 34 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-12-19 14:58:35,122 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [105 Valid, 440 Invalid, 36 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 34 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-12-19 14:58:35,124 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 377 states. [2023-12-19 14:58:35,136 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 377 to 372. [2023-12-19 14:58:35,137 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 372 states, 327 states have (on average 1.4036697247706422) internal successors, (459), 329 states have internal predecessors, (459), 40 states have call successors, (40), 4 states have call predecessors, (40), 4 states have return successors, (40), 38 states have call predecessors, (40), 40 states have call successors, (40) [2023-12-19 14:58:35,139 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 372 states to 372 states and 539 transitions. [2023-12-19 14:58:35,139 INFO L78 Accepts]: Start accepts. Automaton has 372 states and 539 transitions. Word has length 112 [2023-12-19 14:58:35,139 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-19 14:58:35,139 INFO L495 AbstractCegarLoop]: Abstraction has 372 states and 539 transitions. [2023-12-19 14:58:35,140 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 13.75) internal successors, (55), 4 states have internal predecessors, (55), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) [2023-12-19 14:58:35,140 INFO L276 IsEmpty]: Start isEmpty. Operand 372 states and 539 transitions. [2023-12-19 14:58:35,141 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 114 [2023-12-19 14:58:35,141 INFO L187 NwaCegarLoop]: Found error trace [2023-12-19 14:58:35,141 INFO L195 NwaCegarLoop]: trace histogram [12, 12, 12, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-19 14:58:35,141 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2023-12-19 14:58:35,141 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-19 14:58:35,141 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-19 14:58:35,141 INFO L85 PathProgramCache]: Analyzing trace with hash -633881842, now seen corresponding path program 1 times [2023-12-19 14:58:35,142 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-19 14:58:35,142 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1715867707] [2023-12-19 14:58:35,142 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-19 14:58:35,142 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-19 14:58:35,172 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 14:58:35,367 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-12-19 14:58:35,368 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 14:58:35,369 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2023-12-19 14:58:35,370 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 14:58:35,372 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2023-12-19 14:58:35,372 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 14:58:35,373 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2023-12-19 14:58:35,373 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 14:58:35,374 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2023-12-19 14:58:35,374 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 14:58:35,376 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2023-12-19 14:58:35,376 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 14:58:35,377 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2023-12-19 14:58:35,378 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 14:58:35,378 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2023-12-19 14:58:35,379 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 14:58:35,380 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2023-12-19 14:58:35,380 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 14:58:35,381 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2023-12-19 14:58:35,381 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 14:58:35,382 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2023-12-19 14:58:35,382 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 14:58:35,383 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 80 [2023-12-19 14:58:35,384 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 14:58:35,385 INFO L134 CoverageAnalysis]: Checked inductivity of 264 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 264 trivial. 0 not checked. [2023-12-19 14:58:35,385 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-19 14:58:35,385 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1715867707] [2023-12-19 14:58:35,385 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1715867707] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-19 14:58:35,385 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-19 14:58:35,385 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2023-12-19 14:58:35,385 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [641949301] [2023-12-19 14:58:35,385 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-19 14:58:35,386 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-12-19 14:58:35,386 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-19 14:58:35,386 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-12-19 14:58:35,386 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2023-12-19 14:58:35,386 INFO L87 Difference]: Start difference. First operand 372 states and 539 transitions. Second operand has 6 states, 6 states have (on average 9.333333333333334) internal successors, (56), 6 states have internal predecessors, (56), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) [2023-12-19 14:58:35,516 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-19 14:58:35,516 INFO L93 Difference]: Finished difference Result 999 states and 1447 transitions. [2023-12-19 14:58:35,516 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2023-12-19 14:58:35,516 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 9.333333333333334) internal successors, (56), 6 states have internal predecessors, (56), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) Word has length 113 [2023-12-19 14:58:35,517 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-19 14:58:35,520 INFO L225 Difference]: With dead ends: 999 [2023-12-19 14:58:35,520 INFO L226 Difference]: Without dead ends: 628 [2023-12-19 14:58:35,521 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 34 GetRequests, 26 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=32, Invalid=58, Unknown=0, NotChecked=0, Total=90 [2023-12-19 14:58:35,523 INFO L413 NwaCegarLoop]: 249 mSDtfsCounter, 221 mSDsluCounter, 821 mSDsCounter, 0 mSdLazyCounter, 143 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 221 SdHoareTripleChecker+Valid, 1070 SdHoareTripleChecker+Invalid, 145 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 143 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-12-19 14:58:35,523 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [221 Valid, 1070 Invalid, 145 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 143 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-12-19 14:58:35,524 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 628 states. [2023-12-19 14:58:35,546 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 628 to 584. [2023-12-19 14:58:35,547 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 584 states, 513 states have (on average 1.3996101364522417) internal successors, (718), 515 states have internal predecessors, (718), 64 states have call successors, (64), 6 states have call predecessors, (64), 6 states have return successors, (64), 62 states have call predecessors, (64), 64 states have call successors, (64) [2023-12-19 14:58:35,549 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 584 states to 584 states and 846 transitions. [2023-12-19 14:58:35,549 INFO L78 Accepts]: Start accepts. Automaton has 584 states and 846 transitions. Word has length 113 [2023-12-19 14:58:35,549 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-19 14:58:35,550 INFO L495 AbstractCegarLoop]: Abstraction has 584 states and 846 transitions. [2023-12-19 14:58:35,550 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 9.333333333333334) internal successors, (56), 6 states have internal predecessors, (56), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) [2023-12-19 14:58:35,550 INFO L276 IsEmpty]: Start isEmpty. Operand 584 states and 846 transitions. [2023-12-19 14:58:35,551 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 114 [2023-12-19 14:58:35,551 INFO L187 NwaCegarLoop]: Found error trace [2023-12-19 14:58:35,551 INFO L195 NwaCegarLoop]: trace histogram [12, 12, 12, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-19 14:58:35,551 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2023-12-19 14:58:35,551 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-19 14:58:35,551 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-19 14:58:35,551 INFO L85 PathProgramCache]: Analyzing trace with hash 1713590941, now seen corresponding path program 1 times [2023-12-19 14:58:35,551 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-19 14:58:35,551 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [747834562] [2023-12-19 14:58:35,551 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-19 14:58:35,551 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-19 14:58:35,612 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 14:58:35,943 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-12-19 14:58:35,944 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 14:58:35,947 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2023-12-19 14:58:35,947 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 14:58:35,952 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2023-12-19 14:58:35,953 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 14:58:35,955 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2023-12-19 14:58:35,955 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 14:58:35,956 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2023-12-19 14:58:35,957 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 14:58:35,959 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2023-12-19 14:58:35,959 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 14:58:35,960 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2023-12-19 14:58:35,961 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 14:58:35,962 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2023-12-19 14:58:35,962 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 14:58:35,963 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2023-12-19 14:58:35,964 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 14:58:35,965 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2023-12-19 14:58:35,965 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 14:58:35,966 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2023-12-19 14:58:35,966 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 14:58:35,967 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 80 [2023-12-19 14:58:35,968 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 14:58:35,969 INFO L134 CoverageAnalysis]: Checked inductivity of 264 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 264 trivial. 0 not checked. [2023-12-19 14:58:35,969 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-19 14:58:35,969 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [747834562] [2023-12-19 14:58:35,969 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [747834562] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-19 14:58:35,969 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-19 14:58:35,969 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2023-12-19 14:58:35,969 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [128602799] [2023-12-19 14:58:35,969 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-19 14:58:35,971 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-12-19 14:58:35,971 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-19 14:58:35,972 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-12-19 14:58:35,972 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2023-12-19 14:58:35,972 INFO L87 Difference]: Start difference. First operand 584 states and 846 transitions. Second operand has 6 states, 5 states have (on average 11.2) internal successors, (56), 6 states have internal predecessors, (56), 2 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 2 states have call successors, (12) [2023-12-19 14:58:36,088 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-19 14:58:36,088 INFO L93 Difference]: Finished difference Result 1561 states and 2241 transitions. [2023-12-19 14:58:36,089 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2023-12-19 14:58:36,089 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 11.2) internal successors, (56), 6 states have internal predecessors, (56), 2 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 2 states have call successors, (12) Word has length 113 [2023-12-19 14:58:36,089 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-19 14:58:36,093 INFO L225 Difference]: With dead ends: 1561 [2023-12-19 14:58:36,093 INFO L226 Difference]: Without dead ends: 978 [2023-12-19 14:58:36,094 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 32 GetRequests, 27 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2023-12-19 14:58:36,095 INFO L413 NwaCegarLoop]: 171 mSDtfsCounter, 145 mSDsluCounter, 618 mSDsCounter, 0 mSdLazyCounter, 105 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 146 SdHoareTripleChecker+Valid, 789 SdHoareTripleChecker+Invalid, 109 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 105 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-12-19 14:58:36,095 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [146 Valid, 789 Invalid, 109 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 105 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-12-19 14:58:36,096 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 978 states. [2023-12-19 14:58:36,123 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 978 to 900. [2023-12-19 14:58:36,124 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 900 states, 811 states have (on average 1.3958076448828607) internal successors, (1132), 819 states have internal predecessors, (1132), 76 states have call successors, (76), 12 states have call predecessors, (76), 12 states have return successors, (76), 68 states have call predecessors, (76), 76 states have call successors, (76) [2023-12-19 14:58:36,127 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 900 states to 900 states and 1284 transitions. [2023-12-19 14:58:36,127 INFO L78 Accepts]: Start accepts. Automaton has 900 states and 1284 transitions. Word has length 113 [2023-12-19 14:58:36,127 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-19 14:58:36,127 INFO L495 AbstractCegarLoop]: Abstraction has 900 states and 1284 transitions. [2023-12-19 14:58:36,128 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 11.2) internal successors, (56), 6 states have internal predecessors, (56), 2 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 2 states have call successors, (12) [2023-12-19 14:58:36,128 INFO L276 IsEmpty]: Start isEmpty. Operand 900 states and 1284 transitions. [2023-12-19 14:58:36,129 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 114 [2023-12-19 14:58:36,129 INFO L187 NwaCegarLoop]: Found error trace [2023-12-19 14:58:36,129 INFO L195 NwaCegarLoop]: trace histogram [12, 12, 12, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-19 14:58:36,129 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2023-12-19 14:58:36,129 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-19 14:58:36,130 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-19 14:58:36,130 INFO L85 PathProgramCache]: Analyzing trace with hash 480306248, now seen corresponding path program 1 times [2023-12-19 14:58:36,130 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-19 14:58:36,130 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1459713813] [2023-12-19 14:58:36,130 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-19 14:58:36,130 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-19 14:58:36,158 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 14:58:37,011 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-12-19 14:58:37,013 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 14:58:37,015 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2023-12-19 14:58:37,018 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 14:58:37,022 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2023-12-19 14:58:37,023 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 14:58:37,026 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2023-12-19 14:58:37,027 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 14:58:37,029 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2023-12-19 14:58:37,030 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 14:58:37,031 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2023-12-19 14:58:37,032 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 14:58:37,036 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2023-12-19 14:58:37,037 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 14:58:37,038 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2023-12-19 14:58:37,039 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 14:58:37,041 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2023-12-19 14:58:37,042 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 14:58:37,049 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2023-12-19 14:58:37,051 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 14:58:37,056 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2023-12-19 14:58:37,057 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 14:58:37,061 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 80 [2023-12-19 14:58:37,063 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 14:58:37,067 INFO L134 CoverageAnalysis]: Checked inductivity of 264 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 264 trivial. 0 not checked. [2023-12-19 14:58:37,067 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-19 14:58:37,067 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1459713813] [2023-12-19 14:58:37,067 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1459713813] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-19 14:58:37,067 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-19 14:58:37,067 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [15] imperfect sequences [] total 15 [2023-12-19 14:58:37,067 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1635182644] [2023-12-19 14:58:37,068 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-19 14:58:37,068 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 15 states [2023-12-19 14:58:37,068 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-19 14:58:37,068 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2023-12-19 14:58:37,068 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=35, Invalid=175, Unknown=0, NotChecked=0, Total=210 [2023-12-19 14:58:37,069 INFO L87 Difference]: Start difference. First operand 900 states and 1284 transitions. Second operand has 15 states, 14 states have (on average 4.0) internal successors, (56), 15 states have internal predecessors, (56), 3 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 2 states have call predecessors, (12), 3 states have call successors, (12) [2023-12-19 14:58:38,670 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-19 14:58:38,670 INFO L93 Difference]: Finished difference Result 2998 states and 4280 transitions. [2023-12-19 14:58:38,670 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 29 states. [2023-12-19 14:58:38,670 INFO L78 Accepts]: Start accepts. Automaton has has 15 states, 14 states have (on average 4.0) internal successors, (56), 15 states have internal predecessors, (56), 3 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 2 states have call predecessors, (12), 3 states have call successors, (12) Word has length 113 [2023-12-19 14:58:38,670 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-19 14:58:38,678 INFO L225 Difference]: With dead ends: 2998 [2023-12-19 14:58:38,678 INFO L226 Difference]: Without dead ends: 2539 [2023-12-19 14:58:38,680 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 67 GetRequests, 31 SyntacticMatches, 0 SemanticMatches, 36 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 297 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=267, Invalid=1139, Unknown=0, NotChecked=0, Total=1406 [2023-12-19 14:58:38,680 INFO L413 NwaCegarLoop]: 316 mSDtfsCounter, 1121 mSDsluCounter, 2855 mSDsCounter, 0 mSdLazyCounter, 1528 mSolverCounterSat, 138 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1121 SdHoareTripleChecker+Valid, 3171 SdHoareTripleChecker+Invalid, 1666 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 138 IncrementalHoareTripleChecker+Valid, 1528 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.0s IncrementalHoareTripleChecker+Time [2023-12-19 14:58:38,681 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [1121 Valid, 3171 Invalid, 1666 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [138 Valid, 1528 Invalid, 0 Unknown, 0 Unchecked, 1.0s Time] [2023-12-19 14:58:38,682 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2539 states. [2023-12-19 14:58:38,761 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2539 to 1965. [2023-12-19 14:58:38,763 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1965 states, 1753 states have (on average 1.3953223046206502) internal successors, (2446), 1771 states have internal predecessors, (2446), 182 states have call successors, (182), 29 states have call predecessors, (182), 29 states have return successors, (182), 164 states have call predecessors, (182), 182 states have call successors, (182) [2023-12-19 14:58:38,768 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1965 states to 1965 states and 2810 transitions. [2023-12-19 14:58:38,769 INFO L78 Accepts]: Start accepts. Automaton has 1965 states and 2810 transitions. Word has length 113 [2023-12-19 14:58:38,769 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-19 14:58:38,769 INFO L495 AbstractCegarLoop]: Abstraction has 1965 states and 2810 transitions. [2023-12-19 14:58:38,769 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 15 states, 14 states have (on average 4.0) internal successors, (56), 15 states have internal predecessors, (56), 3 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 2 states have call predecessors, (12), 3 states have call successors, (12) [2023-12-19 14:58:38,769 INFO L276 IsEmpty]: Start isEmpty. Operand 1965 states and 2810 transitions. [2023-12-19 14:58:38,771 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 114 [2023-12-19 14:58:38,771 INFO L187 NwaCegarLoop]: Found error trace [2023-12-19 14:58:38,771 INFO L195 NwaCegarLoop]: trace histogram [12, 12, 12, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-19 14:58:38,771 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2023-12-19 14:58:38,771 INFO L420 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-19 14:58:38,771 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-19 14:58:38,771 INFO L85 PathProgramCache]: Analyzing trace with hash 699160966, now seen corresponding path program 1 times [2023-12-19 14:58:38,771 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-19 14:58:38,771 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2083039409] [2023-12-19 14:58:38,772 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-19 14:58:38,772 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-19 14:58:38,825 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 14:58:39,008 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-12-19 14:58:39,009 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 14:58:39,010 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2023-12-19 14:58:39,010 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 14:58:39,011 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2023-12-19 14:58:39,011 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 14:58:39,012 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2023-12-19 14:58:39,012 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 14:58:39,013 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2023-12-19 14:58:39,013 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 14:58:39,014 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2023-12-19 14:58:39,014 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 14:58:39,015 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2023-12-19 14:58:39,015 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 14:58:39,016 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2023-12-19 14:58:39,016 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 14:58:39,017 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2023-12-19 14:58:39,017 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 14:58:39,018 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2023-12-19 14:58:39,018 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 14:58:39,019 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2023-12-19 14:58:39,019 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 14:58:39,020 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 80 [2023-12-19 14:58:39,020 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 14:58:39,021 INFO L134 CoverageAnalysis]: Checked inductivity of 264 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 264 trivial. 0 not checked. [2023-12-19 14:58:39,021 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-19 14:58:39,021 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2083039409] [2023-12-19 14:58:39,021 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2083039409] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-19 14:58:39,021 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-19 14:58:39,021 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2023-12-19 14:58:39,022 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [564034874] [2023-12-19 14:58:39,022 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-19 14:58:39,022 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-12-19 14:58:39,022 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-19 14:58:39,022 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-12-19 14:58:39,022 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2023-12-19 14:58:39,022 INFO L87 Difference]: Start difference. First operand 1965 states and 2810 transitions. Second operand has 6 states, 5 states have (on average 11.2) internal successors, (56), 6 states have internal predecessors, (56), 2 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 2 states have call successors, (12) [2023-12-19 14:58:39,116 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-19 14:58:39,117 INFO L93 Difference]: Finished difference Result 2460 states and 3491 transitions. [2023-12-19 14:58:39,117 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-12-19 14:58:39,117 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 11.2) internal successors, (56), 6 states have internal predecessors, (56), 2 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 2 states have call successors, (12) Word has length 113 [2023-12-19 14:58:39,117 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-19 14:58:39,121 INFO L225 Difference]: With dead ends: 2460 [2023-12-19 14:58:39,121 INFO L226 Difference]: Without dead ends: 1139 [2023-12-19 14:58:39,123 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 32 GetRequests, 27 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2023-12-19 14:58:39,124 INFO L413 NwaCegarLoop]: 210 mSDtfsCounter, 150 mSDsluCounter, 528 mSDsCounter, 0 mSdLazyCounter, 90 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 151 SdHoareTripleChecker+Valid, 738 SdHoareTripleChecker+Invalid, 96 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 90 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-12-19 14:58:39,124 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [151 Valid, 738 Invalid, 96 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 90 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-12-19 14:58:39,125 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1139 states. [2023-12-19 14:58:39,161 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1139 to 897. [2023-12-19 14:58:39,163 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 897 states, 790 states have (on average 1.3810126582278481) internal successors, (1091), 794 states have internal predecessors, (1091), 88 states have call successors, (88), 18 states have call predecessors, (88), 18 states have return successors, (88), 84 states have call predecessors, (88), 88 states have call successors, (88) [2023-12-19 14:58:39,165 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 897 states to 897 states and 1267 transitions. [2023-12-19 14:58:39,165 INFO L78 Accepts]: Start accepts. Automaton has 897 states and 1267 transitions. Word has length 113 [2023-12-19 14:58:39,165 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-19 14:58:39,166 INFO L495 AbstractCegarLoop]: Abstraction has 897 states and 1267 transitions. [2023-12-19 14:58:39,166 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 11.2) internal successors, (56), 6 states have internal predecessors, (56), 2 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 2 states have call successors, (12) [2023-12-19 14:58:39,166 INFO L276 IsEmpty]: Start isEmpty. Operand 897 states and 1267 transitions. [2023-12-19 14:58:39,167 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 115 [2023-12-19 14:58:39,167 INFO L187 NwaCegarLoop]: Found error trace [2023-12-19 14:58:39,167 INFO L195 NwaCegarLoop]: trace histogram [12, 12, 12, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-19 14:58:39,167 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2023-12-19 14:58:39,168 INFO L420 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-19 14:58:39,168 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-19 14:58:39,168 INFO L85 PathProgramCache]: Analyzing trace with hash 536390063, now seen corresponding path program 1 times [2023-12-19 14:58:39,168 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-19 14:58:39,168 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [90354438] [2023-12-19 14:58:39,168 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-19 14:58:39,168 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-19 14:58:39,196 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 14:58:39,469 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-12-19 14:58:39,470 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 14:58:39,472 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2023-12-19 14:58:39,473 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 14:58:39,475 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2023-12-19 14:58:39,476 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 14:58:39,478 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2023-12-19 14:58:39,479 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 14:58:39,480 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2023-12-19 14:58:39,481 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 14:58:39,482 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2023-12-19 14:58:39,483 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 14:58:39,486 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2023-12-19 14:58:39,487 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 14:58:39,488 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2023-12-19 14:58:39,489 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 14:58:39,491 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2023-12-19 14:58:39,492 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 14:58:39,494 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2023-12-19 14:58:39,501 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 14:58:39,503 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2023-12-19 14:58:39,505 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 14:58:39,506 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 80 [2023-12-19 14:58:39,507 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 14:58:39,509 INFO L134 CoverageAnalysis]: Checked inductivity of 264 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 264 trivial. 0 not checked. [2023-12-19 14:58:39,509 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-19 14:58:39,509 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [90354438] [2023-12-19 14:58:39,509 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [90354438] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-19 14:58:39,509 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-19 14:58:39,509 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2023-12-19 14:58:39,509 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1640491977] [2023-12-19 14:58:39,509 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-19 14:58:39,510 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2023-12-19 14:58:39,510 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-19 14:58:39,510 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2023-12-19 14:58:39,510 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2023-12-19 14:58:39,510 INFO L87 Difference]: Start difference. First operand 897 states and 1267 transitions. Second operand has 8 states, 8 states have (on average 7.125) internal successors, (57), 8 states have internal predecessors, (57), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) [2023-12-19 14:58:39,823 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-19 14:58:39,823 INFO L93 Difference]: Finished difference Result 2178 states and 3072 transitions. [2023-12-19 14:58:39,823 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2023-12-19 14:58:39,824 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 7.125) internal successors, (57), 8 states have internal predecessors, (57), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) Word has length 114 [2023-12-19 14:58:39,824 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-19 14:58:39,828 INFO L225 Difference]: With dead ends: 2178 [2023-12-19 14:58:39,828 INFO L226 Difference]: Without dead ends: 1282 [2023-12-19 14:58:39,829 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 39 GetRequests, 27 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 21 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=53, Invalid=129, Unknown=0, NotChecked=0, Total=182 [2023-12-19 14:58:39,830 INFO L413 NwaCegarLoop]: 280 mSDtfsCounter, 435 mSDsluCounter, 780 mSDsCounter, 0 mSdLazyCounter, 251 mSolverCounterSat, 40 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 435 SdHoareTripleChecker+Valid, 1060 SdHoareTripleChecker+Invalid, 291 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 40 IncrementalHoareTripleChecker+Valid, 251 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2023-12-19 14:58:39,830 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [435 Valid, 1060 Invalid, 291 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [40 Valid, 251 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2023-12-19 14:58:39,831 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1282 states. [2023-12-19 14:58:39,879 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1282 to 925. [2023-12-19 14:58:39,880 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 925 states, 818 states have (on average 1.3777506112469438) internal successors, (1127), 822 states have internal predecessors, (1127), 88 states have call successors, (88), 18 states have call predecessors, (88), 18 states have return successors, (88), 84 states have call predecessors, (88), 88 states have call successors, (88) [2023-12-19 14:58:39,883 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 925 states to 925 states and 1303 transitions. [2023-12-19 14:58:39,883 INFO L78 Accepts]: Start accepts. Automaton has 925 states and 1303 transitions. Word has length 114 [2023-12-19 14:58:39,883 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-19 14:58:39,883 INFO L495 AbstractCegarLoop]: Abstraction has 925 states and 1303 transitions. [2023-12-19 14:58:39,883 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 7.125) internal successors, (57), 8 states have internal predecessors, (57), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) [2023-12-19 14:58:39,883 INFO L276 IsEmpty]: Start isEmpty. Operand 925 states and 1303 transitions. [2023-12-19 14:58:39,884 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 115 [2023-12-19 14:58:39,884 INFO L187 NwaCegarLoop]: Found error trace [2023-12-19 14:58:39,885 INFO L195 NwaCegarLoop]: trace histogram [12, 12, 12, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-19 14:58:39,885 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2023-12-19 14:58:39,885 INFO L420 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-19 14:58:39,885 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-19 14:58:39,885 INFO L85 PathProgramCache]: Analyzing trace with hash -348434595, now seen corresponding path program 1 times [2023-12-19 14:58:39,885 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-19 14:58:39,885 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1175328150] [2023-12-19 14:58:39,885 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-19 14:58:39,885 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-19 14:58:39,914 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 14:58:40,117 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-12-19 14:58:40,118 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 14:58:40,118 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2023-12-19 14:58:40,119 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 14:58:40,120 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2023-12-19 14:58:40,120 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 14:58:40,120 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2023-12-19 14:58:40,121 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 14:58:40,121 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2023-12-19 14:58:40,122 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 14:58:40,122 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2023-12-19 14:58:40,123 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 14:58:40,123 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2023-12-19 14:58:40,124 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 14:58:40,124 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2023-12-19 14:58:40,125 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 14:58:40,125 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2023-12-19 14:58:40,126 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 14:58:40,126 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2023-12-19 14:58:40,127 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 14:58:40,127 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2023-12-19 14:58:40,128 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 14:58:40,129 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 80 [2023-12-19 14:58:40,129 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 14:58:40,130 INFO L134 CoverageAnalysis]: Checked inductivity of 264 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 264 trivial. 0 not checked. [2023-12-19 14:58:40,130 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-19 14:58:40,130 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1175328150] [2023-12-19 14:58:40,130 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1175328150] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-19 14:58:40,130 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-19 14:58:40,130 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2023-12-19 14:58:40,130 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1006408425] [2023-12-19 14:58:40,130 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-19 14:58:40,131 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-12-19 14:58:40,131 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-19 14:58:40,131 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-12-19 14:58:40,131 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2023-12-19 14:58:40,131 INFO L87 Difference]: Start difference. First operand 925 states and 1303 transitions. Second operand has 6 states, 5 states have (on average 11.4) internal successors, (57), 6 states have internal predecessors, (57), 2 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 2 states have call successors, (12) [2023-12-19 14:58:40,247 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-19 14:58:40,247 INFO L93 Difference]: Finished difference Result 2095 states and 2930 transitions. [2023-12-19 14:58:40,247 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2023-12-19 14:58:40,248 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 11.4) internal successors, (57), 6 states have internal predecessors, (57), 2 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 2 states have call successors, (12) Word has length 114 [2023-12-19 14:58:40,248 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-19 14:58:40,251 INFO L225 Difference]: With dead ends: 2095 [2023-12-19 14:58:40,251 INFO L226 Difference]: Without dead ends: 1171 [2023-12-19 14:58:40,253 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 32 GetRequests, 27 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2023-12-19 14:58:40,253 INFO L413 NwaCegarLoop]: 135 mSDtfsCounter, 73 mSDsluCounter, 515 mSDsCounter, 0 mSdLazyCounter, 98 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 74 SdHoareTripleChecker+Valid, 650 SdHoareTripleChecker+Invalid, 101 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 98 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-12-19 14:58:40,253 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [74 Valid, 650 Invalid, 101 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 98 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-12-19 14:58:40,254 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1171 states. [2023-12-19 14:58:40,305 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1171 to 923. [2023-12-19 14:58:40,306 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 923 states, 816 states have (on average 1.3713235294117647) internal successors, (1119), 820 states have internal predecessors, (1119), 88 states have call successors, (88), 18 states have call predecessors, (88), 18 states have return successors, (88), 84 states have call predecessors, (88), 88 states have call successors, (88) [2023-12-19 14:58:40,308 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 923 states to 923 states and 1295 transitions. [2023-12-19 14:58:40,309 INFO L78 Accepts]: Start accepts. Automaton has 923 states and 1295 transitions. Word has length 114 [2023-12-19 14:58:40,309 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-19 14:58:40,309 INFO L495 AbstractCegarLoop]: Abstraction has 923 states and 1295 transitions. [2023-12-19 14:58:40,309 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 11.4) internal successors, (57), 6 states have internal predecessors, (57), 2 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 2 states have call successors, (12) [2023-12-19 14:58:40,309 INFO L276 IsEmpty]: Start isEmpty. Operand 923 states and 1295 transitions. [2023-12-19 14:58:40,310 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 116 [2023-12-19 14:58:40,310 INFO L187 NwaCegarLoop]: Found error trace [2023-12-19 14:58:40,310 INFO L195 NwaCegarLoop]: trace histogram [12, 12, 12, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-19 14:58:40,310 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2023-12-19 14:58:40,310 INFO L420 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-19 14:58:40,311 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-19 14:58:40,311 INFO L85 PathProgramCache]: Analyzing trace with hash -74891543, now seen corresponding path program 1 times [2023-12-19 14:58:40,311 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-19 14:58:40,311 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [126924056] [2023-12-19 14:58:40,311 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-19 14:58:40,311 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-19 14:58:40,338 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 14:58:40,528 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-12-19 14:58:40,529 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 14:58:40,530 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2023-12-19 14:58:40,531 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 14:58:40,532 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2023-12-19 14:58:40,533 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 14:58:40,533 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2023-12-19 14:58:40,534 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 14:58:40,534 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2023-12-19 14:58:40,535 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 14:58:40,535 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2023-12-19 14:58:40,536 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 14:58:40,536 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2023-12-19 14:58:40,537 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 14:58:40,537 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2023-12-19 14:58:40,538 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 14:58:40,541 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2023-12-19 14:58:40,542 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 14:58:40,545 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2023-12-19 14:58:40,546 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 14:58:40,546 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2023-12-19 14:58:40,547 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 14:58:40,547 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 80 [2023-12-19 14:58:40,548 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 14:58:40,549 INFO L134 CoverageAnalysis]: Checked inductivity of 264 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 264 trivial. 0 not checked. [2023-12-19 14:58:40,549 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-19 14:58:40,549 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [126924056] [2023-12-19 14:58:40,550 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [126924056] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-19 14:58:40,550 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-19 14:58:40,550 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2023-12-19 14:58:40,550 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1356796780] [2023-12-19 14:58:40,550 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-19 14:58:40,550 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-12-19 14:58:40,550 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-19 14:58:40,550 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-12-19 14:58:40,551 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2023-12-19 14:58:40,551 INFO L87 Difference]: Start difference. First operand 923 states and 1295 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, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 2 states have call successors, (12) [2023-12-19 14:58:40,679 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-19 14:58:40,679 INFO L93 Difference]: Finished difference Result 1934 states and 2704 transitions. [2023-12-19 14:58:40,680 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-12-19 14:58:40,680 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, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 2 states have call successors, (12) Word has length 115 [2023-12-19 14:58:40,680 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-19 14:58:40,683 INFO L225 Difference]: With dead ends: 1934 [2023-12-19 14:58:40,683 INFO L226 Difference]: Without dead ends: 1012 [2023-12-19 14:58:40,685 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 32 GetRequests, 27 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2023-12-19 14:58:40,685 INFO L413 NwaCegarLoop]: 197 mSDtfsCounter, 75 mSDsluCounter, 690 mSDsCounter, 0 mSdLazyCounter, 110 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 76 SdHoareTripleChecker+Valid, 887 SdHoareTripleChecker+Invalid, 112 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 110 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-12-19 14:58:40,685 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [76 Valid, 887 Invalid, 112 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 110 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-12-19 14:58:40,686 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1012 states. [2023-12-19 14:58:40,728 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1012 to 873. [2023-12-19 14:58:40,729 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 873 states, 766 states have (on average 1.3694516971279374) internal successors, (1049), 770 states have internal predecessors, (1049), 88 states have call successors, (88), 18 states have call predecessors, (88), 18 states have return successors, (88), 84 states have call predecessors, (88), 88 states have call successors, (88) [2023-12-19 14:58:40,731 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 873 states to 873 states and 1225 transitions. [2023-12-19 14:58:40,731 INFO L78 Accepts]: Start accepts. Automaton has 873 states and 1225 transitions. Word has length 115 [2023-12-19 14:58:40,731 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-19 14:58:40,731 INFO L495 AbstractCegarLoop]: Abstraction has 873 states and 1225 transitions. [2023-12-19 14:58:40,732 INFO L496 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, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 2 states have call successors, (12) [2023-12-19 14:58:40,732 INFO L276 IsEmpty]: Start isEmpty. Operand 873 states and 1225 transitions. [2023-12-19 14:58:40,733 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 116 [2023-12-19 14:58:40,733 INFO L187 NwaCegarLoop]: Found error trace [2023-12-19 14:58:40,733 INFO L195 NwaCegarLoop]: trace histogram [12, 12, 12, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-19 14:58:40,733 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2023-12-19 14:58:40,733 INFO L420 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-19 14:58:40,733 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-19 14:58:40,733 INFO L85 PathProgramCache]: Analyzing trace with hash 149492180, now seen corresponding path program 1 times [2023-12-19 14:58:40,733 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-19 14:58:40,733 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1596461202] [2023-12-19 14:58:40,733 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-19 14:58:40,734 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-19 14:58:40,757 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 14:58:40,949 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-12-19 14:58:40,950 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 14:58:40,951 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2023-12-19 14:58:40,952 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 14:58:40,953 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2023-12-19 14:58:40,953 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 14:58:40,954 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2023-12-19 14:58:40,955 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 14:58:40,956 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2023-12-19 14:58:40,956 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 14:58:40,957 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2023-12-19 14:58:40,957 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 14:58:40,958 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2023-12-19 14:58:40,958 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 14:58:40,959 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2023-12-19 14:58:40,960 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 14:58:40,960 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2023-12-19 14:58:40,961 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 14:58:40,961 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2023-12-19 14:58:40,962 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 14:58:40,963 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2023-12-19 14:58:40,964 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 14:58:40,965 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 80 [2023-12-19 14:58:40,965 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 14:58:40,966 INFO L134 CoverageAnalysis]: Checked inductivity of 264 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 264 trivial. 0 not checked. [2023-12-19 14:58:40,966 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-19 14:58:40,966 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1596461202] [2023-12-19 14:58:40,966 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1596461202] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-19 14:58:40,966 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-19 14:58:40,967 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2023-12-19 14:58:40,967 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1205749932] [2023-12-19 14:58:40,967 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-19 14:58:40,967 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-12-19 14:58:40,967 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-19 14:58:40,968 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-12-19 14:58:40,968 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2023-12-19 14:58:40,968 INFO L87 Difference]: Start difference. First operand 873 states and 1225 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, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 2 states have call successors, (12) [2023-12-19 14:58:41,093 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-19 14:58:41,093 INFO L93 Difference]: Finished difference Result 1874 states and 2620 transitions. [2023-12-19 14:58:41,093 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-12-19 14:58:41,094 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, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 2 states have call successors, (12) Word has length 115 [2023-12-19 14:58:41,094 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-19 14:58:41,098 INFO L225 Difference]: With dead ends: 1874 [2023-12-19 14:58:41,098 INFO L226 Difference]: Without dead ends: 1002 [2023-12-19 14:58:41,100 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 32 GetRequests, 27 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2023-12-19 14:58:41,100 INFO L413 NwaCegarLoop]: 146 mSDtfsCounter, 74 mSDsluCounter, 530 mSDsCounter, 0 mSdLazyCounter, 98 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 75 SdHoareTripleChecker+Valid, 676 SdHoareTripleChecker+Invalid, 99 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 98 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-12-19 14:58:41,100 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [75 Valid, 676 Invalid, 99 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 98 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-12-19 14:58:41,101 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1002 states. [2023-12-19 14:58:41,146 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1002 to 871. [2023-12-19 14:58:41,148 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 871 states, 764 states have (on average 1.362565445026178) internal successors, (1041), 768 states have internal predecessors, (1041), 88 states have call successors, (88), 18 states have call predecessors, (88), 18 states have return successors, (88), 84 states have call predecessors, (88), 88 states have call successors, (88) [2023-12-19 14:58:41,149 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 871 states to 871 states and 1217 transitions. [2023-12-19 14:58:41,150 INFO L78 Accepts]: Start accepts. Automaton has 871 states and 1217 transitions. Word has length 115 [2023-12-19 14:58:41,150 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-19 14:58:41,150 INFO L495 AbstractCegarLoop]: Abstraction has 871 states and 1217 transitions. [2023-12-19 14:58:41,150 INFO L496 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, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 2 states have call successors, (12) [2023-12-19 14:58:41,150 INFO L276 IsEmpty]: Start isEmpty. Operand 871 states and 1217 transitions. [2023-12-19 14:58:41,151 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 116 [2023-12-19 14:58:41,151 INFO L187 NwaCegarLoop]: Found error trace [2023-12-19 14:58:41,151 INFO L195 NwaCegarLoop]: trace histogram [12, 12, 12, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-19 14:58:41,151 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2023-12-19 14:58:41,151 INFO L420 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-19 14:58:41,152 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-19 14:58:41,152 INFO L85 PathProgramCache]: Analyzing trace with hash -1655946154, now seen corresponding path program 1 times [2023-12-19 14:58:41,152 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-19 14:58:41,152 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1927123471] [2023-12-19 14:58:41,152 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-19 14:58:41,152 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-19 14:58:41,187 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 14:58:41,374 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-12-19 14:58:41,375 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 14:58:41,375 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2023-12-19 14:58:41,376 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 14:58:41,377 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2023-12-19 14:58:41,377 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 14:58:41,378 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2023-12-19 14:58:41,378 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 14:58:41,379 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2023-12-19 14:58:41,380 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 14:58:41,380 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2023-12-19 14:58:41,381 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 14:58:41,382 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2023-12-19 14:58:41,382 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 14:58:41,383 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2023-12-19 14:58:41,383 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 14:58:41,383 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2023-12-19 14:58:41,384 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 14:58:41,384 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2023-12-19 14:58:41,385 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 14:58:41,385 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2023-12-19 14:58:41,386 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 14:58:41,386 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 80 [2023-12-19 14:58:41,387 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 14:58:41,388 INFO L134 CoverageAnalysis]: Checked inductivity of 264 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 264 trivial. 0 not checked. [2023-12-19 14:58:41,388 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-19 14:58:41,388 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1927123471] [2023-12-19 14:58:41,388 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1927123471] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-19 14:58:41,388 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-19 14:58:41,388 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2023-12-19 14:58:41,388 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1958299373] [2023-12-19 14:58:41,388 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-19 14:58:41,388 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-12-19 14:58:41,388 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-19 14:58:41,389 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-12-19 14:58:41,389 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2023-12-19 14:58:41,389 INFO L87 Difference]: Start difference. First operand 871 states and 1217 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, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 2 states have call successors, (12) [2023-12-19 14:58:41,512 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-19 14:58:41,512 INFO L93 Difference]: Finished difference Result 1936 states and 2699 transitions. [2023-12-19 14:58:41,512 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-12-19 14:58:41,513 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, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 2 states have call successors, (12) Word has length 115 [2023-12-19 14:58:41,513 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-19 14:58:41,517 INFO L225 Difference]: With dead ends: 1936 [2023-12-19 14:58:41,517 INFO L226 Difference]: Without dead ends: 1066 [2023-12-19 14:58:41,519 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 32 GetRequests, 27 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2023-12-19 14:58:41,519 INFO L413 NwaCegarLoop]: 176 mSDtfsCounter, 97 mSDsluCounter, 560 mSDsCounter, 0 mSdLazyCounter, 104 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 98 SdHoareTripleChecker+Valid, 736 SdHoareTripleChecker+Invalid, 106 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 104 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-12-19 14:58:41,519 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [98 Valid, 736 Invalid, 106 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 104 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-12-19 14:58:41,520 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1066 states. [2023-12-19 14:58:41,584 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1066 to 871. [2023-12-19 14:58:41,585 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 871 states, 764 states have (on average 1.3494764397905759) internal successors, (1031), 768 states have internal predecessors, (1031), 88 states have call successors, (88), 18 states have call predecessors, (88), 18 states have return successors, (88), 84 states have call predecessors, (88), 88 states have call successors, (88) [2023-12-19 14:58:41,586 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 871 states to 871 states and 1207 transitions. [2023-12-19 14:58:41,587 INFO L78 Accepts]: Start accepts. Automaton has 871 states and 1207 transitions. Word has length 115 [2023-12-19 14:58:41,587 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-19 14:58:41,587 INFO L495 AbstractCegarLoop]: Abstraction has 871 states and 1207 transitions. [2023-12-19 14:58:41,587 INFO L496 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, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 2 states have call successors, (12) [2023-12-19 14:58:41,587 INFO L276 IsEmpty]: Start isEmpty. Operand 871 states and 1207 transitions. [2023-12-19 14:58:41,588 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 116 [2023-12-19 14:58:41,588 INFO L187 NwaCegarLoop]: Found error trace [2023-12-19 14:58:41,588 INFO L195 NwaCegarLoop]: trace histogram [12, 12, 12, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-19 14:58:41,588 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2023-12-19 14:58:41,588 INFO L420 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-19 14:58:41,589 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-19 14:58:41,589 INFO L85 PathProgramCache]: Analyzing trace with hash 1359157464, now seen corresponding path program 1 times [2023-12-19 14:58:41,589 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-19 14:58:41,589 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1922312101] [2023-12-19 14:58:41,589 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-19 14:58:41,589 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-19 14:58:41,614 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 14:58:41,858 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-12-19 14:58:41,860 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 14:58:41,861 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2023-12-19 14:58:41,862 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 14:58:41,863 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2023-12-19 14:58:41,863 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 14:58:41,865 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2023-12-19 14:58:41,866 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 14:58:41,867 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2023-12-19 14:58:41,868 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 14:58:41,869 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2023-12-19 14:58:41,870 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 14:58:41,871 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2023-12-19 14:58:41,871 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 14:58:41,873 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2023-12-19 14:58:41,873 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 14:58:41,874 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2023-12-19 14:58:41,875 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 14:58:41,876 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2023-12-19 14:58:41,877 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 14:58:41,878 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2023-12-19 14:58:41,879 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 14:58:41,881 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 80 [2023-12-19 14:58:41,881 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 14:58:41,883 INFO L134 CoverageAnalysis]: Checked inductivity of 264 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 264 trivial. 0 not checked. [2023-12-19 14:58:41,883 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-19 14:58:41,883 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1922312101] [2023-12-19 14:58:41,884 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1922312101] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-19 14:58:41,884 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-19 14:58:41,884 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2023-12-19 14:58:41,884 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [296962589] [2023-12-19 14:58:41,884 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-19 14:58:41,884 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2023-12-19 14:58:41,884 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-19 14:58:41,885 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2023-12-19 14:58:41,885 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=38, Unknown=0, NotChecked=0, Total=56 [2023-12-19 14:58:41,885 INFO L87 Difference]: Start difference. First operand 871 states and 1207 transitions. Second operand has 8 states, 8 states have (on average 7.25) internal successors, (58), 8 states have internal predecessors, (58), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) [2023-12-19 14:58:42,227 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-19 14:58:42,227 INFO L93 Difference]: Finished difference Result 1673 states and 2312 transitions. [2023-12-19 14:58:42,227 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2023-12-19 14:58:42,227 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 7.25) internal successors, (58), 8 states have internal predecessors, (58), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) Word has length 115 [2023-12-19 14:58:42,228 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-19 14:58:42,230 INFO L225 Difference]: With dead ends: 1673 [2023-12-19 14:58:42,230 INFO L226 Difference]: Without dead ends: 781 [2023-12-19 14:58:42,232 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 37 GetRequests, 26 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 11 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=50, Invalid=106, Unknown=0, NotChecked=0, Total=156 [2023-12-19 14:58:42,232 INFO L413 NwaCegarLoop]: 221 mSDtfsCounter, 389 mSDsluCounter, 771 mSDsCounter, 0 mSdLazyCounter, 307 mSolverCounterSat, 38 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 389 SdHoareTripleChecker+Valid, 992 SdHoareTripleChecker+Invalid, 345 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 38 IncrementalHoareTripleChecker+Valid, 307 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2023-12-19 14:58:42,232 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [389 Valid, 992 Invalid, 345 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [38 Valid, 307 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2023-12-19 14:58:42,233 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 781 states. [2023-12-19 14:58:42,268 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 781 to 751. [2023-12-19 14:58:42,269 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 751 states, 659 states have (on average 1.3490136570561457) internal successors, (889), 662 states have internal predecessors, (889), 76 states have call successors, (76), 15 states have call predecessors, (76), 15 states have return successors, (76), 73 states have call predecessors, (76), 76 states have call successors, (76) [2023-12-19 14:58:42,272 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 751 states to 751 states and 1041 transitions. [2023-12-19 14:58:42,272 INFO L78 Accepts]: Start accepts. Automaton has 751 states and 1041 transitions. Word has length 115 [2023-12-19 14:58:42,272 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-19 14:58:42,272 INFO L495 AbstractCegarLoop]: Abstraction has 751 states and 1041 transitions. [2023-12-19 14:58:42,272 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 7.25) internal successors, (58), 8 states have internal predecessors, (58), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) [2023-12-19 14:58:42,273 INFO L276 IsEmpty]: Start isEmpty. Operand 751 states and 1041 transitions. [2023-12-19 14:58:42,274 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 116 [2023-12-19 14:58:42,274 INFO L187 NwaCegarLoop]: Found error trace [2023-12-19 14:58:42,274 INFO L195 NwaCegarLoop]: trace histogram [12, 12, 12, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-19 14:58:42,274 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2023-12-19 14:58:42,274 INFO L420 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-19 14:58:42,275 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-19 14:58:42,275 INFO L85 PathProgramCache]: Analyzing trace with hash 849684374, now seen corresponding path program 1 times [2023-12-19 14:58:42,275 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-19 14:58:42,275 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [107033106] [2023-12-19 14:58:42,275 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-19 14:58:42,275 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-19 14:58:42,311 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 14:58:42,514 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-12-19 14:58:42,515 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 14:58:42,517 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2023-12-19 14:58:42,517 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 14:58:42,518 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2023-12-19 14:58:42,519 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 14:58:42,520 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2023-12-19 14:58:42,521 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 14:58:42,522 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2023-12-19 14:58:42,523 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 14:58:42,524 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2023-12-19 14:58:42,525 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 14:58:42,526 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2023-12-19 14:58:42,526 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 14:58:42,527 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2023-12-19 14:58:42,528 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 14:58:42,529 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2023-12-19 14:58:42,530 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 14:58:42,531 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2023-12-19 14:58:42,531 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 14:58:42,533 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2023-12-19 14:58:42,533 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 14:58:42,535 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 80 [2023-12-19 14:58:42,535 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 14:58:42,537 INFO L134 CoverageAnalysis]: Checked inductivity of 264 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 264 trivial. 0 not checked. [2023-12-19 14:58:42,537 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-19 14:58:42,537 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [107033106] [2023-12-19 14:58:42,537 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [107033106] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-19 14:58:42,537 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-19 14:58:42,537 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2023-12-19 14:58:42,537 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2019926063] [2023-12-19 14:58:42,537 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-19 14:58:42,538 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2023-12-19 14:58:42,538 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-19 14:58:42,538 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2023-12-19 14:58:42,538 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2023-12-19 14:58:42,538 INFO L87 Difference]: Start difference. First operand 751 states and 1041 transitions. Second operand has 8 states, 8 states have (on average 7.25) internal successors, (58), 8 states have internal predecessors, (58), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) [2023-12-19 14:58:42,846 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-19 14:58:42,846 INFO L93 Difference]: Finished difference Result 1661 states and 2299 transitions. [2023-12-19 14:58:42,847 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2023-12-19 14:58:42,847 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 7.25) internal successors, (58), 8 states have internal predecessors, (58), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) Word has length 115 [2023-12-19 14:58:42,847 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-19 14:58:42,850 INFO L225 Difference]: With dead ends: 1661 [2023-12-19 14:58:42,850 INFO L226 Difference]: Without dead ends: 911 [2023-12-19 14:58:42,851 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 38 GetRequests, 27 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 14 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=47, Invalid=109, Unknown=0, NotChecked=0, Total=156 [2023-12-19 14:58:42,852 INFO L413 NwaCegarLoop]: 174 mSDtfsCounter, 311 mSDsluCounter, 804 mSDsCounter, 0 mSdLazyCounter, 210 mSolverCounterSat, 39 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 311 SdHoareTripleChecker+Valid, 978 SdHoareTripleChecker+Invalid, 249 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 39 IncrementalHoareTripleChecker+Valid, 210 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2023-12-19 14:58:42,852 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [311 Valid, 978 Invalid, 249 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [39 Valid, 210 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2023-12-19 14:58:42,853 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 911 states. [2023-12-19 14:58:42,888 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 911 to 751. [2023-12-19 14:58:42,890 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 751 states, 659 states have (on average 1.347496206373293) internal successors, (888), 662 states have internal predecessors, (888), 76 states have call successors, (76), 15 states have call predecessors, (76), 15 states have return successors, (76), 73 states have call predecessors, (76), 76 states have call successors, (76) [2023-12-19 14:58:42,891 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 751 states to 751 states and 1040 transitions. [2023-12-19 14:58:42,891 INFO L78 Accepts]: Start accepts. Automaton has 751 states and 1040 transitions. Word has length 115 [2023-12-19 14:58:42,892 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-19 14:58:42,892 INFO L495 AbstractCegarLoop]: Abstraction has 751 states and 1040 transitions. [2023-12-19 14:58:42,892 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 7.25) internal successors, (58), 8 states have internal predecessors, (58), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) [2023-12-19 14:58:42,892 INFO L276 IsEmpty]: Start isEmpty. Operand 751 states and 1040 transitions. [2023-12-19 14:58:42,893 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 117 [2023-12-19 14:58:42,893 INFO L187 NwaCegarLoop]: Found error trace [2023-12-19 14:58:42,893 INFO L195 NwaCegarLoop]: trace histogram [12, 12, 12, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-19 14:58:42,893 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2023-12-19 14:58:42,893 INFO L420 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-19 14:58:42,894 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-19 14:58:42,894 INFO L85 PathProgramCache]: Analyzing trace with hash -1639103148, now seen corresponding path program 1 times [2023-12-19 14:58:42,894 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-19 14:58:42,894 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [127273169] [2023-12-19 14:58:42,894 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-19 14:58:42,894 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-19 14:58:42,945 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 14:58:43,522 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-12-19 14:58:43,524 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 14:58:43,525 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2023-12-19 14:58:43,526 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 14:58:43,531 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2023-12-19 14:58:43,531 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 14:58:43,532 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2023-12-19 14:58:43,533 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 14:58:43,533 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2023-12-19 14:58:43,534 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 14:58:43,535 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2023-12-19 14:58:43,535 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 14:58:43,536 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2023-12-19 14:58:43,536 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 14:58:43,537 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2023-12-19 14:58:43,537 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 14:58:43,538 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2023-12-19 14:58:43,538 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 14:58:43,541 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2023-12-19 14:58:43,542 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 14:58:43,544 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2023-12-19 14:58:43,545 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 14:58:43,547 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 80 [2023-12-19 14:58:43,548 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 14:58:43,549 INFO L134 CoverageAnalysis]: Checked inductivity of 264 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 264 trivial. 0 not checked. [2023-12-19 14:58:43,549 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-19 14:58:43,550 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [127273169] [2023-12-19 14:58:43,550 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [127273169] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-19 14:58:43,550 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-19 14:58:43,550 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2023-12-19 14:58:43,550 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1805415703] [2023-12-19 14:58:43,550 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-19 14:58:43,551 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2023-12-19 14:58:43,551 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-19 14:58:43,551 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2023-12-19 14:58:43,552 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=88, Unknown=0, NotChecked=0, Total=110 [2023-12-19 14:58:43,552 INFO L87 Difference]: Start difference. First operand 751 states and 1040 transitions. Second operand has 11 states, 10 states have (on average 5.9) internal successors, (59), 11 states have internal predecessors, (59), 3 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 2 states have call predecessors, (12), 3 states have call successors, (12) [2023-12-19 14:58:44,618 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-19 14:58:44,618 INFO L93 Difference]: Finished difference Result 1494 states and 2076 transitions. [2023-12-19 14:58:44,619 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2023-12-19 14:58:44,619 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 10 states have (on average 5.9) internal successors, (59), 11 states have internal predecessors, (59), 3 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 2 states have call predecessors, (12), 3 states have call successors, (12) Word has length 116 [2023-12-19 14:58:44,619 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-19 14:58:44,622 INFO L225 Difference]: With dead ends: 1494 [2023-12-19 14:58:44,622 INFO L226 Difference]: Without dead ends: 1148 [2023-12-19 14:58:44,623 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 46 GetRequests, 28 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 39 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=83, Invalid=297, Unknown=0, NotChecked=0, Total=380 [2023-12-19 14:58:44,623 INFO L413 NwaCegarLoop]: 345 mSDtfsCounter, 401 mSDsluCounter, 1978 mSDsCounter, 0 mSdLazyCounter, 1018 mSolverCounterSat, 55 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 402 SdHoareTripleChecker+Valid, 2323 SdHoareTripleChecker+Invalid, 1073 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 55 IncrementalHoareTripleChecker+Valid, 1018 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time [2023-12-19 14:58:44,624 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [402 Valid, 2323 Invalid, 1073 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [55 Valid, 1018 Invalid, 0 Unknown, 0 Unchecked, 0.8s Time] [2023-12-19 14:58:44,624 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1148 states. [2023-12-19 14:58:44,663 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1148 to 793. [2023-12-19 14:58:44,665 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 793 states, 701 states have (on average 1.3452211126961484) internal successors, (943), 704 states have internal predecessors, (943), 76 states have call successors, (76), 15 states have call predecessors, (76), 15 states have return successors, (76), 73 states have call predecessors, (76), 76 states have call successors, (76) [2023-12-19 14:58:44,666 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 793 states to 793 states and 1095 transitions. [2023-12-19 14:58:44,666 INFO L78 Accepts]: Start accepts. Automaton has 793 states and 1095 transitions. Word has length 116 [2023-12-19 14:58:44,666 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-19 14:58:44,666 INFO L495 AbstractCegarLoop]: Abstraction has 793 states and 1095 transitions. [2023-12-19 14:58:44,666 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 10 states have (on average 5.9) internal successors, (59), 11 states have internal predecessors, (59), 3 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 2 states have call predecessors, (12), 3 states have call successors, (12) [2023-12-19 14:58:44,667 INFO L276 IsEmpty]: Start isEmpty. Operand 793 states and 1095 transitions. [2023-12-19 14:58:44,667 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 117 [2023-12-19 14:58:44,667 INFO L187 NwaCegarLoop]: Found error trace [2023-12-19 14:58:44,667 INFO L195 NwaCegarLoop]: trace histogram [12, 12, 12, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-19 14:58:44,668 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2023-12-19 14:58:44,668 INFO L420 AbstractCegarLoop]: === Iteration 20 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-19 14:58:44,668 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-19 14:58:44,668 INFO L85 PathProgramCache]: Analyzing trace with hash -1498554538, now seen corresponding path program 1 times [2023-12-19 14:58:44,668 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-19 14:58:44,668 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1943790322] [2023-12-19 14:58:44,668 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-19 14:58:44,668 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-19 14:58:44,697 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 14:58:45,228 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-12-19 14:58:45,230 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 14:58:45,230 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2023-12-19 14:58:45,231 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 14:58:45,231 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2023-12-19 14:58:45,232 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 14:58:45,232 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2023-12-19 14:58:45,232 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 14:58:45,233 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2023-12-19 14:58:45,233 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 14:58:45,234 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2023-12-19 14:58:45,235 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 14:58:45,236 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2023-12-19 14:58:45,236 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 14:58:45,237 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2023-12-19 14:58:45,243 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 14:58:45,248 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2023-12-19 14:58:45,249 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 14:58:45,252 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2023-12-19 14:58:45,252 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 14:58:45,253 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2023-12-19 14:58:45,254 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 14:58:45,254 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 80 [2023-12-19 14:58:45,255 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 14:58:45,258 INFO L134 CoverageAnalysis]: Checked inductivity of 264 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 264 trivial. 0 not checked. [2023-12-19 14:58:45,258 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-19 14:58:45,258 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1943790322] [2023-12-19 14:58:45,258 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1943790322] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-19 14:58:45,258 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-19 14:58:45,258 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2023-12-19 14:58:45,258 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [263792870] [2023-12-19 14:58:45,258 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-19 14:58:45,259 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2023-12-19 14:58:45,259 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-19 14:58:45,259 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2023-12-19 14:58:45,259 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=88, Unknown=0, NotChecked=0, Total=110 [2023-12-19 14:58:45,259 INFO L87 Difference]: Start difference. First operand 793 states and 1095 transitions. Second operand has 11 states, 10 states have (on average 5.9) internal successors, (59), 11 states have internal predecessors, (59), 3 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 2 states have call predecessors, (12), 3 states have call successors, (12) [2023-12-19 14:58:46,300 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-19 14:58:46,300 INFO L93 Difference]: Finished difference Result 1548 states and 2146 transitions. [2023-12-19 14:58:46,308 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2023-12-19 14:58:46,308 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 10 states have (on average 5.9) internal successors, (59), 11 states have internal predecessors, (59), 3 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 2 states have call predecessors, (12), 3 states have call successors, (12) Word has length 116 [2023-12-19 14:58:46,309 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-19 14:58:46,312 INFO L225 Difference]: With dead ends: 1548 [2023-12-19 14:58:46,312 INFO L226 Difference]: Without dead ends: 1160 [2023-12-19 14:58:46,313 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 46 GetRequests, 28 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 39 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=83, Invalid=297, Unknown=0, NotChecked=0, Total=380 [2023-12-19 14:58:46,313 INFO L413 NwaCegarLoop]: 347 mSDtfsCounter, 396 mSDsluCounter, 1991 mSDsCounter, 0 mSdLazyCounter, 1026 mSolverCounterSat, 55 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 397 SdHoareTripleChecker+Valid, 2338 SdHoareTripleChecker+Invalid, 1081 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 55 IncrementalHoareTripleChecker+Valid, 1026 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2023-12-19 14:58:46,314 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [397 Valid, 2338 Invalid, 1081 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [55 Valid, 1026 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2023-12-19 14:58:46,317 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1160 states. [2023-12-19 14:58:46,361 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1160 to 763. [2023-12-19 14:58:46,363 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 763 states, 671 states have (on average 1.34575260804769) internal successors, (903), 674 states have internal predecessors, (903), 76 states have call successors, (76), 15 states have call predecessors, (76), 15 states have return successors, (76), 73 states have call predecessors, (76), 76 states have call successors, (76) [2023-12-19 14:58:46,364 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 763 states to 763 states and 1055 transitions. [2023-12-19 14:58:46,364 INFO L78 Accepts]: Start accepts. Automaton has 763 states and 1055 transitions. Word has length 116 [2023-12-19 14:58:46,364 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-19 14:58:46,364 INFO L495 AbstractCegarLoop]: Abstraction has 763 states and 1055 transitions. [2023-12-19 14:58:46,364 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 10 states have (on average 5.9) internal successors, (59), 11 states have internal predecessors, (59), 3 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 2 states have call predecessors, (12), 3 states have call successors, (12) [2023-12-19 14:58:46,365 INFO L276 IsEmpty]: Start isEmpty. Operand 763 states and 1055 transitions. [2023-12-19 14:58:46,365 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 117 [2023-12-19 14:58:46,365 INFO L187 NwaCegarLoop]: Found error trace [2023-12-19 14:58:46,365 INFO L195 NwaCegarLoop]: trace histogram [12, 12, 12, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-19 14:58:46,366 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19 [2023-12-19 14:58:46,366 INFO L420 AbstractCegarLoop]: === Iteration 21 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-19 14:58:46,366 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-19 14:58:46,366 INFO L85 PathProgramCache]: Analyzing trace with hash 1908231937, now seen corresponding path program 1 times [2023-12-19 14:58:46,367 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-19 14:58:46,367 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1540718009] [2023-12-19 14:58:46,367 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-19 14:58:46,367 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-19 14:58:46,386 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 14:58:46,576 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-12-19 14:58:46,576 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 14:58:46,577 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2023-12-19 14:58:46,577 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 14:58:46,578 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2023-12-19 14:58:46,578 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 14:58:46,579 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2023-12-19 14:58:46,579 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 14:58:46,580 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2023-12-19 14:58:46,580 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 14:58:46,581 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2023-12-19 14:58:46,581 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 14:58:46,581 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2023-12-19 14:58:46,582 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 14:58:46,582 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2023-12-19 14:58:46,583 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 14:58:46,584 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2023-12-19 14:58:46,584 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 14:58:46,585 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2023-12-19 14:58:46,586 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 14:58:46,586 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2023-12-19 14:58:46,586 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 14:58:46,587 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 80 [2023-12-19 14:58:46,587 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 14:58:46,588 INFO L134 CoverageAnalysis]: Checked inductivity of 264 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 264 trivial. 0 not checked. [2023-12-19 14:58:46,588 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-19 14:58:46,588 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1540718009] [2023-12-19 14:58:46,588 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1540718009] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-19 14:58:46,588 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-19 14:58:46,588 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2023-12-19 14:58:46,588 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [185590984] [2023-12-19 14:58:46,589 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-19 14:58:46,589 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2023-12-19 14:58:46,589 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-19 14:58:46,590 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2023-12-19 14:58:46,590 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2023-12-19 14:58:46,590 INFO L87 Difference]: Start difference. First operand 763 states and 1055 transitions. Second operand has 7 states, 7 states have (on average 8.428571428571429) internal successors, (59), 7 states have internal predecessors, (59), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) [2023-12-19 14:58:46,772 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-19 14:58:46,772 INFO L93 Difference]: Finished difference Result 1674 states and 2316 transitions. [2023-12-19 14:58:46,772 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2023-12-19 14:58:46,772 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 8.428571428571429) internal successors, (59), 7 states have internal predecessors, (59), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) Word has length 116 [2023-12-19 14:58:46,772 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-19 14:58:46,775 INFO L225 Difference]: With dead ends: 1674 [2023-12-19 14:58:46,775 INFO L226 Difference]: Without dead ends: 912 [2023-12-19 14:58:46,776 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 42 GetRequests, 27 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 36 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=82, Invalid=190, Unknown=0, NotChecked=0, Total=272 [2023-12-19 14:58:46,776 INFO L413 NwaCegarLoop]: 245 mSDtfsCounter, 381 mSDsluCounter, 1138 mSDsCounter, 0 mSdLazyCounter, 147 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 381 SdHoareTripleChecker+Valid, 1383 SdHoareTripleChecker+Invalid, 152 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 147 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-12-19 14:58:46,776 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [381 Valid, 1383 Invalid, 152 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 147 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-12-19 14:58:46,778 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 912 states. [2023-12-19 14:58:46,822 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 912 to 774. [2023-12-19 14:58:46,823 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 774 states, 682 states have (on average 1.3387096774193548) internal successors, (913), 685 states have internal predecessors, (913), 76 states have call successors, (76), 15 states have call predecessors, (76), 15 states have return successors, (76), 73 states have call predecessors, (76), 76 states have call successors, (76) [2023-12-19 14:58:46,825 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 774 states to 774 states and 1065 transitions. [2023-12-19 14:58:46,825 INFO L78 Accepts]: Start accepts. Automaton has 774 states and 1065 transitions. Word has length 116 [2023-12-19 14:58:46,825 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-19 14:58:46,825 INFO L495 AbstractCegarLoop]: Abstraction has 774 states and 1065 transitions. [2023-12-19 14:58:46,825 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 8.428571428571429) internal successors, (59), 7 states have internal predecessors, (59), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) [2023-12-19 14:58:46,825 INFO L276 IsEmpty]: Start isEmpty. Operand 774 states and 1065 transitions. [2023-12-19 14:58:46,827 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 117 [2023-12-19 14:58:46,827 INFO L187 NwaCegarLoop]: Found error trace [2023-12-19 14:58:46,827 INFO L195 NwaCegarLoop]: trace histogram [12, 12, 12, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-19 14:58:46,827 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20 [2023-12-19 14:58:46,827 INFO L420 AbstractCegarLoop]: === Iteration 22 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-19 14:58:46,827 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-19 14:58:46,827 INFO L85 PathProgramCache]: Analyzing trace with hash -1964033533, now seen corresponding path program 1 times [2023-12-19 14:58:46,827 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-19 14:58:46,827 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1809389971] [2023-12-19 14:58:46,828 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-19 14:58:46,828 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-19 14:58:46,852 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 14:58:47,084 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-12-19 14:58:47,084 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 14:58:47,085 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2023-12-19 14:58:47,085 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 14:58:47,086 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2023-12-19 14:58:47,086 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 14:58:47,087 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2023-12-19 14:58:47,087 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 14:58:47,088 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2023-12-19 14:58:47,088 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 14:58:47,089 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2023-12-19 14:58:47,089 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 14:58:47,089 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2023-12-19 14:58:47,090 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 14:58:47,090 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2023-12-19 14:58:47,091 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 14:58:47,091 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2023-12-19 14:58:47,092 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 14:58:47,092 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2023-12-19 14:58:47,092 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 14:58:47,093 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2023-12-19 14:58:47,093 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 14:58:47,094 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 80 [2023-12-19 14:58:47,094 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 14:58:47,095 INFO L134 CoverageAnalysis]: Checked inductivity of 264 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 264 trivial. 0 not checked. [2023-12-19 14:58:47,095 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-19 14:58:47,095 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1809389971] [2023-12-19 14:58:47,095 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1809389971] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-19 14:58:47,095 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-19 14:58:47,095 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2023-12-19 14:58:47,095 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [171406405] [2023-12-19 14:58:47,095 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-19 14:58:47,096 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-12-19 14:58:47,096 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-19 14:58:47,096 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-12-19 14:58:47,096 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2023-12-19 14:58:47,097 INFO L87 Difference]: Start difference. First operand 774 states and 1065 transitions. Second operand has 6 states, 5 states have (on average 11.8) internal successors, (59), 6 states have internal predecessors, (59), 2 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 2 states have call successors, (12) [2023-12-19 14:58:47,200 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-19 14:58:47,201 INFO L93 Difference]: Finished difference Result 1727 states and 2378 transitions. [2023-12-19 14:58:47,201 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2023-12-19 14:58:47,201 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 11.8) internal successors, (59), 6 states have internal predecessors, (59), 2 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 2 states have call successors, (12) Word has length 116 [2023-12-19 14:58:47,201 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-19 14:58:47,204 INFO L225 Difference]: With dead ends: 1727 [2023-12-19 14:58:47,204 INFO L226 Difference]: Without dead ends: 954 [2023-12-19 14:58:47,205 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 34 GetRequests, 29 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2023-12-19 14:58:47,206 INFO L413 NwaCegarLoop]: 228 mSDtfsCounter, 115 mSDsluCounter, 785 mSDsCounter, 0 mSdLazyCounter, 99 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 116 SdHoareTripleChecker+Valid, 1013 SdHoareTripleChecker+Invalid, 101 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 99 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-12-19 14:58:47,206 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [116 Valid, 1013 Invalid, 101 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 99 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-12-19 14:58:47,207 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 954 states. [2023-12-19 14:58:47,259 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 954 to 776. [2023-12-19 14:58:47,261 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 776 states, 684 states have (on average 1.337719298245614) internal successors, (915), 687 states have internal predecessors, (915), 76 states have call successors, (76), 15 states have call predecessors, (76), 15 states have return successors, (76), 73 states have call predecessors, (76), 76 states have call successors, (76) [2023-12-19 14:58:47,262 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 776 states to 776 states and 1067 transitions. [2023-12-19 14:58:47,263 INFO L78 Accepts]: Start accepts. Automaton has 776 states and 1067 transitions. Word has length 116 [2023-12-19 14:58:47,263 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-19 14:58:47,263 INFO L495 AbstractCegarLoop]: Abstraction has 776 states and 1067 transitions. [2023-12-19 14:58:47,263 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 11.8) internal successors, (59), 6 states have internal predecessors, (59), 2 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 2 states have call successors, (12) [2023-12-19 14:58:47,263 INFO L276 IsEmpty]: Start isEmpty. Operand 776 states and 1067 transitions. [2023-12-19 14:58:47,264 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 118 [2023-12-19 14:58:47,264 INFO L187 NwaCegarLoop]: Found error trace [2023-12-19 14:58:47,264 INFO L195 NwaCegarLoop]: trace histogram [12, 12, 12, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-19 14:58:47,264 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable21 [2023-12-19 14:58:47,264 INFO L420 AbstractCegarLoop]: === Iteration 23 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-19 14:58:47,265 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-19 14:58:47,265 INFO L85 PathProgramCache]: Analyzing trace with hash 1204295652, now seen corresponding path program 1 times [2023-12-19 14:58:47,265 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-19 14:58:47,265 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [579912225] [2023-12-19 14:58:47,265 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-19 14:58:47,265 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-19 14:58:47,303 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 14:58:47,976 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-12-19 14:58:47,977 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 14:58:47,978 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2023-12-19 14:58:47,978 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 14:58:47,979 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2023-12-19 14:58:47,979 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 14:58:47,979 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2023-12-19 14:58:47,980 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 14:58:47,980 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2023-12-19 14:58:47,980 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 14:58:47,981 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2023-12-19 14:58:47,981 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 14:58:47,982 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2023-12-19 14:58:47,982 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 14:58:47,982 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2023-12-19 14:58:47,983 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 14:58:47,983 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2023-12-19 14:58:47,984 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 14:58:47,985 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2023-12-19 14:58:47,986 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 14:58:47,987 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2023-12-19 14:58:47,987 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 14:58:47,988 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 80 [2023-12-19 14:58:47,989 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 14:58:47,990 INFO L134 CoverageAnalysis]: Checked inductivity of 264 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 264 trivial. 0 not checked. [2023-12-19 14:58:47,990 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-19 14:58:47,990 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [579912225] [2023-12-19 14:58:47,990 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [579912225] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-19 14:58:47,990 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-19 14:58:47,990 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2023-12-19 14:58:47,990 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [87634055] [2023-12-19 14:58:47,990 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-19 14:58:47,991 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2023-12-19 14:58:47,991 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-19 14:58:47,991 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2023-12-19 14:58:47,991 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=89, Unknown=0, NotChecked=0, Total=110 [2023-12-19 14:58:47,991 INFO L87 Difference]: Start difference. First operand 776 states and 1067 transitions. Second operand has 11 states, 10 states have (on average 6.0) internal successors, (60), 11 states have internal predecessors, (60), 3 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 2 states have call predecessors, (12), 3 states have call successors, (12) [2023-12-19 14:58:49,758 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-19 14:58:49,758 INFO L93 Difference]: Finished difference Result 1603 states and 2208 transitions. [2023-12-19 14:58:49,759 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2023-12-19 14:58:49,759 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 10 states have (on average 6.0) internal successors, (60), 11 states have internal predecessors, (60), 3 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 2 states have call predecessors, (12), 3 states have call successors, (12) Word has length 117 [2023-12-19 14:58:49,759 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-19 14:58:49,762 INFO L225 Difference]: With dead ends: 1603 [2023-12-19 14:58:49,762 INFO L226 Difference]: Without dead ends: 1229 [2023-12-19 14:58:49,764 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 49 GetRequests, 29 SyntacticMatches, 0 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 51 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=97, Invalid=365, Unknown=0, NotChecked=0, Total=462 [2023-12-19 14:58:49,764 INFO L413 NwaCegarLoop]: 229 mSDtfsCounter, 549 mSDsluCounter, 1378 mSDsCounter, 0 mSdLazyCounter, 840 mSolverCounterSat, 102 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 550 SdHoareTripleChecker+Valid, 1607 SdHoareTripleChecker+Invalid, 942 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 102 IncrementalHoareTripleChecker+Valid, 840 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.9s IncrementalHoareTripleChecker+Time [2023-12-19 14:58:49,764 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [550 Valid, 1607 Invalid, 942 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [102 Valid, 840 Invalid, 0 Unknown, 0 Unchecked, 0.9s Time] [2023-12-19 14:58:49,765 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1229 states. [2023-12-19 14:58:49,848 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1229 to 796. [2023-12-19 14:58:49,850 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 796 states, 704 states have (on average 1.3352272727272727) internal successors, (940), 707 states have internal predecessors, (940), 76 states have call successors, (76), 15 states have call predecessors, (76), 15 states have return successors, (76), 73 states have call predecessors, (76), 76 states have call successors, (76) [2023-12-19 14:58:49,851 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 796 states to 796 states and 1092 transitions. [2023-12-19 14:58:49,852 INFO L78 Accepts]: Start accepts. Automaton has 796 states and 1092 transitions. Word has length 117 [2023-12-19 14:58:49,853 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-19 14:58:49,853 INFO L495 AbstractCegarLoop]: Abstraction has 796 states and 1092 transitions. [2023-12-19 14:58:49,853 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 10 states have (on average 6.0) internal successors, (60), 11 states have internal predecessors, (60), 3 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 2 states have call predecessors, (12), 3 states have call successors, (12) [2023-12-19 14:58:49,853 INFO L276 IsEmpty]: Start isEmpty. Operand 796 states and 1092 transitions. [2023-12-19 14:58:49,855 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 118 [2023-12-19 14:58:49,855 INFO L187 NwaCegarLoop]: Found error trace [2023-12-19 14:58:49,855 INFO L195 NwaCegarLoop]: trace histogram [12, 12, 12, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-19 14:58:49,855 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable22 [2023-12-19 14:58:49,855 INFO L420 AbstractCegarLoop]: === Iteration 24 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-19 14:58:49,855 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-19 14:58:49,855 INFO L85 PathProgramCache]: Analyzing trace with hash 1266335266, now seen corresponding path program 1 times [2023-12-19 14:58:49,856 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-19 14:58:49,856 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1584748216] [2023-12-19 14:58:49,856 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-19 14:58:49,856 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-19 14:58:49,902 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 14:58:50,490 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-12-19 14:58:50,491 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 14:58:50,491 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2023-12-19 14:58:50,492 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 14:58:50,492 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2023-12-19 14:58:50,493 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 14:58:50,493 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2023-12-19 14:58:50,493 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 14:58:50,494 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2023-12-19 14:58:50,494 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 14:58:50,495 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2023-12-19 14:58:50,495 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 14:58:50,495 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2023-12-19 14:58:50,496 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 14:58:50,496 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2023-12-19 14:58:50,496 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 14:58:50,497 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2023-12-19 14:58:50,497 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 14:58:50,499 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2023-12-19 14:58:50,500 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 14:58:50,502 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2023-12-19 14:58:50,502 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 14:58:50,503 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 80 [2023-12-19 14:58:50,504 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 14:58:50,505 INFO L134 CoverageAnalysis]: Checked inductivity of 264 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 264 trivial. 0 not checked. [2023-12-19 14:58:50,507 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-19 14:58:50,507 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1584748216] [2023-12-19 14:58:50,507 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1584748216] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-19 14:58:50,507 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-19 14:58:50,507 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2023-12-19 14:58:50,507 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [17945090] [2023-12-19 14:58:50,507 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-19 14:58:50,508 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2023-12-19 14:58:50,508 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-19 14:58:50,508 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2023-12-19 14:58:50,509 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=88, Unknown=0, NotChecked=0, Total=110 [2023-12-19 14:58:50,509 INFO L87 Difference]: Start difference. First operand 796 states and 1092 transitions. Second operand has 11 states, 10 states have (on average 6.0) internal successors, (60), 11 states have internal predecessors, (60), 3 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 2 states have call predecessors, (12), 3 states have call successors, (12) [2023-12-19 14:58:51,790 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-19 14:58:51,790 INFO L93 Difference]: Finished difference Result 1655 states and 2278 transitions. [2023-12-19 14:58:51,790 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2023-12-19 14:58:51,790 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 10 states have (on average 6.0) internal successors, (60), 11 states have internal predecessors, (60), 3 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 2 states have call predecessors, (12), 3 states have call successors, (12) Word has length 117 [2023-12-19 14:58:51,791 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-19 14:58:51,794 INFO L225 Difference]: With dead ends: 1655 [2023-12-19 14:58:51,794 INFO L226 Difference]: Without dead ends: 1261 [2023-12-19 14:58:51,795 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 47 GetRequests, 28 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 55 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=88, Invalid=332, Unknown=0, NotChecked=0, Total=420 [2023-12-19 14:58:51,795 INFO L413 NwaCegarLoop]: 240 mSDtfsCounter, 531 mSDsluCounter, 1505 mSDsCounter, 0 mSdLazyCounter, 732 mSolverCounterSat, 81 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 532 SdHoareTripleChecker+Valid, 1745 SdHoareTripleChecker+Invalid, 813 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 81 IncrementalHoareTripleChecker+Valid, 732 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time [2023-12-19 14:58:51,795 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [532 Valid, 1745 Invalid, 813 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [81 Valid, 732 Invalid, 0 Unknown, 0 Unchecked, 0.8s Time] [2023-12-19 14:58:51,796 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1261 states. [2023-12-19 14:58:51,849 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1261 to 777. [2023-12-19 14:58:51,850 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 777 states, 685 states have (on average 1.3372262773722627) internal successors, (916), 688 states have internal predecessors, (916), 76 states have call successors, (76), 15 states have call predecessors, (76), 15 states have return successors, (76), 73 states have call predecessors, (76), 76 states have call successors, (76) [2023-12-19 14:58:51,851 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 777 states to 777 states and 1068 transitions. [2023-12-19 14:58:51,851 INFO L78 Accepts]: Start accepts. Automaton has 777 states and 1068 transitions. Word has length 117 [2023-12-19 14:58:51,852 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-19 14:58:51,852 INFO L495 AbstractCegarLoop]: Abstraction has 777 states and 1068 transitions. [2023-12-19 14:58:51,852 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 10 states have (on average 6.0) internal successors, (60), 11 states have internal predecessors, (60), 3 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 2 states have call predecessors, (12), 3 states have call successors, (12) [2023-12-19 14:58:51,852 INFO L276 IsEmpty]: Start isEmpty. Operand 777 states and 1068 transitions. [2023-12-19 14:58:51,853 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 118 [2023-12-19 14:58:51,853 INFO L187 NwaCegarLoop]: Found error trace [2023-12-19 14:58:51,853 INFO L195 NwaCegarLoop]: trace histogram [12, 12, 12, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-19 14:58:51,853 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable23 [2023-12-19 14:58:51,853 INFO L420 AbstractCegarLoop]: === Iteration 25 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-19 14:58:51,853 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-19 14:58:51,853 INFO L85 PathProgramCache]: Analyzing trace with hash -1690555580, now seen corresponding path program 1 times [2023-12-19 14:58:51,853 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-19 14:58:51,853 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [358114956] [2023-12-19 14:58:51,853 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-19 14:58:51,854 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-19 14:58:51,883 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 14:58:52,063 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-12-19 14:58:52,064 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 14:58:52,064 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2023-12-19 14:58:52,065 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 14:58:52,065 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2023-12-19 14:58:52,065 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 14:58:52,066 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2023-12-19 14:58:52,066 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 14:58:52,067 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2023-12-19 14:58:52,067 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 14:58:52,067 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2023-12-19 14:58:52,068 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 14:58:52,068 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2023-12-19 14:58:52,069 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 14:58:52,069 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2023-12-19 14:58:52,069 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 14:58:52,070 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2023-12-19 14:58:52,072 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 14:58:52,073 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2023-12-19 14:58:52,073 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 14:58:52,073 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2023-12-19 14:58:52,074 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 14:58:52,075 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 80 [2023-12-19 14:58:52,075 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 14:58:52,076 INFO L134 CoverageAnalysis]: Checked inductivity of 264 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 264 trivial. 0 not checked. [2023-12-19 14:58:52,076 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-19 14:58:52,076 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [358114956] [2023-12-19 14:58:52,076 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [358114956] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-19 14:58:52,076 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-19 14:58:52,076 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2023-12-19 14:58:52,077 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1833439379] [2023-12-19 14:58:52,077 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-19 14:58:52,077 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-12-19 14:58:52,077 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-19 14:58:52,078 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-12-19 14:58:52,078 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2023-12-19 14:58:52,078 INFO L87 Difference]: Start difference. First operand 777 states and 1068 transitions. Second operand has 6 states, 5 states have (on average 12.0) internal successors, (60), 6 states have internal predecessors, (60), 2 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 2 states have call successors, (12) [2023-12-19 14:58:52,216 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-19 14:58:52,217 INFO L93 Difference]: Finished difference Result 1754 states and 2412 transitions. [2023-12-19 14:58:52,217 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2023-12-19 14:58:52,217 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 12.0) internal successors, (60), 6 states have internal predecessors, (60), 2 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 2 states have call successors, (12) Word has length 117 [2023-12-19 14:58:52,218 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-19 14:58:52,221 INFO L225 Difference]: With dead ends: 1754 [2023-12-19 14:58:52,221 INFO L226 Difference]: Without dead ends: 978 [2023-12-19 14:58:52,223 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 32 GetRequests, 27 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2023-12-19 14:58:52,223 INFO L413 NwaCegarLoop]: 146 mSDtfsCounter, 129 mSDsluCounter, 590 mSDsCounter, 0 mSdLazyCounter, 99 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 130 SdHoareTripleChecker+Valid, 736 SdHoareTripleChecker+Invalid, 101 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 99 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-12-19 14:58:52,227 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [130 Valid, 736 Invalid, 101 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 99 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-12-19 14:58:52,228 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 978 states. [2023-12-19 14:58:52,304 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 978 to 787. [2023-12-19 14:58:52,309 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 787 states, 695 states have (on average 1.3280575539568344) internal successors, (923), 698 states have internal predecessors, (923), 76 states have call successors, (76), 15 states have call predecessors, (76), 15 states have return successors, (76), 73 states have call predecessors, (76), 76 states have call successors, (76) [2023-12-19 14:58:52,311 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 787 states to 787 states and 1075 transitions. [2023-12-19 14:58:52,311 INFO L78 Accepts]: Start accepts. Automaton has 787 states and 1075 transitions. Word has length 117 [2023-12-19 14:58:52,311 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-19 14:58:52,311 INFO L495 AbstractCegarLoop]: Abstraction has 787 states and 1075 transitions. [2023-12-19 14:58:52,312 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 12.0) internal successors, (60), 6 states have internal predecessors, (60), 2 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 2 states have call successors, (12) [2023-12-19 14:58:52,312 INFO L276 IsEmpty]: Start isEmpty. Operand 787 states and 1075 transitions. [2023-12-19 14:58:52,312 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 118 [2023-12-19 14:58:52,312 INFO L187 NwaCegarLoop]: Found error trace [2023-12-19 14:58:52,313 INFO L195 NwaCegarLoop]: trace histogram [12, 12, 12, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-19 14:58:52,313 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable24 [2023-12-19 14:58:52,313 INFO L420 AbstractCegarLoop]: === Iteration 26 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-19 14:58:52,313 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-19 14:58:52,313 INFO L85 PathProgramCache]: Analyzing trace with hash -1539091155, now seen corresponding path program 1 times [2023-12-19 14:58:52,313 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-19 14:58:52,313 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [437955300] [2023-12-19 14:58:52,313 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-19 14:58:52,313 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-19 14:58:52,343 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 14:58:52,791 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-12-19 14:58:52,792 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 14:58:52,798 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2023-12-19 14:58:52,799 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 14:58:52,801 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2023-12-19 14:58:52,802 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 14:58:52,803 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2023-12-19 14:58:52,804 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 14:58:52,805 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2023-12-19 14:58:52,806 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 14:58:52,808 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2023-12-19 14:58:52,808 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 14:58:52,810 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2023-12-19 14:58:52,811 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 14:58:52,812 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2023-12-19 14:58:52,813 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 14:58:52,814 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2023-12-19 14:58:52,815 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 14:58:52,817 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2023-12-19 14:58:52,827 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 14:58:52,829 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2023-12-19 14:58:52,829 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 14:58:52,833 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 80 [2023-12-19 14:58:52,833 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 14:58:52,835 INFO L134 CoverageAnalysis]: Checked inductivity of 264 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 264 trivial. 0 not checked. [2023-12-19 14:58:52,835 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-19 14:58:52,835 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [437955300] [2023-12-19 14:58:52,835 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [437955300] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-19 14:58:52,835 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-19 14:58:52,835 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2023-12-19 14:58:52,835 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1126614964] [2023-12-19 14:58:52,835 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-19 14:58:52,836 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2023-12-19 14:58:52,836 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-19 14:58:52,837 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2023-12-19 14:58:52,837 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=53, Unknown=0, NotChecked=0, Total=72 [2023-12-19 14:58:52,837 INFO L87 Difference]: Start difference. First operand 787 states and 1075 transitions. Second operand has 9 states, 8 states have (on average 7.5) internal successors, (60), 9 states have internal predecessors, (60), 2 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 2 states have call successors, (12) [2023-12-19 14:58:53,164 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-19 14:58:53,164 INFO L93 Difference]: Finished difference Result 1695 states and 2311 transitions. [2023-12-19 14:58:53,164 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2023-12-19 14:58:53,164 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 8 states have (on average 7.5) internal successors, (60), 9 states have internal predecessors, (60), 2 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 2 states have call successors, (12) Word has length 117 [2023-12-19 14:58:53,164 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-19 14:58:53,167 INFO L225 Difference]: With dead ends: 1695 [2023-12-19 14:58:53,167 INFO L226 Difference]: Without dead ends: 909 [2023-12-19 14:58:53,168 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 43 GetRequests, 29 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 23 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=68, Invalid=172, Unknown=0, NotChecked=0, Total=240 [2023-12-19 14:58:53,168 INFO L413 NwaCegarLoop]: 132 mSDtfsCounter, 582 mSDsluCounter, 701 mSDsCounter, 0 mSdLazyCounter, 233 mSolverCounterSat, 113 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 582 SdHoareTripleChecker+Valid, 833 SdHoareTripleChecker+Invalid, 346 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 113 IncrementalHoareTripleChecker+Valid, 233 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2023-12-19 14:58:53,169 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [582 Valid, 833 Invalid, 346 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [113 Valid, 233 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2023-12-19 14:58:53,170 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 909 states. [2023-12-19 14:58:53,225 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 909 to 841. [2023-12-19 14:58:53,226 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 841 states, 736 states have (on average 1.3247282608695652) internal successors, (975), 740 states have internal predecessors, (975), 86 states have call successors, (86), 18 states have call predecessors, (86), 18 states have return successors, (86), 82 states have call predecessors, (86), 86 states have call successors, (86) [2023-12-19 14:58:53,228 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 841 states to 841 states and 1147 transitions. [2023-12-19 14:58:53,228 INFO L78 Accepts]: Start accepts. Automaton has 841 states and 1147 transitions. Word has length 117 [2023-12-19 14:58:53,228 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-19 14:58:53,228 INFO L495 AbstractCegarLoop]: Abstraction has 841 states and 1147 transitions. [2023-12-19 14:58:53,228 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 8 states have (on average 7.5) internal successors, (60), 9 states have internal predecessors, (60), 2 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 2 states have call successors, (12) [2023-12-19 14:58:53,228 INFO L276 IsEmpty]: Start isEmpty. Operand 841 states and 1147 transitions. [2023-12-19 14:58:53,229 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 118 [2023-12-19 14:58:53,229 INFO L187 NwaCegarLoop]: Found error trace [2023-12-19 14:58:53,229 INFO L195 NwaCegarLoop]: trace histogram [12, 12, 12, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-19 14:58:53,230 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable25 [2023-12-19 14:58:53,230 INFO L420 AbstractCegarLoop]: === Iteration 27 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-19 14:58:53,230 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-19 14:58:53,230 INFO L85 PathProgramCache]: Analyzing trace with hash -1146064145, now seen corresponding path program 1 times [2023-12-19 14:58:53,230 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-19 14:58:53,230 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1502276128] [2023-12-19 14:58:53,230 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-19 14:58:53,230 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-19 14:58:53,254 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 14:58:53,590 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-12-19 14:58:53,592 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 14:58:53,593 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2023-12-19 14:58:53,593 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 14:58:53,594 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2023-12-19 14:58:53,595 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 14:58:53,595 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2023-12-19 14:58:53,596 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 14:58:53,597 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2023-12-19 14:58:53,598 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 14:58:53,599 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2023-12-19 14:58:53,599 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 14:58:53,600 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2023-12-19 14:58:53,601 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 14:58:53,602 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2023-12-19 14:58:53,602 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 14:58:53,603 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2023-12-19 14:58:53,604 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 14:58:53,605 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2023-12-19 14:58:53,605 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 14:58:53,606 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2023-12-19 14:58:53,607 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 14:58:53,608 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 80 [2023-12-19 14:58:53,608 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 14:58:53,610 INFO L134 CoverageAnalysis]: Checked inductivity of 264 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 264 trivial. 0 not checked. [2023-12-19 14:58:53,610 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-19 14:58:53,610 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1502276128] [2023-12-19 14:58:53,610 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1502276128] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-19 14:58:53,610 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-19 14:58:53,610 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2023-12-19 14:58:53,610 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [864547913] [2023-12-19 14:58:53,611 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-19 14:58:53,611 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2023-12-19 14:58:53,611 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-19 14:58:53,611 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2023-12-19 14:58:53,611 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=105, Unknown=0, NotChecked=0, Total=132 [2023-12-19 14:58:53,611 INFO L87 Difference]: Start difference. First operand 841 states and 1147 transitions. Second operand has 12 states, 12 states have (on average 5.0) internal successors, (60), 12 states have internal predecessors, (60), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) [2023-12-19 14:58:53,996 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-19 14:58:53,996 INFO L93 Difference]: Finished difference Result 1654 states and 2248 transitions. [2023-12-19 14:58:53,996 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2023-12-19 14:58:53,996 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 12 states have (on average 5.0) internal successors, (60), 12 states have internal predecessors, (60), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) Word has length 117 [2023-12-19 14:58:53,997 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-19 14:58:53,999 INFO L225 Difference]: With dead ends: 1654 [2023-12-19 14:58:53,999 INFO L226 Difference]: Without dead ends: 864 [2023-12-19 14:58:54,000 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 43 GetRequests, 25 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 41 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=105, Invalid=275, Unknown=0, NotChecked=0, Total=380 [2023-12-19 14:58:54,001 INFO L413 NwaCegarLoop]: 215 mSDtfsCounter, 531 mSDsluCounter, 1368 mSDsCounter, 0 mSdLazyCounter, 392 mSolverCounterSat, 46 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 531 SdHoareTripleChecker+Valid, 1583 SdHoareTripleChecker+Invalid, 438 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 46 IncrementalHoareTripleChecker+Valid, 392 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2023-12-19 14:58:54,001 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [531 Valid, 1583 Invalid, 438 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [46 Valid, 392 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2023-12-19 14:58:54,001 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 864 states. [2023-12-19 14:58:54,059 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 864 to 841. [2023-12-19 14:58:54,060 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 841 states, 736 states have (on average 1.3233695652173914) internal successors, (974), 740 states have internal predecessors, (974), 86 states have call successors, (86), 18 states have call predecessors, (86), 18 states have return successors, (86), 82 states have call predecessors, (86), 86 states have call successors, (86) [2023-12-19 14:58:54,062 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 841 states to 841 states and 1146 transitions. [2023-12-19 14:58:54,062 INFO L78 Accepts]: Start accepts. Automaton has 841 states and 1146 transitions. Word has length 117 [2023-12-19 14:58:54,062 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-19 14:58:54,062 INFO L495 AbstractCegarLoop]: Abstraction has 841 states and 1146 transitions. [2023-12-19 14:58:54,062 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 5.0) internal successors, (60), 12 states have internal predecessors, (60), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) [2023-12-19 14:58:54,062 INFO L276 IsEmpty]: Start isEmpty. Operand 841 states and 1146 transitions. [2023-12-19 14:58:54,063 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 118 [2023-12-19 14:58:54,063 INFO L187 NwaCegarLoop]: Found error trace [2023-12-19 14:58:54,063 INFO L195 NwaCegarLoop]: trace histogram [12, 12, 12, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-19 14:58:54,063 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable26 [2023-12-19 14:58:54,063 INFO L420 AbstractCegarLoop]: === Iteration 28 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-19 14:58:54,063 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-19 14:58:54,064 INFO L85 PathProgramCache]: Analyzing trace with hash -1516458901, now seen corresponding path program 1 times [2023-12-19 14:58:54,064 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-19 14:58:54,064 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [612408044] [2023-12-19 14:58:54,064 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-19 14:58:54,064 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-19 14:58:54,096 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 14:58:55,121 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-12-19 14:58:55,122 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 14:58:55,124 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2023-12-19 14:58:55,125 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 14:58:55,126 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2023-12-19 14:58:55,127 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 14:58:55,130 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2023-12-19 14:58:55,130 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 14:58:55,132 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2023-12-19 14:58:55,132 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 14:58:55,134 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2023-12-19 14:58:55,134 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 14:58:55,143 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2023-12-19 14:58:55,144 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 14:58:55,145 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2023-12-19 14:58:55,146 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 14:58:55,147 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2023-12-19 14:58:55,148 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 14:58:55,150 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2023-12-19 14:58:55,150 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 14:58:55,152 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2023-12-19 14:58:55,152 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 14:58:55,154 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 80 [2023-12-19 14:58:55,155 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 14:58:55,159 INFO L134 CoverageAnalysis]: Checked inductivity of 264 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 264 trivial. 0 not checked. [2023-12-19 14:58:55,159 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-19 14:58:55,159 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [612408044] [2023-12-19 14:58:55,159 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [612408044] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-19 14:58:55,159 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-19 14:58:55,159 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [19] imperfect sequences [] total 19 [2023-12-19 14:58:55,159 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1394306001] [2023-12-19 14:58:55,159 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-19 14:58:55,160 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 19 states [2023-12-19 14:58:55,160 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-19 14:58:55,160 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2023-12-19 14:58:55,160 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=49, Invalid=293, Unknown=0, NotChecked=0, Total=342 [2023-12-19 14:58:55,160 INFO L87 Difference]: Start difference. First operand 841 states and 1146 transitions. Second operand has 19 states, 17 states have (on average 3.5294117647058822) internal successors, (60), 19 states have internal predecessors, (60), 3 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 2 states have call predecessors, (12), 3 states have call successors, (12) [2023-12-19 14:58:56,483 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-19 14:58:56,484 INFO L93 Difference]: Finished difference Result 1733 states and 2349 transitions. [2023-12-19 14:58:56,484 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2023-12-19 14:58:56,485 INFO L78 Accepts]: Start accepts. Automaton has has 19 states, 17 states have (on average 3.5294117647058822) internal successors, (60), 19 states have internal predecessors, (60), 3 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 2 states have call predecessors, (12), 3 states have call successors, (12) Word has length 117 [2023-12-19 14:58:56,485 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-19 14:58:56,487 INFO L225 Difference]: With dead ends: 1733 [2023-12-19 14:58:56,487 INFO L226 Difference]: Without dead ends: 943 [2023-12-19 14:58:56,489 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 65 GetRequests, 29 SyntacticMatches, 0 SemanticMatches, 36 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 213 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=260, Invalid=1146, Unknown=0, NotChecked=0, Total=1406 [2023-12-19 14:58:56,489 INFO L413 NwaCegarLoop]: 250 mSDtfsCounter, 682 mSDsluCounter, 2941 mSDsCounter, 0 mSdLazyCounter, 1025 mSolverCounterSat, 121 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 682 SdHoareTripleChecker+Valid, 3191 SdHoareTripleChecker+Invalid, 1146 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 121 IncrementalHoareTripleChecker+Valid, 1025 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time [2023-12-19 14:58:56,490 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [682 Valid, 3191 Invalid, 1146 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [121 Valid, 1025 Invalid, 0 Unknown, 0 Unchecked, 0.8s Time] [2023-12-19 14:58:56,490 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 943 states. [2023-12-19 14:58:56,541 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 943 to 800. [2023-12-19 14:58:56,542 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 800 states, 708 states have (on average 1.3192090395480225) internal successors, (934), 711 states have internal predecessors, (934), 74 states have call successors, (74), 17 states have call predecessors, (74), 17 states have return successors, (74), 71 states have call predecessors, (74), 74 states have call successors, (74) [2023-12-19 14:58:56,544 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 800 states to 800 states and 1082 transitions. [2023-12-19 14:58:56,544 INFO L78 Accepts]: Start accepts. Automaton has 800 states and 1082 transitions. Word has length 117 [2023-12-19 14:58:56,544 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-19 14:58:56,544 INFO L495 AbstractCegarLoop]: Abstraction has 800 states and 1082 transitions. [2023-12-19 14:58:56,544 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 19 states, 17 states have (on average 3.5294117647058822) internal successors, (60), 19 states have internal predecessors, (60), 3 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 2 states have call predecessors, (12), 3 states have call successors, (12) [2023-12-19 14:58:56,544 INFO L276 IsEmpty]: Start isEmpty. Operand 800 states and 1082 transitions. [2023-12-19 14:58:56,545 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 120 [2023-12-19 14:58:56,545 INFO L187 NwaCegarLoop]: Found error trace [2023-12-19 14:58:56,545 INFO L195 NwaCegarLoop]: trace histogram [12, 12, 12, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-19 14:58:56,545 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable27 [2023-12-19 14:58:56,545 INFO L420 AbstractCegarLoop]: === Iteration 29 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-19 14:58:56,546 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-19 14:58:56,546 INFO L85 PathProgramCache]: Analyzing trace with hash -188901552, now seen corresponding path program 1 times [2023-12-19 14:58:56,546 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-19 14:58:56,546 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [462451657] [2023-12-19 14:58:56,546 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-19 14:58:56,546 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-19 14:58:56,575 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 14:58:56,959 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-12-19 14:58:56,960 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 14:58:56,961 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2023-12-19 14:58:56,961 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 14:58:56,961 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2023-12-19 14:58:56,962 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 14:58:56,962 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2023-12-19 14:58:56,962 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 14:58:56,963 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2023-12-19 14:58:56,963 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 14:58:56,964 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2023-12-19 14:58:56,964 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 14:58:56,964 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2023-12-19 14:58:56,965 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 14:58:56,966 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2023-12-19 14:58:56,966 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 14:58:56,967 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2023-12-19 14:58:56,967 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 14:58:56,967 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2023-12-19 14:58:56,968 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 14:58:56,968 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2023-12-19 14:58:56,968 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 14:58:56,970 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 80 [2023-12-19 14:58:56,970 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 14:58:56,971 INFO L134 CoverageAnalysis]: Checked inductivity of 264 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 264 trivial. 0 not checked. [2023-12-19 14:58:56,971 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-19 14:58:56,971 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [462451657] [2023-12-19 14:58:56,971 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [462451657] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-19 14:58:56,971 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-19 14:58:56,971 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2023-12-19 14:58:56,971 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [164991789] [2023-12-19 14:58:56,971 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-19 14:58:56,972 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2023-12-19 14:58:56,972 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-19 14:58:56,972 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2023-12-19 14:58:56,972 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=90, Unknown=0, NotChecked=0, Total=110 [2023-12-19 14:58:56,972 INFO L87 Difference]: Start difference. First operand 800 states and 1082 transitions. Second operand has 11 states, 10 states have (on average 6.2) internal successors, (62), 11 states have internal predecessors, (62), 2 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 2 states have call successors, (12) [2023-12-19 14:58:57,229 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-19 14:58:57,230 INFO L93 Difference]: Finished difference Result 1306 states and 1780 transitions. [2023-12-19 14:58:57,230 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2023-12-19 14:58:57,230 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 10 states have (on average 6.2) internal successors, (62), 11 states have internal predecessors, (62), 2 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 2 states have call successors, (12) Word has length 119 [2023-12-19 14:58:57,230 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-19 14:58:57,239 INFO L225 Difference]: With dead ends: 1306 [2023-12-19 14:58:57,239 INFO L226 Difference]: Without dead ends: 913 [2023-12-19 14:58:57,240 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 43 GetRequests, 28 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 10 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=65, Invalid=207, Unknown=0, NotChecked=0, Total=272 [2023-12-19 14:58:57,240 INFO L413 NwaCegarLoop]: 182 mSDtfsCounter, 154 mSDsluCounter, 1432 mSDsCounter, 0 mSdLazyCounter, 280 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 155 SdHoareTripleChecker+Valid, 1614 SdHoareTripleChecker+Invalid, 282 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 280 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-12-19 14:58:57,240 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [155 Valid, 1614 Invalid, 282 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 280 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-12-19 14:58:57,241 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 913 states. [2023-12-19 14:58:57,291 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 913 to 809. [2023-12-19 14:58:57,292 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 809 states, 717 states have (on average 1.3152022315202232) internal successors, (943), 720 states have internal predecessors, (943), 74 states have call successors, (74), 17 states have call predecessors, (74), 17 states have return successors, (74), 71 states have call predecessors, (74), 74 states have call successors, (74) [2023-12-19 14:58:57,293 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 809 states to 809 states and 1091 transitions. [2023-12-19 14:58:57,293 INFO L78 Accepts]: Start accepts. Automaton has 809 states and 1091 transitions. Word has length 119 [2023-12-19 14:58:57,293 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-19 14:58:57,293 INFO L495 AbstractCegarLoop]: Abstraction has 809 states and 1091 transitions. [2023-12-19 14:58:57,293 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 10 states have (on average 6.2) internal successors, (62), 11 states have internal predecessors, (62), 2 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 2 states have call successors, (12) [2023-12-19 14:58:57,294 INFO L276 IsEmpty]: Start isEmpty. Operand 809 states and 1091 transitions. [2023-12-19 14:58:57,294 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 120 [2023-12-19 14:58:57,294 INFO L187 NwaCegarLoop]: Found error trace [2023-12-19 14:58:57,294 INFO L195 NwaCegarLoop]: trace histogram [12, 12, 12, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-19 14:58:57,294 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable28 [2023-12-19 14:58:57,295 INFO L420 AbstractCegarLoop]: === Iteration 30 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-19 14:58:57,295 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-19 14:58:57,295 INFO L85 PathProgramCache]: Analyzing trace with hash -37437127, now seen corresponding path program 1 times [2023-12-19 14:58:57,295 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-19 14:58:57,295 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1457346940] [2023-12-19 14:58:57,295 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-19 14:58:57,295 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-19 14:58:57,322 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 14:58:57,465 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-12-19 14:58:57,466 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 14:58:57,466 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2023-12-19 14:58:57,466 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 14:58:57,467 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2023-12-19 14:58:57,467 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 14:58:57,468 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2023-12-19 14:58:57,468 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 14:58:57,468 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2023-12-19 14:58:57,471 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 14:58:57,474 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2023-12-19 14:58:57,474 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 14:58:57,475 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2023-12-19 14:58:57,475 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 14:58:57,476 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2023-12-19 14:58:57,476 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 14:58:57,476 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2023-12-19 14:58:57,477 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 14:58:57,477 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2023-12-19 14:58:57,477 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 14:58:57,478 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2023-12-19 14:58:57,478 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 14:58:57,479 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 80 [2023-12-19 14:58:57,479 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 14:58:57,480 INFO L134 CoverageAnalysis]: Checked inductivity of 264 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 264 trivial. 0 not checked. [2023-12-19 14:58:57,480 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-19 14:58:57,480 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1457346940] [2023-12-19 14:58:57,480 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1457346940] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-19 14:58:57,480 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-19 14:58:57,480 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2023-12-19 14:58:57,480 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1615322304] [2023-12-19 14:58:57,480 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-19 14:58:57,480 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-12-19 14:58:57,480 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-19 14:58:57,481 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-12-19 14:58:57,481 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2023-12-19 14:58:57,481 INFO L87 Difference]: Start difference. First operand 809 states and 1091 transitions. Second operand has 6 states, 5 states have (on average 12.4) internal successors, (62), 6 states have internal predecessors, (62), 2 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 2 states have call successors, (12) [2023-12-19 14:58:57,606 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-19 14:58:57,606 INFO L93 Difference]: Finished difference Result 1294 states and 1745 transitions. [2023-12-19 14:58:57,607 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-12-19 14:58:57,607 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 12.4) internal successors, (62), 6 states have internal predecessors, (62), 2 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 2 states have call successors, (12) Word has length 119 [2023-12-19 14:58:57,607 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-19 14:58:57,609 INFO L225 Difference]: With dead ends: 1294 [2023-12-19 14:58:57,609 INFO L226 Difference]: Without dead ends: 892 [2023-12-19 14:58:57,610 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 32 GetRequests, 27 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2023-12-19 14:58:57,610 INFO L413 NwaCegarLoop]: 186 mSDtfsCounter, 75 mSDsluCounter, 629 mSDsCounter, 0 mSdLazyCounter, 108 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 76 SdHoareTripleChecker+Valid, 815 SdHoareTripleChecker+Invalid, 110 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 108 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-12-19 14:58:57,610 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [76 Valid, 815 Invalid, 110 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 108 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-12-19 14:58:57,613 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 892 states. [2023-12-19 14:58:57,664 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 892 to 809. [2023-12-19 14:58:57,665 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 809 states, 717 states have (on average 1.3110181311018132) internal successors, (940), 720 states have internal predecessors, (940), 74 states have call successors, (74), 17 states have call predecessors, (74), 17 states have return successors, (74), 71 states have call predecessors, (74), 74 states have call successors, (74) [2023-12-19 14:58:57,667 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 809 states to 809 states and 1088 transitions. [2023-12-19 14:58:57,667 INFO L78 Accepts]: Start accepts. Automaton has 809 states and 1088 transitions. Word has length 119 [2023-12-19 14:58:57,667 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-19 14:58:57,667 INFO L495 AbstractCegarLoop]: Abstraction has 809 states and 1088 transitions. [2023-12-19 14:58:57,667 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 12.4) internal successors, (62), 6 states have internal predecessors, (62), 2 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 2 states have call successors, (12) [2023-12-19 14:58:57,667 INFO L276 IsEmpty]: Start isEmpty. Operand 809 states and 1088 transitions. [2023-12-19 14:58:57,668 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 120 [2023-12-19 14:58:57,668 INFO L187 NwaCegarLoop]: Found error trace [2023-12-19 14:58:57,668 INFO L195 NwaCegarLoop]: trace histogram [12, 12, 12, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-19 14:58:57,668 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable29 [2023-12-19 14:58:57,668 INFO L420 AbstractCegarLoop]: === Iteration 31 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-19 14:58:57,668 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-19 14:58:57,668 INFO L85 PathProgramCache]: Analyzing trace with hash -1634563139, now seen corresponding path program 1 times [2023-12-19 14:58:57,669 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-19 14:58:57,669 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [633220130] [2023-12-19 14:58:57,669 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-19 14:58:57,669 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-19 14:58:57,685 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 14:58:57,749 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-12-19 14:58:57,749 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 14:58:57,750 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2023-12-19 14:58:57,750 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 14:58:57,751 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2023-12-19 14:58:57,751 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 14:58:57,753 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2023-12-19 14:58:57,753 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 14:58:57,754 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2023-12-19 14:58:57,754 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 14:58:57,755 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2023-12-19 14:58:57,755 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 14:58:57,757 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2023-12-19 14:58:57,757 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 14:58:57,758 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2023-12-19 14:58:57,758 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 14:58:57,758 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2023-12-19 14:58:57,759 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 14:58:57,759 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2023-12-19 14:58:57,759 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 14:58:57,760 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2023-12-19 14:58:57,760 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 14:58:57,760 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 80 [2023-12-19 14:58:57,761 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 14:58:57,761 INFO L134 CoverageAnalysis]: Checked inductivity of 264 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 264 trivial. 0 not checked. [2023-12-19 14:58:57,761 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-19 14:58:57,761 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [633220130] [2023-12-19 14:58:57,762 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [633220130] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-19 14:58:57,762 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-19 14:58:57,762 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-12-19 14:58:57,762 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1762423940] [2023-12-19 14:58:57,762 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-19 14:58:57,762 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-12-19 14:58:57,762 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-19 14:58:57,762 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-12-19 14:58:57,762 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2023-12-19 14:58:57,763 INFO L87 Difference]: Start difference. First operand 809 states and 1088 transitions. Second operand has 5 states, 5 states have (on average 12.4) internal successors, (62), 5 states have internal predecessors, (62), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) [2023-12-19 14:58:57,839 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-19 14:58:57,839 INFO L93 Difference]: Finished difference Result 1687 states and 2273 transitions. [2023-12-19 14:58:57,840 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-12-19 14:58:57,840 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 12.4) internal successors, (62), 5 states have internal predecessors, (62), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) Word has length 119 [2023-12-19 14:58:57,840 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-19 14:58:57,846 INFO L225 Difference]: With dead ends: 1687 [2023-12-19 14:58:57,846 INFO L226 Difference]: Without dead ends: 879 [2023-12-19 14:58:57,847 INFO L412 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 [2023-12-19 14:58:57,847 INFO L413 NwaCegarLoop]: 145 mSDtfsCounter, 45 mSDsluCounter, 415 mSDsCounter, 0 mSdLazyCounter, 36 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 45 SdHoareTripleChecker+Valid, 560 SdHoareTripleChecker+Invalid, 38 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 36 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-12-19 14:58:57,847 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [45 Valid, 560 Invalid, 38 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 36 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-12-19 14:58:57,848 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 879 states. [2023-12-19 14:58:57,896 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 879 to 830. [2023-12-19 14:58:57,897 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 830 states, 738 states have (on average 1.3021680216802167) internal successors, (961), 741 states have internal predecessors, (961), 74 states have call successors, (74), 17 states have call predecessors, (74), 17 states have return successors, (74), 71 states have call predecessors, (74), 74 states have call successors, (74) [2023-12-19 14:58:57,898 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 830 states to 830 states and 1109 transitions. [2023-12-19 14:58:57,898 INFO L78 Accepts]: Start accepts. Automaton has 830 states and 1109 transitions. Word has length 119 [2023-12-19 14:58:57,899 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-19 14:58:57,899 INFO L495 AbstractCegarLoop]: Abstraction has 830 states and 1109 transitions. [2023-12-19 14:58:57,899 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 12.4) internal successors, (62), 5 states have internal predecessors, (62), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) [2023-12-19 14:58:57,899 INFO L276 IsEmpty]: Start isEmpty. Operand 830 states and 1109 transitions. [2023-12-19 14:58:57,899 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 121 [2023-12-19 14:58:57,899 INFO L187 NwaCegarLoop]: Found error trace [2023-12-19 14:58:57,900 INFO L195 NwaCegarLoop]: trace histogram [12, 12, 12, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-19 14:58:57,900 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable30 [2023-12-19 14:58:57,900 INFO L420 AbstractCegarLoop]: === Iteration 32 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-19 14:58:57,900 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-19 14:58:57,900 INFO L85 PathProgramCache]: Analyzing trace with hash 935107953, now seen corresponding path program 1 times [2023-12-19 14:58:57,900 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-19 14:58:57,900 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [793173172] [2023-12-19 14:58:57,900 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-19 14:58:57,901 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-19 14:58:57,929 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 14:58:58,837 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-12-19 14:58:58,839 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 14:58:58,841 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2023-12-19 14:58:58,841 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 14:58:58,843 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2023-12-19 14:58:58,843 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 14:58:58,845 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2023-12-19 14:58:58,845 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 14:58:58,847 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2023-12-19 14:58:58,848 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 14:58:58,849 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2023-12-19 14:58:58,850 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 14:58:58,851 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2023-12-19 14:58:58,852 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 14:58:58,853 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2023-12-19 14:58:58,854 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 14:58:58,855 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2023-12-19 14:58:58,856 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 14:58:58,857 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2023-12-19 14:58:58,858 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 14:58:58,860 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2023-12-19 14:58:58,861 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 14:58:58,868 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 80 [2023-12-19 14:58:58,869 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 14:58:58,874 INFO L134 CoverageAnalysis]: Checked inductivity of 264 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 264 trivial. 0 not checked. [2023-12-19 14:58:58,874 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-19 14:58:58,874 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [793173172] [2023-12-19 14:58:58,874 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [793173172] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-19 14:58:58,874 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-19 14:58:58,874 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [15] imperfect sequences [] total 15 [2023-12-19 14:58:58,875 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2066186152] [2023-12-19 14:58:58,875 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-19 14:58:58,875 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 15 states [2023-12-19 14:58:58,875 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-19 14:58:58,876 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2023-12-19 14:58:58,876 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=35, Invalid=175, Unknown=0, NotChecked=0, Total=210 [2023-12-19 14:58:58,876 INFO L87 Difference]: Start difference. First operand 830 states and 1109 transitions. Second operand has 15 states, 14 states have (on average 4.5) internal successors, (63), 15 states have internal predecessors, (63), 3 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 2 states have call predecessors, (12), 3 states have call successors, (12) [2023-12-19 14:58:59,793 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-19 14:58:59,794 INFO L93 Difference]: Finished difference Result 1787 states and 2386 transitions. [2023-12-19 14:58:59,794 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2023-12-19 14:58:59,794 INFO L78 Accepts]: Start accepts. Automaton has has 15 states, 14 states have (on average 4.5) internal successors, (63), 15 states have internal predecessors, (63), 3 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 2 states have call predecessors, (12), 3 states have call successors, (12) Word has length 120 [2023-12-19 14:58:59,794 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-19 14:58:59,801 INFO L225 Difference]: With dead ends: 1787 [2023-12-19 14:58:59,801 INFO L226 Difference]: Without dead ends: 958 [2023-12-19 14:58:59,803 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 54 GetRequests, 27 SyntacticMatches, 0 SemanticMatches, 27 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 103 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=205, Invalid=607, Unknown=0, NotChecked=0, Total=812 [2023-12-19 14:58:59,803 INFO L413 NwaCegarLoop]: 221 mSDtfsCounter, 863 mSDsluCounter, 1779 mSDsCounter, 0 mSdLazyCounter, 589 mSolverCounterSat, 161 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 863 SdHoareTripleChecker+Valid, 2000 SdHoareTripleChecker+Invalid, 750 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 161 IncrementalHoareTripleChecker+Valid, 589 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2023-12-19 14:58:59,804 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [863 Valid, 2000 Invalid, 750 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [161 Valid, 589 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2023-12-19 14:58:59,805 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 958 states. [2023-12-19 14:58:59,857 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 958 to 838. [2023-12-19 14:58:59,859 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 838 states, 746 states have (on average 1.2989276139410189) internal successors, (969), 749 states have internal predecessors, (969), 74 states have call successors, (74), 17 states have call predecessors, (74), 17 states have return successors, (74), 71 states have call predecessors, (74), 74 states have call successors, (74) [2023-12-19 14:58:59,860 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 838 states to 838 states and 1117 transitions. [2023-12-19 14:58:59,861 INFO L78 Accepts]: Start accepts. Automaton has 838 states and 1117 transitions. Word has length 120 [2023-12-19 14:58:59,861 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-19 14:58:59,861 INFO L495 AbstractCegarLoop]: Abstraction has 838 states and 1117 transitions. [2023-12-19 14:58:59,861 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 15 states, 14 states have (on average 4.5) internal successors, (63), 15 states have internal predecessors, (63), 3 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 2 states have call predecessors, (12), 3 states have call successors, (12) [2023-12-19 14:58:59,861 INFO L276 IsEmpty]: Start isEmpty. Operand 838 states and 1117 transitions. [2023-12-19 14:58:59,862 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 121 [2023-12-19 14:58:59,862 INFO L187 NwaCegarLoop]: Found error trace [2023-12-19 14:58:59,862 INFO L195 NwaCegarLoop]: trace histogram [12, 12, 12, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-19 14:58:59,862 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable31 [2023-12-19 14:58:59,862 INFO L420 AbstractCegarLoop]: === Iteration 33 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-19 14:58:59,862 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-19 14:58:59,862 INFO L85 PathProgramCache]: Analyzing trace with hash 1328134963, now seen corresponding path program 1 times [2023-12-19 14:58:59,862 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-19 14:58:59,862 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1260307102] [2023-12-19 14:58:59,862 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-19 14:58:59,863 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-19 14:58:59,888 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 14:59:00,239 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-12-19 14:59:00,240 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 14:59:00,244 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2023-12-19 14:59:00,245 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 14:59:00,247 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2023-12-19 14:59:00,247 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 14:59:00,248 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2023-12-19 14:59:00,249 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 14:59:00,250 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2023-12-19 14:59:00,250 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 14:59:00,251 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2023-12-19 14:59:00,252 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 14:59:00,253 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2023-12-19 14:59:00,253 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 14:59:00,254 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2023-12-19 14:59:00,255 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 14:59:00,256 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2023-12-19 14:59:00,257 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 14:59:00,258 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2023-12-19 14:59:00,258 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 14:59:00,259 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2023-12-19 14:59:00,260 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 14:59:00,263 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 80 [2023-12-19 14:59:00,264 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 14:59:00,266 INFO L134 CoverageAnalysis]: Checked inductivity of 264 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 264 trivial. 0 not checked. [2023-12-19 14:59:00,266 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-19 14:59:00,266 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1260307102] [2023-12-19 14:59:00,266 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1260307102] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-19 14:59:00,266 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-19 14:59:00,266 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2023-12-19 14:59:00,266 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1363922526] [2023-12-19 14:59:00,266 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-19 14:59:00,267 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2023-12-19 14:59:00,267 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-19 14:59:00,267 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2023-12-19 14:59:00,267 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=53, Unknown=0, NotChecked=0, Total=72 [2023-12-19 14:59:00,267 INFO L87 Difference]: Start difference. First operand 838 states and 1117 transitions. Second operand has 9 states, 8 states have (on average 7.875) internal successors, (63), 9 states have internal predecessors, (63), 2 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 2 states have call successors, (12) [2023-12-19 14:59:00,664 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-19 14:59:00,664 INFO L93 Difference]: Finished difference Result 1731 states and 2306 transitions. [2023-12-19 14:59:00,664 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2023-12-19 14:59:00,665 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 8 states have (on average 7.875) internal successors, (63), 9 states have internal predecessors, (63), 2 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 2 states have call successors, (12) Word has length 120 [2023-12-19 14:59:00,665 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-19 14:59:00,666 INFO L225 Difference]: With dead ends: 1731 [2023-12-19 14:59:00,666 INFO L226 Difference]: Without dead ends: 894 [2023-12-19 14:59:00,667 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 42 GetRequests, 29 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 15 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=61, Invalid=149, Unknown=0, NotChecked=0, Total=210 [2023-12-19 14:59:00,668 INFO L413 NwaCegarLoop]: 240 mSDtfsCounter, 319 mSDsluCounter, 999 mSDsCounter, 0 mSdLazyCounter, 377 mSolverCounterSat, 59 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 319 SdHoareTripleChecker+Valid, 1239 SdHoareTripleChecker+Invalid, 436 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 59 IncrementalHoareTripleChecker+Valid, 377 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2023-12-19 14:59:00,668 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [319 Valid, 1239 Invalid, 436 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [59 Valid, 377 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2023-12-19 14:59:00,668 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 894 states. [2023-12-19 14:59:00,723 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 894 to 821. [2023-12-19 14:59:00,724 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 821 states, 729 states have (on average 1.297668038408779) internal successors, (946), 732 states have internal predecessors, (946), 74 states have call successors, (74), 17 states have call predecessors, (74), 17 states have return successors, (74), 71 states have call predecessors, (74), 74 states have call successors, (74) [2023-12-19 14:59:00,726 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 821 states to 821 states and 1094 transitions. [2023-12-19 14:59:00,726 INFO L78 Accepts]: Start accepts. Automaton has 821 states and 1094 transitions. Word has length 120 [2023-12-19 14:59:00,726 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-19 14:59:00,726 INFO L495 AbstractCegarLoop]: Abstraction has 821 states and 1094 transitions. [2023-12-19 14:59:00,726 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 8 states have (on average 7.875) internal successors, (63), 9 states have internal predecessors, (63), 2 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 2 states have call successors, (12) [2023-12-19 14:59:00,726 INFO L276 IsEmpty]: Start isEmpty. Operand 821 states and 1094 transitions. [2023-12-19 14:59:00,727 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 122 [2023-12-19 14:59:00,727 INFO L187 NwaCegarLoop]: Found error trace [2023-12-19 14:59:00,727 INFO L195 NwaCegarLoop]: trace histogram [12, 12, 12, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-19 14:59:00,727 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable32 [2023-12-19 14:59:00,727 INFO L420 AbstractCegarLoop]: === Iteration 34 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-19 14:59:00,727 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-19 14:59:00,728 INFO L85 PathProgramCache]: Analyzing trace with hash -265899400, now seen corresponding path program 1 times [2023-12-19 14:59:00,728 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-19 14:59:00,728 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1503810883] [2023-12-19 14:59:00,728 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-19 14:59:00,728 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-19 14:59:00,750 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 14:59:00,908 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-12-19 14:59:00,909 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 14:59:00,909 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2023-12-19 14:59:00,910 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 14:59:00,910 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2023-12-19 14:59:00,910 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 14:59:00,911 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2023-12-19 14:59:00,911 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 14:59:00,911 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2023-12-19 14:59:00,912 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 14:59:00,912 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2023-12-19 14:59:00,913 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 14:59:00,913 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2023-12-19 14:59:00,913 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 14:59:00,914 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2023-12-19 14:59:00,914 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 14:59:00,914 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2023-12-19 14:59:00,915 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 14:59:00,915 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2023-12-19 14:59:00,915 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 14:59:00,916 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2023-12-19 14:59:00,916 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 14:59:00,917 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 80 [2023-12-19 14:59:00,917 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 14:59:00,918 INFO L134 CoverageAnalysis]: Checked inductivity of 264 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 264 trivial. 0 not checked. [2023-12-19 14:59:00,918 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-19 14:59:00,918 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1503810883] [2023-12-19 14:59:00,918 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1503810883] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-19 14:59:00,918 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-19 14:59:00,918 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2023-12-19 14:59:00,918 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1017024980] [2023-12-19 14:59:00,918 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-19 14:59:00,919 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-12-19 14:59:00,919 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-19 14:59:00,920 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-12-19 14:59:00,920 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2023-12-19 14:59:00,921 INFO L87 Difference]: Start difference. First operand 821 states and 1094 transitions. Second operand has 6 states, 5 states have (on average 12.8) internal successors, (64), 6 states have internal predecessors, (64), 2 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 2 states have call successors, (12) [2023-12-19 14:59:01,045 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-19 14:59:01,045 INFO L93 Difference]: Finished difference Result 1746 states and 2323 transitions. [2023-12-19 14:59:01,046 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2023-12-19 14:59:01,046 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 12.8) internal successors, (64), 6 states have internal predecessors, (64), 2 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 2 states have call successors, (12) Word has length 121 [2023-12-19 14:59:01,046 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-19 14:59:01,047 INFO L225 Difference]: With dead ends: 1746 [2023-12-19 14:59:01,047 INFO L226 Difference]: Without dead ends: 926 [2023-12-19 14:59:01,049 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 32 GetRequests, 27 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2023-12-19 14:59:01,049 INFO L413 NwaCegarLoop]: 151 mSDtfsCounter, 137 mSDsluCounter, 421 mSDsCounter, 0 mSdLazyCounter, 82 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 138 SdHoareTripleChecker+Valid, 572 SdHoareTripleChecker+Invalid, 89 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 82 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-12-19 14:59:01,050 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [138 Valid, 572 Invalid, 89 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 82 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-12-19 14:59:01,050 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 926 states. [2023-12-19 14:59:01,125 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 926 to 804. [2023-12-19 14:59:01,126 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 804 states, 712 states have (on average 1.2879213483146068) internal successors, (917), 715 states have internal predecessors, (917), 74 states have call successors, (74), 17 states have call predecessors, (74), 17 states have return successors, (74), 71 states have call predecessors, (74), 74 states have call successors, (74) [2023-12-19 14:59:01,128 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 804 states to 804 states and 1065 transitions. [2023-12-19 14:59:01,128 INFO L78 Accepts]: Start accepts. Automaton has 804 states and 1065 transitions. Word has length 121 [2023-12-19 14:59:01,129 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-19 14:59:01,129 INFO L495 AbstractCegarLoop]: Abstraction has 804 states and 1065 transitions. [2023-12-19 14:59:01,129 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 12.8) internal successors, (64), 6 states have internal predecessors, (64), 2 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 2 states have call successors, (12) [2023-12-19 14:59:01,129 INFO L276 IsEmpty]: Start isEmpty. Operand 804 states and 1065 transitions. [2023-12-19 14:59:01,130 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 124 [2023-12-19 14:59:01,130 INFO L187 NwaCegarLoop]: Found error trace [2023-12-19 14:59:01,130 INFO L195 NwaCegarLoop]: trace histogram [12, 12, 12, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-19 14:59:01,130 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable33 [2023-12-19 14:59:01,130 INFO L420 AbstractCegarLoop]: === Iteration 35 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-19 14:59:01,130 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-19 14:59:01,130 INFO L85 PathProgramCache]: Analyzing trace with hash -614941095, now seen corresponding path program 1 times [2023-12-19 14:59:01,130 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-19 14:59:01,130 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2009164832] [2023-12-19 14:59:01,130 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-19 14:59:01,130 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-19 14:59:01,177 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 14:59:02,828 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-12-19 14:59:02,829 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 14:59:02,830 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2023-12-19 14:59:02,830 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 14:59:02,831 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2023-12-19 14:59:02,831 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 14:59:02,831 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2023-12-19 14:59:02,831 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 14:59:02,832 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2023-12-19 14:59:02,832 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 14:59:02,833 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2023-12-19 14:59:02,833 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 14:59:02,833 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2023-12-19 14:59:02,833 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 14:59:02,834 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2023-12-19 14:59:02,834 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 14:59:02,834 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2023-12-19 14:59:02,835 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 14:59:02,837 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2023-12-19 14:59:02,838 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 14:59:02,839 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2023-12-19 14:59:02,839 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 14:59:02,840 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 80 [2023-12-19 14:59:02,841 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 14:59:02,844 INFO L134 CoverageAnalysis]: Checked inductivity of 264 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 264 trivial. 0 not checked. [2023-12-19 14:59:02,844 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-19 14:59:02,845 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2009164832] [2023-12-19 14:59:02,845 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2009164832] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-19 14:59:02,845 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-19 14:59:02,845 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [21] imperfect sequences [] total 21 [2023-12-19 14:59:02,845 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [314587351] [2023-12-19 14:59:02,845 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-19 14:59:02,845 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 21 states [2023-12-19 14:59:02,845 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-19 14:59:02,845 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2023-12-19 14:59:02,846 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=52, Invalid=368, Unknown=0, NotChecked=0, Total=420 [2023-12-19 14:59:02,846 INFO L87 Difference]: Start difference. First operand 804 states and 1065 transitions. Second operand has 21 states, 19 states have (on average 3.473684210526316) internal successors, (66), 21 states have internal predecessors, (66), 4 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 2 states have call predecessors, (12), 4 states have call successors, (12) [2023-12-19 14:59:09,709 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-19 14:59:09,709 INFO L93 Difference]: Finished difference Result 1685 states and 2243 transitions. [2023-12-19 14:59:09,709 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 43 states. [2023-12-19 14:59:09,709 INFO L78 Accepts]: Start accepts. Automaton has has 21 states, 19 states have (on average 3.473684210526316) internal successors, (66), 21 states have internal predecessors, (66), 4 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 2 states have call predecessors, (12), 4 states have call successors, (12) Word has length 123 [2023-12-19 14:59:09,709 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-19 14:59:09,711 INFO L225 Difference]: With dead ends: 1685 [2023-12-19 14:59:09,711 INFO L226 Difference]: Without dead ends: 1271 [2023-12-19 14:59:09,712 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 81 GetRequests, 28 SyntacticMatches, 0 SemanticMatches, 53 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 611 ImplicationChecksByTransitivity, 5.3s TimeCoverageRelationStatistics Valid=603, Invalid=2367, Unknown=0, NotChecked=0, Total=2970 [2023-12-19 14:59:09,713 INFO L413 NwaCegarLoop]: 217 mSDtfsCounter, 773 mSDsluCounter, 2502 mSDsCounter, 0 mSdLazyCounter, 1256 mSolverCounterSat, 39 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 775 SdHoareTripleChecker+Valid, 2719 SdHoareTripleChecker+Invalid, 1295 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 39 IncrementalHoareTripleChecker+Valid, 1256 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.9s IncrementalHoareTripleChecker+Time [2023-12-19 14:59:09,713 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [775 Valid, 2719 Invalid, 1295 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [39 Valid, 1256 Invalid, 0 Unknown, 0 Unchecked, 1.9s Time] [2023-12-19 14:59:09,713 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1271 states. [2023-12-19 14:59:09,786 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1271 to 947. [2023-12-19 14:59:09,787 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 947 states, 845 states have (on average 1.2875739644970414) internal successors, (1088), 849 states have internal predecessors, (1088), 82 states have call successors, (82), 19 states have call predecessors, (82), 19 states have return successors, (82), 78 states have call predecessors, (82), 82 states have call successors, (82) [2023-12-19 14:59:09,788 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 947 states to 947 states and 1252 transitions. [2023-12-19 14:59:09,788 INFO L78 Accepts]: Start accepts. Automaton has 947 states and 1252 transitions. Word has length 123 [2023-12-19 14:59:09,789 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-19 14:59:09,789 INFO L495 AbstractCegarLoop]: Abstraction has 947 states and 1252 transitions. [2023-12-19 14:59:09,789 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 21 states, 19 states have (on average 3.473684210526316) internal successors, (66), 21 states have internal predecessors, (66), 4 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 2 states have call predecessors, (12), 4 states have call successors, (12) [2023-12-19 14:59:09,789 INFO L276 IsEmpty]: Start isEmpty. Operand 947 states and 1252 transitions. [2023-12-19 14:59:09,790 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 124 [2023-12-19 14:59:09,790 INFO L187 NwaCegarLoop]: Found error trace [2023-12-19 14:59:09,790 INFO L195 NwaCegarLoop]: trace histogram [12, 12, 12, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-19 14:59:09,790 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable34 [2023-12-19 14:59:09,790 INFO L420 AbstractCegarLoop]: === Iteration 36 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-19 14:59:09,790 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-19 14:59:09,790 INFO L85 PathProgramCache]: Analyzing trace with hash -1424287721, now seen corresponding path program 1 times [2023-12-19 14:59:09,790 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-19 14:59:09,790 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1739175866] [2023-12-19 14:59:09,790 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-19 14:59:09,790 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-19 14:59:09,808 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 14:59:09,980 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-12-19 14:59:09,981 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 14:59:09,982 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2023-12-19 14:59:09,982 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 14:59:09,983 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2023-12-19 14:59:09,983 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 14:59:09,983 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2023-12-19 14:59:09,984 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 14:59:09,984 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2023-12-19 14:59:09,984 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 14:59:09,985 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2023-12-19 14:59:09,985 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 14:59:09,985 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2023-12-19 14:59:09,986 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 14:59:09,986 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2023-12-19 14:59:09,986 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 14:59:09,987 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2023-12-19 14:59:09,987 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 14:59:09,987 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2023-12-19 14:59:09,988 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 14:59:09,989 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2023-12-19 14:59:09,989 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 14:59:09,989 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 80 [2023-12-19 14:59:09,990 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 14:59:09,990 INFO L134 CoverageAnalysis]: Checked inductivity of 264 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 264 trivial. 0 not checked. [2023-12-19 14:59:09,990 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-19 14:59:09,990 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1739175866] [2023-12-19 14:59:09,990 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1739175866] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-19 14:59:09,990 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-19 14:59:09,991 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2023-12-19 14:59:09,991 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [323386711] [2023-12-19 14:59:09,991 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-19 14:59:09,991 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-12-19 14:59:09,991 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-19 14:59:09,991 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-12-19 14:59:09,992 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2023-12-19 14:59:09,992 INFO L87 Difference]: Start difference. First operand 947 states and 1252 transitions. Second operand has 6 states, 5 states have (on average 13.2) internal successors, (66), 6 states have internal predecessors, (66), 2 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 2 states have call successors, (12) [2023-12-19 14:59:10,153 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-19 14:59:10,153 INFO L93 Difference]: Finished difference Result 1582 states and 2099 transitions. [2023-12-19 14:59:10,153 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2023-12-19 14:59:10,163 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 13.2) internal successors, (66), 6 states have internal predecessors, (66), 2 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 2 states have call successors, (12) Word has length 123 [2023-12-19 14:59:10,163 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-19 14:59:10,165 INFO L225 Difference]: With dead ends: 1582 [2023-12-19 14:59:10,165 INFO L226 Difference]: Without dead ends: 1025 [2023-12-19 14:59:10,166 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 33 GetRequests, 28 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2023-12-19 14:59:10,166 INFO L413 NwaCegarLoop]: 251 mSDtfsCounter, 104 mSDsluCounter, 780 mSDsCounter, 0 mSdLazyCounter, 187 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 105 SdHoareTripleChecker+Valid, 1031 SdHoareTripleChecker+Invalid, 188 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 187 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-12-19 14:59:10,167 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [105 Valid, 1031 Invalid, 188 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 187 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-12-19 14:59:10,167 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1025 states. [2023-12-19 14:59:10,238 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1025 to 943. [2023-12-19 14:59:10,240 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 943 states, 841 states have (on average 1.2853745541022592) internal successors, (1081), 845 states have internal predecessors, (1081), 82 states have call successors, (82), 19 states have call predecessors, (82), 19 states have return successors, (82), 78 states have call predecessors, (82), 82 states have call successors, (82) [2023-12-19 14:59:10,241 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 943 states to 943 states and 1245 transitions. [2023-12-19 14:59:10,241 INFO L78 Accepts]: Start accepts. Automaton has 943 states and 1245 transitions. Word has length 123 [2023-12-19 14:59:10,241 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-19 14:59:10,241 INFO L495 AbstractCegarLoop]: Abstraction has 943 states and 1245 transitions. [2023-12-19 14:59:10,242 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 13.2) internal successors, (66), 6 states have internal predecessors, (66), 2 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 2 states have call successors, (12) [2023-12-19 14:59:10,242 INFO L276 IsEmpty]: Start isEmpty. Operand 943 states and 1245 transitions. [2023-12-19 14:59:10,242 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 124 [2023-12-19 14:59:10,242 INFO L187 NwaCegarLoop]: Found error trace [2023-12-19 14:59:10,242 INFO L195 NwaCegarLoop]: trace histogram [12, 12, 12, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-19 14:59:10,242 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable35 [2023-12-19 14:59:10,243 INFO L420 AbstractCegarLoop]: === Iteration 37 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-19 14:59:10,243 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-19 14:59:10,243 INFO L85 PathProgramCache]: Analyzing trace with hash -340181481, now seen corresponding path program 1 times [2023-12-19 14:59:10,243 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-19 14:59:10,243 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1416357087] [2023-12-19 14:59:10,243 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-19 14:59:10,243 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-19 14:59:10,263 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 14:59:10,397 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-12-19 14:59:10,397 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 14:59:10,398 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2023-12-19 14:59:10,399 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 14:59:10,399 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2023-12-19 14:59:10,400 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 14:59:10,400 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2023-12-19 14:59:10,400 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 14:59:10,401 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2023-12-19 14:59:10,401 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 14:59:10,403 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2023-12-19 14:59:10,403 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 14:59:10,403 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2023-12-19 14:59:10,404 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 14:59:10,404 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2023-12-19 14:59:10,404 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 14:59:10,405 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2023-12-19 14:59:10,405 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 14:59:10,406 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2023-12-19 14:59:10,406 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 14:59:10,406 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2023-12-19 14:59:10,407 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 14:59:10,407 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 80 [2023-12-19 14:59:10,407 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 14:59:10,408 INFO L134 CoverageAnalysis]: Checked inductivity of 264 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 264 trivial. 0 not checked. [2023-12-19 14:59:10,408 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-19 14:59:10,408 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1416357087] [2023-12-19 14:59:10,408 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1416357087] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-19 14:59:10,408 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-19 14:59:10,408 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2023-12-19 14:59:10,408 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1011767674] [2023-12-19 14:59:10,408 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-19 14:59:10,409 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-12-19 14:59:10,409 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-19 14:59:10,410 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-12-19 14:59:10,410 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2023-12-19 14:59:10,410 INFO L87 Difference]: Start difference. First operand 943 states and 1245 transitions. Second operand has 6 states, 5 states have (on average 13.2) internal successors, (66), 6 states have internal predecessors, (66), 2 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 2 states have call successors, (12) [2023-12-19 14:59:10,624 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-19 14:59:10,625 INFO L93 Difference]: Finished difference Result 1748 states and 2328 transitions. [2023-12-19 14:59:10,625 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2023-12-19 14:59:10,625 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 13.2) internal successors, (66), 6 states have internal predecessors, (66), 2 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 2 states have call successors, (12) Word has length 123 [2023-12-19 14:59:10,625 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-19 14:59:10,627 INFO L225 Difference]: With dead ends: 1748 [2023-12-19 14:59:10,627 INFO L226 Difference]: Without dead ends: 1195 [2023-12-19 14:59:10,628 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 34 GetRequests, 28 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2023-12-19 14:59:10,628 INFO L413 NwaCegarLoop]: 196 mSDtfsCounter, 110 mSDsluCounter, 640 mSDsCounter, 0 mSdLazyCounter, 145 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 111 SdHoareTripleChecker+Valid, 836 SdHoareTripleChecker+Invalid, 147 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 145 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-12-19 14:59:10,628 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [111 Valid, 836 Invalid, 147 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 145 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-12-19 14:59:10,629 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1195 states. [2023-12-19 14:59:10,706 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1195 to 931. [2023-12-19 14:59:10,707 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 931 states, 829 states have (on average 1.2858866103739446) internal successors, (1066), 833 states have internal predecessors, (1066), 82 states have call successors, (82), 19 states have call predecessors, (82), 19 states have return successors, (82), 78 states have call predecessors, (82), 82 states have call successors, (82) [2023-12-19 14:59:10,708 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 931 states to 931 states and 1230 transitions. [2023-12-19 14:59:10,709 INFO L78 Accepts]: Start accepts. Automaton has 931 states and 1230 transitions. Word has length 123 [2023-12-19 14:59:10,709 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-19 14:59:10,709 INFO L495 AbstractCegarLoop]: Abstraction has 931 states and 1230 transitions. [2023-12-19 14:59:10,709 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 13.2) internal successors, (66), 6 states have internal predecessors, (66), 2 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 2 states have call successors, (12) [2023-12-19 14:59:10,709 INFO L276 IsEmpty]: Start isEmpty. Operand 931 states and 1230 transitions. [2023-12-19 14:59:10,710 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 124 [2023-12-19 14:59:10,710 INFO L187 NwaCegarLoop]: Found error trace [2023-12-19 14:59:10,710 INFO L195 NwaCegarLoop]: trace histogram [12, 12, 12, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-19 14:59:10,710 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable36 [2023-12-19 14:59:10,710 INFO L420 AbstractCegarLoop]: === Iteration 38 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-19 14:59:10,710 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-19 14:59:10,710 INFO L85 PathProgramCache]: Analyzing trace with hash -1149528107, now seen corresponding path program 1 times [2023-12-19 14:59:10,710 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-19 14:59:10,710 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [453348735] [2023-12-19 14:59:10,710 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-19 14:59:10,710 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-19 14:59:10,743 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 14:59:11,385 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-12-19 14:59:11,385 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 14:59:11,386 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2023-12-19 14:59:11,386 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 14:59:11,387 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2023-12-19 14:59:11,387 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 14:59:11,387 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2023-12-19 14:59:11,388 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 14:59:11,388 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2023-12-19 14:59:11,389 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 14:59:11,389 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2023-12-19 14:59:11,389 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 14:59:11,390 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2023-12-19 14:59:11,390 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 14:59:11,390 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2023-12-19 14:59:11,391 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 14:59:11,391 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2023-12-19 14:59:11,391 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 14:59:11,392 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2023-12-19 14:59:11,392 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 14:59:11,393 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2023-12-19 14:59:11,393 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 14:59:11,393 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 80 [2023-12-19 14:59:11,394 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 14:59:11,395 INFO L134 CoverageAnalysis]: Checked inductivity of 264 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 264 trivial. 0 not checked. [2023-12-19 14:59:11,395 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-19 14:59:11,395 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [453348735] [2023-12-19 14:59:11,395 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [453348735] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-19 14:59:11,395 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-19 14:59:11,395 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2023-12-19 14:59:11,395 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [775077925] [2023-12-19 14:59:11,395 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-19 14:59:11,395 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2023-12-19 14:59:11,395 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-19 14:59:11,396 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2023-12-19 14:59:11,396 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=90, Unknown=0, NotChecked=0, Total=110 [2023-12-19 14:59:11,396 INFO L87 Difference]: Start difference. First operand 931 states and 1230 transitions. Second operand has 11 states, 10 states have (on average 6.6) internal successors, (66), 11 states have internal predecessors, (66), 2 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 2 states have call successors, (12) [2023-12-19 14:59:12,096 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-19 14:59:12,097 INFO L93 Difference]: Finished difference Result 1642 states and 2183 transitions. [2023-12-19 14:59:12,097 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2023-12-19 14:59:12,097 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 10 states have (on average 6.6) internal successors, (66), 11 states have internal predecessors, (66), 2 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 2 states have call successors, (12) Word has length 123 [2023-12-19 14:59:12,097 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-19 14:59:12,099 INFO L225 Difference]: With dead ends: 1642 [2023-12-19 14:59:12,099 INFO L226 Difference]: Without dead ends: 1101 [2023-12-19 14:59:12,100 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 46 GetRequests, 28 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 28 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=93, Invalid=287, Unknown=0, NotChecked=0, Total=380 [2023-12-19 14:59:12,100 INFO L413 NwaCegarLoop]: 246 mSDtfsCounter, 164 mSDsluCounter, 1628 mSDsCounter, 0 mSdLazyCounter, 387 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 165 SdHoareTripleChecker+Valid, 1874 SdHoareTripleChecker+Invalid, 391 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 387 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2023-12-19 14:59:12,100 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [165 Valid, 1874 Invalid, 391 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 387 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2023-12-19 14:59:12,101 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1101 states. [2023-12-19 14:59:12,199 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1101 to 925. [2023-12-19 14:59:12,200 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 925 states, 823 states have (on average 1.2867557715674363) internal successors, (1059), 827 states have internal predecessors, (1059), 82 states have call successors, (82), 19 states have call predecessors, (82), 19 states have return successors, (82), 78 states have call predecessors, (82), 82 states have call successors, (82) [2023-12-19 14:59:12,203 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 925 states to 925 states and 1223 transitions. [2023-12-19 14:59:12,203 INFO L78 Accepts]: Start accepts. Automaton has 925 states and 1223 transitions. Word has length 123 [2023-12-19 14:59:12,204 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-19 14:59:12,204 INFO L495 AbstractCegarLoop]: Abstraction has 925 states and 1223 transitions. [2023-12-19 14:59:12,204 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 10 states have (on average 6.6) internal successors, (66), 11 states have internal predecessors, (66), 2 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 2 states have call successors, (12) [2023-12-19 14:59:12,204 INFO L276 IsEmpty]: Start isEmpty. Operand 925 states and 1223 transitions. [2023-12-19 14:59:12,205 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 124 [2023-12-19 14:59:12,205 INFO L187 NwaCegarLoop]: Found error trace [2023-12-19 14:59:12,205 INFO L195 NwaCegarLoop]: trace histogram [12, 12, 12, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-19 14:59:12,205 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable37 [2023-12-19 14:59:12,205 INFO L420 AbstractCegarLoop]: === Iteration 39 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-19 14:59:12,205 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-19 14:59:12,205 INFO L85 PathProgramCache]: Analyzing trace with hash -170168634, now seen corresponding path program 1 times [2023-12-19 14:59:12,205 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-19 14:59:12,205 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [594310066] [2023-12-19 14:59:12,205 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-19 14:59:12,206 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-19 14:59:12,248 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-12-19 14:59:12,249 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-12-19 14:59:12,275 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-12-19 14:59:12,315 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2023-12-19 14:59:12,316 INFO L360 BasicCegarLoop]: Counterexample is feasible [2023-12-19 14:59:12,316 INFO L805 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2023-12-19 14:59:12,317 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable38 [2023-12-19 14:59:12,320 INFO L445 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-19 14:59:12,322 INFO L179 ceAbstractionStarter]: Computing trace abstraction results [2023-12-19 14:59:12,387 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 19.12 02:59:12 BoogieIcfgContainer [2023-12-19 14:59:12,387 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2023-12-19 14:59:12,388 INFO L158 Benchmark]: Toolchain (without parser) took 40578.73ms. Allocated memory was 184.5MB in the beginning and 739.2MB in the end (delta: 554.7MB). Free memory was 144.7MB in the beginning and 625.1MB in the end (delta: -480.4MB). Peak memory consumption was 75.2MB. Max. memory is 8.0GB. [2023-12-19 14:59:12,388 INFO L158 Benchmark]: CDTParser took 0.50ms. Allocated memory is still 184.5MB. Free memory is still 141.2MB. There was no memory consumed. Max. memory is 8.0GB. [2023-12-19 14:59:12,388 INFO L158 Benchmark]: CACSL2BoogieTranslator took 229.68ms. Allocated memory is still 184.5MB. Free memory was 144.7MB in the beginning and 130.2MB in the end (delta: 14.6MB). Peak memory consumption was 14.7MB. Max. memory is 8.0GB. [2023-12-19 14:59:12,388 INFO L158 Benchmark]: Boogie Procedure Inliner took 42.34ms. Allocated memory is still 184.5MB. Free memory was 130.2MB in the beginning and 126.3MB in the end (delta: 3.8MB). Peak memory consumption was 4.2MB. Max. memory is 8.0GB. [2023-12-19 14:59:12,388 INFO L158 Benchmark]: Boogie Preprocessor took 72.49ms. Allocated memory is still 184.5MB. Free memory was 126.3MB in the beginning and 121.4MB in the end (delta: 4.9MB). Peak memory consumption was 4.2MB. Max. memory is 8.0GB. [2023-12-19 14:59:12,388 INFO L158 Benchmark]: RCFGBuilder took 617.60ms. Allocated memory is still 184.5MB. Free memory was 121.4MB in the beginning and 155.4MB in the end (delta: -34.0MB). Peak memory consumption was 39.9MB. Max. memory is 8.0GB. [2023-12-19 14:59:12,388 INFO L158 Benchmark]: TraceAbstraction took 39612.55ms. Allocated memory was 184.5MB in the beginning and 739.2MB in the end (delta: 554.7MB). Free memory was 154.9MB in the beginning and 625.1MB in the end (delta: -470.2MB). Peak memory consumption was 83.5MB. Max. memory is 8.0GB. [2023-12-19 14:59:12,389 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.50ms. Allocated memory is still 184.5MB. Free memory is still 141.2MB. There was no memory consumed. Max. memory is 8.0GB. * CACSL2BoogieTranslator took 229.68ms. Allocated memory is still 184.5MB. Free memory was 144.7MB in the beginning and 130.2MB in the end (delta: 14.6MB). Peak memory consumption was 14.7MB. Max. memory is 8.0GB. * Boogie Procedure Inliner took 42.34ms. Allocated memory is still 184.5MB. Free memory was 130.2MB in the beginning and 126.3MB in the end (delta: 3.8MB). Peak memory consumption was 4.2MB. Max. memory is 8.0GB. * Boogie Preprocessor took 72.49ms. Allocated memory is still 184.5MB. Free memory was 126.3MB in the beginning and 121.4MB in the end (delta: 4.9MB). Peak memory consumption was 4.2MB. Max. memory is 8.0GB. * RCFGBuilder took 617.60ms. Allocated memory is still 184.5MB. Free memory was 121.4MB in the beginning and 155.4MB in the end (delta: -34.0MB). Peak memory consumption was 39.9MB. Max. memory is 8.0GB. * TraceAbstraction took 39612.55ms. Allocated memory was 184.5MB in the beginning and 739.2MB in the end (delta: 554.7MB). Free memory was 154.9MB in the beginning and 625.1MB in the end (delta: -470.2MB). Peak memory consumption was 83.5MB. Max. memory is 8.0GB. * 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 94, overapproximation of someBinaryArithmeticDOUBLEoperation at line 94. Possible FailurePath: [L21] unsigned char isInitial = 0; [L22-L24] unsigned char BOOL_unsigned_char_Array_0[2] = { 1, 1 }; [L22-L24] unsigned char BOOL_unsigned_char_Array_0[2] = { 1, 1 }; [L22-L24] unsigned char BOOL_unsigned_char_Array_0[2] = { 1, 1 }; [L25-L27] double double_Array_0[5] = { 9.75, 5.1, 32.6, 128.1, 63.9 }; [L25-L27] double double_Array_0[5] = { 9.75, 5.1, 32.6, 128.1, 63.9 }; [L25-L27] double double_Array_0[5] = { 9.75, 5.1, 32.6, 128.1, 63.9 }; [L25-L27] double double_Array_0[5] = { 9.75, 5.1, 32.6, 128.1, 63.9 }; [L25-L27] double double_Array_0[5] = { 9.75, 5.1, 32.6, 128.1, 63.9 }; [L25-L27] double double_Array_0[5] = { 9.75, 5.1, 32.6, 128.1, 63.9 }; [L28-L30] signed char signed_char_Array_0[2] = { 8, -128 }; [L28-L30] signed char signed_char_Array_0[2] = { 8, -128 }; [L28-L30] signed char signed_char_Array_0[2] = { 8, -128 }; [L31-L33] signed long int signed_long_int_Array_0[1] = { -10 }; [L31-L33] signed long int signed_long_int_Array_0[1] = { -10 }; [L34-L36] unsigned long int unsigned_long_int_Array_0[2] = { 1885310857, 1 }; [L34-L36] unsigned long int unsigned_long_int_Array_0[2] = { 1885310857, 1 }; [L34-L36] unsigned long int unsigned_long_int_Array_0[2] = { 1885310857, 1 }; [L37] signed long int last_1_signed_long_int_Array_0_0_ = -10; [L98] isInitial = 1 [L99] FCALL initially() [L100] COND TRUE 1 [L101] CALL updateLastVariables() [L91] EXPR signed_long_int_Array_0[0] [L91] last_1_signed_long_int_Array_0_0_ = signed_long_int_Array_0[0] [L101] RET updateLastVariables() [L102] CALL updateVariables() [L69] BOOL_unsigned_char_Array_0[0] = __VERIFIER_nondet_uchar() [L70] EXPR BOOL_unsigned_char_Array_0[0] VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, isInitial=1, last_1_signed_long_int_Array_0_0_=-10, signed_char_Array_0={6:0}, signed_long_int_Array_0={7:0}, unsigned_long_int_Array_0={8:0}] [L70] 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_signed_long_int_Array_0_0_=-10, signed_char_Array_0={6:0}, signed_long_int_Array_0={7:0}, unsigned_long_int_Array_0={8:0}] [L20] COND FALSE !(!cond) VAL [BOOL_unsigned_char_Array_0={4:0}, \old(cond)=1, cond=1, double_Array_0={5:0}, isInitial=1, last_1_signed_long_int_Array_0_0_=-10, signed_char_Array_0={6:0}, signed_long_int_Array_0={7:0}, unsigned_long_int_Array_0={8:0}] [L70] 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_signed_long_int_Array_0_0_=-10, signed_char_Array_0={6:0}, signed_long_int_Array_0={7:0}, unsigned_long_int_Array_0={8:0}] [L71] EXPR BOOL_unsigned_char_Array_0[0] VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, isInitial=1, last_1_signed_long_int_Array_0_0_=-10, signed_char_Array_0={6:0}, signed_long_int_Array_0={7:0}, unsigned_long_int_Array_0={8:0}] [L71] 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_signed_long_int_Array_0_0_=-10, signed_char_Array_0={6:0}, signed_long_int_Array_0={7:0}, unsigned_long_int_Array_0={8:0}] [L20] COND FALSE !(!cond) VAL [BOOL_unsigned_char_Array_0={4:0}, \old(cond)=1, cond=1, double_Array_0={5:0}, isInitial=1, last_1_signed_long_int_Array_0_0_=-10, signed_char_Array_0={6:0}, signed_long_int_Array_0={7:0}, unsigned_long_int_Array_0={8:0}] [L71] 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_signed_long_int_Array_0_0_=-10, signed_char_Array_0={6:0}, signed_long_int_Array_0={7:0}, unsigned_long_int_Array_0={8:0}] [L72] BOOL_unsigned_char_Array_0[1] = __VERIFIER_nondet_uchar() [L73] EXPR BOOL_unsigned_char_Array_0[1] VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, isInitial=1, last_1_signed_long_int_Array_0_0_=-10, signed_char_Array_0={6:0}, signed_long_int_Array_0={7:0}, unsigned_long_int_Array_0={8:0}] [L73] CALL assume_abort_if_not(BOOL_unsigned_char_Array_0[1] >= 0) VAL [BOOL_unsigned_char_Array_0={4:0}, \old(cond)=1, double_Array_0={5:0}, isInitial=1, last_1_signed_long_int_Array_0_0_=-10, signed_char_Array_0={6:0}, signed_long_int_Array_0={7:0}, unsigned_long_int_Array_0={8:0}] [L20] COND FALSE !(!cond) VAL [BOOL_unsigned_char_Array_0={4:0}, \old(cond)=1, cond=1, double_Array_0={5:0}, isInitial=1, last_1_signed_long_int_Array_0_0_=-10, signed_char_Array_0={6:0}, signed_long_int_Array_0={7:0}, unsigned_long_int_Array_0={8:0}] [L73] RET assume_abort_if_not(BOOL_unsigned_char_Array_0[1] >= 0) VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, isInitial=1, last_1_signed_long_int_Array_0_0_=-10, signed_char_Array_0={6:0}, signed_long_int_Array_0={7:0}, unsigned_long_int_Array_0={8:0}] [L74] EXPR BOOL_unsigned_char_Array_0[1] VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, isInitial=1, last_1_signed_long_int_Array_0_0_=-10, signed_char_Array_0={6:0}, signed_long_int_Array_0={7:0}, unsigned_long_int_Array_0={8:0}] [L74] CALL assume_abort_if_not(BOOL_unsigned_char_Array_0[1] <= 1) VAL [BOOL_unsigned_char_Array_0={4:0}, \old(cond)=1, double_Array_0={5:0}, isInitial=1, last_1_signed_long_int_Array_0_0_=-10, signed_char_Array_0={6:0}, signed_long_int_Array_0={7:0}, unsigned_long_int_Array_0={8:0}] [L20] COND FALSE !(!cond) VAL [BOOL_unsigned_char_Array_0={4:0}, \old(cond)=1, cond=1, double_Array_0={5:0}, isInitial=1, last_1_signed_long_int_Array_0_0_=-10, signed_char_Array_0={6:0}, signed_long_int_Array_0={7:0}, unsigned_long_int_Array_0={8:0}] [L74] RET assume_abort_if_not(BOOL_unsigned_char_Array_0[1] <= 1) VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, isInitial=1, last_1_signed_long_int_Array_0_0_=-10, signed_char_Array_0={6:0}, signed_long_int_Array_0={7:0}, unsigned_long_int_Array_0={8:0}] [L75] double_Array_0[0] = __VERIFIER_nondet_double() [L76] EXPR double_Array_0[0] [L76] EXPR double_Array_0[0] >= 0.0F && double_Array_0[0] <= -1.0e-20F VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, isInitial=1, last_1_signed_long_int_Array_0_0_=-10, signed_char_Array_0={6:0}, signed_long_int_Array_0={7:0}, unsigned_long_int_Array_0={8:0}] [L76] EXPR double_Array_0[0] >= 0.0F && double_Array_0[0] <= -1.0e-20F [L76] EXPR double_Array_0[0] [L76] EXPR double_Array_0[0] >= 0.0F && double_Array_0[0] <= -1.0e-20F VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, isInitial=1, last_1_signed_long_int_Array_0_0_=-10, signed_char_Array_0={6:0}, signed_long_int_Array_0={7:0}, unsigned_long_int_Array_0={8:0}] [L76] EXPR (double_Array_0[0] >= 0.0F && double_Array_0[0] <= -1.0e-20F) || (double_Array_0[0] <= 9223372.036854765600e+12F && double_Array_0[0] >= 1.0e-20F ) VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, isInitial=1, last_1_signed_long_int_Array_0_0_=-10, signed_char_Array_0={6:0}, signed_long_int_Array_0={7:0}, unsigned_long_int_Array_0={8:0}] [L76] EXPR (double_Array_0[0] >= 0.0F && double_Array_0[0] <= -1.0e-20F) || (double_Array_0[0] <= 9223372.036854765600e+12F && double_Array_0[0] >= 1.0e-20F ) VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, isInitial=1, last_1_signed_long_int_Array_0_0_=-10, signed_char_Array_0={6:0}, signed_long_int_Array_0={7:0}, unsigned_long_int_Array_0={8:0}] [L76] CALL assume_abort_if_not((double_Array_0[0] >= 0.0F && double_Array_0[0] <= -1.0e-20F) || (double_Array_0[0] <= 9223372.036854765600e+12F && double_Array_0[0] >= 1.0e-20F )) VAL [BOOL_unsigned_char_Array_0={4:0}, \old(cond)=1, double_Array_0={5:0}, isInitial=1, last_1_signed_long_int_Array_0_0_=-10, signed_char_Array_0={6:0}, signed_long_int_Array_0={7:0}, unsigned_long_int_Array_0={8:0}] [L20] COND FALSE !(!cond) VAL [BOOL_unsigned_char_Array_0={4:0}, \old(cond)=1, cond=1, double_Array_0={5:0}, isInitial=1, last_1_signed_long_int_Array_0_0_=-10, signed_char_Array_0={6:0}, signed_long_int_Array_0={7:0}, unsigned_long_int_Array_0={8:0}] [L76] RET assume_abort_if_not((double_Array_0[0] >= 0.0F && double_Array_0[0] <= -1.0e-20F) || (double_Array_0[0] <= 9223372.036854765600e+12F && double_Array_0[0] >= 1.0e-20F )) VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, isInitial=1, last_1_signed_long_int_Array_0_0_=-10, signed_char_Array_0={6:0}, signed_long_int_Array_0={7:0}, unsigned_long_int_Array_0={8:0}] [L77] double_Array_0[1] = __VERIFIER_nondet_double() [L78] EXPR double_Array_0[1] [L78] EXPR double_Array_0[1] >= 0.0F && double_Array_0[1] <= -1.0e-20F VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, isInitial=1, last_1_signed_long_int_Array_0_0_=-10, signed_char_Array_0={6:0}, signed_long_int_Array_0={7:0}, unsigned_long_int_Array_0={8:0}] [L78] EXPR double_Array_0[1] >= 0.0F && double_Array_0[1] <= -1.0e-20F [L78] EXPR double_Array_0[1] [L78] EXPR double_Array_0[1] >= 0.0F && double_Array_0[1] <= -1.0e-20F VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, isInitial=1, last_1_signed_long_int_Array_0_0_=-10, signed_char_Array_0={6:0}, signed_long_int_Array_0={7:0}, unsigned_long_int_Array_0={8:0}] [L78] EXPR (double_Array_0[1] >= 0.0F && 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_signed_long_int_Array_0_0_=-10, signed_char_Array_0={6:0}, signed_long_int_Array_0={7:0}, unsigned_long_int_Array_0={8:0}] [L78] EXPR (double_Array_0[1] >= 0.0F && 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_signed_long_int_Array_0_0_=-10, signed_char_Array_0={6:0}, signed_long_int_Array_0={7:0}, unsigned_long_int_Array_0={8:0}] [L78] CALL assume_abort_if_not((double_Array_0[1] >= 0.0F && 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_signed_long_int_Array_0_0_=-10, signed_char_Array_0={6:0}, signed_long_int_Array_0={7:0}, unsigned_long_int_Array_0={8:0}] [L20] COND FALSE !(!cond) VAL [BOOL_unsigned_char_Array_0={4:0}, \old(cond)=1, cond=1, double_Array_0={5:0}, isInitial=1, last_1_signed_long_int_Array_0_0_=-10, signed_char_Array_0={6:0}, signed_long_int_Array_0={7:0}, unsigned_long_int_Array_0={8:0}] [L78] RET assume_abort_if_not((double_Array_0[1] >= 0.0F && 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_signed_long_int_Array_0_0_=-10, signed_char_Array_0={6:0}, signed_long_int_Array_0={7:0}, unsigned_long_int_Array_0={8:0}] [L79] double_Array_0[3] = __VERIFIER_nondet_double() [L80] EXPR double_Array_0[3] [L80] EXPR double_Array_0[3] >= 0.0F && double_Array_0[3] <= -1.0e-20F VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, isInitial=1, last_1_signed_long_int_Array_0_0_=-10, signed_char_Array_0={6:0}, signed_long_int_Array_0={7:0}, unsigned_long_int_Array_0={8:0}] [L80] EXPR double_Array_0[3] >= 0.0F && double_Array_0[3] <= -1.0e-20F [L80] EXPR double_Array_0[3] [L80] EXPR double_Array_0[3] >= 0.0F && double_Array_0[3] <= -1.0e-20F VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, isInitial=1, last_1_signed_long_int_Array_0_0_=-10, signed_char_Array_0={6:0}, signed_long_int_Array_0={7:0}, unsigned_long_int_Array_0={8:0}] [L80] EXPR (double_Array_0[3] >= 0.0F && 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_signed_long_int_Array_0_0_=-10, signed_char_Array_0={6:0}, signed_long_int_Array_0={7:0}, unsigned_long_int_Array_0={8:0}] [L80] EXPR (double_Array_0[3] >= 0.0F && 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_signed_long_int_Array_0_0_=-10, signed_char_Array_0={6:0}, signed_long_int_Array_0={7:0}, unsigned_long_int_Array_0={8:0}] [L80] CALL assume_abort_if_not((double_Array_0[3] >= 0.0F && 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_signed_long_int_Array_0_0_=-10, signed_char_Array_0={6:0}, signed_long_int_Array_0={7:0}, unsigned_long_int_Array_0={8:0}] [L20] COND FALSE !(!cond) VAL [BOOL_unsigned_char_Array_0={4:0}, \old(cond)=1, cond=1, double_Array_0={5:0}, isInitial=1, last_1_signed_long_int_Array_0_0_=-10, signed_char_Array_0={6:0}, signed_long_int_Array_0={7:0}, unsigned_long_int_Array_0={8:0}] [L80] RET assume_abort_if_not((double_Array_0[3] >= 0.0F && 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_signed_long_int_Array_0_0_=-10, signed_char_Array_0={6:0}, signed_long_int_Array_0={7:0}, unsigned_long_int_Array_0={8:0}] [L81] double_Array_0[4] = __VERIFIER_nondet_double() [L82] EXPR double_Array_0[4] [L82] EXPR double_Array_0[4] >= 0.0F && double_Array_0[4] <= -1.0e-20F VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, isInitial=1, last_1_signed_long_int_Array_0_0_=-10, signed_char_Array_0={6:0}, signed_long_int_Array_0={7:0}, unsigned_long_int_Array_0={8:0}] [L82] EXPR double_Array_0[4] >= 0.0F && double_Array_0[4] <= -1.0e-20F [L82] EXPR double_Array_0[4] [L82] EXPR double_Array_0[4] >= 0.0F && double_Array_0[4] <= -1.0e-20F VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, isInitial=1, last_1_signed_long_int_Array_0_0_=-10, signed_char_Array_0={6:0}, signed_long_int_Array_0={7:0}, unsigned_long_int_Array_0={8:0}] [L82] EXPR (double_Array_0[4] >= 0.0F && double_Array_0[4] <= -1.0e-20F) || (double_Array_0[4] <= 9223372.036854765600e+12F && double_Array_0[4] >= 1.0e-20F ) VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, isInitial=1, last_1_signed_long_int_Array_0_0_=-10, signed_char_Array_0={6:0}, signed_long_int_Array_0={7:0}, unsigned_long_int_Array_0={8:0}] [L82] EXPR (double_Array_0[4] >= 0.0F && double_Array_0[4] <= -1.0e-20F) || (double_Array_0[4] <= 9223372.036854765600e+12F && double_Array_0[4] >= 1.0e-20F ) VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, isInitial=1, last_1_signed_long_int_Array_0_0_=-10, signed_char_Array_0={6:0}, signed_long_int_Array_0={7:0}, unsigned_long_int_Array_0={8:0}] [L82] CALL assume_abort_if_not((double_Array_0[4] >= 0.0F && double_Array_0[4] <= -1.0e-20F) || (double_Array_0[4] <= 9223372.036854765600e+12F && double_Array_0[4] >= 1.0e-20F )) VAL [BOOL_unsigned_char_Array_0={4:0}, \old(cond)=1, double_Array_0={5:0}, isInitial=1, last_1_signed_long_int_Array_0_0_=-10, signed_char_Array_0={6:0}, signed_long_int_Array_0={7:0}, unsigned_long_int_Array_0={8:0}] [L20] COND FALSE !(!cond) VAL [BOOL_unsigned_char_Array_0={4:0}, \old(cond)=1, cond=1, double_Array_0={5:0}, isInitial=1, last_1_signed_long_int_Array_0_0_=-10, signed_char_Array_0={6:0}, signed_long_int_Array_0={7:0}, unsigned_long_int_Array_0={8:0}] [L82] RET assume_abort_if_not((double_Array_0[4] >= 0.0F && double_Array_0[4] <= -1.0e-20F) || (double_Array_0[4] <= 9223372.036854765600e+12F && double_Array_0[4] >= 1.0e-20F )) VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, isInitial=1, last_1_signed_long_int_Array_0_0_=-10, signed_char_Array_0={6:0}, signed_long_int_Array_0={7:0}, unsigned_long_int_Array_0={8:0}] [L83] signed_char_Array_0[0] = __VERIFIER_nondet_char() [L84] EXPR signed_char_Array_0[0] VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, isInitial=1, last_1_signed_long_int_Array_0_0_=-10, signed_char_Array_0={6:0}, signed_long_int_Array_0={7:0}, unsigned_long_int_Array_0={8:0}] [L84] 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_signed_long_int_Array_0_0_=-10, signed_char_Array_0={6:0}, signed_long_int_Array_0={7:0}, unsigned_long_int_Array_0={8:0}] [L20] COND FALSE !(!cond) VAL [BOOL_unsigned_char_Array_0={4:0}, \old(cond)=1, cond=1, double_Array_0={5:0}, isInitial=1, last_1_signed_long_int_Array_0_0_=-10, signed_char_Array_0={6:0}, signed_long_int_Array_0={7:0}, unsigned_long_int_Array_0={8:0}] [L84] 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_signed_long_int_Array_0_0_=-10, signed_char_Array_0={6:0}, signed_long_int_Array_0={7:0}, unsigned_long_int_Array_0={8:0}] [L85] EXPR signed_char_Array_0[0] VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, isInitial=1, last_1_signed_long_int_Array_0_0_=-10, signed_char_Array_0={6:0}, signed_long_int_Array_0={7:0}, unsigned_long_int_Array_0={8:0}] [L85] 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_signed_long_int_Array_0_0_=-10, signed_char_Array_0={6:0}, signed_long_int_Array_0={7:0}, unsigned_long_int_Array_0={8:0}] [L20] COND FALSE !(!cond) VAL [BOOL_unsigned_char_Array_0={4:0}, \old(cond)=1, cond=1, double_Array_0={5:0}, isInitial=1, last_1_signed_long_int_Array_0_0_=-10, signed_char_Array_0={6:0}, signed_long_int_Array_0={7:0}, unsigned_long_int_Array_0={8:0}] [L85] 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_signed_long_int_Array_0_0_=-10, signed_char_Array_0={6:0}, signed_long_int_Array_0={7:0}, unsigned_long_int_Array_0={8:0}] [L86] unsigned_long_int_Array_0[0] = __VERIFIER_nondet_ulong() [L87] EXPR unsigned_long_int_Array_0[0] VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, isInitial=1, last_1_signed_long_int_Array_0_0_=-10, signed_char_Array_0={6:0}, signed_long_int_Array_0={7:0}, unsigned_long_int_Array_0={8:0}] [L87] CALL assume_abort_if_not(unsigned_long_int_Array_0[0] >= 1073741824) VAL [BOOL_unsigned_char_Array_0={4:0}, \old(cond)=1, double_Array_0={5:0}, isInitial=1, last_1_signed_long_int_Array_0_0_=-10, signed_char_Array_0={6:0}, signed_long_int_Array_0={7:0}, unsigned_long_int_Array_0={8:0}] [L20] COND FALSE !(!cond) VAL [BOOL_unsigned_char_Array_0={4:0}, \old(cond)=1, cond=1, double_Array_0={5:0}, isInitial=1, last_1_signed_long_int_Array_0_0_=-10, signed_char_Array_0={6:0}, signed_long_int_Array_0={7:0}, unsigned_long_int_Array_0={8:0}] [L87] RET assume_abort_if_not(unsigned_long_int_Array_0[0] >= 1073741824) VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, isInitial=1, last_1_signed_long_int_Array_0_0_=-10, signed_char_Array_0={6:0}, signed_long_int_Array_0={7:0}, unsigned_long_int_Array_0={8:0}] [L88] EXPR unsigned_long_int_Array_0[0] VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, isInitial=1, last_1_signed_long_int_Array_0_0_=-10, signed_char_Array_0={6:0}, signed_long_int_Array_0={7:0}, unsigned_long_int_Array_0={8:0}] [L88] CALL assume_abort_if_not(unsigned_long_int_Array_0[0] <= 2147483647) VAL [BOOL_unsigned_char_Array_0={4:0}, \old(cond)=1, double_Array_0={5:0}, isInitial=1, last_1_signed_long_int_Array_0_0_=-10, signed_char_Array_0={6:0}, signed_long_int_Array_0={7:0}, unsigned_long_int_Array_0={8:0}] [L20] COND FALSE !(!cond) VAL [BOOL_unsigned_char_Array_0={4:0}, \old(cond)=1, cond=1, double_Array_0={5:0}, isInitial=1, last_1_signed_long_int_Array_0_0_=-10, signed_char_Array_0={6:0}, signed_long_int_Array_0={7:0}, unsigned_long_int_Array_0={8:0}] [L88] RET assume_abort_if_not(unsigned_long_int_Array_0[0] <= 2147483647) VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, isInitial=1, last_1_signed_long_int_Array_0_0_=-10, signed_char_Array_0={6:0}, signed_long_int_Array_0={7:0}, unsigned_long_int_Array_0={8:0}] [L102] RET updateVariables() [L103] CALL step() [L41] BOOL_unsigned_char_Array_0[1] VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, isInitial=1, last_1_signed_long_int_Array_0_0_=-10, signed_char_Array_0={6:0}, signed_long_int_Array_0={7:0}, unsigned_long_int_Array_0={8:0}] [L41] COND FALSE !(BOOL_unsigned_char_Array_0[1]) [L44] EXPR unsigned_long_int_Array_0[0] VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, isInitial=1, last_1_signed_long_int_Array_0_0_=-10, signed_char_Array_0={6:0}, signed_long_int_Array_0={7:0}, unsigned_long_int_Array_0={8:0}] [L44] EXPR ((last_1_signed_long_int_Array_0_0_) > (unsigned_long_int_Array_0[0])) ? (last_1_signed_long_int_Array_0_0_) : (unsigned_long_int_Array_0[0]) [L44] EXPR ((last_1_signed_long_int_Array_0_0_) > (unsigned_long_int_Array_0[0])) ? (last_1_signed_long_int_Array_0_0_) : (unsigned_long_int_Array_0[0]) VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, isInitial=1, last_1_signed_long_int_Array_0_0_=-10, signed_char_Array_0={6:0}, signed_long_int_Array_0={7:0}, unsigned_long_int_Array_0={8:0}] [L44] unsigned_long_int_Array_0[1] = ((((last_1_signed_long_int_Array_0_0_) > (unsigned_long_int_Array_0[0])) ? (last_1_signed_long_int_Array_0_0_) : (unsigned_long_int_Array_0[0]))) [L46] BOOL_unsigned_char_Array_0[1] VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, isInitial=1, last_1_signed_long_int_Array_0_0_=-10, signed_char_Array_0={6:0}, signed_long_int_Array_0={7:0}, unsigned_long_int_Array_0={8:0}] [L46] COND FALSE !(BOOL_unsigned_char_Array_0[1]) [L49] EXPR BOOL_unsigned_char_Array_0[1] [L49] unsigned char stepLocal_1 = BOOL_unsigned_char_Array_0[1]; [L50] EXPR signed_long_int_Array_0[0] [L50] signed long int stepLocal_0 = signed_long_int_Array_0[0]; [L51] stepLocal_1 || ((~ signed_long_int_Array_0[0]) >= signed_long_int_Array_0[0]) VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, isInitial=1, last_1_signed_long_int_Array_0_0_=-10, signed_char_Array_0={6:0}, signed_long_int_Array_0={7:0}, stepLocal_0=-10, stepLocal_1=0, unsigned_long_int_Array_0={8:0}] [L51] stepLocal_1 || ((~ signed_long_int_Array_0[0]) >= signed_long_int_Array_0[0]) [L51] EXPR signed_long_int_Array_0[0] [L51] EXPR signed_long_int_Array_0[0] [L51] stepLocal_1 || ((~ signed_long_int_Array_0[0]) >= signed_long_int_Array_0[0]) VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, isInitial=1, last_1_signed_long_int_Array_0_0_=-10, signed_char_Array_0={6:0}, signed_long_int_Array_0={7:0}, stepLocal_0=-10, stepLocal_1=0, unsigned_long_int_Array_0={8:0}] [L51] COND TRUE stepLocal_1 || ((~ signed_long_int_Array_0[0]) >= signed_long_int_Array_0[0]) [L52] EXPR unsigned_long_int_Array_0[1] VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, isInitial=1, last_1_signed_long_int_Array_0_0_=-10, signed_char_Array_0={6:0}, signed_long_int_Array_0={7:0}, unsigned_long_int_Array_0={8:0}] [L52] COND FALSE !(stepLocal_0 < unsigned_long_int_Array_0[1]) [L57] signed_char_Array_0[1] = 2 VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, isInitial=1, last_1_signed_long_int_Array_0_0_=-10, signed_char_Array_0={6:0}, signed_long_int_Array_0={7:0}, unsigned_long_int_Array_0={8:0}] [L62] EXPR signed_char_Array_0[1] [L62] EXPR signed_char_Array_0[1] VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, isInitial=1, last_1_signed_long_int_Array_0_0_=-10, signed_char_Array_0={6:0}, signed_long_int_Array_0={7:0}, unsigned_long_int_Array_0={8:0}] [L62] COND TRUE signed_char_Array_0[1] >= signed_char_Array_0[1] [L63] EXPR double_Array_0[0] [L63] EXPR double_Array_0[1] [L63] EXPR double_Array_0[3] [L63] EXPR double_Array_0[4] VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, isInitial=1, last_1_signed_long_int_Array_0_0_=-10, signed_char_Array_0={6:0}, signed_long_int_Array_0={7:0}, unsigned_long_int_Array_0={8:0}] [L63] EXPR (((double_Array_0[1] + double_Array_0[3])) > (double_Array_0[4])) ? ((double_Array_0[1] + double_Array_0[3])) : (double_Array_0[4]) [L63] EXPR double_Array_0[1] [L63] EXPR double_Array_0[3] [L63] EXPR (((double_Array_0[1] + double_Array_0[3])) > (double_Array_0[4])) ? ((double_Array_0[1] + double_Array_0[3])) : (double_Array_0[4]) VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, isInitial=1, last_1_signed_long_int_Array_0_0_=-10, signed_char_Array_0={6:0}, signed_long_int_Array_0={7:0}, stepLocal_0=-10, stepLocal_1=0, unsigned_long_int_Array_0={8:0}] [L63] double_Array_0[2] = (double_Array_0[0] - (((((double_Array_0[1] + double_Array_0[3])) > (double_Array_0[4])) ? ((double_Array_0[1] + double_Array_0[3])) : (double_Array_0[4])))) [L103] RET step() [L104] CALL, EXPR property() [L94] EXPR BOOL_unsigned_char_Array_0[1] [L94] EXPR BOOL_unsigned_char_Array_0[1] || ((~ signed_long_int_Array_0[0]) >= signed_long_int_Array_0[0]) VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, isInitial=1, last_1_signed_long_int_Array_0_0_=-10, signed_char_Array_0={6:0}, signed_long_int_Array_0={7:0}, unsigned_long_int_Array_0={8:0}] [L94] EXPR BOOL_unsigned_char_Array_0[1] || ((~ signed_long_int_Array_0[0]) >= signed_long_int_Array_0[0]) [L94] EXPR signed_long_int_Array_0[0] [L94] EXPR signed_long_int_Array_0[0] [L94] EXPR BOOL_unsigned_char_Array_0[1] || ((~ signed_long_int_Array_0[0]) >= signed_long_int_Array_0[0]) VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, isInitial=1, last_1_signed_long_int_Array_0_0_=-10, signed_char_Array_0={6:0}, signed_long_int_Array_0={7:0}, unsigned_long_int_Array_0={8:0}] [L94] EXPR (BOOL_unsigned_char_Array_0[1] || ((~ signed_long_int_Array_0[0]) >= signed_long_int_Array_0[0])) ? ((signed_long_int_Array_0[0] < unsigned_long_int_Array_0[1]) ? ((! BOOL_unsigned_char_Array_0[0]) ? (signed_char_Array_0[1] == ((signed char) signed_char_Array_0[0])) : 1) : (signed_char_Array_0[1] == ((signed char) 2))) : (signed_char_Array_0[1] == ((signed char) signed_char_Array_0[0])) [L94] EXPR signed_long_int_Array_0[0] [L94] EXPR unsigned_long_int_Array_0[1] VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, isInitial=1, last_1_signed_long_int_Array_0_0_=-10, signed_char_Array_0={6:0}, signed_long_int_Array_0={7:0}, unsigned_long_int_Array_0={8:0}] [L94] EXPR (signed_long_int_Array_0[0] < unsigned_long_int_Array_0[1]) ? ((! BOOL_unsigned_char_Array_0[0]) ? (signed_char_Array_0[1] == ((signed char) signed_char_Array_0[0])) : 1) : (signed_char_Array_0[1] == ((signed char) 2)) [L94] EXPR signed_char_Array_0[1] [L94] EXPR (signed_long_int_Array_0[0] < unsigned_long_int_Array_0[1]) ? ((! BOOL_unsigned_char_Array_0[0]) ? (signed_char_Array_0[1] == ((signed char) signed_char_Array_0[0])) : 1) : (signed_char_Array_0[1] == ((signed char) 2)) VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, isInitial=1, last_1_signed_long_int_Array_0_0_=-10, signed_char_Array_0={6:0}, signed_long_int_Array_0={7:0}, unsigned_long_int_Array_0={8:0}] [L94] EXPR (BOOL_unsigned_char_Array_0[1] || ((~ signed_long_int_Array_0[0]) >= signed_long_int_Array_0[0])) ? ((signed_long_int_Array_0[0] < unsigned_long_int_Array_0[1]) ? ((! BOOL_unsigned_char_Array_0[0]) ? (signed_char_Array_0[1] == ((signed char) signed_char_Array_0[0])) : 1) : (signed_char_Array_0[1] == ((signed char) 2))) : (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_signed_long_int_Array_0_0_=-10, signed_char_Array_0={6:0}, signed_long_int_Array_0={7:0}, unsigned_long_int_Array_0={8:0}] [L94] EXPR ((BOOL_unsigned_char_Array_0[1] || ((~ signed_long_int_Array_0[0]) >= signed_long_int_Array_0[0])) ? ((signed_long_int_Array_0[0] < unsigned_long_int_Array_0[1]) ? ((! BOOL_unsigned_char_Array_0[0]) ? (signed_char_Array_0[1] == ((signed char) signed_char_Array_0[0])) : 1) : (signed_char_Array_0[1] == ((signed char) 2))) : (signed_char_Array_0[1] == ((signed char) signed_char_Array_0[0]))) && (BOOL_unsigned_char_Array_0[1] ? (unsigned_long_int_Array_0[1] == ((unsigned long int) ((1514707036u + ((((unsigned_long_int_Array_0[0]) < 0 ) ? -(unsigned_long_int_Array_0[0]) : (unsigned_long_int_Array_0[0])))) - last_1_signed_long_int_Array_0_0_))) : (unsigned_long_int_Array_0[1] == ((unsigned long int) ((((last_1_signed_long_int_Array_0_0_) > (unsigned_long_int_Array_0[0])) ? (last_1_signed_long_int_Array_0_0_) : (unsigned_long_int_Array_0[0])))))) VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, isInitial=1, last_1_signed_long_int_Array_0_0_=-10, signed_char_Array_0={6:0}, signed_long_int_Array_0={7:0}, unsigned_long_int_Array_0={8:0}] [L94] EXPR ((BOOL_unsigned_char_Array_0[1] || ((~ signed_long_int_Array_0[0]) >= signed_long_int_Array_0[0])) ? ((signed_long_int_Array_0[0] < unsigned_long_int_Array_0[1]) ? ((! BOOL_unsigned_char_Array_0[0]) ? (signed_char_Array_0[1] == ((signed char) signed_char_Array_0[0])) : 1) : (signed_char_Array_0[1] == ((signed char) 2))) : (signed_char_Array_0[1] == ((signed char) signed_char_Array_0[0]))) && (BOOL_unsigned_char_Array_0[1] ? (unsigned_long_int_Array_0[1] == ((unsigned long int) ((1514707036u + ((((unsigned_long_int_Array_0[0]) < 0 ) ? -(unsigned_long_int_Array_0[0]) : (unsigned_long_int_Array_0[0])))) - last_1_signed_long_int_Array_0_0_))) : (unsigned_long_int_Array_0[1] == ((unsigned long int) ((((last_1_signed_long_int_Array_0_0_) > (unsigned_long_int_Array_0[0])) ? (last_1_signed_long_int_Array_0_0_) : (unsigned_long_int_Array_0[0])))))) [L94] EXPR BOOL_unsigned_char_Array_0[1] VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, isInitial=1, last_1_signed_long_int_Array_0_0_=-10, signed_char_Array_0={6:0}, signed_long_int_Array_0={7:0}, unsigned_long_int_Array_0={8:0}] [L94] EXPR BOOL_unsigned_char_Array_0[1] ? (unsigned_long_int_Array_0[1] == ((unsigned long int) ((1514707036u + ((((unsigned_long_int_Array_0[0]) < 0 ) ? -(unsigned_long_int_Array_0[0]) : (unsigned_long_int_Array_0[0])))) - last_1_signed_long_int_Array_0_0_))) : (unsigned_long_int_Array_0[1] == ((unsigned long int) ((((last_1_signed_long_int_Array_0_0_) > (unsigned_long_int_Array_0[0])) ? (last_1_signed_long_int_Array_0_0_) : (unsigned_long_int_Array_0[0]))))) [L94] EXPR unsigned_long_int_Array_0[1] [L94] EXPR unsigned_long_int_Array_0[0] VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, isInitial=1, last_1_signed_long_int_Array_0_0_=-10, signed_char_Array_0={6:0}, signed_long_int_Array_0={7:0}, unsigned_long_int_Array_0={8:0}] [L94] EXPR ((last_1_signed_long_int_Array_0_0_) > (unsigned_long_int_Array_0[0])) ? (last_1_signed_long_int_Array_0_0_) : (unsigned_long_int_Array_0[0]) [L94] EXPR ((last_1_signed_long_int_Array_0_0_) > (unsigned_long_int_Array_0[0])) ? (last_1_signed_long_int_Array_0_0_) : (unsigned_long_int_Array_0[0]) VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, isInitial=1, last_1_signed_long_int_Array_0_0_=-10, signed_char_Array_0={6:0}, signed_long_int_Array_0={7:0}, unsigned_long_int_Array_0={8:0}] [L94] EXPR BOOL_unsigned_char_Array_0[1] ? (unsigned_long_int_Array_0[1] == ((unsigned long int) ((1514707036u + ((((unsigned_long_int_Array_0[0]) < 0 ) ? -(unsigned_long_int_Array_0[0]) : (unsigned_long_int_Array_0[0])))) - last_1_signed_long_int_Array_0_0_))) : (unsigned_long_int_Array_0[1] == ((unsigned long int) ((((last_1_signed_long_int_Array_0_0_) > (unsigned_long_int_Array_0[0])) ? (last_1_signed_long_int_Array_0_0_) : (unsigned_long_int_Array_0[0]))))) VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, isInitial=1, last_1_signed_long_int_Array_0_0_=-10, signed_char_Array_0={6:0}, signed_long_int_Array_0={7:0}, unsigned_long_int_Array_0={8:0}] [L94] EXPR ((BOOL_unsigned_char_Array_0[1] || ((~ signed_long_int_Array_0[0]) >= signed_long_int_Array_0[0])) ? ((signed_long_int_Array_0[0] < unsigned_long_int_Array_0[1]) ? ((! BOOL_unsigned_char_Array_0[0]) ? (signed_char_Array_0[1] == ((signed char) signed_char_Array_0[0])) : 1) : (signed_char_Array_0[1] == ((signed char) 2))) : (signed_char_Array_0[1] == ((signed char) signed_char_Array_0[0]))) && (BOOL_unsigned_char_Array_0[1] ? (unsigned_long_int_Array_0[1] == ((unsigned long int) ((1514707036u + ((((unsigned_long_int_Array_0[0]) < 0 ) ? -(unsigned_long_int_Array_0[0]) : (unsigned_long_int_Array_0[0])))) - last_1_signed_long_int_Array_0_0_))) : (unsigned_long_int_Array_0[1] == ((unsigned long int) ((((last_1_signed_long_int_Array_0_0_) > (unsigned_long_int_Array_0[0])) ? (last_1_signed_long_int_Array_0_0_) : (unsigned_long_int_Array_0[0])))))) VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, isInitial=1, last_1_signed_long_int_Array_0_0_=-10, signed_char_Array_0={6:0}, signed_long_int_Array_0={7:0}, unsigned_long_int_Array_0={8:0}] [L94] EXPR (((BOOL_unsigned_char_Array_0[1] || ((~ signed_long_int_Array_0[0]) >= signed_long_int_Array_0[0])) ? ((signed_long_int_Array_0[0] < unsigned_long_int_Array_0[1]) ? ((! BOOL_unsigned_char_Array_0[0]) ? (signed_char_Array_0[1] == ((signed char) signed_char_Array_0[0])) : 1) : (signed_char_Array_0[1] == ((signed char) 2))) : (signed_char_Array_0[1] == ((signed char) signed_char_Array_0[0]))) && (BOOL_unsigned_char_Array_0[1] ? (unsigned_long_int_Array_0[1] == ((unsigned long int) ((1514707036u + ((((unsigned_long_int_Array_0[0]) < 0 ) ? -(unsigned_long_int_Array_0[0]) : (unsigned_long_int_Array_0[0])))) - last_1_signed_long_int_Array_0_0_))) : (unsigned_long_int_Array_0[1] == ((unsigned long int) ((((last_1_signed_long_int_Array_0_0_) > (unsigned_long_int_Array_0[0])) ? (last_1_signed_long_int_Array_0_0_) : (unsigned_long_int_Array_0[0]))))))) && (BOOL_unsigned_char_Array_0[1] ? (signed_long_int_Array_0[0] == ((signed long int) (unsigned_long_int_Array_0[1] + ((((signed_char_Array_0[0]) < 0 ) ? -(signed_char_Array_0[0]) : (signed_char_Array_0[0])))))) : 1) VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, isInitial=1, last_1_signed_long_int_Array_0_0_=-10, signed_char_Array_0={6:0}, signed_long_int_Array_0={7:0}, unsigned_long_int_Array_0={8:0}] [L94] EXPR (((BOOL_unsigned_char_Array_0[1] || ((~ signed_long_int_Array_0[0]) >= signed_long_int_Array_0[0])) ? ((signed_long_int_Array_0[0] < unsigned_long_int_Array_0[1]) ? ((! BOOL_unsigned_char_Array_0[0]) ? (signed_char_Array_0[1] == ((signed char) signed_char_Array_0[0])) : 1) : (signed_char_Array_0[1] == ((signed char) 2))) : (signed_char_Array_0[1] == ((signed char) signed_char_Array_0[0]))) && (BOOL_unsigned_char_Array_0[1] ? (unsigned_long_int_Array_0[1] == ((unsigned long int) ((1514707036u + ((((unsigned_long_int_Array_0[0]) < 0 ) ? -(unsigned_long_int_Array_0[0]) : (unsigned_long_int_Array_0[0])))) - last_1_signed_long_int_Array_0_0_))) : (unsigned_long_int_Array_0[1] == ((unsigned long int) ((((last_1_signed_long_int_Array_0_0_) > (unsigned_long_int_Array_0[0])) ? (last_1_signed_long_int_Array_0_0_) : (unsigned_long_int_Array_0[0]))))))) && (BOOL_unsigned_char_Array_0[1] ? (signed_long_int_Array_0[0] == ((signed long int) (unsigned_long_int_Array_0[1] + ((((signed_char_Array_0[0]) < 0 ) ? -(signed_char_Array_0[0]) : (signed_char_Array_0[0])))))) : 1) [L94] EXPR BOOL_unsigned_char_Array_0[1] VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, isInitial=1, last_1_signed_long_int_Array_0_0_=-10, signed_char_Array_0={6:0}, signed_long_int_Array_0={7:0}, unsigned_long_int_Array_0={8:0}] [L94] EXPR BOOL_unsigned_char_Array_0[1] ? (signed_long_int_Array_0[0] == ((signed long int) (unsigned_long_int_Array_0[1] + ((((signed_char_Array_0[0]) < 0 ) ? -(signed_char_Array_0[0]) : (signed_char_Array_0[0])))))) : 1 [L94] EXPR BOOL_unsigned_char_Array_0[1] ? (signed_long_int_Array_0[0] == ((signed long int) (unsigned_long_int_Array_0[1] + ((((signed_char_Array_0[0]) < 0 ) ? -(signed_char_Array_0[0]) : (signed_char_Array_0[0])))))) : 1 VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, isInitial=1, last_1_signed_long_int_Array_0_0_=-10, signed_char_Array_0={6:0}, signed_long_int_Array_0={7:0}, unsigned_long_int_Array_0={8:0}] [L94] EXPR (((BOOL_unsigned_char_Array_0[1] || ((~ signed_long_int_Array_0[0]) >= signed_long_int_Array_0[0])) ? ((signed_long_int_Array_0[0] < unsigned_long_int_Array_0[1]) ? ((! BOOL_unsigned_char_Array_0[0]) ? (signed_char_Array_0[1] == ((signed char) signed_char_Array_0[0])) : 1) : (signed_char_Array_0[1] == ((signed char) 2))) : (signed_char_Array_0[1] == ((signed char) signed_char_Array_0[0]))) && (BOOL_unsigned_char_Array_0[1] ? (unsigned_long_int_Array_0[1] == ((unsigned long int) ((1514707036u + ((((unsigned_long_int_Array_0[0]) < 0 ) ? -(unsigned_long_int_Array_0[0]) : (unsigned_long_int_Array_0[0])))) - last_1_signed_long_int_Array_0_0_))) : (unsigned_long_int_Array_0[1] == ((unsigned long int) ((((last_1_signed_long_int_Array_0_0_) > (unsigned_long_int_Array_0[0])) ? (last_1_signed_long_int_Array_0_0_) : (unsigned_long_int_Array_0[0]))))))) && (BOOL_unsigned_char_Array_0[1] ? (signed_long_int_Array_0[0] == ((signed long int) (unsigned_long_int_Array_0[1] + ((((signed_char_Array_0[0]) < 0 ) ? -(signed_char_Array_0[0]) : (signed_char_Array_0[0])))))) : 1) VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, isInitial=1, last_1_signed_long_int_Array_0_0_=-10, signed_char_Array_0={6:0}, signed_long_int_Array_0={7:0}, unsigned_long_int_Array_0={8:0}] [L94] EXPR ((((BOOL_unsigned_char_Array_0[1] || ((~ signed_long_int_Array_0[0]) >= signed_long_int_Array_0[0])) ? ((signed_long_int_Array_0[0] < unsigned_long_int_Array_0[1]) ? ((! BOOL_unsigned_char_Array_0[0]) ? (signed_char_Array_0[1] == ((signed char) signed_char_Array_0[0])) : 1) : (signed_char_Array_0[1] == ((signed char) 2))) : (signed_char_Array_0[1] == ((signed char) signed_char_Array_0[0]))) && (BOOL_unsigned_char_Array_0[1] ? (unsigned_long_int_Array_0[1] == ((unsigned long int) ((1514707036u + ((((unsigned_long_int_Array_0[0]) < 0 ) ? -(unsigned_long_int_Array_0[0]) : (unsigned_long_int_Array_0[0])))) - last_1_signed_long_int_Array_0_0_))) : (unsigned_long_int_Array_0[1] == ((unsigned long int) ((((last_1_signed_long_int_Array_0_0_) > (unsigned_long_int_Array_0[0])) ? (last_1_signed_long_int_Array_0_0_) : (unsigned_long_int_Array_0[0]))))))) && (BOOL_unsigned_char_Array_0[1] ? (signed_long_int_Array_0[0] == ((signed long int) (unsigned_long_int_Array_0[1] + ((((signed_char_Array_0[0]) < 0 ) ? -(signed_char_Array_0[0]) : (signed_char_Array_0[0])))))) : 1)) && ((signed_char_Array_0[1] >= signed_char_Array_0[1]) ? (double_Array_0[2] == ((double) (double_Array_0[0] - (((((double_Array_0[1] + double_Array_0[3])) > (double_Array_0[4])) ? ((double_Array_0[1] + double_Array_0[3])) : (double_Array_0[4])))))) : (double_Array_0[2] == ((double) ((((double_Array_0[3]) > (double_Array_0[1])) ? (double_Array_0[3]) : (double_Array_0[1])))))) VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, isInitial=1, last_1_signed_long_int_Array_0_0_=-10, signed_char_Array_0={6:0}, signed_long_int_Array_0={7:0}, unsigned_long_int_Array_0={8:0}] [L94] EXPR ((((BOOL_unsigned_char_Array_0[1] || ((~ signed_long_int_Array_0[0]) >= signed_long_int_Array_0[0])) ? ((signed_long_int_Array_0[0] < unsigned_long_int_Array_0[1]) ? ((! BOOL_unsigned_char_Array_0[0]) ? (signed_char_Array_0[1] == ((signed char) signed_char_Array_0[0])) : 1) : (signed_char_Array_0[1] == ((signed char) 2))) : (signed_char_Array_0[1] == ((signed char) signed_char_Array_0[0]))) && (BOOL_unsigned_char_Array_0[1] ? (unsigned_long_int_Array_0[1] == ((unsigned long int) ((1514707036u + ((((unsigned_long_int_Array_0[0]) < 0 ) ? -(unsigned_long_int_Array_0[0]) : (unsigned_long_int_Array_0[0])))) - last_1_signed_long_int_Array_0_0_))) : (unsigned_long_int_Array_0[1] == ((unsigned long int) ((((last_1_signed_long_int_Array_0_0_) > (unsigned_long_int_Array_0[0])) ? (last_1_signed_long_int_Array_0_0_) : (unsigned_long_int_Array_0[0]))))))) && (BOOL_unsigned_char_Array_0[1] ? (signed_long_int_Array_0[0] == ((signed long int) (unsigned_long_int_Array_0[1] + ((((signed_char_Array_0[0]) < 0 ) ? -(signed_char_Array_0[0]) : (signed_char_Array_0[0])))))) : 1)) && ((signed_char_Array_0[1] >= signed_char_Array_0[1]) ? (double_Array_0[2] == ((double) (double_Array_0[0] - (((((double_Array_0[1] + double_Array_0[3])) > (double_Array_0[4])) ? ((double_Array_0[1] + double_Array_0[3])) : (double_Array_0[4])))))) : (double_Array_0[2] == ((double) ((((double_Array_0[3]) > (double_Array_0[1])) ? (double_Array_0[3]) : (double_Array_0[1])))))) [L94] EXPR signed_char_Array_0[1] [L94] EXPR signed_char_Array_0[1] VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, isInitial=1, last_1_signed_long_int_Array_0_0_=-10, signed_char_Array_0={6:0}, signed_long_int_Array_0={7:0}, unsigned_long_int_Array_0={8:0}] [L94] EXPR (signed_char_Array_0[1] >= signed_char_Array_0[1]) ? (double_Array_0[2] == ((double) (double_Array_0[0] - (((((double_Array_0[1] + double_Array_0[3])) > (double_Array_0[4])) ? ((double_Array_0[1] + double_Array_0[3])) : (double_Array_0[4])))))) : (double_Array_0[2] == ((double) ((((double_Array_0[3]) > (double_Array_0[1])) ? (double_Array_0[3]) : (double_Array_0[1]))))) [L94] EXPR double_Array_0[2] [L94] EXPR double_Array_0[0] [L94] EXPR double_Array_0[1] [L94] EXPR double_Array_0[3] [L94] EXPR double_Array_0[4] VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, isInitial=1, last_1_signed_long_int_Array_0_0_=-10, signed_char_Array_0={6:0}, signed_long_int_Array_0={7:0}, unsigned_long_int_Array_0={8:0}] [L94] EXPR (((double_Array_0[1] + double_Array_0[3])) > (double_Array_0[4])) ? ((double_Array_0[1] + double_Array_0[3])) : (double_Array_0[4]) [L94] EXPR double_Array_0[1] [L94] EXPR double_Array_0[3] [L94] EXPR (((double_Array_0[1] + double_Array_0[3])) > (double_Array_0[4])) ? ((double_Array_0[1] + double_Array_0[3])) : (double_Array_0[4]) VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, isInitial=1, last_1_signed_long_int_Array_0_0_=-10, signed_char_Array_0={6:0}, signed_long_int_Array_0={7:0}, unsigned_long_int_Array_0={8:0}] [L94] EXPR (signed_char_Array_0[1] >= signed_char_Array_0[1]) ? (double_Array_0[2] == ((double) (double_Array_0[0] - (((((double_Array_0[1] + double_Array_0[3])) > (double_Array_0[4])) ? ((double_Array_0[1] + double_Array_0[3])) : (double_Array_0[4])))))) : (double_Array_0[2] == ((double) ((((double_Array_0[3]) > (double_Array_0[1])) ? (double_Array_0[3]) : (double_Array_0[1]))))) VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, isInitial=1, last_1_signed_long_int_Array_0_0_=-10, signed_char_Array_0={6:0}, signed_long_int_Array_0={7:0}, unsigned_long_int_Array_0={8:0}] [L94] EXPR ((((BOOL_unsigned_char_Array_0[1] || ((~ signed_long_int_Array_0[0]) >= signed_long_int_Array_0[0])) ? ((signed_long_int_Array_0[0] < unsigned_long_int_Array_0[1]) ? ((! BOOL_unsigned_char_Array_0[0]) ? (signed_char_Array_0[1] == ((signed char) signed_char_Array_0[0])) : 1) : (signed_char_Array_0[1] == ((signed char) 2))) : (signed_char_Array_0[1] == ((signed char) signed_char_Array_0[0]))) && (BOOL_unsigned_char_Array_0[1] ? (unsigned_long_int_Array_0[1] == ((unsigned long int) ((1514707036u + ((((unsigned_long_int_Array_0[0]) < 0 ) ? -(unsigned_long_int_Array_0[0]) : (unsigned_long_int_Array_0[0])))) - last_1_signed_long_int_Array_0_0_))) : (unsigned_long_int_Array_0[1] == ((unsigned long int) ((((last_1_signed_long_int_Array_0_0_) > (unsigned_long_int_Array_0[0])) ? (last_1_signed_long_int_Array_0_0_) : (unsigned_long_int_Array_0[0]))))))) && (BOOL_unsigned_char_Array_0[1] ? (signed_long_int_Array_0[0] == ((signed long int) (unsigned_long_int_Array_0[1] + ((((signed_char_Array_0[0]) < 0 ) ? -(signed_char_Array_0[0]) : (signed_char_Array_0[0])))))) : 1)) && ((signed_char_Array_0[1] >= signed_char_Array_0[1]) ? (double_Array_0[2] == ((double) (double_Array_0[0] - (((((double_Array_0[1] + double_Array_0[3])) > (double_Array_0[4])) ? ((double_Array_0[1] + double_Array_0[3])) : (double_Array_0[4])))))) : (double_Array_0[2] == ((double) ((((double_Array_0[3]) > (double_Array_0[1])) ? (double_Array_0[3]) : (double_Array_0[1])))))) VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, isInitial=1, last_1_signed_long_int_Array_0_0_=-10, signed_char_Array_0={6:0}, signed_long_int_Array_0={7:0}, unsigned_long_int_Array_0={8:0}] [L94-L95] return ((((BOOL_unsigned_char_Array_0[1] || ((~ signed_long_int_Array_0[0]) >= signed_long_int_Array_0[0])) ? ((signed_long_int_Array_0[0] < unsigned_long_int_Array_0[1]) ? ((! BOOL_unsigned_char_Array_0[0]) ? (signed_char_Array_0[1] == ((signed char) signed_char_Array_0[0])) : 1) : (signed_char_Array_0[1] == ((signed char) 2))) : (signed_char_Array_0[1] == ((signed char) signed_char_Array_0[0]))) && (BOOL_unsigned_char_Array_0[1] ? (unsigned_long_int_Array_0[1] == ((unsigned long int) ((1514707036u + ((((unsigned_long_int_Array_0[0]) < 0 ) ? -(unsigned_long_int_Array_0[0]) : (unsigned_long_int_Array_0[0])))) - last_1_signed_long_int_Array_0_0_))) : (unsigned_long_int_Array_0[1] == ((unsigned long int) ((((last_1_signed_long_int_Array_0_0_) > (unsigned_long_int_Array_0[0])) ? (last_1_signed_long_int_Array_0_0_) : (unsigned_long_int_Array_0[0]))))))) && (BOOL_unsigned_char_Array_0[1] ? (signed_long_int_Array_0[0] == ((signed long int) (unsigned_long_int_Array_0[1] + ((((signed_char_Array_0[0]) < 0 ) ? -(signed_char_Array_0[0]) : (signed_char_Array_0[0])))))) : 1)) && ((signed_char_Array_0[1] >= signed_char_Array_0[1]) ? (double_Array_0[2] == ((double) (double_Array_0[0] - (((((double_Array_0[1] + double_Array_0[3])) > (double_Array_0[4])) ? ((double_Array_0[1] + double_Array_0[3])) : (double_Array_0[4])))))) : (double_Array_0[2] == ((double) ((((double_Array_0[3]) > (double_Array_0[1])) ? (double_Array_0[3]) : (double_Array_0[1])))))) ; [L104] RET, EXPR property() [L104] CALL __VERIFIER_assert(property()) [L19] COND TRUE !(cond) VAL [BOOL_unsigned_char_Array_0={4:0}, \old(cond)=0, cond=0, double_Array_0={5:0}, isInitial=1, last_1_signed_long_int_Array_0_0_=-10, signed_char_Array_0={6:0}, signed_long_int_Array_0={7:0}, unsigned_long_int_Array_0={8:0}] [L19] reach_error() VAL [BOOL_unsigned_char_Array_0={4:0}, \old(cond)=0, cond=0, double_Array_0={5:0}, isInitial=1, last_1_signed_long_int_Array_0_0_=-10, signed_char_Array_0={6:0}, signed_long_int_Array_0={7:0}, unsigned_long_int_Array_0={8:0}] - StatisticsResult: Ultimate Automizer benchmark data CFG has 2 procedures, 106 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 39.5s, OverallIterations: 39, TraceHistogramMax: 12, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.1s, AutomataDifference: 21.6s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 10649 SdHoareTripleChecker+Valid, 10.2s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 10628 mSDsluCounter, 44663 SdHoareTripleChecker+Invalid, 8.9s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 36821 mSDsCounter, 1145 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 12313 IncrementalHoareTripleChecker+Invalid, 13458 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 1145 mSolverCounterUnsat, 7842 mSDtfsCounter, 12313 mSolverCounterSat, 0.2s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 1493 GetRequests, 1048 SyntacticMatches, 0 SemanticMatches, 445 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1618 ImplicationChecksByTransitivity, 10.4s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=1965occurred in iteration=10, InterpolantAutomatonStates: 399, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 1.9s AutomataMinimizationTime, 38 MinimizatonAttempts, 6111 StatesRemovedByMinimization, 36 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.2s SsaConstructionTime, 0.7s SatisfiabilityAnalysisTime, 14.2s InterpolantComputationTime, 4527 NumberOfCodeBlocks, 4527 NumberOfCodeBlocksAsserted, 39 NumberOfCheckSat, 4366 ConstructedInterpolants, 0 QuantifiedInterpolants, 34202 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 38 InterpolantComputations, 38 PerfectInterpolantSequences, 10032/10032 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 [2023-12-19 14:59:12,410 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Forceful destruction successful, exit code 0 Received shutdown request...