./Ultimate.py --spec ../../../trunk/examples/svcomp/properties/unreach-call.prp --file ../../../trunk/examples/svcomp/hardware-verification-bv/btor2c-lazyMod.vis_QF_BV_s1269b_p4.c --full-output --witness-type violation_witness --validate ./svcomp-yaml-violation-generation.2024-08-01_14-26-22.files/Default/btor2c-lazyMod.vis_QF_BV_s1269b_p4.yml/witness.yml --preprocessor.replace.while.statements.and.if-then-else.statements false --icfgbuilder.size.of.a.code.block SequenceOfStatements --architecture 64bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 03fe66fa Calling Ultimate with: /root/.sdkman/candidates/java/current/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReachWitnessValidation.xml -i ../../../trunk/examples/svcomp/hardware-verification-bv/btor2c-lazyMod.vis_QF_BV_s1269b_p4.c ./svcomp-yaml-violation-generation.2024-08-01_14-26-22.files/Default/btor2c-lazyMod.vis_QF_BV_s1269b_p4.yml/witness.yml -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-64bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --traceabstraction.compute.hoare.annotation.of.negated.interpolant.automaton,.abstraction.and.cfg false --preprocessor.replace.while.statements.and.if-then-else.statements false --icfgbuilder.size.of.a.code.block SequenceOfStatements --- Real Ultimate output --- This is Ultimate 0.2.4-wip.fs.yaml-violation-witnesses-03fe66f-m [2024-08-15 18:22:56,150 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-08-15 18:22:56,231 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-64bit-Automizer_Default.epf [2024-08-15 18:22:56,239 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-08-15 18:22:56,239 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-08-15 18:22:56,270 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-08-15 18:22:56,272 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-08-15 18:22:56,272 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-08-15 18:22:56,273 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-08-15 18:22:56,275 INFO L153 SettingsManager]: * Use memory slicer=true [2024-08-15 18:22:56,276 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-08-15 18:22:56,276 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-08-15 18:22:56,277 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-08-15 18:22:56,278 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-08-15 18:22:56,279 INFO L153 SettingsManager]: * Use SBE=true [2024-08-15 18:22:56,280 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-08-15 18:22:56,280 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-08-15 18:22:56,280 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-08-15 18:22:56,281 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-08-15 18:22:56,281 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-08-15 18:22:56,285 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-08-15 18:22:56,286 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-08-15 18:22:56,286 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-08-15 18:22:56,286 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-08-15 18:22:56,287 INFO L153 SettingsManager]: * Use constant arrays=true [2024-08-15 18:22:56,287 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-08-15 18:22:56,287 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-08-15 18:22:56,288 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-08-15 18:22:56,288 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-08-15 18:22:56,288 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-08-15 18:22:56,288 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-08-15 18:22:56,289 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-08-15 18:22:56,289 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-08-15 18:22:56,289 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-08-15 18:22:56,289 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-08-15 18:22:56,290 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-08-15 18:22:56,290 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-08-15 18:22:56,290 INFO L153 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2024-08-15 18:22:56,290 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-08-15 18:22:56,290 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-08-15 18:22:56,291 INFO L153 SettingsManager]: * Looper check in Petri net analysis=SEMANTIC WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.boogie.preprocessor: Replace while statements and if-then-else statements -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder: Size of a code block -> SequenceOfStatements [2024-08-15 18:22:56,553 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-08-15 18:22:56,579 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-08-15 18:22:56,584 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-08-15 18:22:56,585 INFO L270 PluginConnector]: Initializing Witness Parser... [2024-08-15 18:22:56,586 INFO L274 PluginConnector]: Witness Parser initialized [2024-08-15 18:22:56,588 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/./svcomp-yaml-violation-generation.2024-08-01_14-26-22.files/Default/btor2c-lazyMod.vis_QF_BV_s1269b_p4.yml/witness.yml [2024-08-15 18:22:56,677 INFO L270 PluginConnector]: Initializing CDTParser... [2024-08-15 18:22:56,677 INFO L274 PluginConnector]: CDTParser initialized [2024-08-15 18:22:56,678 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/hardware-verification-bv/btor2c-lazyMod.vis_QF_BV_s1269b_p4.c [2024-08-15 18:22:58,176 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-08-15 18:22:58,418 INFO L384 CDTParser]: Found 1 translation units. [2024-08-15 18:22:58,419 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/hardware-verification-bv/btor2c-lazyMod.vis_QF_BV_s1269b_p4.c [2024-08-15 18:22:58,429 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/2d48e8c5e/16b8f6e8a56c4d3c85dd8ff34d0715e4/FLAG681e4df31 [2024-08-15 18:22:58,444 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/2d48e8c5e/16b8f6e8a56c4d3c85dd8ff34d0715e4 [2024-08-15 18:22:58,444 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-08-15 18:22:58,446 INFO L133 ToolchainWalker]: Walking toolchain with 4 elements. [2024-08-15 18:22:58,447 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-08-15 18:22:58,447 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-08-15 18:22:58,451 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-08-15 18:22:58,452 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "witness.yml de.uni_freiburg.informatik.ultimate.witnessparser VIOLATION_WITNESS 15.08 06:22:56" (1/2) ... [2024-08-15 18:22:58,453 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@47d69412 and model type witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator VIOLATION_WITNESS 15.08 06:22:58, skipping insertion in model container [2024-08-15 18:22:58,453 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "witness.yml de.uni_freiburg.informatik.ultimate.witnessparser VIOLATION_WITNESS 15.08 06:22:56" (1/2) ... [2024-08-15 18:22:58,454 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.CACSL2BoogieTranslatorObserver@6ac08b4e and model type witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator VIOLATION_WITNESS 15.08 06:22:58, skipping insertion in model container [2024-08-15 18:22:58,455 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 15.08 06:22:58" (2/2) ... [2024-08-15 18:22:58,455 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@47d69412 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.08 06:22:58, skipping insertion in model container [2024-08-15 18:22:58,456 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 15.08 06:22:58" (2/2) ... [2024-08-15 18:22:58,486 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-08-15 18:22:58,712 WARN L247 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/hardware-verification-bv/btor2c-lazyMod.vis_QF_BV_s1269b_p4.c[1259,1272] [2024-08-15 18:22:58,822 INFO L207 PostProcessor]: Analyzing one entry point: main [2024-08-15 18:22:58,834 INFO L200 MainTranslator]: Completed pre-run [2024-08-15 18:22:58,847 WARN L247 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/hardware-verification-bv/btor2c-lazyMod.vis_QF_BV_s1269b_p4.c[1259,1272] [2024-08-15 18:22:58,895 INFO L207 PostProcessor]: Analyzing one entry point: main [2024-08-15 18:22:58,913 INFO L204 MainTranslator]: Completed translation [2024-08-15 18:22:58,914 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.08 06:22:58 WrapperNode [2024-08-15 18:22:58,914 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-08-15 18:22:58,915 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-08-15 18:22:58,915 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-08-15 18:22:58,916 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-08-15 18:22:58,930 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.08 06:22:58" (1/1) ... [2024-08-15 18:22:58,931 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.08 06:22:58" (1/1) ... [2024-08-15 18:22:58,947 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.08 06:22:58" (1/1) ... [2024-08-15 18:22:58,991 INFO L175 MemorySlicer]: Split 2 memory accesses to 1 slices as follows [2]. 100 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2]. The 0 writes are split as follows [0]. [2024-08-15 18:22:58,992 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.08 06:22:58" (1/1) ... [2024-08-15 18:22:58,992 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.08 06:22:58" (1/1) ... [2024-08-15 18:22:59,007 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.08 06:22:58" (1/1) ... [2024-08-15 18:22:59,018 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.08 06:22:58" (1/1) ... [2024-08-15 18:22:59,026 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.08 06:22:58" (1/1) ... [2024-08-15 18:22:59,033 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-08-15 18:22:59,035 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2024-08-15 18:22:59,035 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2024-08-15 18:22:59,035 INFO L274 PluginConnector]: IcfgBuilder initialized [2024-08-15 18:22:59,036 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.08 06:22:58" (1/1) ... [2024-08-15 18:22:59,042 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-08-15 18:22:59,053 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-08-15 18:22:59,083 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-08-15 18:22:59,085 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (1)] Waiting until timeout for monitored process [2024-08-15 18:22:59,137 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2024-08-15 18:22:59,138 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-08-15 18:22:59,138 INFO L138 BoogieDeclarations]: Found implementation of procedure reach_error [2024-08-15 18:22:59,138 INFO L138 BoogieDeclarations]: Found implementation of procedure __VERIFIER_assert [2024-08-15 18:22:59,138 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2024-08-15 18:22:59,139 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2024-08-15 18:22:59,139 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_uchar [2024-08-15 18:22:59,139 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_ushort [2024-08-15 18:22:59,139 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_uint [2024-08-15 18:22:59,139 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_ulong [2024-08-15 18:22:59,139 INFO L130 BoogieDeclarations]: Found specification of procedure abort [2024-08-15 18:22:59,140 INFO L130 BoogieDeclarations]: Found specification of procedure __assert_fail [2024-08-15 18:22:59,141 INFO L130 BoogieDeclarations]: Found specification of procedure reach_error [2024-08-15 18:22:59,141 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-08-15 18:22:59,141 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2024-08-15 18:22:59,141 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2024-08-15 18:22:59,142 INFO L130 BoogieDeclarations]: Found specification of procedure main [2024-08-15 18:22:59,142 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2024-08-15 18:22:59,142 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-08-15 18:22:59,142 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-08-15 18:22:59,142 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#0 [2024-08-15 18:22:59,142 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#0 [2024-08-15 18:22:59,143 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2024-08-15 18:22:59,274 INFO L273 CfgBuilder]: Building ICFG [2024-08-15 18:22:59,276 INFO L304 CfgBuilder]: Building CFG for each procedure with an implementation [2024-08-15 18:22:59,911 INFO L? ?]: Removed 230 outVars from TransFormulas that were not future-live. [2024-08-15 18:22:59,911 INFO L327 CfgBuilder]: Performing block encoding [2024-08-15 18:22:59,925 INFO L349 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-08-15 18:22:59,926 INFO L354 CfgBuilder]: Removed 0 assume(true) statements. [2024-08-15 18:22:59,927 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 15.08 06:22:59 BoogieIcfgContainer [2024-08-15 18:22:59,928 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2024-08-15 18:22:59,930 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-08-15 18:22:59,931 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-08-15 18:22:59,935 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-08-15 18:22:59,935 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "witness.yml de.uni_freiburg.informatik.ultimate.witnessparser VIOLATION_WITNESS 15.08 06:22:56" (1/4) ... [2024-08-15 18:22:59,935 WARN L100 eAbstractionObserver]: Found a witness in the YAML format. I will only consider traces that are accepted by the witness [2024-08-15 18:22:59,938 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1b4d6e5e and model type witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction VIOLATION_WITNESS 15.08 06:22:59, skipping insertion in model container [2024-08-15 18:22:59,940 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 15.08 06:22:58" (2/4) ... [2024-08-15 18:22:59,941 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1b4d6e5e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 15.08 06:22:59, skipping insertion in model container [2024-08-15 18:22:59,941 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.08 06:22:58" (3/4) ... [2024-08-15 18:22:59,941 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1b4d6e5e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 15.08 06:22:59, skipping insertion in model container [2024-08-15 18:22:59,941 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 15.08 06:22:59" (4/4) ... [2024-08-15 18:22:59,943 INFO L128 eAbstractionObserver]: Analyzing ICFG btor2c-lazyMod.vis_QF_BV_s1269b_p4.c [2024-08-15 18:22:59,963 INFO L201 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-08-15 18:22:59,964 INFO L160 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-08-15 18:23:00,001 INFO L90 WitnessUtils]: Constructing product of automaton with 102 states and violation witness of the following lengths: [6] [2024-08-15 18:23:00,186 INFO L95 WitnessUtils]: Product has 369 reachable states. [2024-08-15 18:23:00,208 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-08-15 18:23:00,217 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=false, 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;@62efa1bd, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-08-15 18:23:00,218 INFO L358 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-08-15 18:23:00,220 INFO L276 IsEmpty]: Start isEmpty. Operand 369 states and 580 transitions. [2024-08-15 18:23:00,231 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 83 [2024-08-15 18:23:00,232 INFO L187 NwaCegarLoop]: Found error trace [2024-08-15 18:23:00,233 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-08-15 18:23:00,234 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-08-15 18:23:00,242 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-08-15 18:23:00,242 INFO L85 PathProgramCache]: Analyzing trace with hash 1180446364, now seen corresponding path program 1 times [2024-08-15 18:23:00,251 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-08-15 18:23:00,253 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1348417456] [2024-08-15 18:23:00,253 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-08-15 18:23:00,253 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-08-15 18:23:00,578 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-08-15 18:23:01,307 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2024-08-15 18:23:01,309 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-08-15 18:23:01,317 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 25 [2024-08-15 18:23:01,319 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-08-15 18:23:01,326 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2024-08-15 18:23:01,326 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-08-15 18:23:01,327 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1348417456] [2024-08-15 18:23:01,329 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1348417456] provided 1 perfect and 0 imperfect interpolant sequences [2024-08-15 18:23:01,329 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-08-15 18:23:01,329 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-08-15 18:23:01,331 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [715998690] [2024-08-15 18:23:01,332 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-08-15 18:23:01,335 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-08-15 18:23:01,336 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-08-15 18:23:01,371 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-08-15 18:23:01,372 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2024-08-15 18:23:01,377 INFO L87 Difference]: Start difference. First operand 369 states and 580 transitions. Second operand has 6 states, 5 states have (on average 13.4) internal successors, (67), 5 states have internal predecessors, (67), 2 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2024-08-15 18:23:01,491 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-08-15 18:23:01,491 INFO L93 Difference]: Finished difference Result 315 states and 499 transitions. [2024-08-15 18:23:01,493 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-08-15 18:23:01,495 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 13.4) internal successors, (67), 5 states have internal predecessors, (67), 2 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) Word has length 82 [2024-08-15 18:23:01,496 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-08-15 18:23:01,509 INFO L225 Difference]: With dead ends: 315 [2024-08-15 18:23:01,509 INFO L226 Difference]: Without dead ends: 313 [2024-08-15 18:23:01,511 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2024-08-15 18:23:01,514 INFO L413 NwaCegarLoop]: 146 mSDtfsCounter, 93 mSDsluCounter, 580 mSDsCounter, 0 mSdLazyCounter, 23 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 94 SdHoareTripleChecker+Valid, 726 SdHoareTripleChecker+Invalid, 23 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 23 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-08-15 18:23:01,517 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [94 Valid, 726 Invalid, 23 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 23 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-08-15 18:23:01,534 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 313 states. [2024-08-15 18:23:01,571 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 313 to 117. [2024-08-15 18:23:01,575 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 117 states, 109 states have (on average 1.5963302752293578) internal successors, (174), 110 states have internal predecessors, (174), 4 states have call successors, (4), 4 states have call predecessors, (4), 3 states have return successors, (3), 2 states have call predecessors, (3), 3 states have call successors, (3) [2024-08-15 18:23:01,577 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 117 states to 117 states and 181 transitions. [2024-08-15 18:23:01,578 INFO L78 Accepts]: Start accepts. Automaton has 117 states and 181 transitions. Word has length 82 [2024-08-15 18:23:01,579 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-08-15 18:23:01,579 INFO L495 AbstractCegarLoop]: Abstraction has 117 states and 181 transitions. [2024-08-15 18:23:01,579 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 13.4) internal successors, (67), 5 states have internal predecessors, (67), 2 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2024-08-15 18:23:01,580 INFO L276 IsEmpty]: Start isEmpty. Operand 117 states and 181 transitions. [2024-08-15 18:23:01,582 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 84 [2024-08-15 18:23:01,583 INFO L187 NwaCegarLoop]: Found error trace [2024-08-15 18:23:01,583 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-08-15 18:23:01,583 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-08-15 18:23:01,583 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-08-15 18:23:01,584 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-08-15 18:23:01,584 INFO L85 PathProgramCache]: Analyzing trace with hash 602627874, now seen corresponding path program 1 times [2024-08-15 18:23:01,584 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-08-15 18:23:01,584 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1299554638] [2024-08-15 18:23:01,585 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-08-15 18:23:01,585 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-08-15 18:23:01,686 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-08-15 18:23:01,911 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2024-08-15 18:23:01,914 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-08-15 18:23:01,918 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 25 [2024-08-15 18:23:01,920 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-08-15 18:23:01,923 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2024-08-15 18:23:01,924 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-08-15 18:23:01,925 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1299554638] [2024-08-15 18:23:01,925 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1299554638] provided 1 perfect and 0 imperfect interpolant sequences [2024-08-15 18:23:01,927 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-08-15 18:23:01,927 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-08-15 18:23:01,927 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2070471120] [2024-08-15 18:23:01,928 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-08-15 18:23:01,929 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-08-15 18:23:01,930 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-08-15 18:23:01,931 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-08-15 18:23:01,931 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-08-15 18:23:01,932 INFO L87 Difference]: Start difference. First operand 117 states and 181 transitions. Second operand has 4 states, 4 states have (on average 17.5) internal successors, (70), 4 states have internal predecessors, (70), 2 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2024-08-15 18:23:01,966 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-08-15 18:23:01,966 INFO L93 Difference]: Finished difference Result 121 states and 185 transitions. [2024-08-15 18:23:01,967 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-08-15 18:23:01,967 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 17.5) internal successors, (70), 4 states have internal predecessors, (70), 2 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) Word has length 83 [2024-08-15 18:23:01,968 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-08-15 18:23:01,973 INFO L225 Difference]: With dead ends: 121 [2024-08-15 18:23:01,973 INFO L226 Difference]: Without dead ends: 121 [2024-08-15 18:23:01,974 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 7 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-08-15 18:23:01,975 INFO L413 NwaCegarLoop]: 148 mSDtfsCounter, 0 mSDsluCounter, 289 mSDsCounter, 0 mSdLazyCounter, 12 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 437 SdHoareTripleChecker+Invalid, 12 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 12 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-08-15 18:23:01,975 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 437 Invalid, 12 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 12 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-08-15 18:23:01,977 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 121 states. [2024-08-15 18:23:01,989 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 121 to 119. [2024-08-15 18:23:01,990 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 119 states, 111 states have (on average 1.5855855855855856) internal successors, (176), 112 states have internal predecessors, (176), 4 states have call successors, (4), 4 states have call predecessors, (4), 3 states have return successors, (3), 2 states have call predecessors, (3), 3 states have call successors, (3) [2024-08-15 18:23:01,992 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 119 states to 119 states and 183 transitions. [2024-08-15 18:23:01,992 INFO L78 Accepts]: Start accepts. Automaton has 119 states and 183 transitions. Word has length 83 [2024-08-15 18:23:01,992 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-08-15 18:23:01,993 INFO L495 AbstractCegarLoop]: Abstraction has 119 states and 183 transitions. [2024-08-15 18:23:01,993 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 17.5) internal successors, (70), 4 states have internal predecessors, (70), 2 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2024-08-15 18:23:01,995 INFO L276 IsEmpty]: Start isEmpty. Operand 119 states and 183 transitions. [2024-08-15 18:23:01,998 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 85 [2024-08-15 18:23:01,998 INFO L187 NwaCegarLoop]: Found error trace [2024-08-15 18:23:01,999 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-08-15 18:23:01,999 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-08-15 18:23:01,999 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-08-15 18:23:02,000 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-08-15 18:23:02,000 INFO L85 PathProgramCache]: Analyzing trace with hash 815948377, now seen corresponding path program 1 times [2024-08-15 18:23:02,003 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-08-15 18:23:02,003 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1943785264] [2024-08-15 18:23:02,004 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-08-15 18:23:02,004 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-08-15 18:23:02,153 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-08-15 18:23:02,591 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2024-08-15 18:23:02,594 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-08-15 18:23:02,597 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 25 [2024-08-15 18:23:02,599 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-08-15 18:23:02,603 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 14 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-08-15 18:23:02,606 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-08-15 18:23:02,606 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1943785264] [2024-08-15 18:23:02,607 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1943785264] provided 1 perfect and 0 imperfect interpolant sequences [2024-08-15 18:23:02,607 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-08-15 18:23:02,607 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-08-15 18:23:02,607 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [636076440] [2024-08-15 18:23:02,607 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-08-15 18:23:02,608 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-08-15 18:23:02,608 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-08-15 18:23:02,609 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-08-15 18:23:02,611 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2024-08-15 18:23:02,611 INFO L87 Difference]: Start difference. First operand 119 states and 183 transitions. Second operand has 7 states, 7 states have (on average 11.142857142857142) internal successors, (78), 7 states have internal predecessors, (78), 3 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2024-08-15 18:23:02,719 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-08-15 18:23:02,721 INFO L93 Difference]: Finished difference Result 157 states and 242 transitions. [2024-08-15 18:23:02,721 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-08-15 18:23:02,721 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 11.142857142857142) internal successors, (78), 7 states have internal predecessors, (78), 3 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Word has length 84 [2024-08-15 18:23:02,722 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-08-15 18:23:02,723 INFO L225 Difference]: With dead ends: 157 [2024-08-15 18:23:02,723 INFO L226 Difference]: Without dead ends: 157 [2024-08-15 18:23:02,723 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=26, Invalid=64, Unknown=0, NotChecked=0, Total=90 [2024-08-15 18:23:02,724 INFO L413 NwaCegarLoop]: 143 mSDtfsCounter, 90 mSDsluCounter, 561 mSDsCounter, 0 mSdLazyCounter, 39 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 90 SdHoareTripleChecker+Valid, 704 SdHoareTripleChecker+Invalid, 40 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 39 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-08-15 18:23:02,726 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [90 Valid, 704 Invalid, 40 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 39 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-08-15 18:23:02,727 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 157 states. [2024-08-15 18:23:02,736 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 157 to 134. [2024-08-15 18:23:02,739 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 134 states, 125 states have (on average 1.56) internal successors, (195), 126 states have internal predecessors, (195), 5 states have call successors, (5), 4 states have call predecessors, (5), 3 states have return successors, (4), 3 states have call predecessors, (4), 4 states have call successors, (4) [2024-08-15 18:23:02,741 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 134 states to 134 states and 204 transitions. [2024-08-15 18:23:02,742 INFO L78 Accepts]: Start accepts. Automaton has 134 states and 204 transitions. Word has length 84 [2024-08-15 18:23:02,742 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-08-15 18:23:02,743 INFO L495 AbstractCegarLoop]: Abstraction has 134 states and 204 transitions. [2024-08-15 18:23:02,744 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 11.142857142857142) internal successors, (78), 7 states have internal predecessors, (78), 3 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2024-08-15 18:23:02,744 INFO L276 IsEmpty]: Start isEmpty. Operand 134 states and 204 transitions. [2024-08-15 18:23:02,745 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 86 [2024-08-15 18:23:02,746 INFO L187 NwaCegarLoop]: Found error trace [2024-08-15 18:23:02,746 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-08-15 18:23:02,746 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-08-15 18:23:02,746 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-08-15 18:23:02,750 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-08-15 18:23:02,750 INFO L85 PathProgramCache]: Analyzing trace with hash -2021624041, now seen corresponding path program 1 times [2024-08-15 18:23:02,750 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-08-15 18:23:02,750 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [818876891] [2024-08-15 18:23:02,750 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-08-15 18:23:02,750 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-08-15 18:23:02,877 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-08-15 18:23:03,276 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2024-08-15 18:23:03,277 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-08-15 18:23:03,282 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 25 [2024-08-15 18:23:03,283 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-08-15 18:23:03,289 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 14 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-08-15 18:23:03,290 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-08-15 18:23:03,290 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [818876891] [2024-08-15 18:23:03,290 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [818876891] provided 1 perfect and 0 imperfect interpolant sequences [2024-08-15 18:23:03,290 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-08-15 18:23:03,290 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-08-15 18:23:03,290 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [5881274] [2024-08-15 18:23:03,291 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-08-15 18:23:03,292 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-08-15 18:23:03,293 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-08-15 18:23:03,294 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-08-15 18:23:03,294 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2024-08-15 18:23:03,295 INFO L87 Difference]: Start difference. First operand 134 states and 204 transitions. Second operand has 6 states, 6 states have (on average 13.166666666666666) internal successors, (79), 6 states have internal predecessors, (79), 2 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2024-08-15 18:23:03,338 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-08-15 18:23:03,338 INFO L93 Difference]: Finished difference Result 141 states and 213 transitions. [2024-08-15 18:23:03,339 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-08-15 18:23:03,339 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 13.166666666666666) internal successors, (79), 6 states have internal predecessors, (79), 2 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) Word has length 85 [2024-08-15 18:23:03,339 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-08-15 18:23:03,340 INFO L225 Difference]: With dead ends: 141 [2024-08-15 18:23:03,341 INFO L226 Difference]: Without dead ends: 141 [2024-08-15 18:23:03,341 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2024-08-15 18:23:03,342 INFO L413 NwaCegarLoop]: 146 mSDtfsCounter, 4 mSDsluCounter, 432 mSDsCounter, 0 mSdLazyCounter, 25 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4 SdHoareTripleChecker+Valid, 578 SdHoareTripleChecker+Invalid, 26 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 25 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-08-15 18:23:03,344 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [4 Valid, 578 Invalid, 26 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 25 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-08-15 18:23:03,345 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 141 states. [2024-08-15 18:23:03,355 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 141 to 139. [2024-08-15 18:23:03,359 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 139 states, 130 states have (on average 1.5461538461538462) internal successors, (201), 131 states have internal predecessors, (201), 5 states have call successors, (5), 4 states have call predecessors, (5), 3 states have return successors, (4), 3 states have call predecessors, (4), 4 states have call successors, (4) [2024-08-15 18:23:03,360 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 139 states to 139 states and 210 transitions. [2024-08-15 18:23:03,360 INFO L78 Accepts]: Start accepts. Automaton has 139 states and 210 transitions. Word has length 85 [2024-08-15 18:23:03,361 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-08-15 18:23:03,361 INFO L495 AbstractCegarLoop]: Abstraction has 139 states and 210 transitions. [2024-08-15 18:23:03,361 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 13.166666666666666) internal successors, (79), 6 states have internal predecessors, (79), 2 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2024-08-15 18:23:03,361 INFO L276 IsEmpty]: Start isEmpty. Operand 139 states and 210 transitions. [2024-08-15 18:23:03,362 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 87 [2024-08-15 18:23:03,362 INFO L187 NwaCegarLoop]: Found error trace [2024-08-15 18:23:03,362 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-08-15 18:23:03,362 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2024-08-15 18:23:03,362 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-08-15 18:23:03,363 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-08-15 18:23:03,363 INFO L85 PathProgramCache]: Analyzing trace with hash 1373016192, now seen corresponding path program 1 times [2024-08-15 18:23:03,363 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-08-15 18:23:03,363 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1486240806] [2024-08-15 18:23:03,363 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-08-15 18:23:03,363 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-08-15 18:23:03,519 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-08-15 18:23:03,946 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2024-08-15 18:23:03,948 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-08-15 18:23:03,951 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 25 [2024-08-15 18:23:03,952 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-08-15 18:23:03,955 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 10 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2024-08-15 18:23:03,955 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-08-15 18:23:03,955 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1486240806] [2024-08-15 18:23:03,956 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1486240806] provided 1 perfect and 0 imperfect interpolant sequences [2024-08-15 18:23:03,956 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-08-15 18:23:03,958 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-08-15 18:23:03,958 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1409708184] [2024-08-15 18:23:03,959 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-08-15 18:23:03,959 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-08-15 18:23:03,959 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-08-15 18:23:03,960 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-08-15 18:23:03,960 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2024-08-15 18:23:03,960 INFO L87 Difference]: Start difference. First operand 139 states and 210 transitions. Second operand has 7 states, 7 states have (on average 11.142857142857142) internal successors, (78), 7 states have internal predecessors, (78), 2 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2024-08-15 18:23:04,023 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-08-15 18:23:04,024 INFO L93 Difference]: Finished difference Result 142 states and 212 transitions. [2024-08-15 18:23:04,025 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-08-15 18:23:04,025 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 11.142857142857142) internal successors, (78), 7 states have internal predecessors, (78), 2 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Word has length 86 [2024-08-15 18:23:04,026 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-08-15 18:23:04,027 INFO L225 Difference]: With dead ends: 142 [2024-08-15 18:23:04,027 INFO L226 Difference]: Without dead ends: 142 [2024-08-15 18:23:04,028 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2024-08-15 18:23:04,029 INFO L413 NwaCegarLoop]: 142 mSDtfsCounter, 20 mSDsluCounter, 680 mSDsCounter, 0 mSdLazyCounter, 57 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 20 SdHoareTripleChecker+Valid, 822 SdHoareTripleChecker+Invalid, 59 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 57 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-08-15 18:23:04,029 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [20 Valid, 822 Invalid, 59 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 57 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-08-15 18:23:04,031 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 142 states. [2024-08-15 18:23:04,039 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 142 to 142. [2024-08-15 18:23:04,040 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 142 states, 133 states have (on average 1.5263157894736843) internal successors, (203), 134 states have internal predecessors, (203), 5 states have call successors, (5), 4 states have call predecessors, (5), 3 states have return successors, (4), 3 states have call predecessors, (4), 4 states have call successors, (4) [2024-08-15 18:23:04,040 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 142 states to 142 states and 212 transitions. [2024-08-15 18:23:04,043 INFO L78 Accepts]: Start accepts. Automaton has 142 states and 212 transitions. Word has length 86 [2024-08-15 18:23:04,044 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-08-15 18:23:04,044 INFO L495 AbstractCegarLoop]: Abstraction has 142 states and 212 transitions. [2024-08-15 18:23:04,044 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 11.142857142857142) internal successors, (78), 7 states have internal predecessors, (78), 2 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2024-08-15 18:23:04,044 INFO L276 IsEmpty]: Start isEmpty. Operand 142 states and 212 transitions. [2024-08-15 18:23:04,045 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 88 [2024-08-15 18:23:04,045 INFO L187 NwaCegarLoop]: Found error trace [2024-08-15 18:23:04,045 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-08-15 18:23:04,045 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2024-08-15 18:23:04,046 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-08-15 18:23:04,046 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-08-15 18:23:04,046 INFO L85 PathProgramCache]: Analyzing trace with hash 1016025770, now seen corresponding path program 1 times [2024-08-15 18:23:04,046 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-08-15 18:23:04,046 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [916762493] [2024-08-15 18:23:04,046 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-08-15 18:23:04,047 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-08-15 18:23:04,225 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-08-15 18:23:04,933 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2024-08-15 18:23:04,935 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-08-15 18:23:04,937 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2024-08-15 18:23:04,938 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-08-15 18:23:04,940 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 13 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-08-15 18:23:04,941 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-08-15 18:23:04,941 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [916762493] [2024-08-15 18:23:04,941 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [916762493] provided 0 perfect and 1 imperfect interpolant sequences [2024-08-15 18:23:04,941 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [540180128] [2024-08-15 18:23:04,941 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-08-15 18:23:04,942 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-08-15 18:23:04,942 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-08-15 18:23:04,944 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-08-15 18:23:04,946 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2024-08-15 18:23:05,153 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-08-15 18:23:05,162 INFO L262 TraceCheckSpWp]: Trace formula consists of 452 conjuncts, 73 conjunts are in the unsatisfiable core [2024-08-15 18:23:05,172 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2024-08-15 18:23:06,190 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 14 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-08-15 18:23:06,190 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-08-15 18:23:06,191 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [540180128] provided 1 perfect and 0 imperfect interpolant sequences [2024-08-15 18:23:06,191 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-08-15 18:23:06,191 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [18] imperfect sequences [13] total 29 [2024-08-15 18:23:06,191 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1351309574] [2024-08-15 18:23:06,191 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-08-15 18:23:06,192 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 18 states [2024-08-15 18:23:06,192 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-08-15 18:23:06,193 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2024-08-15 18:23:06,193 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=71, Invalid=741, Unknown=0, NotChecked=0, Total=812 [2024-08-15 18:23:06,194 INFO L87 Difference]: Start difference. First operand 142 states and 212 transitions. Second operand has 18 states, 18 states have (on average 4.5) internal successors, (81), 18 states have internal predecessors, (81), 3 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2024-08-15 18:23:06,589 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-08-15 18:23:06,589 INFO L93 Difference]: Finished difference Result 186 states and 279 transitions. [2024-08-15 18:23:06,589 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2024-08-15 18:23:06,590 INFO L78 Accepts]: Start accepts. Automaton has has 18 states, 18 states have (on average 4.5) internal successors, (81), 18 states have internal predecessors, (81), 3 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Word has length 87 [2024-08-15 18:23:06,590 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-08-15 18:23:06,594 INFO L225 Difference]: With dead ends: 186 [2024-08-15 18:23:06,594 INFO L226 Difference]: Without dead ends: 186 [2024-08-15 18:23:06,595 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 104 GetRequests, 76 SyntacticMatches, 1 SemanticMatches, 27 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 200 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=71, Invalid=741, Unknown=0, NotChecked=0, Total=812 [2024-08-15 18:23:06,595 INFO L413 NwaCegarLoop]: 120 mSDtfsCounter, 86 mSDsluCounter, 1541 mSDsCounter, 0 mSdLazyCounter, 445 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 86 SdHoareTripleChecker+Valid, 1661 SdHoareTripleChecker+Invalid, 449 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 445 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2024-08-15 18:23:06,597 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [86 Valid, 1661 Invalid, 449 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 445 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2024-08-15 18:23:06,598 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 186 states. [2024-08-15 18:23:06,607 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 186 to 177. [2024-08-15 18:23:06,612 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 177 states, 168 states have (on average 1.5238095238095237) internal successors, (256), 169 states have internal predecessors, (256), 5 states have call successors, (5), 4 states have call predecessors, (5), 3 states have return successors, (4), 3 states have call predecessors, (4), 4 states have call successors, (4) [2024-08-15 18:23:06,614 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 177 states to 177 states and 265 transitions. [2024-08-15 18:23:06,614 INFO L78 Accepts]: Start accepts. Automaton has 177 states and 265 transitions. Word has length 87 [2024-08-15 18:23:06,614 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-08-15 18:23:06,617 INFO L495 AbstractCegarLoop]: Abstraction has 177 states and 265 transitions. [2024-08-15 18:23:06,618 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 18 states, 18 states have (on average 4.5) internal successors, (81), 18 states have internal predecessors, (81), 3 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2024-08-15 18:23:06,618 INFO L276 IsEmpty]: Start isEmpty. Operand 177 states and 265 transitions. [2024-08-15 18:23:06,623 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 88 [2024-08-15 18:23:06,623 INFO L187 NwaCegarLoop]: Found error trace [2024-08-15 18:23:06,623 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-08-15 18:23:06,644 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2024-08-15 18:23:06,824 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable5 [2024-08-15 18:23:06,824 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-08-15 18:23:06,825 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-08-15 18:23:06,825 INFO L85 PathProgramCache]: Analyzing trace with hash 1055127271, now seen corresponding path program 1 times [2024-08-15 18:23:06,825 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-08-15 18:23:06,825 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1386095536] [2024-08-15 18:23:06,825 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-08-15 18:23:06,825 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-08-15 18:23:06,971 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-08-15 18:23:07,487 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2024-08-15 18:23:07,489 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-08-15 18:23:07,490 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2024-08-15 18:23:07,491 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-08-15 18:23:07,493 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 14 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-08-15 18:23:07,493 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-08-15 18:23:07,493 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1386095536] [2024-08-15 18:23:07,494 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1386095536] provided 1 perfect and 0 imperfect interpolant sequences [2024-08-15 18:23:07,494 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-08-15 18:23:07,494 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2024-08-15 18:23:07,494 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2129312421] [2024-08-15 18:23:07,495 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-08-15 18:23:07,495 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-08-15 18:23:07,495 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-08-15 18:23:07,496 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-08-15 18:23:07,496 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=71, Unknown=0, NotChecked=0, Total=90 [2024-08-15 18:23:07,497 INFO L87 Difference]: Start difference. First operand 177 states and 265 transitions. Second operand has 10 states, 10 states have (on average 8.1) internal successors, (81), 10 states have internal predecessors, (81), 2 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2024-08-15 18:23:07,720 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-08-15 18:23:07,721 INFO L93 Difference]: Finished difference Result 315 states and 477 transitions. [2024-08-15 18:23:07,721 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2024-08-15 18:23:07,722 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 8.1) internal successors, (81), 10 states have internal predecessors, (81), 2 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) Word has length 87 [2024-08-15 18:23:07,722 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-08-15 18:23:07,724 INFO L225 Difference]: With dead ends: 315 [2024-08-15 18:23:07,724 INFO L226 Difference]: Without dead ends: 315 [2024-08-15 18:23:07,724 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 8 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 26 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=39, Invalid=171, Unknown=0, NotChecked=0, Total=210 [2024-08-15 18:23:07,725 INFO L413 NwaCegarLoop]: 216 mSDtfsCounter, 153 mSDsluCounter, 1304 mSDsCounter, 0 mSdLazyCounter, 145 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 154 SdHoareTripleChecker+Valid, 1520 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 [2024-08-15 18:23:07,725 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [154 Valid, 1520 Invalid, 147 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 145 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-08-15 18:23:07,726 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 315 states. [2024-08-15 18:23:07,731 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 315 to 237. [2024-08-15 18:23:07,732 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 237 states, 228 states have (on average 1.5087719298245614) internal successors, (344), 229 states have internal predecessors, (344), 5 states have call successors, (5), 4 states have call predecessors, (5), 3 states have return successors, (4), 3 states have call predecessors, (4), 4 states have call successors, (4) [2024-08-15 18:23:07,733 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 237 states to 237 states and 353 transitions. [2024-08-15 18:23:07,734 INFO L78 Accepts]: Start accepts. Automaton has 237 states and 353 transitions. Word has length 87 [2024-08-15 18:23:07,734 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-08-15 18:23:07,734 INFO L495 AbstractCegarLoop]: Abstraction has 237 states and 353 transitions. [2024-08-15 18:23:07,735 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 8.1) internal successors, (81), 10 states have internal predecessors, (81), 2 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2024-08-15 18:23:07,735 INFO L276 IsEmpty]: Start isEmpty. Operand 237 states and 353 transitions. [2024-08-15 18:23:07,736 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 89 [2024-08-15 18:23:07,736 INFO L187 NwaCegarLoop]: Found error trace [2024-08-15 18:23:07,736 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-08-15 18:23:07,736 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2024-08-15 18:23:07,736 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-08-15 18:23:07,737 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-08-15 18:23:07,737 INFO L85 PathProgramCache]: Analyzing trace with hash -1469868486, now seen corresponding path program 1 times [2024-08-15 18:23:07,737 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-08-15 18:23:07,738 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [804514683] [2024-08-15 18:23:07,738 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-08-15 18:23:07,738 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-08-15 18:23:07,887 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-08-15 18:23:08,323 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2024-08-15 18:23:08,324 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-08-15 18:23:08,327 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2024-08-15 18:23:08,329 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-08-15 18:23:08,332 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 14 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-08-15 18:23:08,333 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-08-15 18:23:08,334 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [804514683] [2024-08-15 18:23:08,335 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [804514683] provided 1 perfect and 0 imperfect interpolant sequences [2024-08-15 18:23:08,335 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-08-15 18:23:08,335 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2024-08-15 18:23:08,335 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1095223509] [2024-08-15 18:23:08,335 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-08-15 18:23:08,336 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-08-15 18:23:08,336 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-08-15 18:23:08,336 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-08-15 18:23:08,336 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=56, Unknown=0, NotChecked=0, Total=72 [2024-08-15 18:23:08,337 INFO L87 Difference]: Start difference. First operand 237 states and 353 transitions. Second operand has 9 states, 9 states have (on average 9.11111111111111) internal successors, (82), 9 states have internal predecessors, (82), 3 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2024-08-15 18:23:08,472 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-08-15 18:23:08,473 INFO L93 Difference]: Finished difference Result 269 states and 401 transitions. [2024-08-15 18:23:08,473 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-08-15 18:23:08,474 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 9.11111111111111) internal successors, (82), 9 states have internal predecessors, (82), 3 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Word has length 88 [2024-08-15 18:23:08,474 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-08-15 18:23:08,475 INFO L225 Difference]: With dead ends: 269 [2024-08-15 18:23:08,475 INFO L226 Difference]: Without dead ends: 269 [2024-08-15 18:23:08,475 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 13 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=38, Invalid=144, Unknown=0, NotChecked=0, Total=182 [2024-08-15 18:23:08,476 INFO L413 NwaCegarLoop]: 137 mSDtfsCounter, 92 mSDsluCounter, 801 mSDsCounter, 0 mSdLazyCounter, 95 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 92 SdHoareTripleChecker+Valid, 938 SdHoareTripleChecker+Invalid, 97 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 95 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-08-15 18:23:08,476 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [92 Valid, 938 Invalid, 97 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 95 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-08-15 18:23:08,477 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 269 states. [2024-08-15 18:23:08,483 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 269 to 242. [2024-08-15 18:23:08,485 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 242 states, 233 states have (on average 1.497854077253219) internal successors, (349), 234 states have internal predecessors, (349), 5 states have call successors, (5), 4 states have call predecessors, (5), 3 states have return successors, (4), 3 states have call predecessors, (4), 4 states have call successors, (4) [2024-08-15 18:23:08,486 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 242 states to 242 states and 358 transitions. [2024-08-15 18:23:08,487 INFO L78 Accepts]: Start accepts. Automaton has 242 states and 358 transitions. Word has length 88 [2024-08-15 18:23:08,488 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-08-15 18:23:08,488 INFO L495 AbstractCegarLoop]: Abstraction has 242 states and 358 transitions. [2024-08-15 18:23:08,489 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 9.11111111111111) internal successors, (82), 9 states have internal predecessors, (82), 3 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2024-08-15 18:23:08,489 INFO L276 IsEmpty]: Start isEmpty. Operand 242 states and 358 transitions. [2024-08-15 18:23:08,490 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 89 [2024-08-15 18:23:08,491 INFO L187 NwaCegarLoop]: Found error trace [2024-08-15 18:23:08,491 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-08-15 18:23:08,492 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2024-08-15 18:23:08,492 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-08-15 18:23:08,492 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-08-15 18:23:08,492 INFO L85 PathProgramCache]: Analyzing trace with hash -683163899, now seen corresponding path program 1 times [2024-08-15 18:23:08,492 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-08-15 18:23:08,493 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [499590613] [2024-08-15 18:23:08,493 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-08-15 18:23:08,493 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-08-15 18:23:08,616 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-08-15 18:23:08,949 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2024-08-15 18:23:08,950 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-08-15 18:23:08,952 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2024-08-15 18:23:08,952 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-08-15 18:23:08,954 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 14 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-08-15 18:23:08,954 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-08-15 18:23:08,954 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [499590613] [2024-08-15 18:23:08,954 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [499590613] provided 1 perfect and 0 imperfect interpolant sequences [2024-08-15 18:23:08,954 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-08-15 18:23:08,954 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2024-08-15 18:23:08,955 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1763495372] [2024-08-15 18:23:08,955 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-08-15 18:23:08,955 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-08-15 18:23:08,955 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-08-15 18:23:08,956 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-08-15 18:23:08,956 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2024-08-15 18:23:08,956 INFO L87 Difference]: Start difference. First operand 242 states and 358 transitions. Second operand has 9 states, 9 states have (on average 9.11111111111111) internal successors, (82), 9 states have internal predecessors, (82), 2 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2024-08-15 18:23:09,044 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-08-15 18:23:09,045 INFO L93 Difference]: Finished difference Result 267 states and 391 transitions. [2024-08-15 18:23:09,045 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-08-15 18:23:09,046 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 9.11111111111111) internal successors, (82), 9 states have internal predecessors, (82), 2 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) Word has length 88 [2024-08-15 18:23:09,046 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-08-15 18:23:09,048 INFO L225 Difference]: With dead ends: 267 [2024-08-15 18:23:09,048 INFO L226 Difference]: Without dead ends: 267 [2024-08-15 18:23:09,048 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 7 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2024-08-15 18:23:09,049 INFO L413 NwaCegarLoop]: 154 mSDtfsCounter, 8 mSDsluCounter, 1049 mSDsCounter, 0 mSdLazyCounter, 102 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 8 SdHoareTripleChecker+Valid, 1203 SdHoareTripleChecker+Invalid, 104 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 102 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-08-15 18:23:09,049 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [8 Valid, 1203 Invalid, 104 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 102 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-08-15 18:23:09,050 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 267 states. [2024-08-15 18:23:09,054 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 267 to 267. [2024-08-15 18:23:09,055 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 267 states, 258 states have (on average 1.4806201550387597) internal successors, (382), 259 states have internal predecessors, (382), 5 states have call successors, (5), 4 states have call predecessors, (5), 3 states have return successors, (4), 3 states have call predecessors, (4), 4 states have call successors, (4) [2024-08-15 18:23:09,056 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 267 states to 267 states and 391 transitions. [2024-08-15 18:23:09,056 INFO L78 Accepts]: Start accepts. Automaton has 267 states and 391 transitions. Word has length 88 [2024-08-15 18:23:09,056 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-08-15 18:23:09,057 INFO L495 AbstractCegarLoop]: Abstraction has 267 states and 391 transitions. [2024-08-15 18:23:09,057 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 9.11111111111111) internal successors, (82), 9 states have internal predecessors, (82), 2 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2024-08-15 18:23:09,057 INFO L276 IsEmpty]: Start isEmpty. Operand 267 states and 391 transitions. [2024-08-15 18:23:09,060 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 90 [2024-08-15 18:23:09,060 INFO L187 NwaCegarLoop]: Found error trace [2024-08-15 18:23:09,061 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-08-15 18:23:09,061 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2024-08-15 18:23:09,061 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-08-15 18:23:09,061 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-08-15 18:23:09,062 INFO L85 PathProgramCache]: Analyzing trace with hash -831125576, now seen corresponding path program 1 times [2024-08-15 18:23:09,062 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-08-15 18:23:09,062 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1320651358] [2024-08-15 18:23:09,063 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-08-15 18:23:09,063 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-08-15 18:23:09,116 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-08-15 18:23:09,276 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2024-08-15 18:23:09,278 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-08-15 18:23:09,280 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2024-08-15 18:23:09,281 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-08-15 18:23:09,283 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 14 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-08-15 18:23:09,283 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-08-15 18:23:09,283 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1320651358] [2024-08-15 18:23:09,284 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1320651358] provided 1 perfect and 0 imperfect interpolant sequences [2024-08-15 18:23:09,284 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-08-15 18:23:09,284 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-08-15 18:23:09,284 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [724171433] [2024-08-15 18:23:09,284 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-08-15 18:23:09,284 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-08-15 18:23:09,285 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-08-15 18:23:09,286 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-08-15 18:23:09,286 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-08-15 18:23:09,286 INFO L87 Difference]: Start difference. First operand 267 states and 391 transitions. Second operand has 5 states, 5 states have (on average 16.6) internal successors, (83), 5 states have internal predecessors, (83), 3 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2024-08-15 18:23:09,325 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-08-15 18:23:09,326 INFO L93 Difference]: Finished difference Result 274 states and 399 transitions. [2024-08-15 18:23:09,326 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-08-15 18:23:09,326 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 16.6) internal successors, (83), 5 states have internal predecessors, (83), 3 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Word has length 89 [2024-08-15 18:23:09,326 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-08-15 18:23:09,328 INFO L225 Difference]: With dead ends: 274 [2024-08-15 18:23:09,328 INFO L226 Difference]: Without dead ends: 274 [2024-08-15 18:23:09,328 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 7 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2024-08-15 18:23:09,328 INFO L413 NwaCegarLoop]: 142 mSDtfsCounter, 58 mSDsluCounter, 402 mSDsCounter, 0 mSdLazyCounter, 35 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 58 SdHoareTripleChecker+Valid, 544 SdHoareTripleChecker+Invalid, 35 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 35 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-08-15 18:23:09,329 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [58 Valid, 544 Invalid, 35 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 35 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-08-15 18:23:09,330 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 274 states. [2024-08-15 18:23:09,335 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 274 to 266. [2024-08-15 18:23:09,335 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 266 states, 257 states have (on average 1.4708171206225682) internal successors, (378), 258 states have internal predecessors, (378), 5 states have call successors, (5), 4 states have call predecessors, (5), 3 states have return successors, (4), 3 states have call predecessors, (4), 4 states have call successors, (4) [2024-08-15 18:23:09,337 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 266 states to 266 states and 387 transitions. [2024-08-15 18:23:09,337 INFO L78 Accepts]: Start accepts. Automaton has 266 states and 387 transitions. Word has length 89 [2024-08-15 18:23:09,337 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-08-15 18:23:09,337 INFO L495 AbstractCegarLoop]: Abstraction has 266 states and 387 transitions. [2024-08-15 18:23:09,338 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 16.6) internal successors, (83), 5 states have internal predecessors, (83), 3 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2024-08-15 18:23:09,338 INFO L276 IsEmpty]: Start isEmpty. Operand 266 states and 387 transitions. [2024-08-15 18:23:09,339 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 90 [2024-08-15 18:23:09,339 INFO L187 NwaCegarLoop]: Found error trace [2024-08-15 18:23:09,339 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-08-15 18:23:09,339 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2024-08-15 18:23:09,339 INFO L420 AbstractCegarLoop]: === Iteration 11 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-08-15 18:23:09,340 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-08-15 18:23:09,340 INFO L85 PathProgramCache]: Analyzing trace with hash -84392366, now seen corresponding path program 1 times [2024-08-15 18:23:09,340 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-08-15 18:23:09,340 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [581007579] [2024-08-15 18:23:09,340 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-08-15 18:23:09,341 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-08-15 18:23:09,470 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-08-15 18:23:10,242 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2024-08-15 18:23:10,244 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-08-15 18:23:10,245 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2024-08-15 18:23:10,246 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-08-15 18:23:10,248 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 14 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-08-15 18:23:10,248 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-08-15 18:23:10,248 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [581007579] [2024-08-15 18:23:10,249 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [581007579] provided 1 perfect and 0 imperfect interpolant sequences [2024-08-15 18:23:10,249 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-08-15 18:23:10,249 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [14] imperfect sequences [] total 14 [2024-08-15 18:23:10,249 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [32783090] [2024-08-15 18:23:10,249 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-08-15 18:23:10,250 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2024-08-15 18:23:10,250 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-08-15 18:23:10,250 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2024-08-15 18:23:10,251 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=31, Invalid=151, Unknown=0, NotChecked=0, Total=182 [2024-08-15 18:23:10,251 INFO L87 Difference]: Start difference. First operand 266 states and 387 transitions. Second operand has 14 states, 14 states have (on average 5.928571428571429) internal successors, (83), 14 states have internal predecessors, (83), 2 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2024-08-15 18:23:10,479 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-08-15 18:23:10,479 INFO L93 Difference]: Finished difference Result 329 states and 474 transitions. [2024-08-15 18:23:10,479 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2024-08-15 18:23:10,480 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 14 states have (on average 5.928571428571429) internal successors, (83), 14 states have internal predecessors, (83), 2 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) Word has length 89 [2024-08-15 18:23:10,480 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-08-15 18:23:10,481 INFO L225 Difference]: With dead ends: 329 [2024-08-15 18:23:10,481 INFO L226 Difference]: Without dead ends: 329 [2024-08-15 18:23:10,482 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 7 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 37 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=39, Invalid=201, Unknown=0, NotChecked=0, Total=240 [2024-08-15 18:23:10,482 INFO L413 NwaCegarLoop]: 151 mSDtfsCounter, 38 mSDsluCounter, 1371 mSDsCounter, 0 mSdLazyCounter, 247 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 38 SdHoareTripleChecker+Valid, 1522 SdHoareTripleChecker+Invalid, 250 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 247 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-08-15 18:23:10,482 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [38 Valid, 1522 Invalid, 250 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 247 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-08-15 18:23:10,483 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 329 states. [2024-08-15 18:23:10,488 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 329 to 309. [2024-08-15 18:23:10,489 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 309 states, 300 states have (on average 1.4566666666666668) internal successors, (437), 301 states have internal predecessors, (437), 5 states have call successors, (5), 4 states have call predecessors, (5), 3 states have return successors, (4), 3 states have call predecessors, (4), 4 states have call successors, (4) [2024-08-15 18:23:10,491 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 309 states to 309 states and 446 transitions. [2024-08-15 18:23:10,491 INFO L78 Accepts]: Start accepts. Automaton has 309 states and 446 transitions. Word has length 89 [2024-08-15 18:23:10,491 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-08-15 18:23:10,491 INFO L495 AbstractCegarLoop]: Abstraction has 309 states and 446 transitions. [2024-08-15 18:23:10,492 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 14 states have (on average 5.928571428571429) internal successors, (83), 14 states have internal predecessors, (83), 2 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2024-08-15 18:23:10,492 INFO L276 IsEmpty]: Start isEmpty. Operand 309 states and 446 transitions. [2024-08-15 18:23:10,493 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 90 [2024-08-15 18:23:10,493 INFO L187 NwaCegarLoop]: Found error trace [2024-08-15 18:23:10,493 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-08-15 18:23:10,493 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2024-08-15 18:23:10,494 INFO L420 AbstractCegarLoop]: === Iteration 12 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-08-15 18:23:10,494 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-08-15 18:23:10,494 INFO L85 PathProgramCache]: Analyzing trace with hash 126958547, now seen corresponding path program 1 times [2024-08-15 18:23:10,494 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-08-15 18:23:10,494 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [818222220] [2024-08-15 18:23:10,495 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-08-15 18:23:10,495 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-08-15 18:23:10,627 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-08-15 18:23:11,499 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2024-08-15 18:23:11,501 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-08-15 18:23:11,504 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2024-08-15 18:23:11,505 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-08-15 18:23:11,507 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 14 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-08-15 18:23:11,507 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-08-15 18:23:11,507 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [818222220] [2024-08-15 18:23:11,507 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [818222220] provided 1 perfect and 0 imperfect interpolant sequences [2024-08-15 18:23:11,507 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-08-15 18:23:11,507 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-08-15 18:23:11,508 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2138121431] [2024-08-15 18:23:11,508 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-08-15 18:23:11,508 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-08-15 18:23:11,508 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-08-15 18:23:11,509 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-08-15 18:23:11,509 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2024-08-15 18:23:11,509 INFO L87 Difference]: Start difference. First operand 309 states and 446 transitions. Second operand has 8 states, 8 states have (on average 10.375) internal successors, (83), 8 states have internal predecessors, (83), 2 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2024-08-15 18:23:11,570 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-08-15 18:23:11,570 INFO L93 Difference]: Finished difference Result 309 states and 442 transitions. [2024-08-15 18:23:11,571 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-08-15 18:23:11,571 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 10.375) internal successors, (83), 8 states have internal predecessors, (83), 2 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) Word has length 89 [2024-08-15 18:23:11,571 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-08-15 18:23:11,572 INFO L225 Difference]: With dead ends: 309 [2024-08-15 18:23:11,573 INFO L226 Difference]: Without dead ends: 309 [2024-08-15 18:23:11,573 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 8 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2024-08-15 18:23:11,573 INFO L413 NwaCegarLoop]: 146 mSDtfsCounter, 1 mSDsluCounter, 846 mSDsCounter, 0 mSdLazyCounter, 49 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 992 SdHoareTripleChecker+Invalid, 49 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 49 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-08-15 18:23:11,574 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [1 Valid, 992 Invalid, 49 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 49 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-08-15 18:23:11,574 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 309 states. [2024-08-15 18:23:11,579 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 309 to 309. [2024-08-15 18:23:11,580 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 309 states, 300 states have (on average 1.4433333333333334) internal successors, (433), 301 states have internal predecessors, (433), 5 states have call successors, (5), 4 states have call predecessors, (5), 3 states have return successors, (4), 3 states have call predecessors, (4), 4 states have call successors, (4) [2024-08-15 18:23:11,582 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 309 states to 309 states and 442 transitions. [2024-08-15 18:23:11,582 INFO L78 Accepts]: Start accepts. Automaton has 309 states and 442 transitions. Word has length 89 [2024-08-15 18:23:11,582 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-08-15 18:23:11,582 INFO L495 AbstractCegarLoop]: Abstraction has 309 states and 442 transitions. [2024-08-15 18:23:11,582 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 10.375) internal successors, (83), 8 states have internal predecessors, (83), 2 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2024-08-15 18:23:11,583 INFO L276 IsEmpty]: Start isEmpty. Operand 309 states and 442 transitions. [2024-08-15 18:23:11,583 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 91 [2024-08-15 18:23:11,584 INFO L187 NwaCegarLoop]: Found error trace [2024-08-15 18:23:11,584 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-08-15 18:23:11,584 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2024-08-15 18:23:11,584 INFO L420 AbstractCegarLoop]: === Iteration 13 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-08-15 18:23:11,585 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-08-15 18:23:11,585 INFO L85 PathProgramCache]: Analyzing trace with hash 1486259572, now seen corresponding path program 1 times [2024-08-15 18:23:11,585 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-08-15 18:23:11,585 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1410656162] [2024-08-15 18:23:11,585 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-08-15 18:23:11,585 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-08-15 18:23:11,680 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-08-15 18:23:12,486 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2024-08-15 18:23:12,487 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-08-15 18:23:12,488 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2024-08-15 18:23:12,491 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-08-15 18:23:12,493 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 14 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-08-15 18:23:12,494 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-08-15 18:23:12,494 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1410656162] [2024-08-15 18:23:12,494 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1410656162] provided 1 perfect and 0 imperfect interpolant sequences [2024-08-15 18:23:12,494 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-08-15 18:23:12,494 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [15] imperfect sequences [] total 15 [2024-08-15 18:23:12,495 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [500268112] [2024-08-15 18:23:12,495 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-08-15 18:23:12,495 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 15 states [2024-08-15 18:23:12,495 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-08-15 18:23:12,496 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2024-08-15 18:23:12,497 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=33, Invalid=177, Unknown=0, NotChecked=0, Total=210 [2024-08-15 18:23:12,497 INFO L87 Difference]: Start difference. First operand 309 states and 442 transitions. Second operand has 15 states, 15 states have (on average 5.6) internal successors, (84), 15 states have internal predecessors, (84), 3 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2024-08-15 18:23:12,925 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-08-15 18:23:12,926 INFO L93 Difference]: Finished difference Result 384 states and 559 transitions. [2024-08-15 18:23:12,927 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2024-08-15 18:23:12,927 INFO L78 Accepts]: Start accepts. Automaton has has 15 states, 15 states have (on average 5.6) internal successors, (84), 15 states have internal predecessors, (84), 3 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Word has length 90 [2024-08-15 18:23:12,927 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-08-15 18:23:12,930 INFO L225 Difference]: With dead ends: 384 [2024-08-15 18:23:12,930 INFO L226 Difference]: Without dead ends: 384 [2024-08-15 18:23:12,930 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 28 GetRequests, 7 SyntacticMatches, 0 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 64 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=78, Invalid=428, Unknown=0, NotChecked=0, Total=506 [2024-08-15 18:23:12,931 INFO L413 NwaCegarLoop]: 121 mSDtfsCounter, 132 mSDsluCounter, 1132 mSDsCounter, 0 mSdLazyCounter, 315 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 132 SdHoareTripleChecker+Valid, 1253 SdHoareTripleChecker+Invalid, 316 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 315 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2024-08-15 18:23:12,932 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [132 Valid, 1253 Invalid, 316 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 315 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2024-08-15 18:23:12,933 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 384 states. [2024-08-15 18:23:12,938 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 384 to 351. [2024-08-15 18:23:12,939 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 351 states, 342 states have (on average 1.4707602339181287) internal successors, (503), 343 states have internal predecessors, (503), 5 states have call successors, (5), 4 states have call predecessors, (5), 3 states have return successors, (4), 3 states have call predecessors, (4), 4 states have call successors, (4) [2024-08-15 18:23:12,940 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 351 states to 351 states and 512 transitions. [2024-08-15 18:23:12,940 INFO L78 Accepts]: Start accepts. Automaton has 351 states and 512 transitions. Word has length 90 [2024-08-15 18:23:12,941 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-08-15 18:23:12,941 INFO L495 AbstractCegarLoop]: Abstraction has 351 states and 512 transitions. [2024-08-15 18:23:12,941 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 15 states, 15 states have (on average 5.6) internal successors, (84), 15 states have internal predecessors, (84), 3 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2024-08-15 18:23:12,941 INFO L276 IsEmpty]: Start isEmpty. Operand 351 states and 512 transitions. [2024-08-15 18:23:12,942 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 91 [2024-08-15 18:23:12,942 INFO L187 NwaCegarLoop]: Found error trace [2024-08-15 18:23:12,942 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-08-15 18:23:12,943 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2024-08-15 18:23:12,943 INFO L420 AbstractCegarLoop]: === Iteration 14 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-08-15 18:23:12,943 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-08-15 18:23:12,943 INFO L85 PathProgramCache]: Analyzing trace with hash -1122988615, now seen corresponding path program 1 times [2024-08-15 18:23:12,944 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-08-15 18:23:12,944 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1083472965] [2024-08-15 18:23:12,944 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-08-15 18:23:12,944 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-08-15 18:23:13,043 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-08-15 18:23:13,454 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2024-08-15 18:23:13,456 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-08-15 18:23:13,459 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2024-08-15 18:23:13,460 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-08-15 18:23:13,461 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 15 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-08-15 18:23:13,461 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-08-15 18:23:13,462 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1083472965] [2024-08-15 18:23:13,462 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1083472965] provided 1 perfect and 0 imperfect interpolant sequences [2024-08-15 18:23:13,462 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-08-15 18:23:13,462 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2024-08-15 18:23:13,462 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1933476096] [2024-08-15 18:23:13,462 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-08-15 18:23:13,463 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2024-08-15 18:23:13,463 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-08-15 18:23:13,464 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2024-08-15 18:23:13,464 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=88, Unknown=0, NotChecked=0, Total=110 [2024-08-15 18:23:13,464 INFO L87 Difference]: Start difference. First operand 351 states and 512 transitions. Second operand has 11 states, 11 states have (on average 7.636363636363637) internal successors, (84), 11 states have internal predecessors, (84), 2 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2024-08-15 18:23:13,617 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-08-15 18:23:13,617 INFO L93 Difference]: Finished difference Result 375 states and 547 transitions. [2024-08-15 18:23:13,618 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2024-08-15 18:23:13,618 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 11 states have (on average 7.636363636363637) internal successors, (84), 11 states have internal predecessors, (84), 2 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) Word has length 90 [2024-08-15 18:23:13,618 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-08-15 18:23:13,620 INFO L225 Difference]: With dead ends: 375 [2024-08-15 18:23:13,620 INFO L226 Difference]: Without dead ends: 375 [2024-08-15 18:23:13,620 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 8 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 19 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=30, Invalid=126, Unknown=0, NotChecked=0, Total=156 [2024-08-15 18:23:13,621 INFO L413 NwaCegarLoop]: 148 mSDtfsCounter, 26 mSDsluCounter, 1044 mSDsCounter, 0 mSdLazyCounter, 124 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 26 SdHoareTripleChecker+Valid, 1192 SdHoareTripleChecker+Invalid, 125 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 124 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-08-15 18:23:13,622 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [26 Valid, 1192 Invalid, 125 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 124 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-08-15 18:23:13,622 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 375 states. [2024-08-15 18:23:13,630 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 375 to 367. [2024-08-15 18:23:13,631 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 367 states, 358 states have (on average 1.4720670391061452) internal successors, (527), 359 states have internal predecessors, (527), 5 states have call successors, (5), 4 states have call predecessors, (5), 3 states have return successors, (4), 3 states have call predecessors, (4), 4 states have call successors, (4) [2024-08-15 18:23:13,632 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 367 states to 367 states and 536 transitions. [2024-08-15 18:23:13,633 INFO L78 Accepts]: Start accepts. Automaton has 367 states and 536 transitions. Word has length 90 [2024-08-15 18:23:13,633 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-08-15 18:23:13,633 INFO L495 AbstractCegarLoop]: Abstraction has 367 states and 536 transitions. [2024-08-15 18:23:13,633 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 7.636363636363637) internal successors, (84), 11 states have internal predecessors, (84), 2 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2024-08-15 18:23:13,633 INFO L276 IsEmpty]: Start isEmpty. Operand 367 states and 536 transitions. [2024-08-15 18:23:13,635 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 91 [2024-08-15 18:23:13,635 INFO L187 NwaCegarLoop]: Found error trace [2024-08-15 18:23:13,635 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-08-15 18:23:13,635 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2024-08-15 18:23:13,636 INFO L420 AbstractCegarLoop]: === Iteration 15 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-08-15 18:23:13,636 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-08-15 18:23:13,636 INFO L85 PathProgramCache]: Analyzing trace with hash -2059206538, now seen corresponding path program 1 times [2024-08-15 18:23:13,636 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-08-15 18:23:13,636 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1520424933] [2024-08-15 18:23:13,637 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-08-15 18:23:13,637 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-08-15 18:23:13,768 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-08-15 18:23:14,221 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2024-08-15 18:23:14,222 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-08-15 18:23:14,224 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2024-08-15 18:23:14,225 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-08-15 18:23:14,226 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 14 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-08-15 18:23:14,227 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-08-15 18:23:14,227 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1520424933] [2024-08-15 18:23:14,227 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1520424933] provided 1 perfect and 0 imperfect interpolant sequences [2024-08-15 18:23:14,227 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-08-15 18:23:14,227 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2024-08-15 18:23:14,229 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1838293271] [2024-08-15 18:23:14,229 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-08-15 18:23:14,229 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-08-15 18:23:14,230 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-08-15 18:23:14,230 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-08-15 18:23:14,230 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=71, Unknown=0, NotChecked=0, Total=90 [2024-08-15 18:23:14,230 INFO L87 Difference]: Start difference. First operand 367 states and 536 transitions. Second operand has 10 states, 10 states have (on average 8.4) internal successors, (84), 10 states have internal predecessors, (84), 2 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2024-08-15 18:23:14,358 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-08-15 18:23:14,359 INFO L93 Difference]: Finished difference Result 391 states and 568 transitions. [2024-08-15 18:23:14,359 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-08-15 18:23:14,359 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 8.4) internal successors, (84), 10 states have internal predecessors, (84), 2 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) Word has length 90 [2024-08-15 18:23:14,360 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-08-15 18:23:14,361 INFO L225 Difference]: With dead ends: 391 [2024-08-15 18:23:14,361 INFO L226 Difference]: Without dead ends: 391 [2024-08-15 18:23:14,362 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 7 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 13 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=27, Invalid=105, Unknown=0, NotChecked=0, Total=132 [2024-08-15 18:23:14,362 INFO L413 NwaCegarLoop]: 150 mSDtfsCounter, 22 mSDsluCounter, 1039 mSDsCounter, 0 mSdLazyCounter, 124 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 22 SdHoareTripleChecker+Valid, 1189 SdHoareTripleChecker+Invalid, 125 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 124 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-08-15 18:23:14,363 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [22 Valid, 1189 Invalid, 125 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 124 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-08-15 18:23:14,363 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 391 states. [2024-08-15 18:23:14,370 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 391 to 384. [2024-08-15 18:23:14,370 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 384 states, 375 states have (on average 1.4693333333333334) internal successors, (551), 376 states have internal predecessors, (551), 5 states have call successors, (5), 4 states have call predecessors, (5), 3 states have return successors, (4), 3 states have call predecessors, (4), 4 states have call successors, (4) [2024-08-15 18:23:14,372 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 384 states to 384 states and 560 transitions. [2024-08-15 18:23:14,372 INFO L78 Accepts]: Start accepts. Automaton has 384 states and 560 transitions. Word has length 90 [2024-08-15 18:23:14,372 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-08-15 18:23:14,372 INFO L495 AbstractCegarLoop]: Abstraction has 384 states and 560 transitions. [2024-08-15 18:23:14,373 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 8.4) internal successors, (84), 10 states have internal predecessors, (84), 2 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2024-08-15 18:23:14,373 INFO L276 IsEmpty]: Start isEmpty. Operand 384 states and 560 transitions. [2024-08-15 18:23:14,374 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 91 [2024-08-15 18:23:14,374 INFO L187 NwaCegarLoop]: Found error trace [2024-08-15 18:23:14,374 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-08-15 18:23:14,374 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2024-08-15 18:23:14,374 INFO L420 AbstractCegarLoop]: === Iteration 16 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-08-15 18:23:14,375 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-08-15 18:23:14,375 INFO L85 PathProgramCache]: Analyzing trace with hash -1855050340, now seen corresponding path program 1 times [2024-08-15 18:23:14,376 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-08-15 18:23:14,376 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2095212469] [2024-08-15 18:23:14,376 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-08-15 18:23:14,376 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-08-15 18:23:14,483 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-08-15 18:23:14,933 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2024-08-15 18:23:14,935 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-08-15 18:23:14,936 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2024-08-15 18:23:14,938 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-08-15 18:23:14,941 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 14 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-08-15 18:23:14,941 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-08-15 18:23:14,941 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2095212469] [2024-08-15 18:23:14,942 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2095212469] provided 1 perfect and 0 imperfect interpolant sequences [2024-08-15 18:23:14,942 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-08-15 18:23:14,942 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2024-08-15 18:23:14,942 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [871821307] [2024-08-15 18:23:14,942 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-08-15 18:23:14,942 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2024-08-15 18:23:14,942 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-08-15 18:23:14,943 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2024-08-15 18:23:14,943 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=90, Unknown=0, NotChecked=0, Total=110 [2024-08-15 18:23:14,943 INFO L87 Difference]: Start difference. First operand 384 states and 560 transitions. Second operand has 11 states, 11 states have (on average 7.636363636363637) internal successors, (84), 11 states have internal predecessors, (84), 3 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2024-08-15 18:23:15,112 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-08-15 18:23:15,112 INFO L93 Difference]: Finished difference Result 412 states and 592 transitions. [2024-08-15 18:23:15,112 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-08-15 18:23:15,113 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 11 states have (on average 7.636363636363637) internal successors, (84), 11 states have internal predecessors, (84), 3 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Word has length 90 [2024-08-15 18:23:15,113 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-08-15 18:23:15,114 INFO L225 Difference]: With dead ends: 412 [2024-08-15 18:23:15,114 INFO L226 Difference]: Without dead ends: 412 [2024-08-15 18:23:15,115 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=24, Invalid=108, Unknown=0, NotChecked=0, Total=132 [2024-08-15 18:23:15,115 INFO L413 NwaCegarLoop]: 132 mSDtfsCounter, 69 mSDsluCounter, 1020 mSDsCounter, 0 mSdLazyCounter, 168 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 69 SdHoareTripleChecker+Valid, 1152 SdHoareTripleChecker+Invalid, 171 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 168 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-08-15 18:23:15,116 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [69 Valid, 1152 Invalid, 171 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 168 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-08-15 18:23:15,117 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 412 states. [2024-08-15 18:23:15,122 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 412 to 412. [2024-08-15 18:23:15,123 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 412 states, 403 states have (on average 1.446650124069479) internal successors, (583), 404 states have internal predecessors, (583), 5 states have call successors, (5), 4 states have call predecessors, (5), 3 states have return successors, (4), 3 states have call predecessors, (4), 4 states have call successors, (4) [2024-08-15 18:23:15,124 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 412 states to 412 states and 592 transitions. [2024-08-15 18:23:15,125 INFO L78 Accepts]: Start accepts. Automaton has 412 states and 592 transitions. Word has length 90 [2024-08-15 18:23:15,125 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-08-15 18:23:15,125 INFO L495 AbstractCegarLoop]: Abstraction has 412 states and 592 transitions. [2024-08-15 18:23:15,125 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 7.636363636363637) internal successors, (84), 11 states have internal predecessors, (84), 3 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2024-08-15 18:23:15,125 INFO L276 IsEmpty]: Start isEmpty. Operand 412 states and 592 transitions. [2024-08-15 18:23:15,126 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 91 [2024-08-15 18:23:15,127 INFO L187 NwaCegarLoop]: Found error trace [2024-08-15 18:23:15,127 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-08-15 18:23:15,127 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2024-08-15 18:23:15,127 INFO L420 AbstractCegarLoop]: === Iteration 17 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-08-15 18:23:15,128 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-08-15 18:23:15,128 INFO L85 PathProgramCache]: Analyzing trace with hash 908065848, now seen corresponding path program 1 times [2024-08-15 18:23:15,128 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-08-15 18:23:15,128 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [848504248] [2024-08-15 18:23:15,128 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-08-15 18:23:15,128 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-08-15 18:23:15,251 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-08-15 18:23:16,570 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2024-08-15 18:23:16,572 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-08-15 18:23:16,574 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2024-08-15 18:23:16,575 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-08-15 18:23:16,579 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 15 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-08-15 18:23:16,579 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-08-15 18:23:16,579 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [848504248] [2024-08-15 18:23:16,579 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [848504248] provided 1 perfect and 0 imperfect interpolant sequences [2024-08-15 18:23:16,580 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-08-15 18:23:16,580 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [14] imperfect sequences [] total 14 [2024-08-15 18:23:16,580 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1826735833] [2024-08-15 18:23:16,580 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-08-15 18:23:16,580 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2024-08-15 18:23:16,580 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-08-15 18:23:16,581 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2024-08-15 18:23:16,581 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=155, Unknown=0, NotChecked=0, Total=182 [2024-08-15 18:23:16,581 INFO L87 Difference]: Start difference. First operand 412 states and 592 transitions. Second operand has 14 states, 14 states have (on average 6.0) internal successors, (84), 14 states have internal predecessors, (84), 3 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2024-08-15 18:23:16,861 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-08-15 18:23:16,861 INFO L93 Difference]: Finished difference Result 426 states and 608 transitions. [2024-08-15 18:23:16,862 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2024-08-15 18:23:16,862 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 14 states have (on average 6.0) internal successors, (84), 14 states have internal predecessors, (84), 3 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Word has length 90 [2024-08-15 18:23:16,862 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-08-15 18:23:16,864 INFO L225 Difference]: With dead ends: 426 [2024-08-15 18:23:16,864 INFO L226 Difference]: Without dead ends: 426 [2024-08-15 18:23:16,864 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 16 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=27, Invalid=155, Unknown=0, NotChecked=0, Total=182 [2024-08-15 18:23:16,865 INFO L413 NwaCegarLoop]: 125 mSDtfsCounter, 52 mSDsluCounter, 1447 mSDsCounter, 0 mSdLazyCounter, 344 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 52 SdHoareTripleChecker+Valid, 1572 SdHoareTripleChecker+Invalid, 346 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 344 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2024-08-15 18:23:16,866 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [52 Valid, 1572 Invalid, 346 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 344 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2024-08-15 18:23:16,866 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 426 states. [2024-08-15 18:23:16,873 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 426 to 422. [2024-08-15 18:23:16,874 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 422 states, 413 states have (on average 1.430992736077482) internal successors, (591), 414 states have internal predecessors, (591), 5 states have call successors, (5), 4 states have call predecessors, (5), 3 states have return successors, (4), 3 states have call predecessors, (4), 4 states have call successors, (4) [2024-08-15 18:23:16,875 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 422 states to 422 states and 600 transitions. [2024-08-15 18:23:16,875 INFO L78 Accepts]: Start accepts. Automaton has 422 states and 600 transitions. Word has length 90 [2024-08-15 18:23:16,875 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-08-15 18:23:16,875 INFO L495 AbstractCegarLoop]: Abstraction has 422 states and 600 transitions. [2024-08-15 18:23:16,875 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 14 states have (on average 6.0) internal successors, (84), 14 states have internal predecessors, (84), 3 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2024-08-15 18:23:16,875 INFO L276 IsEmpty]: Start isEmpty. Operand 422 states and 600 transitions. [2024-08-15 18:23:16,876 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 91 [2024-08-15 18:23:16,877 INFO L187 NwaCegarLoop]: Found error trace [2024-08-15 18:23:16,877 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-08-15 18:23:16,877 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2024-08-15 18:23:16,877 INFO L420 AbstractCegarLoop]: === Iteration 18 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-08-15 18:23:16,877 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-08-15 18:23:16,877 INFO L85 PathProgramCache]: Analyzing trace with hash 496569236, now seen corresponding path program 1 times [2024-08-15 18:23:16,878 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-08-15 18:23:16,878 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [529949627] [2024-08-15 18:23:16,878 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-08-15 18:23:16,878 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-08-15 18:23:16,969 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-08-15 18:23:17,547 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2024-08-15 18:23:17,550 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-08-15 18:23:17,552 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2024-08-15 18:23:17,553 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-08-15 18:23:17,554 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 14 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-08-15 18:23:17,556 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-08-15 18:23:17,556 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [529949627] [2024-08-15 18:23:17,556 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [529949627] provided 1 perfect and 0 imperfect interpolant sequences [2024-08-15 18:23:17,556 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-08-15 18:23:17,556 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-08-15 18:23:17,556 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1208042055] [2024-08-15 18:23:17,556 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-08-15 18:23:17,557 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-08-15 18:23:17,557 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-08-15 18:23:17,557 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-08-15 18:23:17,558 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2024-08-15 18:23:17,558 INFO L87 Difference]: Start difference. First operand 422 states and 600 transitions. Second operand has 8 states, 8 states have (on average 10.5) internal successors, (84), 8 states have internal predecessors, (84), 2 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2024-08-15 18:23:17,655 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-08-15 18:23:17,656 INFO L93 Difference]: Finished difference Result 509 states and 728 transitions. [2024-08-15 18:23:17,656 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-08-15 18:23:17,657 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 10.5) internal successors, (84), 8 states have internal predecessors, (84), 2 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) Word has length 90 [2024-08-15 18:23:17,657 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-08-15 18:23:17,658 INFO L225 Difference]: With dead ends: 509 [2024-08-15 18:23:17,659 INFO L226 Difference]: Without dead ends: 505 [2024-08-15 18:23:17,659 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 8 SyntacticMatches, 1 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2024-08-15 18:23:17,659 INFO L413 NwaCegarLoop]: 166 mSDtfsCounter, 17 mSDsluCounter, 806 mSDsCounter, 0 mSdLazyCounter, 106 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 17 SdHoareTripleChecker+Valid, 972 SdHoareTripleChecker+Invalid, 106 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 106 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-08-15 18:23:17,659 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [17 Valid, 972 Invalid, 106 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 106 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-08-15 18:23:17,661 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 505 states. [2024-08-15 18:23:17,667 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 505 to 496. [2024-08-15 18:23:17,668 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 496 states, 487 states have (on average 1.4394250513347022) internal successors, (701), 488 states have internal predecessors, (701), 5 states have call successors, (5), 4 states have call predecessors, (5), 3 states have return successors, (4), 3 states have call predecessors, (4), 4 states have call successors, (4) [2024-08-15 18:23:17,670 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 496 states to 496 states and 710 transitions. [2024-08-15 18:23:17,670 INFO L78 Accepts]: Start accepts. Automaton has 496 states and 710 transitions. Word has length 90 [2024-08-15 18:23:17,670 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-08-15 18:23:17,670 INFO L495 AbstractCegarLoop]: Abstraction has 496 states and 710 transitions. [2024-08-15 18:23:17,671 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 10.5) internal successors, (84), 8 states have internal predecessors, (84), 2 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2024-08-15 18:23:17,671 INFO L276 IsEmpty]: Start isEmpty. Operand 496 states and 710 transitions. [2024-08-15 18:23:17,672 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 92 [2024-08-15 18:23:17,672 INFO L187 NwaCegarLoop]: Found error trace [2024-08-15 18:23:17,672 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-08-15 18:23:17,672 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2024-08-15 18:23:17,673 INFO L420 AbstractCegarLoop]: === Iteration 19 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-08-15 18:23:17,673 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-08-15 18:23:17,673 INFO L85 PathProgramCache]: Analyzing trace with hash -1667205472, now seen corresponding path program 1 times [2024-08-15 18:23:17,673 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-08-15 18:23:17,673 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [824434234] [2024-08-15 18:23:17,674 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-08-15 18:23:17,674 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-08-15 18:23:17,763 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-08-15 18:23:18,289 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2024-08-15 18:23:18,290 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-08-15 18:23:18,292 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2024-08-15 18:23:18,293 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-08-15 18:23:18,295 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 11 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-08-15 18:23:18,295 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-08-15 18:23:18,295 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [824434234] [2024-08-15 18:23:18,296 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [824434234] provided 0 perfect and 1 imperfect interpolant sequences [2024-08-15 18:23:18,296 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [354658837] [2024-08-15 18:23:18,296 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-08-15 18:23:18,296 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-08-15 18:23:18,296 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-08-15 18:23:18,298 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-08-15 18:23:18,299 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2024-08-15 18:23:18,531 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-08-15 18:23:18,535 INFO L262 TraceCheckSpWp]: Trace formula consists of 465 conjuncts, 34 conjunts are in the unsatisfiable core [2024-08-15 18:23:18,540 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2024-08-15 18:23:19,044 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 14 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-08-15 18:23:19,044 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2024-08-15 18:23:20,655 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 6 proven. 9 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-08-15 18:23:20,656 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [354658837] provided 0 perfect and 2 imperfect interpolant sequences [2024-08-15 18:23:20,656 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-08-15 18:23:20,656 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 11, 12] total 33 [2024-08-15 18:23:20,656 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [549095804] [2024-08-15 18:23:20,657 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-08-15 18:23:20,658 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 33 states [2024-08-15 18:23:20,658 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-08-15 18:23:20,659 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 33 interpolants. [2024-08-15 18:23:20,659 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=97, Invalid=959, Unknown=0, NotChecked=0, Total=1056 [2024-08-15 18:23:20,660 INFO L87 Difference]: Start difference. First operand 496 states and 710 transitions. Second operand has 33 states, 33 states have (on average 7.0606060606060606) internal successors, (233), 33 states have internal predecessors, (233), 5 states have call successors, (6), 2 states have call predecessors, (6), 1 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2024-08-15 18:23:22,961 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-08-15 18:23:22,962 INFO L93 Difference]: Finished difference Result 805 states and 1150 transitions. [2024-08-15 18:23:22,962 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 45 states. [2024-08-15 18:23:22,963 INFO L78 Accepts]: Start accepts. Automaton has has 33 states, 33 states have (on average 7.0606060606060606) internal successors, (233), 33 states have internal predecessors, (233), 5 states have call successors, (6), 2 states have call predecessors, (6), 1 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) Word has length 91 [2024-08-15 18:23:22,963 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-08-15 18:23:22,966 INFO L225 Difference]: With dead ends: 805 [2024-08-15 18:23:22,967 INFO L226 Difference]: Without dead ends: 805 [2024-08-15 18:23:22,969 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 235 GetRequests, 169 SyntacticMatches, 0 SemanticMatches, 66 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 744 ImplicationChecksByTransitivity, 1.8s TimeCoverageRelationStatistics Valid=417, Invalid=4139, Unknown=0, NotChecked=0, Total=4556 [2024-08-15 18:23:22,969 INFO L413 NwaCegarLoop]: 103 mSDtfsCounter, 538 mSDsluCounter, 2437 mSDsCounter, 0 mSdLazyCounter, 1633 mSolverCounterSat, 13 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 538 SdHoareTripleChecker+Valid, 2540 SdHoareTripleChecker+Invalid, 1646 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 13 IncrementalHoareTripleChecker+Valid, 1633 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.2s IncrementalHoareTripleChecker+Time [2024-08-15 18:23:22,969 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [538 Valid, 2540 Invalid, 1646 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [13 Valid, 1633 Invalid, 0 Unknown, 0 Unchecked, 1.2s Time] [2024-08-15 18:23:22,970 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 805 states. [2024-08-15 18:23:22,983 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 805 to 687. [2024-08-15 18:23:22,984 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 687 states, 678 states have (on average 1.424778761061947) internal successors, (966), 679 states have internal predecessors, (966), 5 states have call successors, (5), 4 states have call predecessors, (5), 3 states have return successors, (4), 3 states have call predecessors, (4), 4 states have call successors, (4) [2024-08-15 18:23:22,990 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 687 states to 687 states and 975 transitions. [2024-08-15 18:23:22,990 INFO L78 Accepts]: Start accepts. Automaton has 687 states and 975 transitions. Word has length 91 [2024-08-15 18:23:22,990 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-08-15 18:23:22,991 INFO L495 AbstractCegarLoop]: Abstraction has 687 states and 975 transitions. [2024-08-15 18:23:22,991 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 33 states, 33 states have (on average 7.0606060606060606) internal successors, (233), 33 states have internal predecessors, (233), 5 states have call successors, (6), 2 states have call predecessors, (6), 1 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2024-08-15 18:23:22,991 INFO L276 IsEmpty]: Start isEmpty. Operand 687 states and 975 transitions. [2024-08-15 18:23:22,993 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 92 [2024-08-15 18:23:22,993 INFO L187 NwaCegarLoop]: Found error trace [2024-08-15 18:23:22,993 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-08-15 18:23:23,016 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2024-08-15 18:23:23,194 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18,3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-08-15 18:23:23,195 INFO L420 AbstractCegarLoop]: === Iteration 20 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-08-15 18:23:23,195 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-08-15 18:23:23,195 INFO L85 PathProgramCache]: Analyzing trace with hash 2105028807, now seen corresponding path program 1 times [2024-08-15 18:23:23,195 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-08-15 18:23:23,196 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [536627520] [2024-08-15 18:23:23,196 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-08-15 18:23:23,196 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-08-15 18:23:23,310 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-08-15 18:23:24,238 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2024-08-15 18:23:24,239 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-08-15 18:23:24,241 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2024-08-15 18:23:24,242 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-08-15 18:23:24,244 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 14 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-08-15 18:23:24,244 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-08-15 18:23:24,244 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [536627520] [2024-08-15 18:23:24,244 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [536627520] provided 0 perfect and 1 imperfect interpolant sequences [2024-08-15 18:23:24,245 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1370066675] [2024-08-15 18:23:24,245 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-08-15 18:23:24,245 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-08-15 18:23:24,246 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-08-15 18:23:24,247 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-08-15 18:23:24,249 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2024-08-15 18:23:24,477 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-08-15 18:23:24,482 INFO L262 TraceCheckSpWp]: Trace formula consists of 465 conjuncts, 43 conjunts are in the unsatisfiable core [2024-08-15 18:23:24,494 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2024-08-15 18:23:24,854 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 14 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-08-15 18:23:24,854 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2024-08-15 18:23:26,152 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 6 proven. 9 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-08-15 18:23:26,153 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1370066675] provided 0 perfect and 2 imperfect interpolant sequences [2024-08-15 18:23:26,153 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-08-15 18:23:26,153 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [15, 12, 12] total 31 [2024-08-15 18:23:26,154 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1063790586] [2024-08-15 18:23:26,154 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-08-15 18:23:26,154 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 31 states [2024-08-15 18:23:26,154 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-08-15 18:23:26,155 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 31 interpolants. [2024-08-15 18:23:26,157 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=119, Invalid=811, Unknown=0, NotChecked=0, Total=930 [2024-08-15 18:23:26,157 INFO L87 Difference]: Start difference. First operand 687 states and 975 transitions. Second operand has 31 states, 31 states have (on average 5.516129032258065) internal successors, (171), 31 states have internal predecessors, (171), 4 states have call successors, (5), 2 states have call predecessors, (5), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2024-08-15 18:23:27,019 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-08-15 18:23:27,019 INFO L93 Difference]: Finished difference Result 817 states and 1170 transitions. [2024-08-15 18:23:27,019 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2024-08-15 18:23:27,020 INFO L78 Accepts]: Start accepts. Automaton has has 31 states, 31 states have (on average 5.516129032258065) internal successors, (171), 31 states have internal predecessors, (171), 4 states have call successors, (5), 2 states have call predecessors, (5), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) Word has length 91 [2024-08-15 18:23:27,020 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-08-15 18:23:27,023 INFO L225 Difference]: With dead ends: 817 [2024-08-15 18:23:27,023 INFO L226 Difference]: Without dead ends: 817 [2024-08-15 18:23:27,024 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 210 GetRequests, 170 SyntacticMatches, 1 SemanticMatches, 39 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 442 ImplicationChecksByTransitivity, 1.1s TimeCoverageRelationStatistics Valid=214, Invalid=1426, Unknown=0, NotChecked=0, Total=1640 [2024-08-15 18:23:27,025 INFO L413 NwaCegarLoop]: 222 mSDtfsCounter, 307 mSDsluCounter, 4219 mSDsCounter, 0 mSdLazyCounter, 680 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 308 SdHoareTripleChecker+Valid, 4441 SdHoareTripleChecker+Invalid, 683 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 680 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2024-08-15 18:23:27,025 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [308 Valid, 4441 Invalid, 683 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 680 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2024-08-15 18:23:27,026 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 817 states. [2024-08-15 18:23:27,051 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 817 to 702. [2024-08-15 18:23:27,053 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 702 states, 693 states have (on average 1.4242424242424243) internal successors, (987), 694 states have internal predecessors, (987), 5 states have call successors, (5), 4 states have call predecessors, (5), 3 states have return successors, (4), 3 states have call predecessors, (4), 4 states have call successors, (4) [2024-08-15 18:23:27,056 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 702 states to 702 states and 996 transitions. [2024-08-15 18:23:27,056 INFO L78 Accepts]: Start accepts. Automaton has 702 states and 996 transitions. Word has length 91 [2024-08-15 18:23:27,057 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-08-15 18:23:27,057 INFO L495 AbstractCegarLoop]: Abstraction has 702 states and 996 transitions. [2024-08-15 18:23:27,057 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 31 states, 31 states have (on average 5.516129032258065) internal successors, (171), 31 states have internal predecessors, (171), 4 states have call successors, (5), 2 states have call predecessors, (5), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2024-08-15 18:23:27,057 INFO L276 IsEmpty]: Start isEmpty. Operand 702 states and 996 transitions. [2024-08-15 18:23:27,059 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 92 [2024-08-15 18:23:27,060 INFO L187 NwaCegarLoop]: Found error trace [2024-08-15 18:23:27,060 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-08-15 18:23:27,081 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Forceful destruction successful, exit code 0 [2024-08-15 18:23:27,262 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-08-15 18:23:27,263 INFO L420 AbstractCegarLoop]: === Iteration 21 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-08-15 18:23:27,263 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-08-15 18:23:27,264 INFO L85 PathProgramCache]: Analyzing trace with hash 297574344, now seen corresponding path program 1 times [2024-08-15 18:23:27,264 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-08-15 18:23:27,264 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [733021766] [2024-08-15 18:23:27,264 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-08-15 18:23:27,264 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-08-15 18:23:27,413 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-08-15 18:23:27,413 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-08-15 18:23:27,489 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-08-15 18:23:27,523 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-08-15 18:23:27,524 INFO L360 BasicCegarLoop]: Counterexample is feasible [2024-08-15 18:23:27,525 INFO L805 garLoopResultBuilder]: Registering result UNSAFE for location __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2024-08-15 18:23:27,527 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20 [2024-08-15 18:23:27,530 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] [2024-08-15 18:23:27,534 INFO L176 ceAbstractionStarter]: Computing trace abstraction results [2024-08-15 18:23:27,595 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 15.08 06:23:27 BoogieIcfgContainer [2024-08-15 18:23:27,596 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2024-08-15 18:23:27,596 INFO L158 Benchmark]: Toolchain (without parser) took 29150.47ms. Allocated memory was 142.6MB in the beginning and 696.3MB in the end (delta: 553.6MB). Free memory was 68.6MB in the beginning and 509.1MB in the end (delta: -440.5MB). Peak memory consumption was 113.7MB. Max. memory is 16.1GB. [2024-08-15 18:23:27,596 INFO L158 Benchmark]: Witness Parser took 0.20ms. Allocated memory is still 142.6MB. Free memory is still 91.9MB. There was no memory consumed. Max. memory is 16.1GB. [2024-08-15 18:23:27,596 INFO L158 Benchmark]: CDTParser took 0.09ms. Allocated memory is still 142.6MB. Free memory is still 114.3MB. There was no memory consumed. Max. memory is 16.1GB. [2024-08-15 18:23:27,597 INFO L158 Benchmark]: CACSL2BoogieTranslator took 467.88ms. Allocated memory was 142.6MB in the beginning and 180.4MB in the end (delta: 37.7MB). Free memory was 68.4MB in the beginning and 142.6MB in the end (delta: -74.2MB). Peak memory consumption was 9.6MB. Max. memory is 16.1GB. [2024-08-15 18:23:27,597 INFO L158 Benchmark]: Boogie Preprocessor took 118.49ms. Allocated memory is still 180.4MB. Free memory was 142.6MB in the beginning and 138.5MB in the end (delta: 4.1MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. [2024-08-15 18:23:27,597 INFO L158 Benchmark]: IcfgBuilder took 892.99ms. Allocated memory is still 180.4MB. Free memory was 138.5MB in the beginning and 81.9MB in the end (delta: 56.6MB). Peak memory consumption was 56.6MB. Max. memory is 16.1GB. [2024-08-15 18:23:27,597 INFO L158 Benchmark]: TraceAbstraction took 27665.20ms. Allocated memory was 180.4MB in the beginning and 696.3MB in the end (delta: 515.9MB). Free memory was 80.9MB in the beginning and 509.1MB in the end (delta: -428.2MB). Peak memory consumption was 87.7MB. Max. memory is 16.1GB. [2024-08-15 18:23:27,598 INFO L338 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * Witness Parser took 0.20ms. Allocated memory is still 142.6MB. Free memory is still 91.9MB. There was no memory consumed. Max. memory is 16.1GB. * CDTParser took 0.09ms. Allocated memory is still 142.6MB. Free memory is still 114.3MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 467.88ms. Allocated memory was 142.6MB in the beginning and 180.4MB in the end (delta: 37.7MB). Free memory was 68.4MB in the beginning and 142.6MB in the end (delta: -74.2MB). Peak memory consumption was 9.6MB. Max. memory is 16.1GB. * Boogie Preprocessor took 118.49ms. Allocated memory is still 180.4MB. Free memory was 142.6MB in the beginning and 138.5MB in the end (delta: 4.1MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. * IcfgBuilder took 892.99ms. Allocated memory is still 180.4MB. Free memory was 138.5MB in the beginning and 81.9MB in the end (delta: 56.6MB). Peak memory consumption was 56.6MB. Max. memory is 16.1GB. * TraceAbstraction took 27665.20ms. Allocated memory was 180.4MB in the beginning and 696.3MB in the end (delta: 515.9MB). Free memory was 80.9MB in the beginning and 509.1MB in the end (delta: -428.2MB). Peak memory consumption was 87.7MB. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: ErrorAutomatonStatistics NumberErrorTraces: 0, NumberStatementsAllTraces: 0, NumberRelevantStatements: 0, 0.0s ErrorAutomatonConstructionTimeTotal, 0.0s FaulLocalizationTime, NumberStatementsFirstTrace: -1, TraceLengthAvg: 0, 0.0s ErrorAutomatonConstructionTimeAvg, 0.0s ErrorAutomatonDifferenceTimeAvg, 0.0s ErrorAutomatonDifferenceTimeTotal, NumberOfNoEnhancement: 0, NumberOfFiniteEnhancement: 0, NumberOfInfiniteEnhancement: 0 - UnprovableResult [Line: 21]: 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 bitwiseOr at line 106, overapproximation of bitwiseAnd at line 111. Possible FailurePath: [L26] const SORT_1 mask_SORT_1 = (SORT_1)-1 >> (sizeof(SORT_1) * 8 - 3); [L27] const SORT_1 msb_SORT_1 = (SORT_1)1 << (3 - 1); [L29] const SORT_3 mask_SORT_3 = (SORT_3)-1 >> (sizeof(SORT_3) * 8 - 1); [L30] const SORT_3 msb_SORT_3 = (SORT_3)1 << (1 - 1); [L32] const SORT_12 mask_SORT_12 = (SORT_12)-1 >> (sizeof(SORT_12) * 8 - 8); [L33] const SORT_12 msb_SORT_12 = (SORT_12)1 << (8 - 1); [L35] const SORT_3 var_14 = 0; [L36] const SORT_3 var_29 = 1; [L38] SORT_1 input_2; [L39] SORT_3 input_4; [L40] SORT_3 input_5; [L41] SORT_3 input_6; [L42] SORT_3 input_7; [L43] SORT_3 input_8; [L44] SORT_3 input_9; [L45] SORT_3 input_10; [L46] SORT_3 input_11; [L47] SORT_12 input_13; [L48] SORT_12 input_33; [L49] SORT_12 input_35; [L50] SORT_3 input_37; [L51] SORT_3 input_39; [L52] SORT_12 input_97; [L53] SORT_3 input_99; [L54] SORT_1 input_102; [L55] SORT_3 input_104; [L56] SORT_3 input_106; [L57] SORT_3 input_108; [L59] EXPR __VERIFIER_nondet_uchar() & mask_SORT_3 [L59] EXPR __VERIFIER_nondet_uchar() & mask_SORT_3 VAL [mask_SORT_3=1, var_14=0, var_29=1] [L59] SORT_3 state_15 = __VERIFIER_nondet_uchar() & mask_SORT_3; [L60] EXPR __VERIFIER_nondet_uchar() & mask_SORT_3 [L60] EXPR __VERIFIER_nondet_uchar() & mask_SORT_3 VAL [mask_SORT_3=1, var_14=0, var_29=1] [L60] SORT_3 state_17 = __VERIFIER_nondet_uchar() & mask_SORT_3; [L61] EXPR __VERIFIER_nondet_uchar() & mask_SORT_3 [L61] EXPR __VERIFIER_nondet_uchar() & mask_SORT_3 VAL [mask_SORT_3=1, var_14=0, var_29=1] [L61] SORT_3 state_20 = __VERIFIER_nondet_uchar() & mask_SORT_3; [L62] EXPR __VERIFIER_nondet_uchar() & mask_SORT_3 [L62] EXPR __VERIFIER_nondet_uchar() & mask_SORT_3 VAL [mask_SORT_3=1, var_14=0, var_29=1] [L62] SORT_3 state_24 = __VERIFIER_nondet_uchar() & mask_SORT_3; [L64] SORT_3 init_16_arg_1 = var_14; [L65] state_15 = init_16_arg_1 [L66] SORT_3 init_18_arg_1 = var_14; [L67] state_17 = init_18_arg_1 [L68] SORT_3 init_21_arg_1 = var_14; [L69] state_20 = init_21_arg_1 [L70] SORT_3 init_25_arg_1 = var_14; [L71] state_24 = init_25_arg_1 VAL [mask_SORT_3=1, state_15=0, state_17=0, state_20=0, state_24=0, var_29=1] [L74] input_2 = __VERIFIER_nondet_uchar() [L75] input_4 = __VERIFIER_nondet_uchar() [L76] input_5 = __VERIFIER_nondet_uchar() [L77] input_6 = __VERIFIER_nondet_uchar() [L78] input_7 = __VERIFIER_nondet_uchar() [L79] input_8 = __VERIFIER_nondet_uchar() [L80] input_9 = __VERIFIER_nondet_uchar() [L81] input_10 = __VERIFIER_nondet_uchar() [L82] input_11 = __VERIFIER_nondet_uchar() [L83] input_13 = __VERIFIER_nondet_uchar() [L84] input_33 = __VERIFIER_nondet_uchar() [L85] input_35 = __VERIFIER_nondet_uchar() [L86] input_37 = __VERIFIER_nondet_uchar() [L87] input_39 = __VERIFIER_nondet_uchar() [L88] input_97 = __VERIFIER_nondet_uchar() [L89] input_99 = __VERIFIER_nondet_uchar() [L90] input_102 = __VERIFIER_nondet_uchar() [L91] input_104 = __VERIFIER_nondet_uchar() [L92] input_106 = __VERIFIER_nondet_uchar() [L93] input_108 = __VERIFIER_nondet_uchar() [L96] SORT_3 var_19_arg_0 = state_15; [L97] SORT_3 var_19_arg_1 = state_17; VAL [mask_SORT_3=1, state_15=0, state_17=0, state_20=0, state_24=0, var_19_arg_0=0, var_19_arg_1=0, var_29=1] [L98] EXPR var_19_arg_0 | var_19_arg_1 [L98] EXPR var_19_arg_0 | var_19_arg_1 VAL [mask_SORT_3=1, state_15=0, state_17=0, state_20=0, state_24=0, var_29=1] [L98] SORT_3 var_19 = var_19_arg_0 | var_19_arg_1; [L99] SORT_3 var_22_arg_0 = var_19; [L100] SORT_3 var_22_arg_1 = state_20; VAL [mask_SORT_3=1, state_15=0, state_17=0, state_20=0, state_24=0, var_22_arg_0=0, var_22_arg_1=0, var_29=1] [L101] EXPR var_22_arg_0 | var_22_arg_1 [L101] EXPR var_22_arg_0 | var_22_arg_1 VAL [mask_SORT_3=1, state_15=0, state_17=0, state_20=0, state_24=0, var_29=1] [L101] SORT_3 var_22 = var_22_arg_0 | var_22_arg_1; [L102] SORT_3 var_23_arg_0 = var_22; [L103] SORT_3 var_23 = ~var_23_arg_0; [L104] SORT_3 var_26_arg_0 = var_23; [L105] SORT_3 var_26_arg_1 = state_24; VAL [mask_SORT_3=1, state_15=0, state_17=0, state_20=0, var_26_arg_0=-1, var_26_arg_1=0, var_29=1] [L106] EXPR var_26_arg_0 | var_26_arg_1 VAL [mask_SORT_3=1, state_15=0, state_17=0, state_20=0, var_26_arg_0=-1, var_26_arg_1=0, var_29=1] [L106] EXPR var_26_arg_0 | var_26_arg_1 [L106] EXPR var_26_arg_0 | var_26_arg_1 VAL [mask_SORT_3=1, state_15=0, state_17=0, state_20=0, var_29=1] [L106] SORT_3 var_26 = var_26_arg_0 | var_26_arg_1; [L107] SORT_3 var_30_arg_0 = var_26; [L108] SORT_3 var_30 = ~var_30_arg_0; [L109] SORT_3 var_31_arg_0 = var_29; [L110] SORT_3 var_31_arg_1 = var_30; VAL [mask_SORT_3=1, state_15=0, state_17=0, state_20=0, var_29=1, var_31_arg_0=1, var_31_arg_1=-256] [L111] EXPR var_31_arg_0 & var_31_arg_1 [L111] EXPR var_31_arg_0 & var_31_arg_1 VAL [mask_SORT_3=1, state_15=0, state_17=0, state_20=0, var_29=1] [L111] SORT_3 var_31 = var_31_arg_0 & var_31_arg_1; [L112] EXPR var_31 & mask_SORT_3 [L112] EXPR var_31 & mask_SORT_3 VAL [mask_SORT_3=1, state_15=0, state_17=0, state_20=0, var_29=1] [L112] var_31 = var_31 & mask_SORT_3 [L113] SORT_3 bad_32_arg_0 = var_31; VAL [bad_32_arg_0=0, mask_SORT_3=1, state_15=0, state_17=0, state_20=0, var_29=1] [L114] CALL __VERIFIER_assert(!(bad_32_arg_0)) VAL [\old(cond)=1] [L21] COND FALSE !(!(cond)) VAL [\old(cond)=1] [L114] RET __VERIFIER_assert(!(bad_32_arg_0)) VAL [bad_32_arg_0=0, mask_SORT_3=1, state_15=0, state_17=0, state_20=0, var_29=1] [L116] SORT_3 var_41_arg_0 = state_17; [L117] SORT_3 var_41 = ~var_41_arg_0; [L118] SORT_3 var_42_arg_0 = state_15; [L119] SORT_3 var_42 = ~var_42_arg_0; [L120] SORT_3 var_43_arg_0 = var_42; [L121] SORT_3 var_43_arg_1 = state_20; VAL [bad_32_arg_0=0, mask_SORT_3=1, state_15=0, state_17=0, state_20=0, var_29=1, var_41=-1, var_42=-1, var_43_arg_0=-1, var_43_arg_1=0] [L122] EXPR var_43_arg_0 & var_43_arg_1 [L122] EXPR var_43_arg_0 & var_43_arg_1 VAL [bad_32_arg_0=0, mask_SORT_3=1, state_15=0, state_17=0, state_20=0, var_29=1, var_41=-1, var_42=-1] [L122] SORT_3 var_43 = var_43_arg_0 & var_43_arg_1; [L123] SORT_3 var_44_arg_0 = var_43; [L124] SORT_3 var_44 = ~var_44_arg_0; [L125] SORT_3 var_45_arg_0 = var_41; [L126] SORT_3 var_45_arg_1 = var_44; VAL [bad_32_arg_0=0, mask_SORT_3=1, state_15=0, state_17=0, state_20=0, var_29=1, var_42=-1, var_45_arg_0=-1, var_45_arg_1=-1] [L127] EXPR var_45_arg_0 | var_45_arg_1 [L127] EXPR var_45_arg_0 | var_45_arg_1 VAL [bad_32_arg_0=0, mask_SORT_3=1, state_15=0, state_17=0, state_20=0, var_29=1, var_42=-1] [L127] SORT_3 var_45 = var_45_arg_0 | var_45_arg_1; [L128] SORT_3 var_46_arg_0 = var_45; [L129] SORT_3 var_46 = ~var_46_arg_0; [L130] SORT_3 var_47_arg_0 = state_17; [L131] SORT_3 var_47_arg_1 = state_20; VAL [bad_32_arg_0=0, mask_SORT_3=1, state_15=0, state_17=0, state_20=0, var_29=1, var_42=-1, var_46=-256, var_47_arg_0=0, var_47_arg_1=0] [L132] EXPR var_47_arg_0 & var_47_arg_1 [L132] EXPR var_47_arg_0 & var_47_arg_1 VAL [bad_32_arg_0=0, mask_SORT_3=1, state_15=0, state_17=0, state_20=0, var_29=1, var_42=-1, var_46=-256] [L132] SORT_3 var_47 = var_47_arg_0 & var_47_arg_1; [L133] SORT_3 var_48_arg_0 = var_42; [L134] SORT_3 var_48_arg_1 = var_47; VAL [bad_32_arg_0=0, mask_SORT_3=1, state_15=0, state_17=0, state_20=0, var_29=1, var_46=-256, var_48_arg_0=-1, var_48_arg_1=0] [L135] EXPR var_48_arg_0 | var_48_arg_1 VAL [bad_32_arg_0=0, mask_SORT_3=1, state_15=0, state_17=0, state_20=0, var_29=1, var_46=-256, var_48_arg_0=-1, var_48_arg_1=0] [L135] EXPR var_48_arg_0 | var_48_arg_1 [L135] EXPR var_48_arg_0 | var_48_arg_1 VAL [bad_32_arg_0=0, mask_SORT_3=1, state_15=0, state_17=0, state_20=0, var_29=1, var_46=-256] [L135] SORT_3 var_48 = var_48_arg_0 | var_48_arg_1; [L136] SORT_3 var_49_arg_0 = var_48; [L137] SORT_3 var_49 = ~var_49_arg_0; [L138] SORT_3 var_50_arg_0 = var_46; [L139] SORT_3 var_50_arg_1 = var_49; VAL [bad_32_arg_0=0, mask_SORT_3=1, state_15=0, state_17=0, state_20=0, var_29=1, var_50_arg_0=-256, var_50_arg_1=-256] [L140] EXPR var_50_arg_0 | var_50_arg_1 [L140] EXPR var_50_arg_0 | var_50_arg_1 VAL [bad_32_arg_0=0, mask_SORT_3=1, state_15=0, state_17=0, state_20=0, var_29=1] [L140] SORT_3 var_50 = var_50_arg_0 | var_50_arg_1; [L141] SORT_3 next_110_arg_1 = var_50; [L142] SORT_3 var_52_arg_0 = state_20; [L143] SORT_3 var_52 = ~var_52_arg_0; [L144] SORT_3 var_53_arg_0 = state_17; [L145] SORT_3 var_53_arg_1 = var_52; VAL [bad_32_arg_0=0, mask_SORT_3=1, next_110_arg_1=0, state_15=0, state_17=0, state_20=0, var_29=1, var_52=-1, var_53_arg_0=0, var_53_arg_1=-1] [L146] EXPR var_53_arg_0 | var_53_arg_1 [L146] EXPR var_53_arg_0 | var_53_arg_1 VAL [bad_32_arg_0=0, mask_SORT_3=1, next_110_arg_1=0, state_15=0, state_17=0, state_20=0, var_29=1, var_52=-1] [L146] SORT_3 var_53 = var_53_arg_0 | var_53_arg_1; [L147] SORT_3 var_54_arg_0 = state_17; [L148] SORT_3 var_54_arg_1 = var_52; VAL [bad_32_arg_0=0, mask_SORT_3=1, next_110_arg_1=0, state_15=0, state_17=0, state_20=0, var_29=1, var_52=-1, var_53=255, var_54_arg_0=0, var_54_arg_1=-1] [L149] EXPR var_54_arg_0 & var_54_arg_1 [L149] EXPR var_54_arg_0 & var_54_arg_1 VAL [bad_32_arg_0=0, mask_SORT_3=1, next_110_arg_1=0, state_15=0, state_17=0, state_20=0, var_29=1, var_52=-1, var_53=255] [L149] SORT_3 var_54 = var_54_arg_0 & var_54_arg_1; [L150] SORT_3 var_55_arg_0 = var_54; [L151] SORT_3 var_55 = ~var_55_arg_0; [L152] SORT_3 var_56_arg_0 = var_53; [L153] SORT_3 var_56_arg_1 = var_55; VAL [bad_32_arg_0=0, mask_SORT_3=1, next_110_arg_1=0, state_15=0, state_17=0, state_20=0, var_29=1, var_52=-1, var_56_arg_0=255, var_56_arg_1=-1] [L154] EXPR var_56_arg_0 & var_56_arg_1 VAL [bad_32_arg_0=0, mask_SORT_3=1, next_110_arg_1=0, state_15=0, state_17=0, state_20=0, var_29=1, var_52=-1, var_56_arg_0=255, var_56_arg_1=-1] [L154] EXPR var_56_arg_0 & var_56_arg_1 [L154] EXPR var_56_arg_0 & var_56_arg_1 VAL [bad_32_arg_0=0, mask_SORT_3=1, next_110_arg_1=0, state_15=0, state_17=0, state_20=0, var_29=1, var_52=-1] [L154] SORT_3 var_56 = var_56_arg_0 & var_56_arg_1; [L155] SORT_3 var_57_arg_0 = var_56; [L156] SORT_3 var_57 = ~var_57_arg_0; [L157] SORT_3 next_111_arg_1 = var_57; [L158] SORT_1 var_59_arg_0 = input_2; [L159] SORT_3 var_59 = var_59_arg_0 >> 0; [L160] SORT_1 var_60_arg_0 = input_2; [L161] SORT_3 var_60 = var_60_arg_0 >> 2; [L162] SORT_3 var_61_arg_0 = var_60; [L163] SORT_3 var_61 = ~var_61_arg_0; [L164] SORT_1 var_62_arg_0 = input_2; [L165] SORT_3 var_62 = var_62_arg_0 >> 1; [L166] SORT_3 var_63_arg_0 = var_61; [L167] SORT_3 var_63_arg_1 = var_62; VAL [bad_32_arg_0=0, mask_SORT_3=1, next_110_arg_1=0, next_111_arg_1=-256, state_15=0, state_17=0, state_20=0, var_29=1, var_52=-1, var_59=0, var_63_arg_0=-1, var_63_arg_1=0] [L168] EXPR var_63_arg_0 | var_63_arg_1 VAL [bad_32_arg_0=0, mask_SORT_3=1, next_110_arg_1=0, next_111_arg_1=-256, state_15=0, state_17=0, state_20=0, var_29=1, var_52=-1, var_59=0, var_63_arg_0=-1, var_63_arg_1=0] [L168] EXPR var_63_arg_0 | var_63_arg_1 [L168] EXPR var_63_arg_0 | var_63_arg_1 VAL [bad_32_arg_0=0, mask_SORT_3=1, next_110_arg_1=0, next_111_arg_1=-256, state_15=0, state_17=0, state_20=0, var_29=1, var_52=-1, var_59=0] [L168] SORT_3 var_63 = var_63_arg_0 | var_63_arg_1; [L169] SORT_3 var_64_arg_0 = var_59; [L170] SORT_3 var_64_arg_1 = var_63; VAL [bad_32_arg_0=0, mask_SORT_3=1, next_110_arg_1=0, next_111_arg_1=-256, state_15=0, state_17=0, state_20=0, var_29=1, var_52=-1, var_59=0, var_63=255, var_64_arg_0=0, var_64_arg_1=255] [L171] EXPR var_64_arg_0 | var_64_arg_1 [L171] EXPR var_64_arg_0 | var_64_arg_1 VAL [bad_32_arg_0=0, mask_SORT_3=1, next_110_arg_1=0, next_111_arg_1=-256, state_15=0, state_17=0, state_20=0, var_29=1, var_52=-1, var_59=0, var_63=255] [L171] SORT_3 var_64 = var_64_arg_0 | var_64_arg_1; [L172] SORT_3 var_65_arg_0 = var_64; [L173] SORT_3 var_65 = ~var_65_arg_0; [L174] SORT_3 var_66_arg_0 = state_15; [L175] SORT_3 var_66_arg_1 = state_17; VAL [bad_32_arg_0=0, mask_SORT_3=1, next_110_arg_1=0, next_111_arg_1=-256, state_20=0, var_29=1, var_52=-1, var_59=0, var_63=255, var_65=-256, var_66_arg_0=0, var_66_arg_1=0] [L176] EXPR var_66_arg_0 | var_66_arg_1 [L176] EXPR var_66_arg_0 | var_66_arg_1 VAL [bad_32_arg_0=0, mask_SORT_3=1, next_110_arg_1=0, next_111_arg_1=-256, state_20=0, var_29=1, var_52=-1, var_59=0, var_63=255, var_65=-256] [L176] SORT_3 var_66 = var_66_arg_0 | var_66_arg_1; [L177] SORT_3 var_67_arg_0 = var_65; [L178] SORT_3 var_67_arg_1 = var_66; VAL [bad_32_arg_0=0, mask_SORT_3=1, next_110_arg_1=0, next_111_arg_1=-256, state_20=0, var_29=1, var_52=-1, var_59=0, var_63=255, var_66=0, var_67_arg_0=-256, var_67_arg_1=0] [L179] EXPR var_67_arg_0 | var_67_arg_1 [L179] EXPR var_67_arg_0 | var_67_arg_1 VAL [bad_32_arg_0=0, mask_SORT_3=1, next_110_arg_1=0, next_111_arg_1=-256, state_20=0, var_29=1, var_52=-1, var_59=0, var_63=255, var_66=0] [L179] SORT_3 var_67 = var_67_arg_0 | var_67_arg_1; [L180] SORT_3 var_68_arg_0 = var_67; [L181] SORT_3 var_68_arg_1 = var_52; VAL [bad_32_arg_0=0, mask_SORT_3=1, next_110_arg_1=0, next_111_arg_1=-256, state_20=0, var_29=1, var_59=0, var_63=255, var_66=0, var_68_arg_0=0, var_68_arg_1=-1] [L182] EXPR var_68_arg_0 & var_68_arg_1 [L182] EXPR var_68_arg_0 & var_68_arg_1 VAL [bad_32_arg_0=0, mask_SORT_3=1, next_110_arg_1=0, next_111_arg_1=-256, state_20=0, var_29=1, var_59=0, var_63=255, var_66=0] [L182] SORT_3 var_68 = var_68_arg_0 & var_68_arg_1; [L183] SORT_3 next_112_arg_1 = var_68; [L184] SORT_3 var_75_arg_0 = state_20; [L185] SORT_3 var_75_arg_1 = var_66; VAL [bad_32_arg_0=0, mask_SORT_3=1, next_110_arg_1=0, next_111_arg_1=-256, next_112_arg_1=0, var_29=1, var_59=0, var_63=255, var_75_arg_0=0, var_75_arg_1=0] [L186] EXPR var_75_arg_0 | var_75_arg_1 [L186] EXPR var_75_arg_0 | var_75_arg_1 VAL [bad_32_arg_0=0, mask_SORT_3=1, next_110_arg_1=0, next_111_arg_1=-256, next_112_arg_1=0, var_29=1, var_59=0, var_63=255] [L186] SORT_3 var_75 = var_75_arg_0 | var_75_arg_1; [L187] SORT_3 var_76_arg_0 = var_75; [L188] SORT_3 var_76 = ~var_76_arg_0; [L189] SORT_3 var_77_arg_0 = var_59; [L190] SORT_3 var_77_arg_1 = var_76; VAL [bad_32_arg_0=0, mask_SORT_3=1, next_110_arg_1=0, next_111_arg_1=-256, next_112_arg_1=0, var_29=1, var_63=255, var_76=-1, var_77_arg_0=0, var_77_arg_1=-1] [L191] EXPR var_77_arg_0 & var_77_arg_1 [L191] EXPR var_77_arg_0 & var_77_arg_1 VAL [bad_32_arg_0=0, mask_SORT_3=1, next_110_arg_1=0, next_111_arg_1=-256, next_112_arg_1=0, var_29=1, var_63=255, var_76=-1] [L191] SORT_3 var_77 = var_77_arg_0 & var_77_arg_1; [L192] SORT_3 var_78_arg_0 = var_77; [L193] SORT_3 var_78 = ~var_78_arg_0; [L194] SORT_3 var_82_arg_0 = var_63; [L195] SORT_3 var_82_arg_1 = var_76; VAL [bad_32_arg_0=0, mask_SORT_3=1, next_110_arg_1=0, next_111_arg_1=-256, next_112_arg_1=0, var_29=1, var_78=-1, var_82_arg_0=255, var_82_arg_1=-1] [L196] EXPR var_82_arg_0 & var_82_arg_1 VAL [bad_32_arg_0=0, mask_SORT_3=1, next_110_arg_1=0, next_111_arg_1=-256, next_112_arg_1=0, var_29=1, var_78=-1, var_82_arg_0=255, var_82_arg_1=-1] [L196] EXPR var_82_arg_0 & var_82_arg_1 [L196] EXPR var_82_arg_0 & var_82_arg_1 VAL [bad_32_arg_0=0, mask_SORT_3=1, next_110_arg_1=0, next_111_arg_1=-256, next_112_arg_1=0, var_29=1, var_78=-1] [L196] SORT_3 var_82 = var_82_arg_0 & var_82_arg_1; [L197] SORT_3 var_91_arg_0 = var_82; [L198] SORT_3 var_91 = ~var_91_arg_0; [L199] SORT_3 var_92_arg_0 = var_78; [L200] SORT_3 var_92_arg_1 = var_91; VAL [bad_32_arg_0=0, mask_SORT_3=1, next_110_arg_1=0, next_111_arg_1=-256, next_112_arg_1=0, var_29=1, var_92_arg_0=-1, var_92_arg_1=-256] [L201] EXPR var_92_arg_0 & var_92_arg_1 [L201] EXPR var_92_arg_0 & var_92_arg_1 VAL [bad_32_arg_0=0, mask_SORT_3=1, next_110_arg_1=0, next_111_arg_1=-256, next_112_arg_1=0, var_29=1] [L201] SORT_3 var_92 = var_92_arg_0 & var_92_arg_1; [L202] SORT_3 var_94_arg_0 = input_4; [L203] SORT_3 var_94_arg_1 = var_92; VAL [bad_32_arg_0=0, mask_SORT_3=1, next_110_arg_1=0, next_111_arg_1=-256, next_112_arg_1=0, var_29=1, var_94_arg_0=254, var_94_arg_1=0] [L204] EXPR var_94_arg_0 | var_94_arg_1 VAL [bad_32_arg_0=0, mask_SORT_3=1, next_110_arg_1=0, next_111_arg_1=-256, next_112_arg_1=0, var_29=1, var_94_arg_0=254, var_94_arg_1=0] [L204] EXPR var_94_arg_0 | var_94_arg_1 [L204] EXPR var_94_arg_0 | var_94_arg_1 VAL [bad_32_arg_0=0, mask_SORT_3=1, next_110_arg_1=0, next_111_arg_1=-256, next_112_arg_1=0, var_29=1] [L204] SORT_3 var_94 = var_94_arg_0 | var_94_arg_1; [L205] SORT_3 var_95_arg_0 = var_94; [L206] SORT_3 var_95 = ~var_95_arg_0; [L207] SORT_3 next_113_arg_1 = var_95; [L209] state_15 = next_110_arg_1 [L210] state_17 = next_111_arg_1 [L211] state_20 = next_112_arg_1 [L212] state_24 = next_113_arg_1 [L74] input_2 = __VERIFIER_nondet_uchar() [L75] input_4 = __VERIFIER_nondet_uchar() [L76] input_5 = __VERIFIER_nondet_uchar() [L77] input_6 = __VERIFIER_nondet_uchar() [L78] input_7 = __VERIFIER_nondet_uchar() [L79] input_8 = __VERIFIER_nondet_uchar() [L80] input_9 = __VERIFIER_nondet_uchar() [L81] input_10 = __VERIFIER_nondet_uchar() [L82] input_11 = __VERIFIER_nondet_uchar() [L83] input_13 = __VERIFIER_nondet_uchar() [L84] input_33 = __VERIFIER_nondet_uchar() [L85] input_35 = __VERIFIER_nondet_uchar() [L86] input_37 = __VERIFIER_nondet_uchar() [L87] input_39 = __VERIFIER_nondet_uchar() [L88] input_97 = __VERIFIER_nondet_uchar() [L89] input_99 = __VERIFIER_nondet_uchar() [L90] input_102 = __VERIFIER_nondet_uchar() [L91] input_104 = __VERIFIER_nondet_uchar() [L92] input_106 = __VERIFIER_nondet_uchar() [L93] input_108 = __VERIFIER_nondet_uchar() [L96] SORT_3 var_19_arg_0 = state_15; [L97] SORT_3 var_19_arg_1 = state_17; VAL [mask_SORT_3=1, state_15=0, state_17=-256, state_20=0, state_24=-255, var_19_arg_0=0, var_19_arg_1=-256, var_29=1] [L98] EXPR var_19_arg_0 | var_19_arg_1 [L98] EXPR var_19_arg_0 | var_19_arg_1 VAL [mask_SORT_3=1, state_15=0, state_17=-256, state_20=0, state_24=-255, var_29=1] [L98] SORT_3 var_19 = var_19_arg_0 | var_19_arg_1; [L99] SORT_3 var_22_arg_0 = var_19; [L100] SORT_3 var_22_arg_1 = state_20; VAL [mask_SORT_3=1, state_15=0, state_17=-256, state_20=0, state_24=-255, var_22_arg_0=0, var_22_arg_1=0, var_29=1] [L101] EXPR var_22_arg_0 | var_22_arg_1 [L101] EXPR var_22_arg_0 | var_22_arg_1 VAL [mask_SORT_3=1, state_15=0, state_17=-256, state_20=0, state_24=-255, var_29=1] [L101] SORT_3 var_22 = var_22_arg_0 | var_22_arg_1; [L102] SORT_3 var_23_arg_0 = var_22; [L103] SORT_3 var_23 = ~var_23_arg_0; [L104] SORT_3 var_26_arg_0 = var_23; [L105] SORT_3 var_26_arg_1 = state_24; VAL [mask_SORT_3=1, state_15=0, state_17=-256, state_20=0, var_26_arg_0=-1, var_26_arg_1=-255, var_29=1] [L106] EXPR var_26_arg_0 | var_26_arg_1 VAL [mask_SORT_3=1, state_15=0, state_17=-256, state_20=0, var_26_arg_0=-1, var_26_arg_1=-255, var_29=1] [L106] EXPR var_26_arg_0 | var_26_arg_1 [L106] EXPR var_26_arg_0 | var_26_arg_1 VAL [mask_SORT_3=1, state_15=0, state_17=-256, state_20=0, var_29=1] [L106] SORT_3 var_26 = var_26_arg_0 | var_26_arg_1; [L107] SORT_3 var_30_arg_0 = var_26; [L108] SORT_3 var_30 = ~var_30_arg_0; [L109] SORT_3 var_31_arg_0 = var_29; [L110] SORT_3 var_31_arg_1 = var_30; VAL [mask_SORT_3=1, state_15=0, state_17=-256, state_20=0, var_29=1, var_31_arg_0=1, var_31_arg_1=-1] [L111] EXPR var_31_arg_0 & var_31_arg_1 VAL [mask_SORT_3=1, state_15=0, state_17=-256, state_20=0, var_29=1, var_31_arg_0=1, var_31_arg_1=-1] [L111] EXPR var_31_arg_0 & var_31_arg_1 [L111] EXPR var_31_arg_0 & var_31_arg_1 VAL [mask_SORT_3=1, state_15=0, state_17=-256, state_20=0, var_29=1] [L111] SORT_3 var_31 = var_31_arg_0 & var_31_arg_1; [L112] EXPR var_31 & mask_SORT_3 VAL [mask_SORT_3=1, state_15=0, state_17=-256, state_20=0, var_29=1, var_31=1] [L112] EXPR var_31 & mask_SORT_3 [L112] EXPR var_31 & mask_SORT_3 VAL [mask_SORT_3=1, state_15=0, state_17=-256, state_20=0, var_29=1] [L112] var_31 = var_31 & mask_SORT_3 [L113] SORT_3 bad_32_arg_0 = var_31; VAL [bad_32_arg_0=1, mask_SORT_3=1, state_15=0, state_17=-256, state_20=0, var_29=1] [L114] CALL __VERIFIER_assert(!(bad_32_arg_0)) VAL [\old(cond)=0] [L21] COND TRUE !(cond) VAL [\old(cond)=0] [L21] reach_error() VAL [\old(cond)=0] - StatisticsResult: Ultimate Automizer benchmark data CFG has 6 procedures, 109 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 27.5s, OverallIterations: 21, TraceHistogramMax: 2, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 6.2s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.2s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 1809 SdHoareTripleChecker+Valid, 3.9s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 1806 mSDsluCounter, 25958 SdHoareTripleChecker+Invalid, 3.3s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 23000 mSDsCounter, 41 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 4768 IncrementalHoareTripleChecker+Invalid, 4809 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 41 mSolverCounterUnsat, 2958 mSDtfsCounter, 4768 mSolverCounterSat, 0.1s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 816 GetRequests, 531 SyntacticMatches, 3 SemanticMatches, 282 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1582 ImplicationChecksByTransitivity, 4.9s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=702occurred in iteration=20, InterpolantAutomatonStates: 233, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.3s AutomataMinimizationTime, 20 MinimizatonAttempts, 659 StatesRemovedByMinimization, 16 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.2s SsaConstructionTime, 2.5s SatisfiabilityAnalysisTime, 16.5s InterpolantComputationTime, 2119 NumberOfCodeBlocks, 2119 NumberOfCodeBlocksAsserted, 24 NumberOfCheckSat, 2185 ConstructedInterpolants, 0 QuantifiedInterpolants, 12829 SizeOfPredicates, 13 NumberOfNonLiveVariables, 1382 ConjunctsInSsa, 150 ConjunctsInUnsatCore, 25 InterpolantComputations, 18 PerfectInterpolantSequences, 332/358 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available RESULT: Ultimate could not prove your program: unable to determine feasibility of some traces [2024-08-15 18:23:27,644 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (1)] Ended with exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Using bit-precise analysis Retrying with bit-precise analysis ### Bit-precise run ### Calling Ultimate with: /root/.sdkman/candidates/java/current/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReachWitnessValidation.xml -i ../../../trunk/examples/svcomp/hardware-verification-bv/btor2c-lazyMod.vis_QF_BV_s1269b_p4.c ./svcomp-yaml-violation-generation.2024-08-01_14-26-22.files/Default/btor2c-lazyMod.vis_QF_BV_s1269b_p4.yml/witness.yml -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-64bit-Automizer_Bitvector.epf --cacsl2boogietranslator.entry.function main --traceabstraction.compute.hoare.annotation.of.negated.interpolant.automaton,.abstraction.and.cfg false --preprocessor.replace.while.statements.and.if-then-else.statements false --icfgbuilder.size.of.a.code.block SequenceOfStatements --- Real Ultimate output --- This is Ultimate 0.2.4-wip.fs.yaml-violation-witnesses-03fe66f-m [2024-08-15 18:23:30,057 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-08-15 18:23:30,130 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-64bit-Automizer_Bitvector.epf [2024-08-15 18:23:30,134 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-08-15 18:23:30,135 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-08-15 18:23:30,161 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-08-15 18:23:30,162 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-08-15 18:23:30,163 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-08-15 18:23:30,164 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-08-15 18:23:30,165 INFO L153 SettingsManager]: * Use memory slicer=true [2024-08-15 18:23:30,165 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-08-15 18:23:30,166 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-08-15 18:23:30,166 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-08-15 18:23:30,167 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-08-15 18:23:30,169 INFO L153 SettingsManager]: * Use SBE=true [2024-08-15 18:23:30,169 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-08-15 18:23:30,169 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-08-15 18:23:30,170 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-08-15 18:23:30,170 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-08-15 18:23:30,170 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-08-15 18:23:30,170 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-08-15 18:23:30,174 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2024-08-15 18:23:30,175 INFO L153 SettingsManager]: * Use bitvectors instead of ints=true [2024-08-15 18:23:30,175 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-08-15 18:23:30,175 INFO L153 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2024-08-15 18:23:30,176 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-08-15 18:23:30,176 INFO L153 SettingsManager]: * Use constant arrays=true [2024-08-15 18:23:30,176 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-08-15 18:23:30,176 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-08-15 18:23:30,177 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-08-15 18:23:30,177 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-08-15 18:23:30,177 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-08-15 18:23:30,178 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-08-15 18:23:30,178 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-08-15 18:23:30,180 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-08-15 18:23:30,181 INFO L153 SettingsManager]: * Trace refinement strategy=WOLF [2024-08-15 18:23:30,181 INFO L153 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2024-08-15 18:23:30,181 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-08-15 18:23:30,181 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-08-15 18:23:30,182 INFO L153 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2024-08-15 18:23:30,182 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-08-15 18:23:30,182 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-08-15 18:23:30,182 INFO L153 SettingsManager]: * Logic for external solver=AUFBV [2024-08-15 18:23:30,183 INFO L153 SettingsManager]: * Looper check in Petri net analysis=SEMANTIC WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.boogie.preprocessor: Replace while statements and if-then-else statements -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder: Size of a code block -> SequenceOfStatements [2024-08-15 18:23:30,566 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-08-15 18:23:30,589 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-08-15 18:23:30,591 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-08-15 18:23:30,593 INFO L270 PluginConnector]: Initializing CDTParser... [2024-08-15 18:23:30,594 INFO L274 PluginConnector]: CDTParser initialized [2024-08-15 18:23:30,600 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/hardware-verification-bv/btor2c-lazyMod.vis_QF_BV_s1269b_p4.c [2024-08-15 18:23:32,194 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-08-15 18:23:32,444 INFO L384 CDTParser]: Found 1 translation units. [2024-08-15 18:23:32,445 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/hardware-verification-bv/btor2c-lazyMod.vis_QF_BV_s1269b_p4.c [2024-08-15 18:23:32,457 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/17386b45e/29f8d727990949e8b250e30ffb378626/FLAG090b4f318 [2024-08-15 18:23:32,798 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/17386b45e/29f8d727990949e8b250e30ffb378626 [2024-08-15 18:23:32,803 INFO L270 PluginConnector]: Initializing Witness Parser... [2024-08-15 18:23:32,804 INFO L274 PluginConnector]: Witness Parser initialized [2024-08-15 18:23:32,804 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/./svcomp-yaml-violation-generation.2024-08-01_14-26-22.files/Default/btor2c-lazyMod.vis_QF_BV_s1269b_p4.yml/witness.yml [2024-08-15 18:23:32,873 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-08-15 18:23:32,874 INFO L133 ToolchainWalker]: Walking toolchain with 4 elements. [2024-08-15 18:23:32,877 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-08-15 18:23:32,878 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-08-15 18:23:32,882 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-08-15 18:23:32,883 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 15.08 06:23:32" (1/2) ... [2024-08-15 18:23:32,884 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@2d5a8ae3 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.08 06:23:32, skipping insertion in model container [2024-08-15 18:23:32,884 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 15.08 06:23:32" (1/2) ... [2024-08-15 18:23:32,885 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.CACSL2BoogieTranslatorObserver@227e11a9 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.08 06:23:32, skipping insertion in model container [2024-08-15 18:23:32,886 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "witness.yml de.uni_freiburg.informatik.ultimate.witnessparser VIOLATION_WITNESS 15.08 06:23:32" (2/2) ... [2024-08-15 18:23:32,886 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@2d5a8ae3 and model type witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator VIOLATION_WITNESS 15.08 06:23:32, skipping insertion in model container [2024-08-15 18:23:32,886 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "witness.yml de.uni_freiburg.informatik.ultimate.witnessparser VIOLATION_WITNESS 15.08 06:23:32" (2/2) ... [2024-08-15 18:23:32,915 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-08-15 18:23:33,080 WARN L247 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/hardware-verification-bv/btor2c-lazyMod.vis_QF_BV_s1269b_p4.c[1259,1272] [2024-08-15 18:23:33,159 INFO L207 PostProcessor]: Analyzing one entry point: main [2024-08-15 18:23:33,178 INFO L200 MainTranslator]: Completed pre-run [2024-08-15 18:23:33,194 WARN L247 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/hardware-verification-bv/btor2c-lazyMod.vis_QF_BV_s1269b_p4.c[1259,1272] [2024-08-15 18:23:33,227 INFO L207 PostProcessor]: Analyzing one entry point: main [2024-08-15 18:23:33,249 INFO L204 MainTranslator]: Completed translation [2024-08-15 18:23:33,252 INFO L201 PluginConnector]: Adding new model witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator VIOLATION_WITNESS 15.08 06:23:33 WrapperNode [2024-08-15 18:23:33,252 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-08-15 18:23:33,254 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-08-15 18:23:33,254 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-08-15 18:23:33,255 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-08-15 18:23:33,268 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator VIOLATION_WITNESS 15.08 06:23:33" (1/1) ... [2024-08-15 18:23:33,269 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator VIOLATION_WITNESS 15.08 06:23:33" (1/1) ... [2024-08-15 18:23:33,284 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator VIOLATION_WITNESS 15.08 06:23:33" (1/1) ... [2024-08-15 18:23:33,319 INFO L175 MemorySlicer]: Split 2 memory accesses to 1 slices as follows [2]. 100 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2]. The 0 writes are split as follows [0]. [2024-08-15 18:23:33,319 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator VIOLATION_WITNESS 15.08 06:23:33" (1/1) ... [2024-08-15 18:23:33,320 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator VIOLATION_WITNESS 15.08 06:23:33" (1/1) ... [2024-08-15 18:23:33,336 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator VIOLATION_WITNESS 15.08 06:23:33" (1/1) ... [2024-08-15 18:23:33,341 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator VIOLATION_WITNESS 15.08 06:23:33" (1/1) ... [2024-08-15 18:23:33,344 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator VIOLATION_WITNESS 15.08 06:23:33" (1/1) ... [2024-08-15 18:23:33,347 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-08-15 18:23:33,352 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2024-08-15 18:23:33,353 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2024-08-15 18:23:33,353 INFO L274 PluginConnector]: IcfgBuilder initialized [2024-08-15 18:23:33,354 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator VIOLATION_WITNESS 15.08 06:23:33" (1/1) ... [2024-08-15 18:23:33,360 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-08-15 18:23:33,374 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-08-15 18:23:33,392 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-08-15 18:23:33,398 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (1)] Waiting until timeout for monitored process [2024-08-15 18:23:33,451 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2024-08-15 18:23:33,452 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-08-15 18:23:33,452 INFO L138 BoogieDeclarations]: Found implementation of procedure reach_error [2024-08-15 18:23:33,452 INFO L138 BoogieDeclarations]: Found implementation of procedure __VERIFIER_assert [2024-08-15 18:23:33,452 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2024-08-15 18:23:33,453 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2024-08-15 18:23:33,453 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_uchar [2024-08-15 18:23:33,453 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_ushort [2024-08-15 18:23:33,453 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_uint [2024-08-15 18:23:33,453 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_ulong [2024-08-15 18:23:33,455 INFO L130 BoogieDeclarations]: Found specification of procedure abort [2024-08-15 18:23:33,455 INFO L130 BoogieDeclarations]: Found specification of procedure __assert_fail [2024-08-15 18:23:33,455 INFO L130 BoogieDeclarations]: Found specification of procedure reach_error [2024-08-15 18:23:33,456 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-08-15 18:23:33,456 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2024-08-15 18:23:33,456 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2024-08-15 18:23:33,456 INFO L130 BoogieDeclarations]: Found specification of procedure main [2024-08-15 18:23:33,456 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2024-08-15 18:23:33,456 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#0 [2024-08-15 18:23:33,456 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-08-15 18:23:33,457 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE1#0 [2024-08-15 18:23:33,457 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE1#0 [2024-08-15 18:23:33,457 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2024-08-15 18:23:33,592 INFO L273 CfgBuilder]: Building ICFG [2024-08-15 18:23:33,594 INFO L304 CfgBuilder]: Building CFG for each procedure with an implementation [2024-08-15 18:23:33,895 INFO L? ?]: Removed 33 outVars from TransFormulas that were not future-live. [2024-08-15 18:23:33,895 INFO L327 CfgBuilder]: Performing block encoding [2024-08-15 18:23:33,905 INFO L349 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-08-15 18:23:33,906 INFO L354 CfgBuilder]: Removed 0 assume(true) statements. [2024-08-15 18:23:33,907 INFO L201 PluginConnector]: Adding new model witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 15.08 06:23:33 BoogieIcfgContainer [2024-08-15 18:23:33,907 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2024-08-15 18:23:33,909 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-08-15 18:23:33,910 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-08-15 18:23:33,914 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-08-15 18:23:33,914 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 15.08 06:23:32" (1/4) ... [2024-08-15 18:23:33,916 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5941f587 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 15.08 06:23:33, skipping insertion in model container [2024-08-15 18:23:33,916 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "witness.yml de.uni_freiburg.informatik.ultimate.witnessparser VIOLATION_WITNESS 15.08 06:23:32" (2/4) ... [2024-08-15 18:23:33,916 WARN L100 eAbstractionObserver]: Found a witness in the YAML format. I will only consider traces that are accepted by the witness [2024-08-15 18:23:33,919 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5941f587 and model type witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction VIOLATION_WITNESS 15.08 06:23:33, skipping insertion in model container [2024-08-15 18:23:33,919 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator VIOLATION_WITNESS 15.08 06:23:33" (3/4) ... [2024-08-15 18:23:33,920 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5941f587 and model type witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction VIOLATION_WITNESS 15.08 06:23:33, skipping insertion in model container [2024-08-15 18:23:33,921 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 15.08 06:23:33" (4/4) ... [2024-08-15 18:23:33,922 INFO L128 eAbstractionObserver]: Analyzing ICFG btor2c-lazyMod.vis_QF_BV_s1269b_p4.c [2024-08-15 18:23:33,943 INFO L201 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-08-15 18:23:33,943 INFO L160 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-08-15 18:23:33,977 INFO L90 WitnessUtils]: Constructing product of automaton with 21 states and violation witness of the following lengths: [6] [2024-08-15 18:23:34,028 INFO L95 WitnessUtils]: Product has 66 reachable states. [2024-08-15 18:23:34,053 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-08-15 18:23:34,061 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=false, 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;@1a7de78e, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-08-15 18:23:34,061 INFO L358 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-08-15 18:23:34,063 INFO L276 IsEmpty]: Start isEmpty. Operand 66 states and 75 transitions. [2024-08-15 18:23:34,071 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2024-08-15 18:23:34,072 INFO L187 NwaCegarLoop]: Found error trace [2024-08-15 18:23:34,072 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-08-15 18:23:34,073 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-08-15 18:23:34,080 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-08-15 18:23:34,081 INFO L85 PathProgramCache]: Analyzing trace with hash -1013903583, now seen corresponding path program 1 times [2024-08-15 18:23:34,097 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-08-15 18:23:34,098 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1629995838] [2024-08-15 18:23:34,098 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-08-15 18:23:34,099 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-08-15 18:23:34,099 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-08-15 18:23:34,103 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-08-15 18:23:34,104 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (2)] Waiting until timeout for monitored process [2024-08-15 18:23:34,309 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-08-15 18:23:34,310 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-08-15 18:23:34,359 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-08-15 18:23:34,446 INFO L130 FreeRefinementEngine]: Strategy WOLF found a feasible trace [2024-08-15 18:23:34,449 INFO L360 BasicCegarLoop]: Counterexample is feasible [2024-08-15 18:23:34,450 INFO L805 garLoopResultBuilder]: Registering result UNSAFE for location __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2024-08-15 18:23:34,459 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (2)] Forceful destruction successful, exit code 0 [2024-08-15 18:23:34,653 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-08-15 18:23:34,659 INFO L445 BasicCegarLoop]: Path program histogram: [1] [2024-08-15 18:23:34,665 INFO L176 ceAbstractionStarter]: Computing trace abstraction results [2024-08-15 18:23:34,693 INFO L201 PluginConnector]: Adding new model witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 15.08 06:23:34 BoogieIcfgContainer [2024-08-15 18:23:34,695 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2024-08-15 18:23:34,696 INFO L158 Benchmark]: Toolchain (without parser) took 1821.78ms. Allocated memory was 60.8MB in the beginning and 77.6MB in the end (delta: 16.8MB). Free memory was 34.3MB in the beginning and 27.9MB in the end (delta: 6.5MB). Peak memory consumption was 24.2MB. Max. memory is 16.1GB. [2024-08-15 18:23:34,699 INFO L158 Benchmark]: CDTParser took 0.63ms. Allocated memory is still 60.8MB. Free memory was 37.0MB in the beginning and 36.9MB in the end (delta: 73.4kB). There was no memory consumed. Max. memory is 16.1GB. [2024-08-15 18:23:34,699 INFO L158 Benchmark]: Witness Parser took 0.10ms. Allocated memory is still 60.8MB. Free memory is still 36.4MB. There was no memory consumed. Max. memory is 16.1GB. [2024-08-15 18:23:34,700 INFO L158 Benchmark]: CACSL2BoogieTranslator took 375.48ms. Allocated memory was 60.8MB in the beginning and 77.6MB in the end (delta: 16.8MB). Free memory was 34.2MB in the beginning and 52.8MB in the end (delta: -18.7MB). Peak memory consumption was 13.6MB. Max. memory is 16.1GB. [2024-08-15 18:23:34,700 INFO L158 Benchmark]: Boogie Preprocessor took 96.91ms. Allocated memory is still 77.6MB. Free memory was 52.8MB in the beginning and 49.8MB in the end (delta: 3.0MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2024-08-15 18:23:34,701 INFO L158 Benchmark]: IcfgBuilder took 555.07ms. Allocated memory is still 77.6MB. Free memory was 49.8MB in the beginning and 53.5MB in the end (delta: -3.6MB). Peak memory consumption was 25.3MB. Max. memory is 16.1GB. [2024-08-15 18:23:34,703 INFO L158 Benchmark]: TraceAbstraction took 785.43ms. Allocated memory is still 77.6MB. Free memory was 53.0MB in the beginning and 27.9MB in the end (delta: 25.2MB). Peak memory consumption was 25.2MB. Max. memory is 16.1GB. [2024-08-15 18:23:34,705 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.63ms. Allocated memory is still 60.8MB. Free memory was 37.0MB in the beginning and 36.9MB in the end (delta: 73.4kB). There was no memory consumed. Max. memory is 16.1GB. * Witness Parser took 0.10ms. Allocated memory is still 60.8MB. Free memory is still 36.4MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 375.48ms. Allocated memory was 60.8MB in the beginning and 77.6MB in the end (delta: 16.8MB). Free memory was 34.2MB in the beginning and 52.8MB in the end (delta: -18.7MB). Peak memory consumption was 13.6MB. Max. memory is 16.1GB. * Boogie Preprocessor took 96.91ms. Allocated memory is still 77.6MB. Free memory was 52.8MB in the beginning and 49.8MB in the end (delta: 3.0MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * IcfgBuilder took 555.07ms. Allocated memory is still 77.6MB. Free memory was 49.8MB in the beginning and 53.5MB in the end (delta: -3.6MB). Peak memory consumption was 25.3MB. Max. memory is 16.1GB. * TraceAbstraction took 785.43ms. Allocated memory is still 77.6MB. Free memory was 53.0MB in the beginning and 27.9MB in the end (delta: 25.2MB). Peak memory consumption was 25.2MB. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: ErrorAutomatonStatistics NumberErrorTraces: 0, NumberStatementsAllTraces: 0, NumberRelevantStatements: 0, 0.0s ErrorAutomatonConstructionTimeTotal, 0.0s FaulLocalizationTime, NumberStatementsFirstTrace: -1, TraceLengthAvg: 0, 0.0s ErrorAutomatonConstructionTimeAvg, 0.0s ErrorAutomatonDifferenceTimeAvg, 0.0s ErrorAutomatonDifferenceTimeTotal, NumberOfNoEnhancement: 0, NumberOfFiniteEnhancement: 0, NumberOfInfiniteEnhancement: 0 - CounterExampleResult [Line: 21]: a call to reach_error is reachable a call to reach_error is reachable We found a FailurePath: [L26] const SORT_1 mask_SORT_1 = (SORT_1)-1 >> (sizeof(SORT_1) * 8 - 3); [L27] const SORT_1 msb_SORT_1 = (SORT_1)1 << (3 - 1); [L29] const SORT_3 mask_SORT_3 = (SORT_3)-1 >> (sizeof(SORT_3) * 8 - 1); [L30] const SORT_3 msb_SORT_3 = (SORT_3)1 << (1 - 1); [L32] const SORT_12 mask_SORT_12 = (SORT_12)-1 >> (sizeof(SORT_12) * 8 - 8); [L33] const SORT_12 msb_SORT_12 = (SORT_12)1 << (8 - 1); [L35] const SORT_3 var_14 = 0; [L36] const SORT_3 var_29 = 1; [L38] SORT_1 input_2; [L39] SORT_3 input_4; [L40] SORT_3 input_5; [L41] SORT_3 input_6; [L42] SORT_3 input_7; [L43] SORT_3 input_8; [L44] SORT_3 input_9; [L45] SORT_3 input_10; [L46] SORT_3 input_11; [L47] SORT_12 input_13; [L48] SORT_12 input_33; [L49] SORT_12 input_35; [L50] SORT_3 input_37; [L51] SORT_3 input_39; [L52] SORT_12 input_97; [L53] SORT_3 input_99; [L54] SORT_1 input_102; [L55] SORT_3 input_104; [L56] SORT_3 input_106; [L57] SORT_3 input_108; [L59] SORT_3 state_15 = __VERIFIER_nondet_uchar() & mask_SORT_3; [L60] SORT_3 state_17 = __VERIFIER_nondet_uchar() & mask_SORT_3; [L61] SORT_3 state_20 = __VERIFIER_nondet_uchar() & mask_SORT_3; [L62] SORT_3 state_24 = __VERIFIER_nondet_uchar() & mask_SORT_3; [L64] SORT_3 init_16_arg_1 = var_14; [L65] state_15 = init_16_arg_1 [L66] SORT_3 init_18_arg_1 = var_14; [L67] state_17 = init_18_arg_1 [L68] SORT_3 init_21_arg_1 = var_14; [L69] state_20 = init_21_arg_1 [L70] SORT_3 init_25_arg_1 = var_14; [L71] state_24 = init_25_arg_1 VAL [mask_SORT_3=1, state_15=0, state_17=0, state_20=0, state_24=0, var_29=1] [L74] input_2 = __VERIFIER_nondet_uchar() [L75] input_4 = __VERIFIER_nondet_uchar() [L76] input_5 = __VERIFIER_nondet_uchar() [L77] input_6 = __VERIFIER_nondet_uchar() [L78] input_7 = __VERIFIER_nondet_uchar() [L79] input_8 = __VERIFIER_nondet_uchar() [L80] input_9 = __VERIFIER_nondet_uchar() [L81] input_10 = __VERIFIER_nondet_uchar() [L82] input_11 = __VERIFIER_nondet_uchar() [L83] input_13 = __VERIFIER_nondet_uchar() [L84] input_33 = __VERIFIER_nondet_uchar() [L85] input_35 = __VERIFIER_nondet_uchar() [L86] input_37 = __VERIFIER_nondet_uchar() [L87] input_39 = __VERIFIER_nondet_uchar() [L88] input_97 = __VERIFIER_nondet_uchar() [L89] input_99 = __VERIFIER_nondet_uchar() [L90] input_102 = __VERIFIER_nondet_uchar() [L91] input_104 = __VERIFIER_nondet_uchar() [L92] input_106 = __VERIFIER_nondet_uchar() [L93] input_108 = __VERIFIER_nondet_uchar() [L96] SORT_3 var_19_arg_0 = state_15; [L97] SORT_3 var_19_arg_1 = state_17; [L98] SORT_3 var_19 = var_19_arg_0 | var_19_arg_1; [L99] SORT_3 var_22_arg_0 = var_19; [L100] SORT_3 var_22_arg_1 = state_20; [L101] SORT_3 var_22 = var_22_arg_0 | var_22_arg_1; [L102] SORT_3 var_23_arg_0 = var_22; [L103] SORT_3 var_23 = ~var_23_arg_0; [L104] SORT_3 var_26_arg_0 = var_23; [L105] SORT_3 var_26_arg_1 = state_24; [L106] SORT_3 var_26 = var_26_arg_0 | var_26_arg_1; [L107] SORT_3 var_30_arg_0 = var_26; [L108] SORT_3 var_30 = ~var_30_arg_0; [L109] SORT_3 var_31_arg_0 = var_29; [L110] SORT_3 var_31_arg_1 = var_30; [L111] SORT_3 var_31 = var_31_arg_0 & var_31_arg_1; [L112] var_31 = var_31 & mask_SORT_3 [L113] SORT_3 bad_32_arg_0 = var_31; VAL [bad_32_arg_0=0, mask_SORT_3=1, state_15=0, state_17=0, state_20=0, var_29=1] [L114] CALL __VERIFIER_assert(!(bad_32_arg_0)) VAL [\old(cond)=1] [L21] COND FALSE !(!(cond)) VAL [\old(cond)=1] [L114] RET __VERIFIER_assert(!(bad_32_arg_0)) VAL [bad_32_arg_0=0, mask_SORT_3=1, state_15=0, state_17=0, state_20=0, var_29=1] [L116] SORT_3 var_41_arg_0 = state_17; [L117] SORT_3 var_41 = ~var_41_arg_0; [L118] SORT_3 var_42_arg_0 = state_15; [L119] SORT_3 var_42 = ~var_42_arg_0; [L120] SORT_3 var_43_arg_0 = var_42; [L121] SORT_3 var_43_arg_1 = state_20; [L122] SORT_3 var_43 = var_43_arg_0 & var_43_arg_1; [L123] SORT_3 var_44_arg_0 = var_43; [L124] SORT_3 var_44 = ~var_44_arg_0; [L125] SORT_3 var_45_arg_0 = var_41; [L126] SORT_3 var_45_arg_1 = var_44; [L127] SORT_3 var_45 = var_45_arg_0 | var_45_arg_1; [L128] SORT_3 var_46_arg_0 = var_45; [L129] SORT_3 var_46 = ~var_46_arg_0; [L130] SORT_3 var_47_arg_0 = state_17; [L131] SORT_3 var_47_arg_1 = state_20; [L132] SORT_3 var_47 = var_47_arg_0 & var_47_arg_1; [L133] SORT_3 var_48_arg_0 = var_42; [L134] SORT_3 var_48_arg_1 = var_47; [L135] SORT_3 var_48 = var_48_arg_0 | var_48_arg_1; [L136] SORT_3 var_49_arg_0 = var_48; [L137] SORT_3 var_49 = ~var_49_arg_0; [L138] SORT_3 var_50_arg_0 = var_46; [L139] SORT_3 var_50_arg_1 = var_49; [L140] SORT_3 var_50 = var_50_arg_0 | var_50_arg_1; [L141] SORT_3 next_110_arg_1 = var_50; [L142] SORT_3 var_52_arg_0 = state_20; [L143] SORT_3 var_52 = ~var_52_arg_0; [L144] SORT_3 var_53_arg_0 = state_17; [L145] SORT_3 var_53_arg_1 = var_52; [L146] SORT_3 var_53 = var_53_arg_0 | var_53_arg_1; [L147] SORT_3 var_54_arg_0 = state_17; [L148] SORT_3 var_54_arg_1 = var_52; [L149] SORT_3 var_54 = var_54_arg_0 & var_54_arg_1; [L150] SORT_3 var_55_arg_0 = var_54; [L151] SORT_3 var_55 = ~var_55_arg_0; [L152] SORT_3 var_56_arg_0 = var_53; [L153] SORT_3 var_56_arg_1 = var_55; [L154] SORT_3 var_56 = var_56_arg_0 & var_56_arg_1; [L155] SORT_3 var_57_arg_0 = var_56; [L156] SORT_3 var_57 = ~var_57_arg_0; [L157] SORT_3 next_111_arg_1 = var_57; [L158] SORT_1 var_59_arg_0 = input_2; [L159] SORT_3 var_59 = var_59_arg_0 >> 0; [L160] SORT_1 var_60_arg_0 = input_2; [L161] SORT_3 var_60 = var_60_arg_0 >> 2; [L162] SORT_3 var_61_arg_0 = var_60; [L163] SORT_3 var_61 = ~var_61_arg_0; [L164] SORT_1 var_62_arg_0 = input_2; [L165] SORT_3 var_62 = var_62_arg_0 >> 1; [L166] SORT_3 var_63_arg_0 = var_61; [L167] SORT_3 var_63_arg_1 = var_62; [L168] SORT_3 var_63 = var_63_arg_0 | var_63_arg_1; [L169] SORT_3 var_64_arg_0 = var_59; [L170] SORT_3 var_64_arg_1 = var_63; [L171] SORT_3 var_64 = var_64_arg_0 | var_64_arg_1; [L172] SORT_3 var_65_arg_0 = var_64; [L173] SORT_3 var_65 = ~var_65_arg_0; [L174] SORT_3 var_66_arg_0 = state_15; [L175] SORT_3 var_66_arg_1 = state_17; [L176] SORT_3 var_66 = var_66_arg_0 | var_66_arg_1; [L177] SORT_3 var_67_arg_0 = var_65; [L178] SORT_3 var_67_arg_1 = var_66; [L179] SORT_3 var_67 = var_67_arg_0 | var_67_arg_1; [L180] SORT_3 var_68_arg_0 = var_67; [L181] SORT_3 var_68_arg_1 = var_52; [L182] SORT_3 var_68 = var_68_arg_0 & var_68_arg_1; [L183] SORT_3 next_112_arg_1 = var_68; [L184] SORT_3 var_75_arg_0 = state_20; [L185] SORT_3 var_75_arg_1 = var_66; [L186] SORT_3 var_75 = var_75_arg_0 | var_75_arg_1; [L187] SORT_3 var_76_arg_0 = var_75; [L188] SORT_3 var_76 = ~var_76_arg_0; [L189] SORT_3 var_77_arg_0 = var_59; [L190] SORT_3 var_77_arg_1 = var_76; [L191] SORT_3 var_77 = var_77_arg_0 & var_77_arg_1; [L192] SORT_3 var_78_arg_0 = var_77; [L193] SORT_3 var_78 = ~var_78_arg_0; [L194] SORT_3 var_82_arg_0 = var_63; [L195] SORT_3 var_82_arg_1 = var_76; [L196] SORT_3 var_82 = var_82_arg_0 & var_82_arg_1; [L197] SORT_3 var_91_arg_0 = var_82; [L198] SORT_3 var_91 = ~var_91_arg_0; [L199] SORT_3 var_92_arg_0 = var_78; [L200] SORT_3 var_92_arg_1 = var_91; [L201] SORT_3 var_92 = var_92_arg_0 & var_92_arg_1; [L202] SORT_3 var_94_arg_0 = input_4; [L203] SORT_3 var_94_arg_1 = var_92; [L204] SORT_3 var_94 = var_94_arg_0 | var_94_arg_1; [L205] SORT_3 var_95_arg_0 = var_94; [L206] SORT_3 var_95 = ~var_95_arg_0; [L207] SORT_3 next_113_arg_1 = var_95; [L209] state_15 = next_110_arg_1 [L210] state_17 = next_111_arg_1 [L211] state_20 = next_112_arg_1 [L212] state_24 = next_113_arg_1 [L74] input_2 = __VERIFIER_nondet_uchar() [L75] input_4 = __VERIFIER_nondet_uchar() [L76] input_5 = __VERIFIER_nondet_uchar() [L77] input_6 = __VERIFIER_nondet_uchar() [L78] input_7 = __VERIFIER_nondet_uchar() [L79] input_8 = __VERIFIER_nondet_uchar() [L80] input_9 = __VERIFIER_nondet_uchar() [L81] input_10 = __VERIFIER_nondet_uchar() [L82] input_11 = __VERIFIER_nondet_uchar() [L83] input_13 = __VERIFIER_nondet_uchar() [L84] input_33 = __VERIFIER_nondet_uchar() [L85] input_35 = __VERIFIER_nondet_uchar() [L86] input_37 = __VERIFIER_nondet_uchar() [L87] input_39 = __VERIFIER_nondet_uchar() [L88] input_97 = __VERIFIER_nondet_uchar() [L89] input_99 = __VERIFIER_nondet_uchar() [L90] input_102 = __VERIFIER_nondet_uchar() [L91] input_104 = __VERIFIER_nondet_uchar() [L92] input_106 = __VERIFIER_nondet_uchar() [L93] input_108 = __VERIFIER_nondet_uchar() [L96] SORT_3 var_19_arg_0 = state_15; [L97] SORT_3 var_19_arg_1 = state_17; [L98] SORT_3 var_19 = var_19_arg_0 | var_19_arg_1; [L99] SORT_3 var_22_arg_0 = var_19; [L100] SORT_3 var_22_arg_1 = state_20; [L101] SORT_3 var_22 = var_22_arg_0 | var_22_arg_1; [L102] SORT_3 var_23_arg_0 = var_22; [L103] SORT_3 var_23 = ~var_23_arg_0; [L104] SORT_3 var_26_arg_0 = var_23; [L105] SORT_3 var_26_arg_1 = state_24; [L106] SORT_3 var_26 = var_26_arg_0 | var_26_arg_1; [L107] SORT_3 var_30_arg_0 = var_26; [L108] SORT_3 var_30 = ~var_30_arg_0; [L109] SORT_3 var_31_arg_0 = var_29; [L110] SORT_3 var_31_arg_1 = var_30; [L111] SORT_3 var_31 = var_31_arg_0 & var_31_arg_1; [L112] var_31 = var_31 & mask_SORT_3 [L113] SORT_3 bad_32_arg_0 = var_31; VAL [bad_32_arg_0=1, mask_SORT_3=1, state_15=0, state_17=0, state_20=9, var_29=1] [L114] CALL __VERIFIER_assert(!(bad_32_arg_0)) VAL [\old(cond)=0] [L21] COND TRUE !(cond) VAL [\old(cond)=0] [L21] reach_error() VAL [\old(cond)=0] - StatisticsResult: Ultimate Automizer benchmark data CFG has 6 procedures, 28 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 0.7s, OverallIterations: 1, TraceHistogramMax: 2, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 0.0s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.1s, HoareTripleCheckerStatistics: , PredicateUnifierStatistics: No data available, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=66occurred in iteration=0, InterpolantAutomatonStates: 0, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: No data available, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.0s SatisfiabilityAnalysisTime, 0.0s InterpolantComputationTime, 18 NumberOfCodeBlocks, 18 NumberOfCodeBlocksAsserted, 1 NumberOfCheckSat, 0 ConstructedInterpolants, 0 QuantifiedInterpolants, 0 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 0 InterpolantComputations, 0 PerfectInterpolantSequences, 0/0 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 proved your program to be incorrect! [2024-08-15 18:23:34,757 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (1)] Forceful destruction successful, exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Writing output log to file Ultimate.log Writing human readable error path to file UltimateCounterExample.errorpath Result: FALSE