./Ultimate.py --spec ../../../trunk/examples/svcomp/properties/unreach-call.prp --file ../../../trunk/examples/svcomp/hardware-verification-bv/btor2c-lazyMod.vis_QF_BV_rotate32.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_rotate32.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_rotate32.c ./svcomp-yaml-violation-generation.2024-08-01_14-26-22.files/Default/btor2c-lazyMod.vis_QF_BV_rotate32.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:41,510 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-08-15 18:22:41,631 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:41,636 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-08-15 18:22:41,636 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-08-15 18:22:41,667 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-08-15 18:22:41,668 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-08-15 18:22:41,670 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-08-15 18:22:41,670 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-08-15 18:22:41,672 INFO L153 SettingsManager]: * Use memory slicer=true [2024-08-15 18:22:41,672 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-08-15 18:22:41,672 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-08-15 18:22:41,673 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-08-15 18:22:41,673 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-08-15 18:22:41,675 INFO L153 SettingsManager]: * Use SBE=true [2024-08-15 18:22:41,676 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-08-15 18:22:41,676 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-08-15 18:22:41,676 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-08-15 18:22:41,677 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-08-15 18:22:41,677 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-08-15 18:22:41,681 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-08-15 18:22:41,681 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-08-15 18:22:41,682 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-08-15 18:22:41,682 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-08-15 18:22:41,682 INFO L153 SettingsManager]: * Use constant arrays=true [2024-08-15 18:22:41,682 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-08-15 18:22:41,683 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-08-15 18:22:41,683 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-08-15 18:22:41,683 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-08-15 18:22:41,683 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-08-15 18:22:41,684 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-08-15 18:22:41,684 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-08-15 18:22:41,684 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-08-15 18:22:41,684 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-08-15 18:22:41,684 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-08-15 18:22:41,685 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-08-15 18:22:41,685 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-08-15 18:22:41,685 INFO L153 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2024-08-15 18:22:41,685 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-08-15 18:22:41,686 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-08-15 18:22:41,686 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:41,969 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-08-15 18:22:41,999 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-08-15 18:22:42,002 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-08-15 18:22:42,004 INFO L270 PluginConnector]: Initializing CDTParser... [2024-08-15 18:22:42,005 INFO L274 PluginConnector]: CDTParser initialized [2024-08-15 18:22:42,007 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_rotate32.c [2024-08-15 18:22:43,527 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-08-15 18:22:43,757 INFO L384 CDTParser]: Found 1 translation units. [2024-08-15 18:22:43,758 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/hardware-verification-bv/btor2c-lazyMod.vis_QF_BV_rotate32.c [2024-08-15 18:22:43,769 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/c267b253f/7a1f94747d924409b5a2ae29ff535a64/FLAGa28744870 [2024-08-15 18:22:43,783 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/c267b253f/7a1f94747d924409b5a2ae29ff535a64 [2024-08-15 18:22:43,786 INFO L270 PluginConnector]: Initializing Witness Parser... [2024-08-15 18:22:43,787 INFO L274 PluginConnector]: Witness Parser initialized [2024-08-15 18:22:43,788 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_rotate32.yml/witness.yml [2024-08-15 18:22:43,857 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-08-15 18:22:43,858 INFO L133 ToolchainWalker]: Walking toolchain with 4 elements. [2024-08-15 18:22:43,861 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-08-15 18:22:43,861 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-08-15 18:22:43,866 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-08-15 18:22:43,867 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 15.08 06:22:43" (1/2) ... [2024-08-15 18:22:43,868 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@74466533 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.08 06:22:43, skipping insertion in model container [2024-08-15 18:22:43,868 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 15.08 06:22:43" (1/2) ... [2024-08-15 18:22:43,870 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.CACSL2BoogieTranslatorObserver@67bbb24c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.08 06:22:43, skipping insertion in model container [2024-08-15 18:22:43,870 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:43" (2/2) ... [2024-08-15 18:22:43,871 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@74466533 and model type witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator VIOLATION_WITNESS 15.08 06:22:43, skipping insertion in model container [2024-08-15 18:22:43,871 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:43" (2/2) ... [2024-08-15 18:22:43,903 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-08-15 18:22:44,095 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_rotate32.c[1258,1271] [2024-08-15 18:22:44,155 INFO L207 PostProcessor]: Analyzing one entry point: main [2024-08-15 18:22:44,166 INFO L200 MainTranslator]: Completed pre-run [2024-08-15 18:22:44,181 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_rotate32.c[1258,1271] [2024-08-15 18:22:44,220 INFO L207 PostProcessor]: Analyzing one entry point: main [2024-08-15 18:22:44,245 INFO L204 MainTranslator]: Completed translation [2024-08-15 18:22:44,246 INFO L201 PluginConnector]: Adding new model witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator VIOLATION_WITNESS 15.08 06:22:44 WrapperNode [2024-08-15 18:22:44,248 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-08-15 18:22:44,249 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-08-15 18:22:44,249 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-08-15 18:22:44,249 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-08-15 18:22:44,263 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:22:44" (1/1) ... [2024-08-15 18:22:44,264 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:22:44" (1/1) ... [2024-08-15 18:22:44,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:22:44" (1/1) ... [2024-08-15 18:22:44,318 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:44,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:22:44" (1/1) ... [2024-08-15 18:22:44,319 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:22:44" (1/1) ... [2024-08-15 18:22:44,334 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:22:44" (1/1) ... [2024-08-15 18:22:44,337 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:22:44" (1/1) ... [2024-08-15 18:22:44,343 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:22:44" (1/1) ... [2024-08-15 18:22:44,353 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-08-15 18:22:44,354 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2024-08-15 18:22:44,354 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2024-08-15 18:22:44,354 INFO L274 PluginConnector]: IcfgBuilder initialized [2024-08-15 18:22:44,355 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:22:44" (1/1) ... [2024-08-15 18:22:44,361 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-08-15 18:22:44,373 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-08-15 18:22:44,390 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:44,393 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:44,444 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2024-08-15 18:22:44,444 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-08-15 18:22:44,447 INFO L138 BoogieDeclarations]: Found implementation of procedure reach_error [2024-08-15 18:22:44,447 INFO L138 BoogieDeclarations]: Found implementation of procedure __VERIFIER_assert [2024-08-15 18:22:44,448 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2024-08-15 18:22:44,448 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2024-08-15 18:22:44,448 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_uchar [2024-08-15 18:22:44,448 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_ushort [2024-08-15 18:22:44,448 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_uint [2024-08-15 18:22:44,448 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_ulong [2024-08-15 18:22:44,448 INFO L130 BoogieDeclarations]: Found specification of procedure abort [2024-08-15 18:22:44,448 INFO L130 BoogieDeclarations]: Found specification of procedure __assert_fail [2024-08-15 18:22:44,448 INFO L130 BoogieDeclarations]: Found specification of procedure reach_error [2024-08-15 18:22:44,449 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-08-15 18:22:44,449 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2024-08-15 18:22:44,449 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2024-08-15 18:22:44,449 INFO L130 BoogieDeclarations]: Found specification of procedure main [2024-08-15 18:22:44,449 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2024-08-15 18:22:44,449 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-08-15 18:22:44,449 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-08-15 18:22:44,449 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#0 [2024-08-15 18:22:44,449 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#0 [2024-08-15 18:22:44,449 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2024-08-15 18:22:44,543 INFO L273 CfgBuilder]: Building ICFG [2024-08-15 18:22:44,546 INFO L304 CfgBuilder]: Building CFG for each procedure with an implementation [2024-08-15 18:22:45,113 INFO L? ?]: Removed 170 outVars from TransFormulas that were not future-live. [2024-08-15 18:22:45,113 INFO L327 CfgBuilder]: Performing block encoding [2024-08-15 18:22:45,124 INFO L349 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-08-15 18:22:45,127 INFO L354 CfgBuilder]: Removed 0 assume(true) statements. [2024-08-15 18:22:45,128 INFO L201 PluginConnector]: Adding new model witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 15.08 06:22:45 BoogieIcfgContainer [2024-08-15 18:22:45,128 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2024-08-15 18:22:45,131 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-08-15 18:22:45,131 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-08-15 18:22:45,136 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-08-15 18:22:45,136 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 15.08 06:22:43" (1/4) ... [2024-08-15 18:22:45,137 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5e3bf43f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 15.08 06:22:45, skipping insertion in model container [2024-08-15 18:22:45,137 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:43" (2/4) ... [2024-08-15 18:22:45,137 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:45,141 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5e3bf43f and model type witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction VIOLATION_WITNESS 15.08 06:22:45, skipping insertion in model container [2024-08-15 18:22:45,142 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:22:44" (3/4) ... [2024-08-15 18:22:45,142 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5e3bf43f and model type witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction VIOLATION_WITNESS 15.08 06:22:45, skipping insertion in model container [2024-08-15 18:22:45,143 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:22:45" (4/4) ... [2024-08-15 18:22:45,144 INFO L128 eAbstractionObserver]: Analyzing ICFG btor2c-lazyMod.vis_QF_BV_rotate32.c [2024-08-15 18:22:45,166 INFO L201 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-08-15 18:22:45,166 INFO L160 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-08-15 18:22:45,203 INFO L90 WitnessUtils]: Constructing product of automaton with 81 states and violation witness of the following lengths: [9] [2024-08-15 18:22:45,371 INFO L95 WitnessUtils]: Product has 427 reachable states. [2024-08-15 18:22:45,411 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-08-15 18:22:45,444 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;@24bc7bc1, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-08-15 18:22:45,444 INFO L358 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-08-15 18:22:45,447 INFO L276 IsEmpty]: Start isEmpty. Operand 427 states and 663 transitions. [2024-08-15 18:22:45,458 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 106 [2024-08-15 18:22:45,459 INFO L187 NwaCegarLoop]: Found error trace [2024-08-15 18:22:45,460 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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] [2024-08-15 18:22:45,461 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-08-15 18:22:45,468 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-08-15 18:22:45,469 INFO L85 PathProgramCache]: Analyzing trace with hash 1641050639, now seen corresponding path program 1 times [2024-08-15 18:22:45,479 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-08-15 18:22:45,479 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1265227195] [2024-08-15 18:22:45,480 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-08-15 18:22:45,480 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-08-15 18:22:45,862 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-08-15 18:22:46,728 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2024-08-15 18:22:46,730 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-08-15 18:22:46,735 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2024-08-15 18:22:46,737 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-08-15 18:22:46,741 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 58 [2024-08-15 18:22:46,742 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-08-15 18:22:46,747 INFO L134 CoverageAnalysis]: Checked inductivity of 59 backedges. 8 proven. 0 refuted. 0 times theorem prover too weak. 51 trivial. 0 not checked. [2024-08-15 18:22:46,747 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-08-15 18:22:46,748 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1265227195] [2024-08-15 18:22:46,749 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1265227195] provided 1 perfect and 0 imperfect interpolant sequences [2024-08-15 18:22:46,749 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-08-15 18:22:46,750 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-08-15 18:22:46,751 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1160131324] [2024-08-15 18:22:46,752 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-08-15 18:22:46,756 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-08-15 18:22:46,757 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-08-15 18:22:46,792 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-08-15 18:22:46,793 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2024-08-15 18:22:46,796 INFO L87 Difference]: Start difference. First operand 427 states and 663 transitions. Second operand has 6 states, 5 states have (on average 10.6) internal successors, (53), 5 states have internal predecessors, (53), 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:22:46,885 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-08-15 18:22:46,886 INFO L93 Difference]: Finished difference Result 376 states and 590 transitions. [2024-08-15 18:22:46,888 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-08-15 18:22:46,889 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 10.6) internal successors, (53), 5 states have internal predecessors, (53), 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 105 [2024-08-15 18:22:46,890 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-08-15 18:22:46,900 INFO L225 Difference]: With dead ends: 376 [2024-08-15 18:22:46,904 INFO L226 Difference]: Without dead ends: 372 [2024-08-15 18:22:46,906 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 8 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:22:46,912 INFO L413 NwaCegarLoop]: 111 mSDtfsCounter, 83 mSDsluCounter, 440 mSDsCounter, 0 mSdLazyCounter, 23 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 84 SdHoareTripleChecker+Valid, 551 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:22:46,913 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [84 Valid, 551 Invalid, 23 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 23 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-08-15 18:22:46,931 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 372 states. [2024-08-15 18:22:46,974 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 372 to 148. [2024-08-15 18:22:46,977 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 148 states, 138 states have (on average 1.5869565217391304) internal successors, (219), 139 states have internal predecessors, (219), 5 states have call successors, (5), 5 states have call predecessors, (5), 4 states have return successors, (4), 3 states have call predecessors, (4), 4 states have call successors, (4) [2024-08-15 18:22:46,981 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 148 states to 148 states and 228 transitions. [2024-08-15 18:22:46,983 INFO L78 Accepts]: Start accepts. Automaton has 148 states and 228 transitions. Word has length 105 [2024-08-15 18:22:46,984 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-08-15 18:22:46,984 INFO L495 AbstractCegarLoop]: Abstraction has 148 states and 228 transitions. [2024-08-15 18:22:46,985 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 10.6) internal successors, (53), 5 states have internal predecessors, (53), 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:22:46,985 INFO L276 IsEmpty]: Start isEmpty. Operand 148 states and 228 transitions. [2024-08-15 18:22:46,986 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 107 [2024-08-15 18:22:46,989 INFO L187 NwaCegarLoop]: Found error trace [2024-08-15 18:22:46,989 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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] [2024-08-15 18:22:46,989 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-08-15 18:22:46,990 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-08-15 18:22:46,990 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-08-15 18:22:46,994 INFO L85 PathProgramCache]: Analyzing trace with hash 2019546501, now seen corresponding path program 1 times [2024-08-15 18:22:46,994 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-08-15 18:22:46,995 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [56604012] [2024-08-15 18:22:46,995 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-08-15 18:22:46,995 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-08-15 18:22:47,125 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-08-15 18:22:47,481 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2024-08-15 18:22:47,482 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-08-15 18:22:47,485 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2024-08-15 18:22:47,487 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-08-15 18:22:47,489 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 58 [2024-08-15 18:22:47,490 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-08-15 18:22:47,493 INFO L134 CoverageAnalysis]: Checked inductivity of 59 backedges. 12 proven. 0 refuted. 0 times theorem prover too weak. 47 trivial. 0 not checked. [2024-08-15 18:22:47,494 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-08-15 18:22:47,495 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [56604012] [2024-08-15 18:22:47,497 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [56604012] provided 1 perfect and 0 imperfect interpolant sequences [2024-08-15 18:22:47,497 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-08-15 18:22:47,497 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-08-15 18:22:47,498 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [465887167] [2024-08-15 18:22:47,498 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-08-15 18:22:47,499 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-08-15 18:22:47,500 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-08-15 18:22:47,501 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-08-15 18:22:47,501 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-08-15 18:22:47,502 INFO L87 Difference]: Start difference. First operand 148 states and 228 transitions. Second operand has 4 states, 4 states have (on average 14.0) internal successors, (56), 4 states have internal predecessors, (56), 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:22:47,533 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-08-15 18:22:47,533 INFO L93 Difference]: Finished difference Result 154 states and 234 transitions. [2024-08-15 18:22:47,534 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-08-15 18:22:47,534 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 14.0) internal successors, (56), 4 states have internal predecessors, (56), 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 106 [2024-08-15 18:22:47,535 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-08-15 18:22:47,536 INFO L225 Difference]: With dead ends: 154 [2024-08-15 18:22:47,536 INFO L226 Difference]: Without dead ends: 154 [2024-08-15 18:22:47,537 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 9 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:22:47,538 INFO L413 NwaCegarLoop]: 113 mSDtfsCounter, 0 mSDsluCounter, 219 mSDsCounter, 0 mSdLazyCounter, 12 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 332 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:22:47,538 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 332 Invalid, 12 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 12 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-08-15 18:22:47,539 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 154 states. [2024-08-15 18:22:47,548 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 154 to 152. [2024-08-15 18:22:47,549 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 152 states, 142 states have (on average 1.5704225352112675) internal successors, (223), 143 states have internal predecessors, (223), 5 states have call successors, (5), 5 states have call predecessors, (5), 4 states have return successors, (4), 3 states have call predecessors, (4), 4 states have call successors, (4) [2024-08-15 18:22:47,550 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 152 states to 152 states and 232 transitions. [2024-08-15 18:22:47,551 INFO L78 Accepts]: Start accepts. Automaton has 152 states and 232 transitions. Word has length 106 [2024-08-15 18:22:47,551 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-08-15 18:22:47,551 INFO L495 AbstractCegarLoop]: Abstraction has 152 states and 232 transitions. [2024-08-15 18:22:47,551 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 14.0) internal successors, (56), 4 states have internal predecessors, (56), 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:22:47,552 INFO L276 IsEmpty]: Start isEmpty. Operand 152 states and 232 transitions. [2024-08-15 18:22:47,553 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 108 [2024-08-15 18:22:47,553 INFO L187 NwaCegarLoop]: Found error trace [2024-08-15 18:22:47,553 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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] [2024-08-15 18:22:47,554 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-08-15 18:22:47,554 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-08-15 18:22:47,554 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-08-15 18:22:47,554 INFO L85 PathProgramCache]: Analyzing trace with hash 1813840844, now seen corresponding path program 1 times [2024-08-15 18:22:47,555 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-08-15 18:22:47,555 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [993737577] [2024-08-15 18:22:47,555 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-08-15 18:22:47,555 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-08-15 18:22:47,770 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-08-15 18:22:48,680 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2024-08-15 18:22:48,682 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-08-15 18:22:48,686 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2024-08-15 18:22:48,689 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-08-15 18:22:48,692 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 58 [2024-08-15 18:22:48,721 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-08-15 18:22:48,726 INFO L134 CoverageAnalysis]: Checked inductivity of 59 backedges. 15 proven. 2 refuted. 0 times theorem prover too weak. 42 trivial. 0 not checked. [2024-08-15 18:22:48,729 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-08-15 18:22:48,729 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [993737577] [2024-08-15 18:22:48,729 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [993737577] provided 0 perfect and 1 imperfect interpolant sequences [2024-08-15 18:22:48,730 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [77262112] [2024-08-15 18:22:48,730 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-08-15 18:22:48,730 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-08-15 18:22:48,730 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-08-15 18:22:48,734 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:22:48,737 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:22:49,004 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-08-15 18:22:49,012 INFO L262 TraceCheckSpWp]: Trace formula consists of 622 conjuncts, 52 conjunts are in the unsatisfiable core [2024-08-15 18:22:49,023 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2024-08-15 18:22:49,986 INFO L134 CoverageAnalysis]: Checked inductivity of 59 backedges. 16 proven. 2 refuted. 0 times theorem prover too weak. 41 trivial. 0 not checked. [2024-08-15 18:22:49,986 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2024-08-15 18:22:52,173 INFO L134 CoverageAnalysis]: Checked inductivity of 59 backedges. 12 proven. 6 refuted. 0 times theorem prover too weak. 41 trivial. 0 not checked. [2024-08-15 18:22:52,174 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [77262112] provided 0 perfect and 2 imperfect interpolant sequences [2024-08-15 18:22:52,174 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-08-15 18:22:52,175 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7, 8] total 18 [2024-08-15 18:22:52,176 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1686132426] [2024-08-15 18:22:52,176 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-08-15 18:22:52,177 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 18 states [2024-08-15 18:22:52,177 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-08-15 18:22:52,180 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2024-08-15 18:22:52,180 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=64, Invalid=242, Unknown=0, NotChecked=0, Total=306 [2024-08-15 18:22:52,180 INFO L87 Difference]: Start difference. First operand 152 states and 232 transitions. Second operand has 18 states, 18 states have (on average 9.0) internal successors, (162), 18 states have internal predecessors, (162), 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:22:52,581 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-08-15 18:22:52,581 INFO L93 Difference]: Finished difference Result 158 states and 238 transitions. [2024-08-15 18:22:52,583 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-08-15 18:22:52,584 INFO L78 Accepts]: Start accepts. Automaton has has 18 states, 18 states have (on average 9.0) internal successors, (162), 18 states have internal predecessors, (162), 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 107 [2024-08-15 18:22:52,584 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-08-15 18:22:52,585 INFO L225 Difference]: With dead ends: 158 [2024-08-15 18:22:52,585 INFO L226 Difference]: Without dead ends: 158 [2024-08-15 18:22:52,586 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 227 GetRequests, 210 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 67 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=75, Invalid=267, Unknown=0, NotChecked=0, Total=342 [2024-08-15 18:22:52,587 INFO L413 NwaCegarLoop]: 85 mSDtfsCounter, 60 mSDsluCounter, 919 mSDsCounter, 0 mSdLazyCounter, 402 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 60 SdHoareTripleChecker+Valid, 1004 SdHoareTripleChecker+Invalid, 403 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 402 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2024-08-15 18:22:52,587 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [60 Valid, 1004 Invalid, 403 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 402 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2024-08-15 18:22:52,590 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 158 states. [2024-08-15 18:22:52,600 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 158 to 155. [2024-08-15 18:22:52,601 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 155 states, 145 states have (on average 1.5586206896551724) internal successors, (226), 146 states have internal predecessors, (226), 5 states have call successors, (5), 5 states have call predecessors, (5), 4 states have return successors, (4), 3 states have call predecessors, (4), 4 states have call successors, (4) [2024-08-15 18:22:52,602 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 155 states to 155 states and 235 transitions. [2024-08-15 18:22:52,602 INFO L78 Accepts]: Start accepts. Automaton has 155 states and 235 transitions. Word has length 107 [2024-08-15 18:22:52,603 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-08-15 18:22:52,603 INFO L495 AbstractCegarLoop]: Abstraction has 155 states and 235 transitions. [2024-08-15 18:22:52,603 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 18 states, 18 states have (on average 9.0) internal successors, (162), 18 states have internal predecessors, (162), 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:22:52,604 INFO L276 IsEmpty]: Start isEmpty. Operand 155 states and 235 transitions. [2024-08-15 18:22:52,605 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 109 [2024-08-15 18:22:52,605 INFO L187 NwaCegarLoop]: Found error trace [2024-08-15 18:22:52,605 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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] [2024-08-15 18:22:52,627 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2024-08-15 18:22:52,806 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2,2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-08-15 18:22:52,807 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-08-15 18:22:52,808 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-08-15 18:22:52,808 INFO L85 PathProgramCache]: Analyzing trace with hash 1332272066, now seen corresponding path program 1 times [2024-08-15 18:22:52,808 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-08-15 18:22:52,808 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [760944072] [2024-08-15 18:22:52,809 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-08-15 18:22:52,809 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-08-15 18:22:53,046 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-08-15 18:22:53,768 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2024-08-15 18:22:53,769 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-08-15 18:22:53,771 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2024-08-15 18:22:53,772 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-08-15 18:22:53,774 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 58 [2024-08-15 18:22:53,775 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-08-15 18:22:53,778 INFO L134 CoverageAnalysis]: Checked inductivity of 59 backedges. 12 proven. 5 refuted. 0 times theorem prover too weak. 42 trivial. 0 not checked. [2024-08-15 18:22:53,778 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-08-15 18:22:53,779 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [760944072] [2024-08-15 18:22:53,779 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [760944072] provided 0 perfect and 1 imperfect interpolant sequences [2024-08-15 18:22:53,779 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1630916906] [2024-08-15 18:22:53,779 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-08-15 18:22:53,780 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-08-15 18:22:53,780 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-08-15 18:22:53,782 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:22:53,783 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:22:54,069 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-08-15 18:22:54,077 INFO L262 TraceCheckSpWp]: Trace formula consists of 625 conjuncts, 25 conjunts are in the unsatisfiable core [2024-08-15 18:22:54,083 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2024-08-15 18:22:54,387 INFO L134 CoverageAnalysis]: Checked inductivity of 59 backedges. 47 proven. 0 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2024-08-15 18:22:54,388 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-08-15 18:22:54,389 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1630916906] provided 1 perfect and 0 imperfect interpolant sequences [2024-08-15 18:22:54,389 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-08-15 18:22:54,389 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [6] total 13 [2024-08-15 18:22:54,390 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1717264649] [2024-08-15 18:22:54,390 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-08-15 18:22:54,391 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-08-15 18:22:54,391 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-08-15 18:22:54,392 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-08-15 18:22:54,392 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=32, Invalid=124, Unknown=0, NotChecked=0, Total=156 [2024-08-15 18:22:54,392 INFO L87 Difference]: Start difference. First operand 155 states and 235 transitions. Second operand has 9 states, 9 states have (on average 10.11111111111111) internal successors, (91), 9 states have internal predecessors, (91), 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:22:54,541 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-08-15 18:22:54,542 INFO L93 Difference]: Finished difference Result 247 states and 385 transitions. [2024-08-15 18:22:54,543 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-08-15 18:22:54,543 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 10.11111111111111) internal successors, (91), 9 states have internal predecessors, (91), 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 108 [2024-08-15 18:22:54,544 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-08-15 18:22:54,545 INFO L225 Difference]: With dead ends: 247 [2024-08-15 18:22:54,546 INFO L226 Difference]: Without dead ends: 247 [2024-08-15 18:22:54,546 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 120 GetRequests, 109 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=32, Invalid=124, Unknown=0, NotChecked=0, Total=156 [2024-08-15 18:22:54,547 INFO L413 NwaCegarLoop]: 96 mSDtfsCounter, 103 mSDsluCounter, 539 mSDsCounter, 0 mSdLazyCounter, 169 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 103 SdHoareTripleChecker+Valid, 635 SdHoareTripleChecker+Invalid, 169 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 169 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-08-15 18:22:54,549 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [103 Valid, 635 Invalid, 169 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 169 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-08-15 18:22:54,551 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 247 states. [2024-08-15 18:22:54,565 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 247 to 243. [2024-08-15 18:22:54,566 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 243 states, 233 states have (on average 1.5879828326180256) internal successors, (370), 234 states have internal predecessors, (370), 5 states have call successors, (5), 5 states have call predecessors, (5), 4 states have return successors, (4), 3 states have call predecessors, (4), 4 states have call successors, (4) [2024-08-15 18:22:54,568 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 243 states to 243 states and 379 transitions. [2024-08-15 18:22:54,568 INFO L78 Accepts]: Start accepts. Automaton has 243 states and 379 transitions. Word has length 108 [2024-08-15 18:22:54,568 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-08-15 18:22:54,569 INFO L495 AbstractCegarLoop]: Abstraction has 243 states and 379 transitions. [2024-08-15 18:22:54,569 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 10.11111111111111) internal successors, (91), 9 states have internal predecessors, (91), 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:22:54,569 INFO L276 IsEmpty]: Start isEmpty. Operand 243 states and 379 transitions. [2024-08-15 18:22:54,571 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 109 [2024-08-15 18:22:54,571 INFO L187 NwaCegarLoop]: Found error trace [2024-08-15 18:22:54,572 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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] [2024-08-15 18:22:54,596 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Ended with exit code 0 [2024-08-15 18:22:54,773 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable3 [2024-08-15 18:22:54,774 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-08-15 18:22:54,775 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-08-15 18:22:54,778 INFO L85 PathProgramCache]: Analyzing trace with hash 1038869059, now seen corresponding path program 1 times [2024-08-15 18:22:54,778 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-08-15 18:22:54,778 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [948151712] [2024-08-15 18:22:54,778 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-08-15 18:22:54,779 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-08-15 18:22:55,008 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-08-15 18:22:56,852 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2024-08-15 18:22:56,853 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-08-15 18:22:56,855 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2024-08-15 18:22:56,856 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-08-15 18:22:56,860 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 58 [2024-08-15 18:22:56,862 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-08-15 18:22:56,867 INFO L134 CoverageAnalysis]: Checked inductivity of 59 backedges. 37 proven. 10 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2024-08-15 18:22:56,867 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-08-15 18:22:56,867 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [948151712] [2024-08-15 18:22:56,868 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [948151712] provided 0 perfect and 1 imperfect interpolant sequences [2024-08-15 18:22:56,868 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1563519413] [2024-08-15 18:22:56,868 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-08-15 18:22:56,868 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-08-15 18:22:56,868 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-08-15 18:22:56,870 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:22:56,872 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:22:57,238 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-08-15 18:22:57,247 INFO L262 TraceCheckSpWp]: Trace formula consists of 624 conjuncts, 205 conjunts are in the unsatisfiable core [2024-08-15 18:22:57,265 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2024-08-15 18:23:00,385 INFO L134 CoverageAnalysis]: Checked inductivity of 59 backedges. 23 proven. 26 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2024-08-15 18:23:00,385 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2024-08-15 18:23:11,046 INFO L134 CoverageAnalysis]: Checked inductivity of 59 backedges. 12 proven. 43 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2024-08-15 18:23:11,047 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1563519413] provided 0 perfect and 2 imperfect interpolant sequences [2024-08-15 18:23:11,047 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-08-15 18:23:11,047 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 35, 33] total 76 [2024-08-15 18:23:11,047 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1456647668] [2024-08-15 18:23:11,047 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-08-15 18:23:11,048 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 76 states [2024-08-15 18:23:11,048 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-08-15 18:23:11,050 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 76 interpolants. [2024-08-15 18:23:11,052 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=601, Invalid=5099, Unknown=0, NotChecked=0, Total=5700 [2024-08-15 18:23:11,052 INFO L87 Difference]: Start difference. First operand 243 states and 379 transitions. Second operand has 76 states, 76 states have (on average 3.4078947368421053) internal successors, (259), 76 states have internal predecessors, (259), 6 states have call successors, (7), 2 states have call predecessors, (7), 1 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) [2024-08-15 18:23:18,890 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-08-15 18:23:18,890 INFO L93 Difference]: Finished difference Result 471 states and 711 transitions. [2024-08-15 18:23:18,891 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 58 states. [2024-08-15 18:23:18,892 INFO L78 Accepts]: Start accepts. Automaton has has 76 states, 76 states have (on average 3.4078947368421053) internal successors, (259), 76 states have internal predecessors, (259), 6 states have call successors, (7), 2 states have call predecessors, (7), 1 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) Word has length 108 [2024-08-15 18:23:18,892 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-08-15 18:23:18,894 INFO L225 Difference]: With dead ends: 471 [2024-08-15 18:23:18,894 INFO L226 Difference]: Without dead ends: 471 [2024-08-15 18:23:18,900 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 292 GetRequests, 161 SyntacticMatches, 1 SemanticMatches, 130 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3425 ImplicationChecksByTransitivity, 10.8s TimeCoverageRelationStatistics Valid=2021, Invalid=15271, Unknown=0, NotChecked=0, Total=17292 [2024-08-15 18:23:18,901 INFO L413 NwaCegarLoop]: 45 mSDtfsCounter, 712 mSDsluCounter, 2004 mSDsCounter, 0 mSdLazyCounter, 3804 mSolverCounterSat, 37 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 3.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 712 SdHoareTripleChecker+Valid, 2049 SdHoareTripleChecker+Invalid, 3841 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 37 IncrementalHoareTripleChecker+Valid, 3804 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 3.7s IncrementalHoareTripleChecker+Time [2024-08-15 18:23:18,901 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [712 Valid, 2049 Invalid, 3841 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [37 Valid, 3804 Invalid, 0 Unknown, 0 Unchecked, 3.7s Time] [2024-08-15 18:23:18,902 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 471 states. [2024-08-15 18:23:18,910 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 471 to 353. [2024-08-15 18:23:18,912 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 353 states, 343 states have (on average 1.5626822157434401) internal successors, (536), 344 states have internal predecessors, (536), 5 states have call successors, (5), 5 states have call predecessors, (5), 4 states have return successors, (4), 3 states have call predecessors, (4), 4 states have call successors, (4) [2024-08-15 18:23:18,917 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 353 states to 353 states and 545 transitions. [2024-08-15 18:23:18,919 INFO L78 Accepts]: Start accepts. Automaton has 353 states and 545 transitions. Word has length 108 [2024-08-15 18:23:18,920 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-08-15 18:23:18,920 INFO L495 AbstractCegarLoop]: Abstraction has 353 states and 545 transitions. [2024-08-15 18:23:18,920 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 76 states, 76 states have (on average 3.4078947368421053) internal successors, (259), 76 states have internal predecessors, (259), 6 states have call successors, (7), 2 states have call predecessors, (7), 1 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) [2024-08-15 18:23:18,920 INFO L276 IsEmpty]: Start isEmpty. Operand 353 states and 545 transitions. [2024-08-15 18:23:18,922 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 110 [2024-08-15 18:23:18,923 INFO L187 NwaCegarLoop]: Found error trace [2024-08-15 18:23:18,923 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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] [2024-08-15 18:23:18,945 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Ended with exit code 0 [2024-08-15 18:23:19,127 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-08-15 18:23:19,128 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-08-15 18:23:19,129 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-08-15 18:23:19,129 INFO L85 PathProgramCache]: Analyzing trace with hash 522948122, now seen corresponding path program 1 times [2024-08-15 18:23:19,129 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-08-15 18:23:19,129 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [453983759] [2024-08-15 18:23:19,129 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-08-15 18:23:19,129 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-08-15 18:23:19,237 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-08-15 18:23:19,995 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2024-08-15 18:23:19,997 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-08-15 18:23:19,999 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2024-08-15 18:23:20,000 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-08-15 18:23:20,002 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 58 [2024-08-15 18:23:20,003 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-08-15 18:23:20,005 INFO L134 CoverageAnalysis]: Checked inductivity of 59 backedges. 47 proven. 0 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2024-08-15 18:23:20,006 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-08-15 18:23:20,006 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [453983759] [2024-08-15 18:23:20,007 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [453983759] provided 1 perfect and 0 imperfect interpolant sequences [2024-08-15 18:23:20,007 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-08-15 18:23:20,007 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2024-08-15 18:23:20,007 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [664119095] [2024-08-15 18:23:20,007 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-08-15 18:23:20,008 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-08-15 18:23:20,008 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-08-15 18:23:20,009 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-08-15 18:23:20,009 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=49, Unknown=0, NotChecked=0, Total=72 [2024-08-15 18:23:20,009 INFO L87 Difference]: Start difference. First operand 353 states and 545 transitions. Second operand has 9 states, 9 states have (on average 10.222222222222221) internal successors, (92), 9 states have internal predecessors, (92), 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:20,238 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-08-15 18:23:20,238 INFO L93 Difference]: Finished difference Result 455 states and 707 transitions. [2024-08-15 18:23:20,239 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-08-15 18:23:20,239 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 10.222222222222221) internal successors, (92), 9 states have internal predecessors, (92), 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 109 [2024-08-15 18:23:20,240 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-08-15 18:23:20,241 INFO L225 Difference]: With dead ends: 455 [2024-08-15 18:23:20,241 INFO L226 Difference]: Without dead ends: 455 [2024-08-15 18:23:20,242 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 11 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=27, Invalid=63, Unknown=0, NotChecked=0, Total=90 [2024-08-15 18:23:20,244 INFO L413 NwaCegarLoop]: 140 mSDtfsCounter, 147 mSDsluCounter, 498 mSDsCounter, 0 mSdLazyCounter, 248 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 148 SdHoareTripleChecker+Valid, 638 SdHoareTripleChecker+Invalid, 250 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 248 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-08-15 18:23:20,245 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [148 Valid, 638 Invalid, 250 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 248 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-08-15 18:23:20,245 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 455 states. [2024-08-15 18:23:20,269 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 455 to 443. [2024-08-15 18:23:20,270 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 443 states, 433 states have (on average 1.5704387990762125) internal successors, (680), 434 states have internal predecessors, (680), 5 states have call successors, (5), 5 states have call predecessors, (5), 4 states have return successors, (4), 3 states have call predecessors, (4), 4 states have call successors, (4) [2024-08-15 18:23:20,271 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 443 states to 443 states and 689 transitions. [2024-08-15 18:23:20,272 INFO L78 Accepts]: Start accepts. Automaton has 443 states and 689 transitions. Word has length 109 [2024-08-15 18:23:20,272 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-08-15 18:23:20,272 INFO L495 AbstractCegarLoop]: Abstraction has 443 states and 689 transitions. [2024-08-15 18:23:20,272 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 10.222222222222221) internal successors, (92), 9 states have internal predecessors, (92), 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:20,273 INFO L276 IsEmpty]: Start isEmpty. Operand 443 states and 689 transitions. [2024-08-15 18:23:20,274 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 110 [2024-08-15 18:23:20,274 INFO L187 NwaCegarLoop]: Found error trace [2024-08-15 18:23:20,274 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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] [2024-08-15 18:23:20,274 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2024-08-15 18:23:20,275 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-08-15 18:23:20,275 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-08-15 18:23:20,276 INFO L85 PathProgramCache]: Analyzing trace with hash -501745799, now seen corresponding path program 1 times [2024-08-15 18:23:20,277 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-08-15 18:23:20,277 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1192055920] [2024-08-15 18:23:20,277 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-08-15 18:23:20,277 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-08-15 18:23:20,468 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-08-15 18:23:22,250 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2024-08-15 18:23:22,252 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-08-15 18:23:22,253 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2024-08-15 18:23:22,255 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-08-15 18:23:22,258 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 58 [2024-08-15 18:23:22,259 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-08-15 18:23:22,264 INFO L134 CoverageAnalysis]: Checked inductivity of 59 backedges. 12 proven. 10 refuted. 0 times theorem prover too weak. 37 trivial. 0 not checked. [2024-08-15 18:23:22,264 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-08-15 18:23:22,264 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1192055920] [2024-08-15 18:23:22,264 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1192055920] provided 0 perfect and 1 imperfect interpolant sequences [2024-08-15 18:23:22,264 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2122228482] [2024-08-15 18:23:22,265 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-08-15 18:23:22,265 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-08-15 18:23:22,267 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-08-15 18:23:22,269 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-08-15 18:23:22,270 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2024-08-15 18:23:22,526 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-08-15 18:23:22,531 INFO L262 TraceCheckSpWp]: Trace formula consists of 628 conjuncts, 21 conjunts are in the unsatisfiable core [2024-08-15 18:23:22,535 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2024-08-15 18:23:22,896 INFO L134 CoverageAnalysis]: Checked inductivity of 59 backedges. 48 proven. 0 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2024-08-15 18:23:22,896 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-08-15 18:23:22,896 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2122228482] provided 1 perfect and 0 imperfect interpolant sequences [2024-08-15 18:23:22,896 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-08-15 18:23:22,897 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [12] total 17 [2024-08-15 18:23:22,897 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [827428727] [2024-08-15 18:23:22,897 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-08-15 18:23:22,897 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-08-15 18:23:22,897 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-08-15 18:23:22,898 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-08-15 18:23:22,898 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=37, Invalid=235, Unknown=0, NotChecked=0, Total=272 [2024-08-15 18:23:22,899 INFO L87 Difference]: Start difference. First operand 443 states and 689 transitions. Second operand has 7 states, 7 states have (on average 13.285714285714286) internal successors, (93), 7 states have internal predecessors, (93), 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:23,055 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-08-15 18:23:23,055 INFO L93 Difference]: Finished difference Result 443 states and 685 transitions. [2024-08-15 18:23:23,056 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-08-15 18:23:23,056 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 13.285714285714286) internal successors, (93), 7 states have internal predecessors, (93), 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 109 [2024-08-15 18:23:23,056 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-08-15 18:23:23,058 INFO L225 Difference]: With dead ends: 443 [2024-08-15 18:23:23,058 INFO L226 Difference]: Without dead ends: 443 [2024-08-15 18:23:23,059 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 129 GetRequests, 113 SyntacticMatches, 1 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 10 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=37, Invalid=235, Unknown=0, NotChecked=0, Total=272 [2024-08-15 18:23:23,060 INFO L413 NwaCegarLoop]: 90 mSDtfsCounter, 68 mSDsluCounter, 226 mSDsCounter, 0 mSdLazyCounter, 175 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 68 SdHoareTripleChecker+Valid, 316 SdHoareTripleChecker+Invalid, 176 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 175 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-08-15 18:23:23,060 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [68 Valid, 316 Invalid, 176 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 175 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-08-15 18:23:23,061 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 443 states. [2024-08-15 18:23:23,067 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 443 to 443. [2024-08-15 18:23:23,068 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 443 states, 433 states have (on average 1.5612009237875288) internal successors, (676), 434 states have internal predecessors, (676), 5 states have call successors, (5), 5 states have call predecessors, (5), 4 states have return successors, (4), 3 states have call predecessors, (4), 4 states have call successors, (4) [2024-08-15 18:23:23,070 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 443 states to 443 states and 685 transitions. [2024-08-15 18:23:23,070 INFO L78 Accepts]: Start accepts. Automaton has 443 states and 685 transitions. Word has length 109 [2024-08-15 18:23:23,070 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-08-15 18:23:23,071 INFO L495 AbstractCegarLoop]: Abstraction has 443 states and 685 transitions. [2024-08-15 18:23:23,071 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 13.285714285714286) internal successors, (93), 7 states have internal predecessors, (93), 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:23,071 INFO L276 IsEmpty]: Start isEmpty. Operand 443 states and 685 transitions. [2024-08-15 18:23:23,072 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 111 [2024-08-15 18:23:23,072 INFO L187 NwaCegarLoop]: Found error trace [2024-08-15 18:23:23,072 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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] [2024-08-15 18:23:23,094 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Ended with exit code 0 [2024-08-15 18:23:23,276 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6,5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-08-15 18:23:23,277 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-08-15 18:23:23,277 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-08-15 18:23:23,277 INFO L85 PathProgramCache]: Analyzing trace with hash 938462841, now seen corresponding path program 1 times [2024-08-15 18:23:23,278 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-08-15 18:23:23,278 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [598140308] [2024-08-15 18:23:23,278 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-08-15 18:23:23,278 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-08-15 18:23:23,478 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-08-15 18:23:26,149 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2024-08-15 18:23:26,151 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-08-15 18:23:26,153 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2024-08-15 18:23:26,155 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-08-15 18:23:26,160 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 58 [2024-08-15 18:23:26,162 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-08-15 18:23:26,167 INFO L134 CoverageAnalysis]: Checked inductivity of 59 backedges. 33 proven. 14 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2024-08-15 18:23:26,167 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-08-15 18:23:26,167 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [598140308] [2024-08-15 18:23:26,167 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [598140308] provided 0 perfect and 1 imperfect interpolant sequences [2024-08-15 18:23:26,168 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1979133050] [2024-08-15 18:23:26,168 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-08-15 18:23:26,168 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-08-15 18:23:26,168 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-08-15 18:23:26,170 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-08-15 18:23:26,172 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2024-08-15 18:23:26,442 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-08-15 18:23:26,445 INFO L262 TraceCheckSpWp]: Trace formula consists of 630 conjuncts, 16 conjunts are in the unsatisfiable core [2024-08-15 18:23:26,448 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2024-08-15 18:23:26,629 INFO L134 CoverageAnalysis]: Checked inductivity of 59 backedges. 48 proven. 0 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2024-08-15 18:23:26,630 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-08-15 18:23:26,630 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1979133050] provided 1 perfect and 0 imperfect interpolant sequences [2024-08-15 18:23:26,630 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-08-15 18:23:26,630 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [18] total 22 [2024-08-15 18:23:26,630 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [513345356] [2024-08-15 18:23:26,630 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-08-15 18:23:26,631 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-08-15 18:23:26,631 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-08-15 18:23:26,631 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-08-15 18:23:26,632 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=50, Invalid=412, Unknown=0, NotChecked=0, Total=462 [2024-08-15 18:23:26,632 INFO L87 Difference]: Start difference. First operand 443 states and 685 transitions. Second operand has 6 states, 6 states have (on average 15.666666666666666) internal successors, (94), 6 states have internal predecessors, (94), 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:26,773 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-08-15 18:23:26,774 INFO L93 Difference]: Finished difference Result 443 states and 681 transitions. [2024-08-15 18:23:26,774 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-08-15 18:23:26,774 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 15.666666666666666) internal successors, (94), 6 states have internal predecessors, (94), 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 110 [2024-08-15 18:23:26,775 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-08-15 18:23:26,776 INFO L225 Difference]: With dead ends: 443 [2024-08-15 18:23:26,776 INFO L226 Difference]: Without dead ends: 443 [2024-08-15 18:23:26,777 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 139 GetRequests, 116 SyntacticMatches, 3 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 57 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=50, Invalid=412, Unknown=0, NotChecked=0, Total=462 [2024-08-15 18:23:26,777 INFO L413 NwaCegarLoop]: 91 mSDtfsCounter, 68 mSDsluCounter, 249 mSDsCounter, 0 mSdLazyCounter, 172 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 68 SdHoareTripleChecker+Valid, 340 SdHoareTripleChecker+Invalid, 173 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 172 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-08-15 18:23:26,778 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [68 Valid, 340 Invalid, 173 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 172 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-08-15 18:23:26,779 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 443 states. [2024-08-15 18:23:26,786 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 443 to 443. [2024-08-15 18:23:26,787 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 443 states, 433 states have (on average 1.5519630484988454) internal successors, (672), 434 states have internal predecessors, (672), 5 states have call successors, (5), 5 states have call predecessors, (5), 4 states have return successors, (4), 3 states have call predecessors, (4), 4 states have call successors, (4) [2024-08-15 18:23:26,789 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 443 states to 443 states and 681 transitions. [2024-08-15 18:23:26,789 INFO L78 Accepts]: Start accepts. Automaton has 443 states and 681 transitions. Word has length 110 [2024-08-15 18:23:26,790 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-08-15 18:23:26,790 INFO L495 AbstractCegarLoop]: Abstraction has 443 states and 681 transitions. [2024-08-15 18:23:26,790 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 15.666666666666666) internal successors, (94), 6 states have internal predecessors, (94), 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:26,790 INFO L276 IsEmpty]: Start isEmpty. Operand 443 states and 681 transitions. [2024-08-15 18:23:26,792 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 111 [2024-08-15 18:23:26,792 INFO L187 NwaCegarLoop]: Found error trace [2024-08-15 18:23:26,792 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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] [2024-08-15 18:23:26,813 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Forceful destruction successful, exit code 0 [2024-08-15 18:23:26,992 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7,6 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-08-15 18:23:26,993 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-08-15 18:23:26,993 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-08-15 18:23:26,994 INFO L85 PathProgramCache]: Analyzing trace with hash -734159881, now seen corresponding path program 1 times [2024-08-15 18:23:26,994 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-08-15 18:23:26,994 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1051472438] [2024-08-15 18:23:26,994 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-08-15 18:23:26,994 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-08-15 18:23:27,111 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-08-15 18:23:28,284 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2024-08-15 18:23:28,285 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-08-15 18:23:28,287 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2024-08-15 18:23:28,287 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-08-15 18:23:28,289 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 58 [2024-08-15 18:23:28,290 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-08-15 18:23:28,293 INFO L134 CoverageAnalysis]: Checked inductivity of 59 backedges. 12 proven. 10 refuted. 0 times theorem prover too weak. 37 trivial. 0 not checked. [2024-08-15 18:23:28,293 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-08-15 18:23:28,293 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1051472438] [2024-08-15 18:23:28,293 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1051472438] provided 0 perfect and 1 imperfect interpolant sequences [2024-08-15 18:23:28,293 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1369753385] [2024-08-15 18:23:28,293 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-08-15 18:23:28,294 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-08-15 18:23:28,294 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-08-15 18:23:28,295 INFO L229 MonitoredProcess]: Starting monitored process 7 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-08-15 18:23:28,297 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Waiting until timeout for monitored process [2024-08-15 18:23:28,614 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-08-15 18:23:28,619 INFO L262 TraceCheckSpWp]: Trace formula consists of 632 conjuncts, 35 conjunts are in the unsatisfiable core [2024-08-15 18:23:28,623 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2024-08-15 18:23:28,971 INFO L134 CoverageAnalysis]: Checked inductivity of 59 backedges. 42 proven. 1 refuted. 0 times theorem prover too weak. 16 trivial. 0 not checked. [2024-08-15 18:23:28,971 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2024-08-15 18:23:29,326 INFO L134 CoverageAnalysis]: Checked inductivity of 59 backedges. 45 proven. 3 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2024-08-15 18:23:29,326 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1369753385] provided 0 perfect and 2 imperfect interpolant sequences [2024-08-15 18:23:29,326 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-08-15 18:23:29,326 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 8, 9] total 25 [2024-08-15 18:23:29,327 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1865420250] [2024-08-15 18:23:29,327 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-08-15 18:23:29,327 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 25 states [2024-08-15 18:23:29,328 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-08-15 18:23:29,328 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 25 interpolants. [2024-08-15 18:23:29,329 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=83, Invalid=517, Unknown=0, NotChecked=0, Total=600 [2024-08-15 18:23:29,329 INFO L87 Difference]: Start difference. First operand 443 states and 681 transitions. Second operand has 25 states, 25 states have (on average 8.16) internal successors, (204), 25 states have internal predecessors, (204), 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:30,134 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-08-15 18:23:30,134 INFO L93 Difference]: Finished difference Result 494 states and 740 transitions. [2024-08-15 18:23:30,135 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2024-08-15 18:23:30,135 INFO L78 Accepts]: Start accepts. Automaton has has 25 states, 25 states have (on average 8.16) internal successors, (204), 25 states have internal predecessors, (204), 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 110 [2024-08-15 18:23:30,136 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-08-15 18:23:30,138 INFO L225 Difference]: With dead ends: 494 [2024-08-15 18:23:30,138 INFO L226 Difference]: Without dead ends: 482 [2024-08-15 18:23:30,139 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 253 GetRequests, 215 SyntacticMatches, 1 SemanticMatches, 37 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 178 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=218, Invalid=1264, Unknown=0, NotChecked=0, Total=1482 [2024-08-15 18:23:30,140 INFO L413 NwaCegarLoop]: 71 mSDtfsCounter, 193 mSDsluCounter, 1037 mSDsCounter, 0 mSdLazyCounter, 778 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 193 SdHoareTripleChecker+Valid, 1108 SdHoareTripleChecker+Invalid, 783 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 778 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2024-08-15 18:23:30,141 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [193 Valid, 1108 Invalid, 783 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 778 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2024-08-15 18:23:30,142 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 482 states. [2024-08-15 18:23:30,150 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 482 to 465. [2024-08-15 18:23:30,151 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 465 states, 455 states have (on average 1.5362637362637364) internal successors, (699), 456 states have internal predecessors, (699), 5 states have call successors, (5), 5 states have call predecessors, (5), 4 states have return successors, (4), 3 states have call predecessors, (4), 4 states have call successors, (4) [2024-08-15 18:23:30,152 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 465 states to 465 states and 708 transitions. [2024-08-15 18:23:30,153 INFO L78 Accepts]: Start accepts. Automaton has 465 states and 708 transitions. Word has length 110 [2024-08-15 18:23:30,153 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-08-15 18:23:30,153 INFO L495 AbstractCegarLoop]: Abstraction has 465 states and 708 transitions. [2024-08-15 18:23:30,153 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 25 states, 25 states have (on average 8.16) internal successors, (204), 25 states have internal predecessors, (204), 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:30,153 INFO L276 IsEmpty]: Start isEmpty. Operand 465 states and 708 transitions. [2024-08-15 18:23:30,155 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 112 [2024-08-15 18:23:30,155 INFO L187 NwaCegarLoop]: Found error trace [2024-08-15 18:23:30,155 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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] [2024-08-15 18:23:30,177 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Forceful destruction successful, exit code 0 [2024-08-15 18:23:30,359 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8,7 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-08-15 18:23:30,360 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-08-15 18:23:30,361 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-08-15 18:23:30,361 INFO L85 PathProgramCache]: Analyzing trace with hash 1034280979, now seen corresponding path program 1 times [2024-08-15 18:23:30,361 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-08-15 18:23:30,361 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1638765754] [2024-08-15 18:23:30,361 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-08-15 18:23:30,361 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-08-15 18:23:30,515 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-08-15 18:23:31,717 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2024-08-15 18:23:31,718 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-08-15 18:23:31,720 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2024-08-15 18:23:31,721 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-08-15 18:23:31,723 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 58 [2024-08-15 18:23:31,726 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-08-15 18:23:31,730 INFO L134 CoverageAnalysis]: Checked inductivity of 59 backedges. 37 proven. 6 refuted. 0 times theorem prover too weak. 16 trivial. 0 not checked. [2024-08-15 18:23:31,730 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-08-15 18:23:31,730 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1638765754] [2024-08-15 18:23:31,730 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1638765754] provided 0 perfect and 1 imperfect interpolant sequences [2024-08-15 18:23:31,730 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1023916156] [2024-08-15 18:23:31,730 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-08-15 18:23:31,731 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-08-15 18:23:31,731 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-08-15 18:23:31,733 INFO L229 MonitoredProcess]: Starting monitored process 8 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-08-15 18:23:31,734 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Waiting until timeout for monitored process [2024-08-15 18:23:32,065 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-08-15 18:23:32,070 INFO L262 TraceCheckSpWp]: Trace formula consists of 634 conjuncts, 18 conjunts are in the unsatisfiable core [2024-08-15 18:23:32,073 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2024-08-15 18:23:32,314 INFO L134 CoverageAnalysis]: Checked inductivity of 59 backedges. 46 proven. 1 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2024-08-15 18:23:32,314 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2024-08-15 18:23:32,466 INFO L134 CoverageAnalysis]: Checked inductivity of 59 backedges. 46 proven. 0 refuted. 0 times theorem prover too weak. 13 trivial. 0 not checked. [2024-08-15 18:23:32,467 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1023916156] provided 1 perfect and 1 imperfect interpolant sequences [2024-08-15 18:23:32,467 INFO L185 FreeRefinementEngine]: Found 1 perfect and 2 imperfect interpolant sequences. [2024-08-15 18:23:32,467 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [11, 8] total 21 [2024-08-15 18:23:32,467 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2102294534] [2024-08-15 18:23:32,467 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-08-15 18:23:32,467 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-08-15 18:23:32,467 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-08-15 18:23:32,468 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-08-15 18:23:32,468 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=60, Invalid=360, Unknown=0, NotChecked=0, Total=420 [2024-08-15 18:23:32,468 INFO L87 Difference]: Start difference. First operand 465 states and 708 transitions. Second operand has 6 states, 6 states have (on average 15.5) internal successors, (93), 6 states have internal predecessors, (93), 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:32,585 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-08-15 18:23:32,586 INFO L93 Difference]: Finished difference Result 517 states and 780 transitions. [2024-08-15 18:23:32,586 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-08-15 18:23:32,587 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 15.5) internal successors, (93), 6 states have internal predecessors, (93), 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 111 [2024-08-15 18:23:32,587 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-08-15 18:23:32,589 INFO L225 Difference]: With dead ends: 517 [2024-08-15 18:23:32,589 INFO L226 Difference]: Without dead ends: 517 [2024-08-15 18:23:32,590 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 240 GetRequests, 221 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 75 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=60, Invalid=360, Unknown=0, NotChecked=0, Total=420 [2024-08-15 18:23:32,590 INFO L413 NwaCegarLoop]: 109 mSDtfsCounter, 12 mSDsluCounter, 250 mSDsCounter, 0 mSdLazyCounter, 122 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 12 SdHoareTripleChecker+Valid, 359 SdHoareTripleChecker+Invalid, 123 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 122 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-08-15 18:23:32,591 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [12 Valid, 359 Invalid, 123 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 122 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-08-15 18:23:32,591 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 517 states. [2024-08-15 18:23:32,597 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 517 to 485. [2024-08-15 18:23:32,598 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 485 states, 475 states have (on average 1.5305263157894737) internal successors, (727), 476 states have internal predecessors, (727), 5 states have call successors, (5), 5 states have call predecessors, (5), 4 states have return successors, (4), 3 states have call predecessors, (4), 4 states have call successors, (4) [2024-08-15 18:23:32,600 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 485 states to 485 states and 736 transitions. [2024-08-15 18:23:32,600 INFO L78 Accepts]: Start accepts. Automaton has 485 states and 736 transitions. Word has length 111 [2024-08-15 18:23:32,601 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-08-15 18:23:32,601 INFO L495 AbstractCegarLoop]: Abstraction has 485 states and 736 transitions. [2024-08-15 18:23:32,601 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 15.5) internal successors, (93), 6 states have internal predecessors, (93), 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:32,602 INFO L276 IsEmpty]: Start isEmpty. Operand 485 states and 736 transitions. [2024-08-15 18:23:32,603 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 112 [2024-08-15 18:23:32,603 INFO L187 NwaCegarLoop]: Found error trace [2024-08-15 18:23:32,603 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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] [2024-08-15 18:23:32,626 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Ended with exit code 0 [2024-08-15 18:23:32,807 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9,8 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-08-15 18:23:32,808 INFO L420 AbstractCegarLoop]: === Iteration 11 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-08-15 18:23:32,809 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-08-15 18:23:32,809 INFO L85 PathProgramCache]: Analyzing trace with hash 2058974900, now seen corresponding path program 1 times [2024-08-15 18:23:32,809 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-08-15 18:23:32,809 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1591611145] [2024-08-15 18:23:32,809 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-08-15 18:23:32,809 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-08-15 18:23:32,908 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-08-15 18:23:33,499 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2024-08-15 18:23:33,501 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-08-15 18:23:33,502 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2024-08-15 18:23:33,503 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-08-15 18:23:33,504 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 58 [2024-08-15 18:23:33,505 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-08-15 18:23:33,507 INFO L134 CoverageAnalysis]: Checked inductivity of 59 backedges. 43 proven. 2 refuted. 0 times theorem prover too weak. 14 trivial. 0 not checked. [2024-08-15 18:23:33,507 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-08-15 18:23:33,507 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1591611145] [2024-08-15 18:23:33,508 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1591611145] provided 0 perfect and 1 imperfect interpolant sequences [2024-08-15 18:23:33,508 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [631293198] [2024-08-15 18:23:33,508 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-08-15 18:23:33,508 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-08-15 18:23:33,508 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-08-15 18:23:33,510 INFO L229 MonitoredProcess]: Starting monitored process 9 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-08-15 18:23:33,517 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Waiting until timeout for monitored process [2024-08-15 18:23:33,791 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-08-15 18:23:33,794 INFO L262 TraceCheckSpWp]: Trace formula consists of 633 conjuncts, 18 conjunts are in the unsatisfiable core [2024-08-15 18:23:33,797 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2024-08-15 18:23:33,926 INFO L134 CoverageAnalysis]: Checked inductivity of 59 backedges. 46 proven. 1 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2024-08-15 18:23:33,927 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2024-08-15 18:23:34,064 INFO L134 CoverageAnalysis]: Checked inductivity of 59 backedges. 46 proven. 0 refuted. 0 times theorem prover too weak. 13 trivial. 0 not checked. [2024-08-15 18:23:34,065 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [631293198] provided 1 perfect and 1 imperfect interpolant sequences [2024-08-15 18:23:34,065 INFO L185 FreeRefinementEngine]: Found 1 perfect and 2 imperfect interpolant sequences. [2024-08-15 18:23:34,065 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [9, 7] total 18 [2024-08-15 18:23:34,065 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [454477358] [2024-08-15 18:23:34,066 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-08-15 18:23:34,066 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-08-15 18:23:34,067 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-08-15 18:23:34,068 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-08-15 18:23:34,068 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=52, Invalid=254, Unknown=0, NotChecked=0, Total=306 [2024-08-15 18:23:34,068 INFO L87 Difference]: Start difference. First operand 485 states and 736 transitions. Second operand has 6 states, 6 states have (on average 15.5) internal successors, (93), 6 states have internal predecessors, (93), 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:34,171 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-08-15 18:23:34,171 INFO L93 Difference]: Finished difference Result 513 states and 770 transitions. [2024-08-15 18:23:34,171 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-08-15 18:23:34,172 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 15.5) internal successors, (93), 6 states have internal predecessors, (93), 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 111 [2024-08-15 18:23:34,172 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-08-15 18:23:34,174 INFO L225 Difference]: With dead ends: 513 [2024-08-15 18:23:34,174 INFO L226 Difference]: Without dead ends: 513 [2024-08-15 18:23:34,175 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 240 GetRequests, 223 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 75 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=58, Invalid=284, Unknown=0, NotChecked=0, Total=342 [2024-08-15 18:23:34,176 INFO L413 NwaCegarLoop]: 109 mSDtfsCounter, 27 mSDsluCounter, 168 mSDsCounter, 0 mSdLazyCounter, 85 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 27 SdHoareTripleChecker+Valid, 277 SdHoareTripleChecker+Invalid, 86 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 85 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-08-15 18:23:34,176 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [27 Valid, 277 Invalid, 86 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 85 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-08-15 18:23:34,177 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 513 states. [2024-08-15 18:23:34,182 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 513 to 493. [2024-08-15 18:23:34,183 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 493 states, 483 states have (on average 1.5175983436853002) internal successors, (733), 484 states have internal predecessors, (733), 5 states have call successors, (5), 5 states have call predecessors, (5), 4 states have return successors, (4), 3 states have call predecessors, (4), 4 states have call successors, (4) [2024-08-15 18:23:34,185 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 493 states to 493 states and 742 transitions. [2024-08-15 18:23:34,186 INFO L78 Accepts]: Start accepts. Automaton has 493 states and 742 transitions. Word has length 111 [2024-08-15 18:23:34,186 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-08-15 18:23:34,186 INFO L495 AbstractCegarLoop]: Abstraction has 493 states and 742 transitions. [2024-08-15 18:23:34,186 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 15.5) internal successors, (93), 6 states have internal predecessors, (93), 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:34,187 INFO L276 IsEmpty]: Start isEmpty. Operand 493 states and 742 transitions. [2024-08-15 18:23:34,188 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 112 [2024-08-15 18:23:34,188 INFO L187 NwaCegarLoop]: Found error trace [2024-08-15 18:23:34,189 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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] [2024-08-15 18:23:34,211 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Ended with exit code 0 [2024-08-15 18:23:34,390 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable10 [2024-08-15 18:23:34,391 INFO L420 AbstractCegarLoop]: === Iteration 12 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-08-15 18:23:34,391 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-08-15 18:23:34,391 INFO L85 PathProgramCache]: Analyzing trace with hash -1717888760, now seen corresponding path program 1 times [2024-08-15 18:23:34,392 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-08-15 18:23:34,392 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1395617936] [2024-08-15 18:23:34,392 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-08-15 18:23:34,392 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-08-15 18:23:34,481 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-08-15 18:23:36,114 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2024-08-15 18:23:36,115 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-08-15 18:23:36,117 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2024-08-15 18:23:36,117 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-08-15 18:23:36,118 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 58 [2024-08-15 18:23:36,119 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-08-15 18:23:36,119 INFO L134 CoverageAnalysis]: Checked inductivity of 59 backedges. 47 proven. 0 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2024-08-15 18:23:36,120 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-08-15 18:23:36,120 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1395617936] [2024-08-15 18:23:36,120 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1395617936] provided 1 perfect and 0 imperfect interpolant sequences [2024-08-15 18:23:36,120 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-08-15 18:23:36,120 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [21] imperfect sequences [] total 21 [2024-08-15 18:23:36,120 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1732893334] [2024-08-15 18:23:36,120 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-08-15 18:23:36,120 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 21 states [2024-08-15 18:23:36,120 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-08-15 18:23:36,121 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2024-08-15 18:23:36,121 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=93, Invalid=327, Unknown=0, NotChecked=0, Total=420 [2024-08-15 18:23:36,121 INFO L87 Difference]: Start difference. First operand 493 states and 742 transitions. Second operand has 21 states, 21 states have (on average 4.476190476190476) internal successors, (94), 21 states have internal predecessors, (94), 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:36,356 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-08-15 18:23:36,357 INFO L93 Difference]: Finished difference Result 741 states and 1122 transitions. [2024-08-15 18:23:36,358 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2024-08-15 18:23:36,358 INFO L78 Accepts]: Start accepts. Automaton has has 21 states, 21 states have (on average 4.476190476190476) internal successors, (94), 21 states have internal predecessors, (94), 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 111 [2024-08-15 18:23:36,359 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-08-15 18:23:36,363 INFO L225 Difference]: With dead ends: 741 [2024-08-15 18:23:36,364 INFO L226 Difference]: Without dead ends: 741 [2024-08-15 18:23:36,364 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 32 GetRequests, 12 SyntacticMatches, 0 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 54 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=101, Invalid=361, Unknown=0, NotChecked=0, Total=462 [2024-08-15 18:23:36,365 INFO L413 NwaCegarLoop]: 141 mSDtfsCounter, 345 mSDsluCounter, 1320 mSDsCounter, 0 mSdLazyCounter, 332 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 345 SdHoareTripleChecker+Valid, 1461 SdHoareTripleChecker+Invalid, 333 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 332 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-08-15 18:23:36,366 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [345 Valid, 1461 Invalid, 333 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 332 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-08-15 18:23:36,367 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 741 states. [2024-08-15 18:23:36,376 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 741 to 541. [2024-08-15 18:23:36,377 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 541 states, 531 states have (on average 1.5197740112994351) internal successors, (807), 532 states have internal predecessors, (807), 5 states have call successors, (5), 5 states have call predecessors, (5), 4 states have return successors, (4), 3 states have call predecessors, (4), 4 states have call successors, (4) [2024-08-15 18:23:36,379 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 541 states to 541 states and 816 transitions. [2024-08-15 18:23:36,380 INFO L78 Accepts]: Start accepts. Automaton has 541 states and 816 transitions. Word has length 111 [2024-08-15 18:23:36,380 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-08-15 18:23:36,380 INFO L495 AbstractCegarLoop]: Abstraction has 541 states and 816 transitions. [2024-08-15 18:23:36,380 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 21 states, 21 states have (on average 4.476190476190476) internal successors, (94), 21 states have internal predecessors, (94), 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:36,380 INFO L276 IsEmpty]: Start isEmpty. Operand 541 states and 816 transitions. [2024-08-15 18:23:36,382 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 112 [2024-08-15 18:23:36,382 INFO L187 NwaCegarLoop]: Found error trace [2024-08-15 18:23:36,382 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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] [2024-08-15 18:23:36,382 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2024-08-15 18:23:36,382 INFO L420 AbstractCegarLoop]: === Iteration 13 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-08-15 18:23:36,383 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-08-15 18:23:36,383 INFO L85 PathProgramCache]: Analyzing trace with hash 1059740918, now seen corresponding path program 1 times [2024-08-15 18:23:36,383 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-08-15 18:23:36,383 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1606416697] [2024-08-15 18:23:36,383 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-08-15 18:23:36,384 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-08-15 18:23:36,511 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-08-15 18:23:37,654 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2024-08-15 18:23:37,655 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-08-15 18:23:37,656 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2024-08-15 18:23:37,658 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-08-15 18:23:37,661 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 58 [2024-08-15 18:23:37,662 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-08-15 18:23:37,665 INFO L134 CoverageAnalysis]: Checked inductivity of 59 backedges. 34 proven. 7 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2024-08-15 18:23:37,666 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-08-15 18:23:37,666 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1606416697] [2024-08-15 18:23:37,666 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1606416697] provided 0 perfect and 1 imperfect interpolant sequences [2024-08-15 18:23:37,666 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1923425369] [2024-08-15 18:23:37,666 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-08-15 18:23:37,666 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-08-15 18:23:37,667 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-08-15 18:23:37,668 INFO L229 MonitoredProcess]: Starting monitored process 10 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-08-15 18:23:37,670 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Waiting until timeout for monitored process [2024-08-15 18:23:37,967 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-08-15 18:23:37,970 INFO L262 TraceCheckSpWp]: Trace formula consists of 633 conjuncts, 25 conjunts are in the unsatisfiable core [2024-08-15 18:23:37,973 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2024-08-15 18:23:38,200 INFO L134 CoverageAnalysis]: Checked inductivity of 59 backedges. 39 proven. 6 refuted. 0 times theorem prover too weak. 14 trivial. 0 not checked. [2024-08-15 18:23:38,200 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2024-08-15 18:23:39,182 INFO L134 CoverageAnalysis]: Checked inductivity of 59 backedges. 38 proven. 7 refuted. 0 times theorem prover too weak. 14 trivial. 0 not checked. [2024-08-15 18:23:39,182 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1923425369] provided 0 perfect and 2 imperfect interpolant sequences [2024-08-15 18:23:39,183 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-08-15 18:23:39,183 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 9, 9] total 26 [2024-08-15 18:23:39,183 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1942279253] [2024-08-15 18:23:39,183 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-08-15 18:23:39,184 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 26 states [2024-08-15 18:23:39,184 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-08-15 18:23:39,185 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 26 interpolants. [2024-08-15 18:23:39,185 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=89, Invalid=561, Unknown=0, NotChecked=0, Total=650 [2024-08-15 18:23:39,185 INFO L87 Difference]: Start difference. First operand 541 states and 816 transitions. Second operand has 26 states, 26 states have (on average 9.0) internal successors, (234), 26 states have internal predecessors, (234), 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:40,023 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-08-15 18:23:40,023 INFO L93 Difference]: Finished difference Result 889 states and 1336 transitions. [2024-08-15 18:23:40,024 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 26 states. [2024-08-15 18:23:40,024 INFO L78 Accepts]: Start accepts. Automaton has has 26 states, 26 states have (on average 9.0) internal successors, (234), 26 states have internal predecessors, (234), 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 111 [2024-08-15 18:23:40,025 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-08-15 18:23:40,032 INFO L225 Difference]: With dead ends: 889 [2024-08-15 18:23:40,032 INFO L226 Difference]: Without dead ends: 889 [2024-08-15 18:23:40,033 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 262 GetRequests, 218 SyntacticMatches, 0 SemanticMatches, 44 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 326 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=263, Invalid=1807, Unknown=0, NotChecked=0, Total=2070 [2024-08-15 18:23:40,034 INFO L413 NwaCegarLoop]: 103 mSDtfsCounter, 393 mSDsluCounter, 1649 mSDsCounter, 0 mSdLazyCounter, 578 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 393 SdHoareTripleChecker+Valid, 1752 SdHoareTripleChecker+Invalid, 581 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 578 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2024-08-15 18:23:40,034 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [393 Valid, 1752 Invalid, 581 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 578 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2024-08-15 18:23:40,039 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 889 states. [2024-08-15 18:23:40,054 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 889 to 799. [2024-08-15 18:23:40,055 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 799 states, 789 states have (on average 1.5183776932826363) internal successors, (1198), 790 states have internal predecessors, (1198), 5 states have call successors, (5), 5 states have call predecessors, (5), 4 states have return successors, (4), 3 states have call predecessors, (4), 4 states have call successors, (4) [2024-08-15 18:23:40,058 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 799 states to 799 states and 1207 transitions. [2024-08-15 18:23:40,059 INFO L78 Accepts]: Start accepts. Automaton has 799 states and 1207 transitions. Word has length 111 [2024-08-15 18:23:40,059 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-08-15 18:23:40,059 INFO L495 AbstractCegarLoop]: Abstraction has 799 states and 1207 transitions. [2024-08-15 18:23:40,059 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 26 states, 26 states have (on average 9.0) internal successors, (234), 26 states have internal predecessors, (234), 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:40,060 INFO L276 IsEmpty]: Start isEmpty. Operand 799 states and 1207 transitions. [2024-08-15 18:23:40,061 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 112 [2024-08-15 18:23:40,062 INFO L187 NwaCegarLoop]: Found error trace [2024-08-15 18:23:40,062 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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] [2024-08-15 18:23:40,083 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Ended with exit code 0 [2024-08-15 18:23:40,262 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 10 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable12 [2024-08-15 18:23:40,263 INFO L420 AbstractCegarLoop]: === Iteration 14 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-08-15 18:23:40,263 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-08-15 18:23:40,264 INFO L85 PathProgramCache]: Analyzing trace with hash 509964314, now seen corresponding path program 1 times [2024-08-15 18:23:40,264 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-08-15 18:23:40,264 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [827144988] [2024-08-15 18:23:40,264 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-08-15 18:23:40,264 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-08-15 18:23:40,366 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-08-15 18:23:41,121 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2024-08-15 18:23:41,122 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-08-15 18:23:41,123 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2024-08-15 18:23:41,125 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-08-15 18:23:41,128 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 58 [2024-08-15 18:23:41,129 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-08-15 18:23:41,131 INFO L134 CoverageAnalysis]: Checked inductivity of 59 backedges. 36 proven. 7 refuted. 0 times theorem prover too weak. 16 trivial. 0 not checked. [2024-08-15 18:23:41,131 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-08-15 18:23:41,131 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [827144988] [2024-08-15 18:23:41,131 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [827144988] provided 0 perfect and 1 imperfect interpolant sequences [2024-08-15 18:23:41,131 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [349960584] [2024-08-15 18:23:41,131 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-08-15 18:23:41,131 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-08-15 18:23:41,132 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-08-15 18:23:41,133 INFO L229 MonitoredProcess]: Starting monitored process 11 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-08-15 18:23:41,134 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Waiting until timeout for monitored process [2024-08-15 18:23:41,461 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-08-15 18:23:41,465 INFO L262 TraceCheckSpWp]: Trace formula consists of 632 conjuncts, 66 conjunts are in the unsatisfiable core [2024-08-15 18:23:41,468 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2024-08-15 18:23:41,762 INFO L134 CoverageAnalysis]: Checked inductivity of 59 backedges. 33 proven. 8 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2024-08-15 18:23:41,763 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2024-08-15 18:23:42,357 INFO L134 CoverageAnalysis]: Checked inductivity of 59 backedges. 29 proven. 12 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2024-08-15 18:23:42,357 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [349960584] provided 0 perfect and 2 imperfect interpolant sequences [2024-08-15 18:23:42,357 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-08-15 18:23:42,357 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 14, 14] total 34 [2024-08-15 18:23:42,358 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [936833035] [2024-08-15 18:23:42,358 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-08-15 18:23:42,358 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 34 states [2024-08-15 18:23:42,358 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-08-15 18:23:42,359 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 34 interpolants. [2024-08-15 18:23:42,359 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=122, Invalid=1000, Unknown=0, NotChecked=0, Total=1122 [2024-08-15 18:23:42,360 INFO L87 Difference]: Start difference. First operand 799 states and 1207 transitions. Second operand has 34 states, 34 states have (on average 6.205882352941177) internal successors, (211), 34 states have internal predecessors, (211), 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:44,464 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-08-15 18:23:44,465 INFO L93 Difference]: Finished difference Result 1584 states and 2372 transitions. [2024-08-15 18:23:44,465 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 50 states. [2024-08-15 18:23:44,465 INFO L78 Accepts]: Start accepts. Automaton has has 34 states, 34 states have (on average 6.205882352941177) internal successors, (211), 34 states have internal predecessors, (211), 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 111 [2024-08-15 18:23:44,465 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-08-15 18:23:44,471 INFO L225 Difference]: With dead ends: 1584 [2024-08-15 18:23:44,471 INFO L226 Difference]: Without dead ends: 1584 [2024-08-15 18:23:44,473 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 286 GetRequests, 206 SyntacticMatches, 0 SemanticMatches, 80 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1552 ImplicationChecksByTransitivity, 2.0s TimeCoverageRelationStatistics Valid=835, Invalid=5807, Unknown=0, NotChecked=0, Total=6642 [2024-08-15 18:23:44,473 INFO L413 NwaCegarLoop]: 97 mSDtfsCounter, 588 mSDsluCounter, 1890 mSDsCounter, 0 mSdLazyCounter, 834 mSolverCounterSat, 26 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 588 SdHoareTripleChecker+Valid, 1987 SdHoareTripleChecker+Invalid, 860 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 26 IncrementalHoareTripleChecker+Valid, 834 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2024-08-15 18:23:44,473 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [588 Valid, 1987 Invalid, 860 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [26 Valid, 834 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2024-08-15 18:23:44,475 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1584 states. [2024-08-15 18:23:44,498 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1584 to 1351. [2024-08-15 18:23:44,500 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1351 states, 1341 states have (on average 1.5078299776286352) internal successors, (2022), 1342 states have internal predecessors, (2022), 5 states have call successors, (5), 5 states have call predecessors, (5), 4 states have return successors, (4), 3 states have call predecessors, (4), 4 states have call successors, (4) [2024-08-15 18:23:44,505 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1351 states to 1351 states and 2031 transitions. [2024-08-15 18:23:44,506 INFO L78 Accepts]: Start accepts. Automaton has 1351 states and 2031 transitions. Word has length 111 [2024-08-15 18:23:44,506 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-08-15 18:23:44,506 INFO L495 AbstractCegarLoop]: Abstraction has 1351 states and 2031 transitions. [2024-08-15 18:23:44,506 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 34 states, 34 states have (on average 6.205882352941177) internal successors, (211), 34 states have internal predecessors, (211), 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:44,507 INFO L276 IsEmpty]: Start isEmpty. Operand 1351 states and 2031 transitions. [2024-08-15 18:23:44,509 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 112 [2024-08-15 18:23:44,510 INFO L187 NwaCegarLoop]: Found error trace [2024-08-15 18:23:44,510 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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] [2024-08-15 18:23:44,527 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Forceful destruction successful, exit code 0 [2024-08-15 18:23:44,710 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 11 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable13 [2024-08-15 18:23:44,711 INFO L420 AbstractCegarLoop]: === Iteration 15 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-08-15 18:23:44,711 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-08-15 18:23:44,711 INFO L85 PathProgramCache]: Analyzing trace with hash -1762132675, now seen corresponding path program 1 times [2024-08-15 18:23:44,711 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-08-15 18:23:44,712 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1946872606] [2024-08-15 18:23:44,712 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-08-15 18:23:44,712 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-08-15 18:23:44,832 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-08-15 18:23:45,549 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2024-08-15 18:23:45,550 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-08-15 18:23:45,551 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2024-08-15 18:23:45,552 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-08-15 18:23:45,553 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 58 [2024-08-15 18:23:45,554 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-08-15 18:23:45,555 INFO L134 CoverageAnalysis]: Checked inductivity of 59 backedges. 41 proven. 0 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2024-08-15 18:23:45,555 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-08-15 18:23:45,555 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1946872606] [2024-08-15 18:23:45,556 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1946872606] provided 1 perfect and 0 imperfect interpolant sequences [2024-08-15 18:23:45,556 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-08-15 18:23:45,556 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2024-08-15 18:23:45,556 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1363882500] [2024-08-15 18:23:45,556 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-08-15 18:23:45,558 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2024-08-15 18:23:45,558 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-08-15 18:23:45,559 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2024-08-15 18:23:45,560 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=85, Unknown=0, NotChecked=0, Total=110 [2024-08-15 18:23:45,560 INFO L87 Difference]: Start difference. First operand 1351 states and 2031 transitions. Second operand has 11 states, 11 states have (on average 8.0) internal successors, (88), 11 states have internal predecessors, (88), 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:45,657 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-08-15 18:23:45,658 INFO L93 Difference]: Finished difference Result 1459 states and 2181 transitions. [2024-08-15 18:23:45,658 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2024-08-15 18:23:45,658 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 11 states have (on average 8.0) internal successors, (88), 11 states have internal predecessors, (88), 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 111 [2024-08-15 18:23:45,659 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-08-15 18:23:45,663 INFO L225 Difference]: With dead ends: 1459 [2024-08-15 18:23:45,664 INFO L226 Difference]: Without dead ends: 1459 [2024-08-15 18:23:45,664 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 8 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 17 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=31, Invalid=101, Unknown=0, NotChecked=0, Total=132 [2024-08-15 18:23:45,665 INFO L413 NwaCegarLoop]: 110 mSDtfsCounter, 21 mSDsluCounter, 750 mSDsCounter, 0 mSdLazyCounter, 122 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 21 SdHoareTripleChecker+Valid, 860 SdHoareTripleChecker+Invalid, 123 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 122 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-08-15 18:23:45,665 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [21 Valid, 860 Invalid, 123 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 122 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-08-15 18:23:45,666 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1459 states. [2024-08-15 18:23:45,688 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1459 to 1426. [2024-08-15 18:23:45,690 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1426 states, 1416 states have (on average 1.5042372881355932) internal successors, (2130), 1417 states have internal predecessors, (2130), 5 states have call successors, (5), 5 states have call predecessors, (5), 4 states have return successors, (4), 3 states have call predecessors, (4), 4 states have call successors, (4) [2024-08-15 18:23:45,696 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1426 states to 1426 states and 2139 transitions. [2024-08-15 18:23:45,696 INFO L78 Accepts]: Start accepts. Automaton has 1426 states and 2139 transitions. Word has length 111 [2024-08-15 18:23:45,696 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-08-15 18:23:45,696 INFO L495 AbstractCegarLoop]: Abstraction has 1426 states and 2139 transitions. [2024-08-15 18:23:45,697 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 8.0) internal successors, (88), 11 states have internal predecessors, (88), 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:45,697 INFO L276 IsEmpty]: Start isEmpty. Operand 1426 states and 2139 transitions. [2024-08-15 18:23:45,700 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 112 [2024-08-15 18:23:45,700 INFO L187 NwaCegarLoop]: Found error trace [2024-08-15 18:23:45,701 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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] [2024-08-15 18:23:45,701 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2024-08-15 18:23:45,702 INFO L420 AbstractCegarLoop]: === Iteration 16 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-08-15 18:23:45,702 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-08-15 18:23:45,702 INFO L85 PathProgramCache]: Analyzing trace with hash 891014560, now seen corresponding path program 1 times [2024-08-15 18:23:45,702 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-08-15 18:23:45,702 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1840352490] [2024-08-15 18:23:45,703 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-08-15 18:23:45,703 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-08-15 18:23:45,799 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-08-15 18:23:46,815 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2024-08-15 18:23:46,816 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-08-15 18:23:46,817 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2024-08-15 18:23:46,818 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-08-15 18:23:46,819 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 58 [2024-08-15 18:23:46,820 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-08-15 18:23:46,822 INFO L134 CoverageAnalysis]: Checked inductivity of 59 backedges. 40 proven. 5 refuted. 0 times theorem prover too weak. 14 trivial. 0 not checked. [2024-08-15 18:23:46,822 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-08-15 18:23:46,822 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1840352490] [2024-08-15 18:23:46,822 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1840352490] provided 0 perfect and 1 imperfect interpolant sequences [2024-08-15 18:23:46,822 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [402476274] [2024-08-15 18:23:46,823 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-08-15 18:23:46,823 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-08-15 18:23:46,823 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-08-15 18:23:46,825 INFO L229 MonitoredProcess]: Starting monitored process 12 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-08-15 18:23:46,837 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Waiting until timeout for monitored process [2024-08-15 18:23:47,135 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-08-15 18:23:47,139 INFO L262 TraceCheckSpWp]: Trace formula consists of 632 conjuncts, 59 conjunts are in the unsatisfiable core [2024-08-15 18:23:47,143 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2024-08-15 18:23:47,536 INFO L134 CoverageAnalysis]: Checked inductivity of 59 backedges. 33 proven. 22 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2024-08-15 18:23:47,537 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2024-08-15 18:23:49,988 INFO L134 CoverageAnalysis]: Checked inductivity of 59 backedges. 33 proven. 5 refuted. 0 times theorem prover too weak. 21 trivial. 0 not checked. [2024-08-15 18:23:49,989 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [402476274] provided 0 perfect and 2 imperfect interpolant sequences [2024-08-15 18:23:49,989 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-08-15 18:23:49,989 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 14, 13] total 34 [2024-08-15 18:23:49,990 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1150735394] [2024-08-15 18:23:49,990 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-08-15 18:23:49,990 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 34 states [2024-08-15 18:23:49,990 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-08-15 18:23:49,991 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 34 interpolants. [2024-08-15 18:23:49,992 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=154, Invalid=968, Unknown=0, NotChecked=0, Total=1122 [2024-08-15 18:23:49,992 INFO L87 Difference]: Start difference. First operand 1426 states and 2139 transitions. Second operand has 34 states, 34 states have (on average 6.382352941176471) internal successors, (217), 34 states have internal predecessors, (217), 6 states have call successors, (7), 2 states have call predecessors, (7), 1 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) [2024-08-15 18:23:51,754 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-08-15 18:23:51,755 INFO L93 Difference]: Finished difference Result 1750 states and 2458 transitions. [2024-08-15 18:23:51,755 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 52 states. [2024-08-15 18:23:51,756 INFO L78 Accepts]: Start accepts. Automaton has has 34 states, 34 states have (on average 6.382352941176471) internal successors, (217), 34 states have internal predecessors, (217), 6 states have call successors, (7), 2 states have call predecessors, (7), 1 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) Word has length 111 [2024-08-15 18:23:51,756 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-08-15 18:23:51,762 INFO L225 Difference]: With dead ends: 1750 [2024-08-15 18:23:51,762 INFO L226 Difference]: Without dead ends: 1750 [2024-08-15 18:23:51,765 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 292 GetRequests, 210 SyntacticMatches, 0 SemanticMatches, 82 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1662 ImplicationChecksByTransitivity, 2.1s TimeCoverageRelationStatistics Valid=1015, Invalid=5957, Unknown=0, NotChecked=0, Total=6972 [2024-08-15 18:23:51,765 INFO L413 NwaCegarLoop]: 95 mSDtfsCounter, 933 mSDsluCounter, 1323 mSDsCounter, 0 mSdLazyCounter, 493 mSolverCounterSat, 50 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 933 SdHoareTripleChecker+Valid, 1418 SdHoareTripleChecker+Invalid, 543 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 50 IncrementalHoareTripleChecker+Valid, 493 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2024-08-15 18:23:51,766 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [933 Valid, 1418 Invalid, 543 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [50 Valid, 493 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2024-08-15 18:23:51,767 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1750 states. [2024-08-15 18:23:51,791 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1750 to 1614. [2024-08-15 18:23:51,795 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1614 states, 1604 states have (on average 1.4183291770573565) internal successors, (2275), 1605 states have internal predecessors, (2275), 5 states have call successors, (5), 5 states have call predecessors, (5), 4 states have return successors, (4), 3 states have call predecessors, (4), 4 states have call successors, (4) [2024-08-15 18:23:51,801 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1614 states to 1614 states and 2284 transitions. [2024-08-15 18:23:51,802 INFO L78 Accepts]: Start accepts. Automaton has 1614 states and 2284 transitions. Word has length 111 [2024-08-15 18:23:51,802 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-08-15 18:23:51,802 INFO L495 AbstractCegarLoop]: Abstraction has 1614 states and 2284 transitions. [2024-08-15 18:23:51,802 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 34 states, 34 states have (on average 6.382352941176471) internal successors, (217), 34 states have internal predecessors, (217), 6 states have call successors, (7), 2 states have call predecessors, (7), 1 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) [2024-08-15 18:23:51,803 INFO L276 IsEmpty]: Start isEmpty. Operand 1614 states and 2284 transitions. [2024-08-15 18:23:51,806 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 113 [2024-08-15 18:23:51,806 INFO L187 NwaCegarLoop]: Found error trace [2024-08-15 18:23:51,806 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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] [2024-08-15 18:23:51,830 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Ended with exit code 0 [2024-08-15 18:23:52,007 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 12 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable15 [2024-08-15 18:23:52,007 INFO L420 AbstractCegarLoop]: === Iteration 17 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-08-15 18:23:52,007 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-08-15 18:23:52,008 INFO L85 PathProgramCache]: Analyzing trace with hash -348493096, now seen corresponding path program 1 times [2024-08-15 18:23:52,008 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-08-15 18:23:52,008 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1233485605] [2024-08-15 18:23:52,008 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-08-15 18:23:52,008 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-08-15 18:23:52,049 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-08-15 18:23:52,957 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2024-08-15 18:23:52,958 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-08-15 18:23:52,959 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2024-08-15 18:23:52,960 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-08-15 18:23:52,961 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 58 [2024-08-15 18:23:52,961 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-08-15 18:23:52,962 INFO L134 CoverageAnalysis]: Checked inductivity of 59 backedges. 45 proven. 0 refuted. 0 times theorem prover too weak. 14 trivial. 0 not checked. [2024-08-15 18:23:52,962 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-08-15 18:23:52,962 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1233485605] [2024-08-15 18:23:52,963 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1233485605] provided 1 perfect and 0 imperfect interpolant sequences [2024-08-15 18:23:52,963 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-08-15 18:23:52,963 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [17] imperfect sequences [] total 17 [2024-08-15 18:23:52,963 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [970819897] [2024-08-15 18:23:52,963 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-08-15 18:23:52,964 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 17 states [2024-08-15 18:23:52,964 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-08-15 18:23:52,965 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2024-08-15 18:23:52,965 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=49, Invalid=223, Unknown=0, NotChecked=0, Total=272 [2024-08-15 18:23:52,965 INFO L87 Difference]: Start difference. First operand 1614 states and 2284 transitions. Second operand has 17 states, 17 states have (on average 5.470588235294118) internal successors, (93), 17 states have internal predecessors, (93), 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:53,390 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-08-15 18:23:53,390 INFO L93 Difference]: Finished difference Result 1879 states and 2634 transitions. [2024-08-15 18:23:53,391 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2024-08-15 18:23:53,391 INFO L78 Accepts]: Start accepts. Automaton has has 17 states, 17 states have (on average 5.470588235294118) internal successors, (93), 17 states have internal predecessors, (93), 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 112 [2024-08-15 18:23:53,391 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-08-15 18:23:53,397 INFO L225 Difference]: With dead ends: 1879 [2024-08-15 18:23:53,397 INFO L226 Difference]: Without dead ends: 1826 [2024-08-15 18:23:53,398 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 37 GetRequests, 15 SyntacticMatches, 0 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 110 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=88, Invalid=464, Unknown=0, NotChecked=0, Total=552 [2024-08-15 18:23:53,398 INFO L413 NwaCegarLoop]: 102 mSDtfsCounter, 200 mSDsluCounter, 1106 mSDsCounter, 0 mSdLazyCounter, 579 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 201 SdHoareTripleChecker+Valid, 1208 SdHoareTripleChecker+Invalid, 581 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 579 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2024-08-15 18:23:53,398 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [201 Valid, 1208 Invalid, 581 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 579 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2024-08-15 18:23:53,400 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1826 states. [2024-08-15 18:23:53,429 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1826 to 1720. [2024-08-15 18:23:53,433 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1720 states, 1710 states have (on average 1.4140350877192982) internal successors, (2418), 1711 states have internal predecessors, (2418), 5 states have call successors, (5), 5 states have call predecessors, (5), 4 states have return successors, (4), 3 states have call predecessors, (4), 4 states have call successors, (4) [2024-08-15 18:23:53,441 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1720 states to 1720 states and 2427 transitions. [2024-08-15 18:23:53,441 INFO L78 Accepts]: Start accepts. Automaton has 1720 states and 2427 transitions. Word has length 112 [2024-08-15 18:23:53,442 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-08-15 18:23:53,442 INFO L495 AbstractCegarLoop]: Abstraction has 1720 states and 2427 transitions. [2024-08-15 18:23:53,442 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 17 states, 17 states have (on average 5.470588235294118) internal successors, (93), 17 states have internal predecessors, (93), 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:53,442 INFO L276 IsEmpty]: Start isEmpty. Operand 1720 states and 2427 transitions. [2024-08-15 18:23:53,446 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 113 [2024-08-15 18:23:53,446 INFO L187 NwaCegarLoop]: Found error trace [2024-08-15 18:23:53,446 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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] [2024-08-15 18:23:53,446 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2024-08-15 18:23:53,446 INFO L420 AbstractCegarLoop]: === Iteration 18 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-08-15 18:23:53,447 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-08-15 18:23:53,447 INFO L85 PathProgramCache]: Analyzing trace with hash -309391595, now seen corresponding path program 1 times [2024-08-15 18:23:53,447 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-08-15 18:23:53,447 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1124603882] [2024-08-15 18:23:53,447 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-08-15 18:23:53,447 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-08-15 18:23:53,511 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-08-15 18:23:54,487 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2024-08-15 18:23:54,489 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-08-15 18:23:54,490 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2024-08-15 18:23:54,490 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-08-15 18:23:54,492 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 58 [2024-08-15 18:23:54,492 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-08-15 18:23:54,494 INFO L134 CoverageAnalysis]: Checked inductivity of 59 backedges. 44 proven. 1 refuted. 0 times theorem prover too weak. 14 trivial. 0 not checked. [2024-08-15 18:23:54,494 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-08-15 18:23:54,494 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1124603882] [2024-08-15 18:23:54,494 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1124603882] provided 0 perfect and 1 imperfect interpolant sequences [2024-08-15 18:23:54,494 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1420828708] [2024-08-15 18:23:54,494 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-08-15 18:23:54,494 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-08-15 18:23:54,495 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-08-15 18:23:54,497 INFO L229 MonitoredProcess]: Starting monitored process 13 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-08-15 18:23:54,500 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (13)] Waiting until timeout for monitored process [2024-08-15 18:23:54,809 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-08-15 18:23:54,813 INFO L262 TraceCheckSpWp]: Trace formula consists of 637 conjuncts, 109 conjunts are in the unsatisfiable core [2024-08-15 18:23:54,818 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2024-08-15 18:23:56,064 INFO L134 CoverageAnalysis]: Checked inductivity of 59 backedges. 39 proven. 8 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2024-08-15 18:23:56,064 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2024-08-15 18:24:02,352 INFO L134 CoverageAnalysis]: Checked inductivity of 59 backedges. 33 proven. 14 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2024-08-15 18:24:02,353 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1420828708] provided 0 perfect and 2 imperfect interpolant sequences [2024-08-15 18:24:02,353 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-08-15 18:24:02,353 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [16, 25, 31] total 68 [2024-08-15 18:24:02,353 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1187256960] [2024-08-15 18:24:02,353 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-08-15 18:24:02,354 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 68 states [2024-08-15 18:24:02,354 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-08-15 18:24:02,355 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 68 interpolants. [2024-08-15 18:24:02,356 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=392, Invalid=4164, Unknown=0, NotChecked=0, Total=4556 [2024-08-15 18:24:02,356 INFO L87 Difference]: Start difference. First operand 1720 states and 2427 transitions. Second operand has 68 states, 68 states have (on average 3.7794117647058822) internal successors, (257), 68 states have internal predecessors, (257), 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:24:06,935 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-08-15 18:24:06,935 INFO L93 Difference]: Finished difference Result 2003 states and 2803 transitions. [2024-08-15 18:24:06,935 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 48 states. [2024-08-15 18:24:06,936 INFO L78 Accepts]: Start accepts. Automaton has has 68 states, 68 states have (on average 3.7794117647058822) internal successors, (257), 68 states have internal predecessors, (257), 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 112 [2024-08-15 18:24:06,936 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-08-15 18:24:06,941 INFO L225 Difference]: With dead ends: 2003 [2024-08-15 18:24:06,941 INFO L226 Difference]: Without dead ends: 2002 [2024-08-15 18:24:06,945 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 277 GetRequests, 181 SyntacticMatches, 0 SemanticMatches, 96 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2275 ImplicationChecksByTransitivity, 5.6s TimeCoverageRelationStatistics Valid=816, Invalid=8690, Unknown=0, NotChecked=0, Total=9506 [2024-08-15 18:24:06,945 INFO L413 NwaCegarLoop]: 82 mSDtfsCounter, 1041 mSDsluCounter, 2837 mSDsCounter, 0 mSdLazyCounter, 3186 mSolverCounterSat, 9 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1041 SdHoareTripleChecker+Valid, 2919 SdHoareTripleChecker+Invalid, 3195 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 9 IncrementalHoareTripleChecker+Valid, 3186 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 3.0s IncrementalHoareTripleChecker+Time [2024-08-15 18:24:06,946 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [1041 Valid, 2919 Invalid, 3195 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [9 Valid, 3186 Invalid, 0 Unknown, 0 Unchecked, 3.0s Time] [2024-08-15 18:24:06,948 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2002 states. [2024-08-15 18:24:06,977 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2002 to 1793. [2024-08-15 18:24:06,979 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1793 states, 1783 states have (on average 1.4127874369040943) internal successors, (2519), 1784 states have internal predecessors, (2519), 5 states have call successors, (5), 5 states have call predecessors, (5), 4 states have return successors, (4), 3 states have call predecessors, (4), 4 states have call successors, (4) [2024-08-15 18:24:06,984 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1793 states to 1793 states and 2528 transitions. [2024-08-15 18:24:06,985 INFO L78 Accepts]: Start accepts. Automaton has 1793 states and 2528 transitions. Word has length 112 [2024-08-15 18:24:06,985 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-08-15 18:24:06,985 INFO L495 AbstractCegarLoop]: Abstraction has 1793 states and 2528 transitions. [2024-08-15 18:24:06,985 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 68 states, 68 states have (on average 3.7794117647058822) internal successors, (257), 68 states have internal predecessors, (257), 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:24:06,986 INFO L276 IsEmpty]: Start isEmpty. Operand 1793 states and 2528 transitions. [2024-08-15 18:24:06,990 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 113 [2024-08-15 18:24:06,991 INFO L187 NwaCegarLoop]: Found error trace [2024-08-15 18:24:06,991 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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] [2024-08-15 18:24:07,014 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (13)] Ended with exit code 0 [2024-08-15 18:24:07,191 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 13 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable17 [2024-08-15 18:24:07,191 INFO L420 AbstractCegarLoop]: === Iteration 19 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-08-15 18:24:07,192 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-08-15 18:24:07,192 INFO L85 PathProgramCache]: Analyzing trace with hash 935372886, now seen corresponding path program 1 times [2024-08-15 18:24:07,192 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-08-15 18:24:07,192 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [141344691] [2024-08-15 18:24:07,192 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-08-15 18:24:07,192 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-08-15 18:24:07,270 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-08-15 18:24:08,219 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2024-08-15 18:24:08,220 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-08-15 18:24:08,222 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2024-08-15 18:24:08,222 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-08-15 18:24:08,223 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 58 [2024-08-15 18:24:08,224 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-08-15 18:24:08,225 INFO L134 CoverageAnalysis]: Checked inductivity of 59 backedges. 46 proven. 0 refuted. 0 times theorem prover too weak. 13 trivial. 0 not checked. [2024-08-15 18:24:08,225 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-08-15 18:24:08,225 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [141344691] [2024-08-15 18:24:08,225 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [141344691] provided 1 perfect and 0 imperfect interpolant sequences [2024-08-15 18:24:08,225 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-08-15 18:24:08,226 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-08-15 18:24:08,226 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [529230977] [2024-08-15 18:24:08,226 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-08-15 18:24:08,226 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-08-15 18:24:08,226 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-08-15 18:24:08,227 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-08-15 18:24:08,227 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2024-08-15 18:24:08,227 INFO L87 Difference]: Start difference. First operand 1793 states and 2528 transitions. Second operand has 7 states, 7 states have (on average 13.428571428571429) internal successors, (94), 7 states have internal predecessors, (94), 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:24:08,755 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-08-15 18:24:08,755 INFO L93 Difference]: Finished difference Result 1599 states and 2250 transitions. [2024-08-15 18:24:08,755 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-08-15 18:24:08,756 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 13.428571428571429) internal successors, (94), 7 states have internal predecessors, (94), 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 112 [2024-08-15 18:24:08,756 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-08-15 18:24:08,760 INFO L225 Difference]: With dead ends: 1599 [2024-08-15 18:24:08,760 INFO L226 Difference]: Without dead ends: 1587 [2024-08-15 18:24:08,760 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 9 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2024-08-15 18:24:08,761 INFO L413 NwaCegarLoop]: 91 mSDtfsCounter, 64 mSDsluCounter, 260 mSDsCounter, 0 mSdLazyCounter, 159 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 64 SdHoareTripleChecker+Valid, 351 SdHoareTripleChecker+Invalid, 159 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 159 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2024-08-15 18:24:08,761 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [64 Valid, 351 Invalid, 159 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 159 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2024-08-15 18:24:08,763 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1587 states. [2024-08-15 18:24:08,780 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1587 to 1587. [2024-08-15 18:24:08,782 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1587 states, 1577 states have (on average 1.4121750158528852) internal successors, (2227), 1578 states have internal predecessors, (2227), 5 states have call successors, (5), 5 states have call predecessors, (5), 4 states have return successors, (4), 3 states have call predecessors, (4), 4 states have call successors, (4) [2024-08-15 18:24:08,791 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1587 states to 1587 states and 2236 transitions. [2024-08-15 18:24:08,794 INFO L78 Accepts]: Start accepts. Automaton has 1587 states and 2236 transitions. Word has length 112 [2024-08-15 18:24:08,794 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-08-15 18:24:08,794 INFO L495 AbstractCegarLoop]: Abstraction has 1587 states and 2236 transitions. [2024-08-15 18:24:08,795 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 13.428571428571429) internal successors, (94), 7 states have internal predecessors, (94), 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:24:08,795 INFO L276 IsEmpty]: Start isEmpty. Operand 1587 states and 2236 transitions. [2024-08-15 18:24:08,798 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 113 [2024-08-15 18:24:08,798 INFO L187 NwaCegarLoop]: Found error trace [2024-08-15 18:24:08,798 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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] [2024-08-15 18:24:08,799 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2024-08-15 18:24:08,799 INFO L420 AbstractCegarLoop]: === Iteration 20 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-08-15 18:24:08,799 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-08-15 18:24:08,799 INFO L85 PathProgramCache]: Analyzing trace with hash 7689821, now seen corresponding path program 1 times [2024-08-15 18:24:08,799 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-08-15 18:24:08,800 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [611680697] [2024-08-15 18:24:08,800 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-08-15 18:24:08,800 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-08-15 18:24:08,846 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-08-15 18:24:09,391 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2024-08-15 18:24:09,392 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-08-15 18:24:09,393 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2024-08-15 18:24:09,394 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-08-15 18:24:09,395 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 58 [2024-08-15 18:24:09,395 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-08-15 18:24:09,396 INFO L134 CoverageAnalysis]: Checked inductivity of 59 backedges. 45 proven. 0 refuted. 0 times theorem prover too weak. 14 trivial. 0 not checked. [2024-08-15 18:24:09,396 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-08-15 18:24:09,396 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [611680697] [2024-08-15 18:24:09,397 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [611680697] provided 1 perfect and 0 imperfect interpolant sequences [2024-08-15 18:24:09,397 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-08-15 18:24:09,397 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2024-08-15 18:24:09,397 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [652935172] [2024-08-15 18:24:09,397 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-08-15 18:24:09,398 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-08-15 18:24:09,398 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-08-15 18:24:09,399 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-08-15 18:24:09,399 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=65, Unknown=0, NotChecked=0, Total=90 [2024-08-15 18:24:09,399 INFO L87 Difference]: Start difference. First operand 1587 states and 2236 transitions. Second operand has 10 states, 10 states have (on average 9.3) internal successors, (93), 10 states have internal predecessors, (93), 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:24:09,574 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-08-15 18:24:09,575 INFO L93 Difference]: Finished difference Result 2336 states and 3260 transitions. [2024-08-15 18:24:09,575 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-08-15 18:24:09,575 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 9.3) internal successors, (93), 10 states have internal predecessors, (93), 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 112 [2024-08-15 18:24:09,575 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-08-15 18:24:09,582 INFO L225 Difference]: With dead ends: 2336 [2024-08-15 18:24:09,582 INFO L226 Difference]: Without dead ends: 2336 [2024-08-15 18:24:09,583 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 22 GetRequests, 12 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 17 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=33, Invalid=99, Unknown=0, NotChecked=0, Total=132 [2024-08-15 18:24:09,583 INFO L413 NwaCegarLoop]: 119 mSDtfsCounter, 132 mSDsluCounter, 495 mSDsCounter, 0 mSdLazyCounter, 246 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 133 SdHoareTripleChecker+Valid, 614 SdHoareTripleChecker+Invalid, 248 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 246 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-08-15 18:24:09,585 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [133 Valid, 614 Invalid, 248 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 246 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-08-15 18:24:09,587 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2336 states. [2024-08-15 18:24:09,625 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2336 to 2193. [2024-08-15 18:24:09,628 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2193 states, 2183 states have (on average 1.3994502977553824) internal successors, (3055), 2184 states have internal predecessors, (3055), 5 states have call successors, (5), 5 states have call predecessors, (5), 4 states have return successors, (4), 3 states have call predecessors, (4), 4 states have call successors, (4) [2024-08-15 18:24:09,635 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2193 states to 2193 states and 3064 transitions. [2024-08-15 18:24:09,635 INFO L78 Accepts]: Start accepts. Automaton has 2193 states and 3064 transitions. Word has length 112 [2024-08-15 18:24:09,635 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-08-15 18:24:09,635 INFO L495 AbstractCegarLoop]: Abstraction has 2193 states and 3064 transitions. [2024-08-15 18:24:09,636 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 9.3) internal successors, (93), 10 states have internal predecessors, (93), 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:24:09,636 INFO L276 IsEmpty]: Start isEmpty. Operand 2193 states and 3064 transitions. [2024-08-15 18:24:09,640 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 113 [2024-08-15 18:24:09,640 INFO L187 NwaCegarLoop]: Found error trace [2024-08-15 18:24:09,641 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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] [2024-08-15 18:24:09,641 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19 [2024-08-15 18:24:09,641 INFO L420 AbstractCegarLoop]: === Iteration 21 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-08-15 18:24:09,642 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-08-15 18:24:09,642 INFO L85 PathProgramCache]: Analyzing trace with hash 46791322, now seen corresponding path program 1 times [2024-08-15 18:24:09,642 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-08-15 18:24:09,642 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1519853573] [2024-08-15 18:24:09,642 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-08-15 18:24:09,642 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-08-15 18:24:09,713 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-08-15 18:24:10,751 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2024-08-15 18:24:10,751 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-08-15 18:24:10,753 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2024-08-15 18:24:10,753 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-08-15 18:24:10,755 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 58 [2024-08-15 18:24:10,755 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-08-15 18:24:10,757 INFO L134 CoverageAnalysis]: Checked inductivity of 59 backedges. 39 proven. 8 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2024-08-15 18:24:10,757 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-08-15 18:24:10,757 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1519853573] [2024-08-15 18:24:10,758 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1519853573] provided 0 perfect and 1 imperfect interpolant sequences [2024-08-15 18:24:10,758 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [534101598] [2024-08-15 18:24:10,758 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-08-15 18:24:10,758 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-08-15 18:24:10,758 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-08-15 18:24:10,760 INFO L229 MonitoredProcess]: Starting monitored process 14 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:24:10,761 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (14)] Waiting until timeout for monitored process [2024-08-15 18:24:11,084 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-08-15 18:24:11,089 INFO L262 TraceCheckSpWp]: Trace formula consists of 636 conjuncts, 148 conjunts are in the unsatisfiable core [2024-08-15 18:24:11,095 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2024-08-15 18:24:12,237 INFO L134 CoverageAnalysis]: Checked inductivity of 59 backedges. 25 proven. 30 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2024-08-15 18:24:12,237 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2024-08-15 18:24:26,803 INFO L134 CoverageAnalysis]: Checked inductivity of 59 backedges. 45 proven. 0 refuted. 0 times theorem prover too weak. 14 trivial. 0 not checked. [2024-08-15 18:24:26,804 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [534101598] provided 1 perfect and 1 imperfect interpolant sequences [2024-08-15 18:24:26,804 INFO L185 FreeRefinementEngine]: Found 1 perfect and 2 imperfect interpolant sequences. [2024-08-15 18:24:26,804 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [19, 30] total 58 [2024-08-15 18:24:26,804 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1999946054] [2024-08-15 18:24:26,804 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-08-15 18:24:26,804 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2024-08-15 18:24:26,804 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-08-15 18:24:26,805 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2024-08-15 18:24:26,805 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=264, Invalid=3041, Unknown=1, NotChecked=0, Total=3306 [2024-08-15 18:24:26,805 INFO L87 Difference]: Start difference. First operand 2193 states and 3064 transitions. Second operand has 13 states, 13 states have (on average 7.153846153846154) internal successors, (93), 13 states have internal predecessors, (93), 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:24:30,101 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-08-15 18:24:30,102 INFO L93 Difference]: Finished difference Result 3587 states and 5048 transitions. [2024-08-15 18:24:30,102 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2024-08-15 18:24:30,102 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 13 states have (on average 7.153846153846154) internal successors, (93), 13 states have internal predecessors, (93), 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 112 [2024-08-15 18:24:30,103 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-08-15 18:24:30,110 INFO L225 Difference]: With dead ends: 3587 [2024-08-15 18:24:30,110 INFO L226 Difference]: Without dead ends: 2306 [2024-08-15 18:24:30,111 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 263 GetRequests, 198 SyntacticMatches, 0 SemanticMatches, 65 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1387 ImplicationChecksByTransitivity, 15.9s TimeCoverageRelationStatistics Valid=329, Invalid=4092, Unknown=1, NotChecked=0, Total=4422 [2024-08-15 18:24:30,112 INFO L413 NwaCegarLoop]: 184 mSDtfsCounter, 502 mSDsluCounter, 765 mSDsCounter, 0 mSdLazyCounter, 575 mSolverCounterSat, 8 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 504 SdHoareTripleChecker+Valid, 949 SdHoareTripleChecker+Invalid, 583 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 8 IncrementalHoareTripleChecker+Valid, 575 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.0s IncrementalHoareTripleChecker+Time [2024-08-15 18:24:30,112 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [504 Valid, 949 Invalid, 583 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [8 Valid, 575 Invalid, 0 Unknown, 0 Unchecked, 2.0s Time] [2024-08-15 18:24:30,114 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2306 states. [2024-08-15 18:24:30,151 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2306 to 2167. [2024-08-15 18:24:30,155 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2167 states, 2157 states have (on average 1.3977746870653687) internal successors, (3015), 2158 states have internal predecessors, (3015), 5 states have call successors, (5), 5 states have call predecessors, (5), 4 states have return successors, (4), 3 states have call predecessors, (4), 4 states have call successors, (4) [2024-08-15 18:24:30,160 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2167 states to 2167 states and 3024 transitions. [2024-08-15 18:24:30,160 INFO L78 Accepts]: Start accepts. Automaton has 2167 states and 3024 transitions. Word has length 112 [2024-08-15 18:24:30,161 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-08-15 18:24:30,161 INFO L495 AbstractCegarLoop]: Abstraction has 2167 states and 3024 transitions. [2024-08-15 18:24:30,161 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 13 states have (on average 7.153846153846154) internal successors, (93), 13 states have internal predecessors, (93), 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:24:30,161 INFO L276 IsEmpty]: Start isEmpty. Operand 2167 states and 3024 transitions. [2024-08-15 18:24:30,166 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 113 [2024-08-15 18:24:30,166 INFO L187 NwaCegarLoop]: Found error trace [2024-08-15 18:24:30,166 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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] [2024-08-15 18:24:30,189 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (14)] Ended with exit code 0 [2024-08-15 18:24:30,367 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 14 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable20 [2024-08-15 18:24:30,367 INFO L420 AbstractCegarLoop]: === Iteration 22 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-08-15 18:24:30,368 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-08-15 18:24:30,368 INFO L85 PathProgramCache]: Analyzing trace with hash 1291555803, now seen corresponding path program 1 times [2024-08-15 18:24:30,368 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-08-15 18:24:30,368 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1748717742] [2024-08-15 18:24:30,369 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-08-15 18:24:30,369 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-08-15 18:24:30,435 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-08-15 18:24:31,076 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2024-08-15 18:24:31,077 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-08-15 18:24:31,078 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2024-08-15 18:24:31,079 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-08-15 18:24:31,079 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 58 [2024-08-15 18:24:31,080 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-08-15 18:24:31,081 INFO L134 CoverageAnalysis]: Checked inductivity of 59 backedges. 45 proven. 0 refuted. 0 times theorem prover too weak. 14 trivial. 0 not checked. [2024-08-15 18:24:31,081 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-08-15 18:24:31,081 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1748717742] [2024-08-15 18:24:31,081 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1748717742] provided 1 perfect and 0 imperfect interpolant sequences [2024-08-15 18:24:31,081 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-08-15 18:24:31,081 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2024-08-15 18:24:31,081 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1627589507] [2024-08-15 18:24:31,081 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-08-15 18:24:31,082 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-08-15 18:24:31,082 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-08-15 18:24:31,082 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-08-15 18:24:31,082 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=49, Unknown=0, NotChecked=0, Total=72 [2024-08-15 18:24:31,082 INFO L87 Difference]: Start difference. First operand 2167 states and 3024 transitions. Second operand has 9 states, 9 states have (on average 10.333333333333334) internal successors, (93), 9 states have internal predecessors, (93), 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:24:31,745 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-08-15 18:24:31,745 INFO L93 Difference]: Finished difference Result 2272 states and 3170 transitions. [2024-08-15 18:24:31,746 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-08-15 18:24:31,746 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 10.333333333333334) internal successors, (93), 9 states have internal predecessors, (93), 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 112 [2024-08-15 18:24:31,746 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-08-15 18:24:31,753 INFO L225 Difference]: With dead ends: 2272 [2024-08-15 18:24:31,753 INFO L226 Difference]: Without dead ends: 2272 [2024-08-15 18:24:31,754 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 11 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=27, Invalid=63, Unknown=0, NotChecked=0, Total=90 [2024-08-15 18:24:31,754 INFO L413 NwaCegarLoop]: 118 mSDtfsCounter, 125 mSDsluCounter, 587 mSDsCounter, 0 mSdLazyCounter, 308 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 126 SdHoareTripleChecker+Valid, 705 SdHoareTripleChecker+Invalid, 309 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 308 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2024-08-15 18:24:31,754 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [126 Valid, 705 Invalid, 309 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 308 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2024-08-15 18:24:31,756 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2272 states. [2024-08-15 18:24:31,783 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2272 to 2133. [2024-08-15 18:24:31,786 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2133 states, 2123 states have (on average 1.3984926990108337) internal successors, (2969), 2124 states have internal predecessors, (2969), 5 states have call successors, (5), 5 states have call predecessors, (5), 4 states have return successors, (4), 3 states have call predecessors, (4), 4 states have call successors, (4) [2024-08-15 18:24:31,791 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2133 states to 2133 states and 2978 transitions. [2024-08-15 18:24:31,792 INFO L78 Accepts]: Start accepts. Automaton has 2133 states and 2978 transitions. Word has length 112 [2024-08-15 18:24:31,792 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-08-15 18:24:31,792 INFO L495 AbstractCegarLoop]: Abstraction has 2133 states and 2978 transitions. [2024-08-15 18:24:31,793 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 10.333333333333334) internal successors, (93), 9 states have internal predecessors, (93), 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:24:31,793 INFO L276 IsEmpty]: Start isEmpty. Operand 2133 states and 2978 transitions. [2024-08-15 18:24:31,797 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 113 [2024-08-15 18:24:31,797 INFO L187 NwaCegarLoop]: Found error trace [2024-08-15 18:24:31,797 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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] [2024-08-15 18:24:31,799 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable21 [2024-08-15 18:24:31,799 INFO L420 AbstractCegarLoop]: === Iteration 23 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-08-15 18:24:31,799 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-08-15 18:24:31,799 INFO L85 PathProgramCache]: Analyzing trace with hash 131763068, now seen corresponding path program 1 times [2024-08-15 18:24:31,800 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-08-15 18:24:31,800 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [77048606] [2024-08-15 18:24:31,800 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-08-15 18:24:31,800 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-08-15 18:24:31,873 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-08-15 18:24:32,503 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2024-08-15 18:24:32,504 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-08-15 18:24:32,506 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2024-08-15 18:24:32,507 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-08-15 18:24:32,508 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 58 [2024-08-15 18:24:32,509 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-08-15 18:24:32,510 INFO L134 CoverageAnalysis]: Checked inductivity of 59 backedges. 43 proven. 2 refuted. 0 times theorem prover too weak. 14 trivial. 0 not checked. [2024-08-15 18:24:32,511 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-08-15 18:24:32,511 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [77048606] [2024-08-15 18:24:32,511 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [77048606] provided 0 perfect and 1 imperfect interpolant sequences [2024-08-15 18:24:32,511 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [212554459] [2024-08-15 18:24:32,511 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-08-15 18:24:32,511 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-08-15 18:24:32,511 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-08-15 18:24:32,513 INFO L229 MonitoredProcess]: Starting monitored process 15 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:24:32,516 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (15)] Waiting until timeout for monitored process [2024-08-15 18:24:32,866 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-08-15 18:24:32,870 INFO L262 TraceCheckSpWp]: Trace formula consists of 637 conjuncts, 46 conjunts are in the unsatisfiable core [2024-08-15 18:24:32,874 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2024-08-15 18:24:33,834 INFO L134 CoverageAnalysis]: Checked inductivity of 59 backedges. 21 proven. 24 refuted. 0 times theorem prover too weak. 14 trivial. 0 not checked. [2024-08-15 18:24:33,834 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2024-08-15 18:24:36,673 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [212554459] provided 0 perfect and 1 imperfect interpolant sequences [2024-08-15 18:24:36,673 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-08-15 18:24:36,673 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 8] total 15 [2024-08-15 18:24:36,674 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1086821663] [2024-08-15 18:24:36,674 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-08-15 18:24:36,674 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 15 states [2024-08-15 18:24:36,674 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-08-15 18:24:36,675 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2024-08-15 18:24:36,675 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=91, Invalid=461, Unknown=0, NotChecked=0, Total=552 [2024-08-15 18:24:36,675 INFO L87 Difference]: Start difference. First operand 2133 states and 2978 transitions. Second operand has 15 states, 15 states have (on average 11.0) internal successors, (165), 15 states have internal predecessors, (165), 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:24:38,069 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-08-15 18:24:38,070 INFO L93 Difference]: Finished difference Result 2554 states and 3561 transitions. [2024-08-15 18:24:38,070 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-08-15 18:24:38,071 INFO L78 Accepts]: Start accepts. Automaton has has 15 states, 15 states have (on average 11.0) internal successors, (165), 15 states have internal predecessors, (165), 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 112 [2024-08-15 18:24:38,071 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-08-15 18:24:38,079 INFO L225 Difference]: With dead ends: 2554 [2024-08-15 18:24:38,079 INFO L226 Difference]: Without dead ends: 2554 [2024-08-15 18:24:38,079 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 183 GetRequests, 156 SyntacticMatches, 0 SemanticMatches, 27 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 170 ImplicationChecksByTransitivity, 1.6s TimeCoverageRelationStatistics Valid=149, Invalid=663, Unknown=0, NotChecked=0, Total=812 [2024-08-15 18:24:38,080 INFO L413 NwaCegarLoop]: 122 mSDtfsCounter, 247 mSDsluCounter, 810 mSDsCounter, 0 mSdLazyCounter, 435 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 247 SdHoareTripleChecker+Valid, 932 SdHoareTripleChecker+Invalid, 436 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 435 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.1s IncrementalHoareTripleChecker+Time [2024-08-15 18:24:38,080 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [247 Valid, 932 Invalid, 436 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 435 Invalid, 0 Unknown, 0 Unchecked, 1.1s Time] [2024-08-15 18:24:38,082 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2554 states. [2024-08-15 18:24:38,111 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2554 to 2517. [2024-08-15 18:24:38,119 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2517 states, 2507 states have (on average 1.4020741922616673) internal successors, (3515), 2508 states have internal predecessors, (3515), 5 states have call successors, (5), 5 states have call predecessors, (5), 4 states have return successors, (4), 3 states have call predecessors, (4), 4 states have call successors, (4) [2024-08-15 18:24:38,128 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2517 states to 2517 states and 3524 transitions. [2024-08-15 18:24:38,128 INFO L78 Accepts]: Start accepts. Automaton has 2517 states and 3524 transitions. Word has length 112 [2024-08-15 18:24:38,128 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-08-15 18:24:38,129 INFO L495 AbstractCegarLoop]: Abstraction has 2517 states and 3524 transitions. [2024-08-15 18:24:38,131 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 15 states, 15 states have (on average 11.0) internal successors, (165), 15 states have internal predecessors, (165), 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:24:38,131 INFO L276 IsEmpty]: Start isEmpty. Operand 2517 states and 3524 transitions. [2024-08-15 18:24:38,137 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 113 [2024-08-15 18:24:38,137 INFO L187 NwaCegarLoop]: Found error trace [2024-08-15 18:24:38,137 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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] [2024-08-15 18:24:38,160 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (15)] Ended with exit code 0 [2024-08-15 18:24:38,338 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable22,15 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-08-15 18:24:38,338 INFO L420 AbstractCegarLoop]: === Iteration 24 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-08-15 18:24:38,338 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-08-15 18:24:38,339 INFO L85 PathProgramCache]: Analyzing trace with hash -865309285, now seen corresponding path program 1 times [2024-08-15 18:24:38,339 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-08-15 18:24:38,339 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1859549752] [2024-08-15 18:24:38,339 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-08-15 18:24:38,339 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-08-15 18:24:38,453 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-08-15 18:24:39,471 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2024-08-15 18:24:39,472 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-08-15 18:24:39,473 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2024-08-15 18:24:39,473 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-08-15 18:24:39,474 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 58 [2024-08-15 18:24:39,475 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-08-15 18:24:39,476 INFO L134 CoverageAnalysis]: Checked inductivity of 59 backedges. 24 proven. 6 refuted. 0 times theorem prover too weak. 29 trivial. 0 not checked. [2024-08-15 18:24:39,477 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-08-15 18:24:39,477 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1859549752] [2024-08-15 18:24:39,477 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1859549752] provided 0 perfect and 1 imperfect interpolant sequences [2024-08-15 18:24:39,477 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1686524535] [2024-08-15 18:24:39,477 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-08-15 18:24:39,477 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-08-15 18:24:39,477 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-08-15 18:24:39,478 INFO L229 MonitoredProcess]: Starting monitored process 16 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:24:39,479 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (16)] Waiting until timeout for monitored process [2024-08-15 18:24:39,852 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-08-15 18:24:39,856 INFO L262 TraceCheckSpWp]: Trace formula consists of 638 conjuncts, 18 conjunts are in the unsatisfiable core [2024-08-15 18:24:39,858 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2024-08-15 18:24:40,356 INFO L134 CoverageAnalysis]: Checked inductivity of 59 backedges. 46 proven. 1 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2024-08-15 18:24:40,356 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2024-08-15 18:24:40,770 INFO L134 CoverageAnalysis]: Checked inductivity of 59 backedges. 46 proven. 0 refuted. 0 times theorem prover too weak. 13 trivial. 0 not checked. [2024-08-15 18:24:40,770 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1686524535] provided 1 perfect and 1 imperfect interpolant sequences [2024-08-15 18:24:40,770 INFO L185 FreeRefinementEngine]: Found 1 perfect and 2 imperfect interpolant sequences. [2024-08-15 18:24:40,770 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [9, 7] total 18 [2024-08-15 18:24:40,771 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [398196990] [2024-08-15 18:24:40,771 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-08-15 18:24:40,771 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-08-15 18:24:40,771 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-08-15 18:24:40,772 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-08-15 18:24:40,772 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=47, Invalid=259, Unknown=0, NotChecked=0, Total=306 [2024-08-15 18:24:40,772 INFO L87 Difference]: Start difference. First operand 2517 states and 3524 transitions. Second operand has 6 states, 6 states have (on average 15.666666666666666) internal successors, (94), 6 states have internal predecessors, (94), 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:24:41,213 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-08-15 18:24:41,214 INFO L93 Difference]: Finished difference Result 2358 states and 3304 transitions. [2024-08-15 18:24:41,214 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-08-15 18:24:41,215 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 15.666666666666666) internal successors, (94), 6 states have internal predecessors, (94), 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 112 [2024-08-15 18:24:41,215 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-08-15 18:24:41,221 INFO L225 Difference]: With dead ends: 2358 [2024-08-15 18:24:41,221 INFO L226 Difference]: Without dead ends: 2350 [2024-08-15 18:24:41,222 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 240 GetRequests, 224 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 36 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=47, Invalid=259, Unknown=0, NotChecked=0, Total=306 [2024-08-15 18:24:41,222 INFO L413 NwaCegarLoop]: 109 mSDtfsCounter, 4 mSDsluCounter, 334 mSDsCounter, 0 mSdLazyCounter, 151 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4 SdHoareTripleChecker+Valid, 443 SdHoareTripleChecker+Invalid, 152 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 151 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2024-08-15 18:24:41,223 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [4 Valid, 443 Invalid, 152 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 151 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2024-08-15 18:24:41,225 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2350 states. [2024-08-15 18:24:41,249 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2350 to 2350. [2024-08-15 18:24:41,252 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2350 states, 2340 states have (on average 1.4047008547008546) internal successors, (3287), 2341 states have internal predecessors, (3287), 5 states have call successors, (5), 5 states have call predecessors, (5), 4 states have return successors, (4), 3 states have call predecessors, (4), 4 states have call successors, (4) [2024-08-15 18:24:41,257 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2350 states to 2350 states and 3296 transitions. [2024-08-15 18:24:41,257 INFO L78 Accepts]: Start accepts. Automaton has 2350 states and 3296 transitions. Word has length 112 [2024-08-15 18:24:41,257 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-08-15 18:24:41,257 INFO L495 AbstractCegarLoop]: Abstraction has 2350 states and 3296 transitions. [2024-08-15 18:24:41,258 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 15.666666666666666) internal successors, (94), 6 states have internal predecessors, (94), 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:24:41,258 INFO L276 IsEmpty]: Start isEmpty. Operand 2350 states and 3296 transitions. [2024-08-15 18:24:41,263 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 113 [2024-08-15 18:24:41,263 INFO L187 NwaCegarLoop]: Found error trace [2024-08-15 18:24:41,263 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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] [2024-08-15 18:24:41,287 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (16)] Ended with exit code 0 [2024-08-15 18:24:41,464 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable23,16 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-08-15 18:24:41,465 INFO L420 AbstractCegarLoop]: === Iteration 25 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-08-15 18:24:41,465 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-08-15 18:24:41,465 INFO L85 PathProgramCache]: Analyzing trace with hash 1486218641, now seen corresponding path program 1 times [2024-08-15 18:24:41,465 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-08-15 18:24:41,465 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [553476771] [2024-08-15 18:24:41,465 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-08-15 18:24:41,465 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-08-15 18:24:41,596 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-08-15 18:24:42,589 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2024-08-15 18:24:42,590 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-08-15 18:24:42,591 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2024-08-15 18:24:42,592 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-08-15 18:24:42,593 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 58 [2024-08-15 18:24:42,594 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-08-15 18:24:42,596 INFO L134 CoverageAnalysis]: Checked inductivity of 59 backedges. 36 proven. 5 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2024-08-15 18:24:42,596 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-08-15 18:24:42,596 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [553476771] [2024-08-15 18:24:42,596 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [553476771] provided 0 perfect and 1 imperfect interpolant sequences [2024-08-15 18:24:42,596 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1071639931] [2024-08-15 18:24:42,596 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-08-15 18:24:42,596 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-08-15 18:24:42,596 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-08-15 18:24:42,597 INFO L229 MonitoredProcess]: Starting monitored process 17 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:24:42,598 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (17)] Waiting until timeout for monitored process [2024-08-15 18:24:42,965 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-08-15 18:24:42,968 INFO L262 TraceCheckSpWp]: Trace formula consists of 634 conjuncts, 68 conjunts are in the unsatisfiable core [2024-08-15 18:24:42,973 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2024-08-15 18:24:43,900 INFO L134 CoverageAnalysis]: Checked inductivity of 59 backedges. 29 proven. 8 refuted. 0 times theorem prover too weak. 22 trivial. 0 not checked. [2024-08-15 18:24:43,900 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2024-08-15 18:24:50,387 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1071639931] provided 0 perfect and 1 imperfect interpolant sequences [2024-08-15 18:24:50,387 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-08-15 18:24:50,387 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 11] total 18 [2024-08-15 18:24:50,387 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [558314326] [2024-08-15 18:24:50,388 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-08-15 18:24:50,388 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 18 states [2024-08-15 18:24:50,388 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-08-15 18:24:50,388 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2024-08-15 18:24:50,388 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=119, Invalid=751, Unknown=0, NotChecked=0, Total=870 [2024-08-15 18:24:50,389 INFO L87 Difference]: Start difference. First operand 2350 states and 3296 transitions. Second operand has 18 states, 18 states have (on average 7.888888888888889) internal successors, (142), 18 states have internal predecessors, (142), 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:24:53,585 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-08-15 18:24:53,585 INFO L93 Difference]: Finished difference Result 2702 states and 3703 transitions. [2024-08-15 18:24:53,586 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 27 states. [2024-08-15 18:24:53,586 INFO L78 Accepts]: Start accepts. Automaton has has 18 states, 18 states have (on average 7.888888888888889) internal successors, (142), 18 states have internal predecessors, (142), 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 112 [2024-08-15 18:24:53,587 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-08-15 18:24:53,592 INFO L225 Difference]: With dead ends: 2702 [2024-08-15 18:24:53,592 INFO L226 Difference]: Without dead ends: 2702 [2024-08-15 18:24:53,593 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 204 GetRequests, 152 SyntacticMatches, 0 SemanticMatches, 52 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 403 ImplicationChecksByTransitivity, 5.0s TimeCoverageRelationStatistics Valid=401, Invalid=2461, Unknown=0, NotChecked=0, Total=2862 [2024-08-15 18:24:53,593 INFO L413 NwaCegarLoop]: 98 mSDtfsCounter, 124 mSDsluCounter, 1222 mSDsCounter, 0 mSdLazyCounter, 399 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 124 SdHoareTripleChecker+Valid, 1320 SdHoareTripleChecker+Invalid, 406 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 399 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.3s IncrementalHoareTripleChecker+Time [2024-08-15 18:24:53,594 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [124 Valid, 1320 Invalid, 406 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 399 Invalid, 0 Unknown, 0 Unchecked, 1.3s Time] [2024-08-15 18:24:53,597 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2702 states. [2024-08-15 18:24:53,628 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2702 to 2564. [2024-08-15 18:24:53,631 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2564 states, 2554 states have (on average 1.3856695379796398) internal successors, (3539), 2555 states have internal predecessors, (3539), 5 states have call successors, (5), 5 states have call predecessors, (5), 4 states have return successors, (4), 3 states have call predecessors, (4), 4 states have call successors, (4) [2024-08-15 18:24:53,639 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2564 states to 2564 states and 3548 transitions. [2024-08-15 18:24:53,640 INFO L78 Accepts]: Start accepts. Automaton has 2564 states and 3548 transitions. Word has length 112 [2024-08-15 18:24:53,640 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-08-15 18:24:53,640 INFO L495 AbstractCegarLoop]: Abstraction has 2564 states and 3548 transitions. [2024-08-15 18:24:53,640 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 18 states, 18 states have (on average 7.888888888888889) internal successors, (142), 18 states have internal predecessors, (142), 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:24:53,641 INFO L276 IsEmpty]: Start isEmpty. Operand 2564 states and 3548 transitions. [2024-08-15 18:24:53,646 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 113 [2024-08-15 18:24:53,647 INFO L187 NwaCegarLoop]: Found error trace [2024-08-15 18:24:53,647 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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] [2024-08-15 18:24:53,671 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (17)] Ended with exit code 0 [2024-08-15 18:24:53,847 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 17 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable24 [2024-08-15 18:24:53,848 INFO L420 AbstractCegarLoop]: === Iteration 26 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-08-15 18:24:53,848 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-08-15 18:24:53,848 INFO L85 PathProgramCache]: Analyzing trace with hash 1125002265, now seen corresponding path program 1 times [2024-08-15 18:24:53,848 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-08-15 18:24:53,848 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [759641166] [2024-08-15 18:24:53,849 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-08-15 18:24:53,849 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-08-15 18:24:53,900 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-08-15 18:24:55,600 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2024-08-15 18:24:55,601 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-08-15 18:24:55,602 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2024-08-15 18:24:55,602 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-08-15 18:24:55,603 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 58 [2024-08-15 18:24:55,603 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-08-15 18:24:55,604 INFO L134 CoverageAnalysis]: Checked inductivity of 59 backedges. 47 proven. 0 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2024-08-15 18:24:55,605 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-08-15 18:24:55,605 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [759641166] [2024-08-15 18:24:55,605 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [759641166] provided 1 perfect and 0 imperfect interpolant sequences [2024-08-15 18:24:55,605 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-08-15 18:24:55,605 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [22] imperfect sequences [] total 22 [2024-08-15 18:24:55,605 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [763284564] [2024-08-15 18:24:55,605 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-08-15 18:24:55,606 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 22 states [2024-08-15 18:24:55,606 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-08-15 18:24:55,607 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 22 interpolants. [2024-08-15 18:24:55,607 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=90, Invalid=372, Unknown=0, NotChecked=0, Total=462 [2024-08-15 18:24:55,607 INFO L87 Difference]: Start difference. First operand 2564 states and 3548 transitions. Second operand has 22 states, 22 states have (on average 4.318181818181818) internal successors, (95), 22 states have internal predecessors, (95), 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:24:56,903 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-08-15 18:24:56,903 INFO L93 Difference]: Finished difference Result 2732 states and 3778 transitions. [2024-08-15 18:24:56,904 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2024-08-15 18:24:56,904 INFO L78 Accepts]: Start accepts. Automaton has has 22 states, 22 states have (on average 4.318181818181818) internal successors, (95), 22 states have internal predecessors, (95), 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 112 [2024-08-15 18:24:56,905 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-08-15 18:24:56,910 INFO L225 Difference]: With dead ends: 2732 [2024-08-15 18:24:56,910 INFO L226 Difference]: Without dead ends: 2732 [2024-08-15 18:24:56,910 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 41 GetRequests, 15 SyntacticMatches, 0 SemanticMatches, 26 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 122 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=133, Invalid=623, Unknown=0, NotChecked=0, Total=756 [2024-08-15 18:24:56,911 INFO L413 NwaCegarLoop]: 189 mSDtfsCounter, 229 mSDsluCounter, 1767 mSDsCounter, 0 mSdLazyCounter, 511 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 229 SdHoareTripleChecker+Valid, 1956 SdHoareTripleChecker+Invalid, 513 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 511 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.0s IncrementalHoareTripleChecker+Time [2024-08-15 18:24:56,913 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [229 Valid, 1956 Invalid, 513 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 511 Invalid, 0 Unknown, 0 Unchecked, 1.0s Time] [2024-08-15 18:24:56,915 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2732 states. [2024-08-15 18:24:56,938 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2732 to 2537. [2024-08-15 18:24:56,941 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2537 states, 2527 states have (on average 1.3870201820340324) internal successors, (3505), 2528 states have internal predecessors, (3505), 5 states have call successors, (5), 5 states have call predecessors, (5), 4 states have return successors, (4), 3 states have call predecessors, (4), 4 states have call successors, (4) [2024-08-15 18:24:56,945 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2537 states to 2537 states and 3514 transitions. [2024-08-15 18:24:56,946 INFO L78 Accepts]: Start accepts. Automaton has 2537 states and 3514 transitions. Word has length 112 [2024-08-15 18:24:56,946 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-08-15 18:24:56,946 INFO L495 AbstractCegarLoop]: Abstraction has 2537 states and 3514 transitions. [2024-08-15 18:24:56,947 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 22 states, 22 states have (on average 4.318181818181818) internal successors, (95), 22 states have internal predecessors, (95), 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:24:56,947 INFO L276 IsEmpty]: Start isEmpty. Operand 2537 states and 3514 transitions. [2024-08-15 18:24:56,952 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 113 [2024-08-15 18:24:56,953 INFO L187 NwaCegarLoop]: Found error trace [2024-08-15 18:24:56,953 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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] [2024-08-15 18:24:56,953 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable25 [2024-08-15 18:24:56,953 INFO L420 AbstractCegarLoop]: === Iteration 27 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-08-15 18:24:56,953 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-08-15 18:24:56,953 INFO L85 PathProgramCache]: Analyzing trace with hash 953060115, now seen corresponding path program 1 times [2024-08-15 18:24:56,954 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-08-15 18:24:56,954 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [706151007] [2024-08-15 18:24:56,954 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-08-15 18:24:56,954 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-08-15 18:24:57,045 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-08-15 18:24:59,357 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2024-08-15 18:24:59,358 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-08-15 18:24:59,359 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2024-08-15 18:24:59,360 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-08-15 18:24:59,362 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 58 [2024-08-15 18:24:59,363 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-08-15 18:24:59,365 INFO L134 CoverageAnalysis]: Checked inductivity of 59 backedges. 26 proven. 21 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2024-08-15 18:24:59,366 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-08-15 18:24:59,366 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [706151007] [2024-08-15 18:24:59,366 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [706151007] provided 0 perfect and 1 imperfect interpolant sequences [2024-08-15 18:24:59,366 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [409654416] [2024-08-15 18:24:59,366 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-08-15 18:24:59,366 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-08-15 18:24:59,367 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-08-15 18:24:59,368 INFO L229 MonitoredProcess]: Starting monitored process 18 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:24:59,369 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (18)] Waiting until timeout for monitored process [2024-08-15 18:24:59,749 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-08-15 18:24:59,752 INFO L262 TraceCheckSpWp]: Trace formula consists of 636 conjuncts, 18 conjunts are in the unsatisfiable core [2024-08-15 18:24:59,755 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2024-08-15 18:25:00,346 INFO L134 CoverageAnalysis]: Checked inductivity of 59 backedges. 46 proven. 1 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2024-08-15 18:25:00,346 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2024-08-15 18:25:01,330 INFO L134 CoverageAnalysis]: Checked inductivity of 59 backedges. 43 proven. 3 refuted. 0 times theorem prover too weak. 13 trivial. 0 not checked. [2024-08-15 18:25:01,330 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [409654416] provided 0 perfect and 2 imperfect interpolant sequences [2024-08-15 18:25:01,330 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-08-15 18:25:01,331 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [22, 8, 7] total 33 [2024-08-15 18:25:01,331 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [502480447] [2024-08-15 18:25:01,331 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-08-15 18:25:01,331 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 33 states [2024-08-15 18:25:01,331 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-08-15 18:25:01,332 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 33 interpolants. [2024-08-15 18:25:01,332 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=99, Invalid=957, Unknown=0, NotChecked=0, Total=1056 [2024-08-15 18:25:01,332 INFO L87 Difference]: Start difference. First operand 2537 states and 3514 transitions. Second operand has 33 states, 33 states have (on average 6.696969696969697) internal successors, (221), 33 states have internal predecessors, (221), 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:25:06,419 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-08-15 18:25:06,420 INFO L93 Difference]: Finished difference Result 2361 states and 3261 transitions. [2024-08-15 18:25:06,420 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 30 states. [2024-08-15 18:25:06,420 INFO L78 Accepts]: Start accepts. Automaton has has 33 states, 33 states have (on average 6.696969696969697) internal successors, (221), 33 states have internal predecessors, (221), 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 112 [2024-08-15 18:25:06,421 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-08-15 18:25:06,424 INFO L225 Difference]: With dead ends: 2361 [2024-08-15 18:25:06,424 INFO L226 Difference]: Without dead ends: 2361 [2024-08-15 18:25:06,425 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 281 GetRequests, 222 SyntacticMatches, 0 SemanticMatches, 59 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 809 ImplicationChecksByTransitivity, 4.0s TimeCoverageRelationStatistics Valid=457, Invalid=3203, Unknown=0, NotChecked=0, Total=3660 [2024-08-15 18:25:06,425 INFO L413 NwaCegarLoop]: 74 mSDtfsCounter, 813 mSDsluCounter, 1359 mSDsCounter, 0 mSdLazyCounter, 1139 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 813 SdHoareTripleChecker+Valid, 1433 SdHoareTripleChecker+Invalid, 1143 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 1139 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 3.0s IncrementalHoareTripleChecker+Time [2024-08-15 18:25:06,425 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [813 Valid, 1433 Invalid, 1143 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 1139 Invalid, 0 Unknown, 0 Unchecked, 3.0s Time] [2024-08-15 18:25:06,426 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2361 states. [2024-08-15 18:25:06,445 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2361 to 2283. [2024-08-15 18:25:06,448 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2283 states, 2273 states have (on average 1.3858336999560052) internal successors, (3150), 2274 states have internal predecessors, (3150), 5 states have call successors, (5), 5 states have call predecessors, (5), 4 states have return successors, (4), 3 states have call predecessors, (4), 4 states have call successors, (4) [2024-08-15 18:25:06,451 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2283 states to 2283 states and 3159 transitions. [2024-08-15 18:25:06,451 INFO L78 Accepts]: Start accepts. Automaton has 2283 states and 3159 transitions. Word has length 112 [2024-08-15 18:25:06,452 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-08-15 18:25:06,452 INFO L495 AbstractCegarLoop]: Abstraction has 2283 states and 3159 transitions. [2024-08-15 18:25:06,452 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 33 states, 33 states have (on average 6.696969696969697) internal successors, (221), 33 states have internal predecessors, (221), 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:25:06,452 INFO L276 IsEmpty]: Start isEmpty. Operand 2283 states and 3159 transitions. [2024-08-15 18:25:06,457 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 113 [2024-08-15 18:25:06,457 INFO L187 NwaCegarLoop]: Found error trace [2024-08-15 18:25:06,457 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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] [2024-08-15 18:25:06,480 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (18)] Ended with exit code 0 [2024-08-15 18:25:06,658 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 18 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable26 [2024-08-15 18:25:06,658 INFO L420 AbstractCegarLoop]: === Iteration 28 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-08-15 18:25:06,659 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-08-15 18:25:06,659 INFO L85 PathProgramCache]: Analyzing trace with hash 158069693, now seen corresponding path program 1 times [2024-08-15 18:25:06,659 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-08-15 18:25:06,659 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1384910007] [2024-08-15 18:25:06,659 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-08-15 18:25:06,659 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-08-15 18:25:06,695 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-08-15 18:25:07,889 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2024-08-15 18:25:07,890 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-08-15 18:25:07,891 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2024-08-15 18:25:07,891 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-08-15 18:25:07,892 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 58 [2024-08-15 18:25:07,893 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-08-15 18:25:07,893 INFO L134 CoverageAnalysis]: Checked inductivity of 59 backedges. 47 proven. 0 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2024-08-15 18:25:07,894 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-08-15 18:25:07,894 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1384910007] [2024-08-15 18:25:07,894 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1384910007] provided 1 perfect and 0 imperfect interpolant sequences [2024-08-15 18:25:07,894 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-08-15 18:25:07,894 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [17] imperfect sequences [] total 17 [2024-08-15 18:25:07,894 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1432022199] [2024-08-15 18:25:07,894 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-08-15 18:25:07,894 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 17 states [2024-08-15 18:25:07,894 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-08-15 18:25:07,895 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2024-08-15 18:25:07,895 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=49, Invalid=223, Unknown=0, NotChecked=0, Total=272 [2024-08-15 18:25:07,895 INFO L87 Difference]: Start difference. First operand 2283 states and 3159 transitions. Second operand has 17 states, 17 states have (on average 5.588235294117647) internal successors, (95), 17 states have internal predecessors, (95), 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:25:09,159 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-08-15 18:25:09,159 INFO L93 Difference]: Finished difference Result 2893 states and 3945 transitions. [2024-08-15 18:25:09,159 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2024-08-15 18:25:09,159 INFO L78 Accepts]: Start accepts. Automaton has has 17 states, 17 states have (on average 5.588235294117647) internal successors, (95), 17 states have internal predecessors, (95), 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 112 [2024-08-15 18:25:09,160 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-08-15 18:25:09,164 INFO L225 Difference]: With dead ends: 2893 [2024-08-15 18:25:09,164 INFO L226 Difference]: Without dead ends: 2893 [2024-08-15 18:25:09,164 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 37 GetRequests, 15 SyntacticMatches, 0 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 110 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=88, Invalid=464, Unknown=0, NotChecked=0, Total=552 [2024-08-15 18:25:09,165 INFO L413 NwaCegarLoop]: 119 mSDtfsCounter, 216 mSDsluCounter, 1155 mSDsCounter, 0 mSdLazyCounter, 566 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 217 SdHoareTripleChecker+Valid, 1274 SdHoareTripleChecker+Invalid, 568 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 566 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.1s IncrementalHoareTripleChecker+Time [2024-08-15 18:25:09,165 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [217 Valid, 1274 Invalid, 568 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 566 Invalid, 0 Unknown, 0 Unchecked, 1.1s Time] [2024-08-15 18:25:09,166 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2893 states. [2024-08-15 18:25:09,188 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2893 to 2710. [2024-08-15 18:25:09,191 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2710 states, 2700 states have (on average 1.372962962962963) internal successors, (3707), 2701 states have internal predecessors, (3707), 5 states have call successors, (5), 5 states have call predecessors, (5), 4 states have return successors, (4), 3 states have call predecessors, (4), 4 states have call successors, (4) [2024-08-15 18:25:09,195 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2710 states to 2710 states and 3716 transitions. [2024-08-15 18:25:09,195 INFO L78 Accepts]: Start accepts. Automaton has 2710 states and 3716 transitions. Word has length 112 [2024-08-15 18:25:09,196 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-08-15 18:25:09,196 INFO L495 AbstractCegarLoop]: Abstraction has 2710 states and 3716 transitions. [2024-08-15 18:25:09,196 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 17 states, 17 states have (on average 5.588235294117647) internal successors, (95), 17 states have internal predecessors, (95), 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:25:09,196 INFO L276 IsEmpty]: Start isEmpty. Operand 2710 states and 3716 transitions. [2024-08-15 18:25:09,200 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 113 [2024-08-15 18:25:09,201 INFO L187 NwaCegarLoop]: Found error trace [2024-08-15 18:25:09,201 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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] [2024-08-15 18:25:09,201 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable27 [2024-08-15 18:25:09,201 INFO L420 AbstractCegarLoop]: === Iteration 29 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-08-15 18:25:09,202 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-08-15 18:25:09,202 INFO L85 PathProgramCache]: Analyzing trace with hash 1789320544, now seen corresponding path program 1 times [2024-08-15 18:25:09,202 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-08-15 18:25:09,202 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [259777781] [2024-08-15 18:25:09,202 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-08-15 18:25:09,202 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-08-15 18:25:09,271 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-08-15 18:25:10,353 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2024-08-15 18:25:10,354 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-08-15 18:25:10,355 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2024-08-15 18:25:10,355 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-08-15 18:25:10,357 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 58 [2024-08-15 18:25:10,357 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-08-15 18:25:10,358 INFO L134 CoverageAnalysis]: Checked inductivity of 59 backedges. 46 proven. 1 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2024-08-15 18:25:10,358 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-08-15 18:25:10,358 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [259777781] [2024-08-15 18:25:10,358 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [259777781] provided 0 perfect and 1 imperfect interpolant sequences [2024-08-15 18:25:10,359 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1602855373] [2024-08-15 18:25:10,359 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-08-15 18:25:10,359 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-08-15 18:25:10,359 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-08-15 18:25:10,360 INFO L229 MonitoredProcess]: Starting monitored process 19 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:25:10,361 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (19)] Waiting until timeout for monitored process [2024-08-15 18:25:10,760 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-08-15 18:25:10,764 INFO L262 TraceCheckSpWp]: Trace formula consists of 637 conjuncts, 109 conjunts are in the unsatisfiable core [2024-08-15 18:25:10,769 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2024-08-15 18:25:12,115 INFO L134 CoverageAnalysis]: Checked inductivity of 59 backedges. 21 proven. 33 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2024-08-15 18:25:12,115 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2024-08-15 18:25:15,074 INFO L134 CoverageAnalysis]: Checked inductivity of 59 backedges. 45 proven. 0 refuted. 0 times theorem prover too weak. 14 trivial. 0 not checked. [2024-08-15 18:25:15,075 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1602855373] provided 1 perfect and 1 imperfect interpolant sequences [2024-08-15 18:25:15,075 INFO L185 FreeRefinementEngine]: Found 1 perfect and 2 imperfect interpolant sequences. [2024-08-15 18:25:15,075 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [21] imperfect sequences [17, 19] total 53 [2024-08-15 18:25:15,075 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2122963728] [2024-08-15 18:25:15,075 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-08-15 18:25:15,075 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 21 states [2024-08-15 18:25:15,075 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-08-15 18:25:15,076 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2024-08-15 18:25:15,077 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=227, Invalid=2529, Unknown=0, NotChecked=0, Total=2756 [2024-08-15 18:25:15,077 INFO L87 Difference]: Start difference. First operand 2710 states and 3716 transitions. Second operand has 21 states, 20 states have (on average 4.7) internal successors, (94), 20 states have internal predecessors, (94), 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:25:18,152 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-08-15 18:25:18,153 INFO L93 Difference]: Finished difference Result 4736 states and 6502 transitions. [2024-08-15 18:25:18,153 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 35 states. [2024-08-15 18:25:18,153 INFO L78 Accepts]: Start accepts. Automaton has has 21 states, 20 states have (on average 4.7) internal successors, (94), 20 states have internal predecessors, (94), 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 112 [2024-08-15 18:25:18,154 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-08-15 18:25:18,162 INFO L225 Difference]: With dead ends: 4736 [2024-08-15 18:25:18,162 INFO L226 Difference]: Without dead ends: 4542 [2024-08-15 18:25:18,164 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 271 GetRequests, 204 SyntacticMatches, 0 SemanticMatches, 67 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1466 ImplicationChecksByTransitivity, 4.8s TimeCoverageRelationStatistics Valid=364, Invalid=4328, Unknown=0, NotChecked=0, Total=4692 [2024-08-15 18:25:18,164 INFO L413 NwaCegarLoop]: 189 mSDtfsCounter, 343 mSDsluCounter, 1680 mSDsCounter, 0 mSdLazyCounter, 674 mSolverCounterSat, 12 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 344 SdHoareTripleChecker+Valid, 1869 SdHoareTripleChecker+Invalid, 686 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 12 IncrementalHoareTripleChecker+Valid, 674 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.7s IncrementalHoareTripleChecker+Time [2024-08-15 18:25:18,165 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [344 Valid, 1869 Invalid, 686 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [12 Valid, 674 Invalid, 0 Unknown, 0 Unchecked, 1.7s Time] [2024-08-15 18:25:18,168 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4542 states. [2024-08-15 18:25:18,201 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4542 to 2613. [2024-08-15 18:25:18,204 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2613 states, 2603 states have (on average 1.3753361505954669) internal successors, (3580), 2604 states have internal predecessors, (3580), 5 states have call successors, (5), 5 states have call predecessors, (5), 4 states have return successors, (4), 3 states have call predecessors, (4), 4 states have call successors, (4) [2024-08-15 18:25:18,207 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2613 states to 2613 states and 3589 transitions. [2024-08-15 18:25:18,208 INFO L78 Accepts]: Start accepts. Automaton has 2613 states and 3589 transitions. Word has length 112 [2024-08-15 18:25:18,208 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-08-15 18:25:18,208 INFO L495 AbstractCegarLoop]: Abstraction has 2613 states and 3589 transitions. [2024-08-15 18:25:18,208 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 21 states, 20 states have (on average 4.7) internal successors, (94), 20 states have internal predecessors, (94), 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:25:18,208 INFO L276 IsEmpty]: Start isEmpty. Operand 2613 states and 3589 transitions. [2024-08-15 18:25:18,212 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 113 [2024-08-15 18:25:18,212 INFO L187 NwaCegarLoop]: Found error trace [2024-08-15 18:25:18,213 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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] [2024-08-15 18:25:18,235 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (19)] Ended with exit code 0 [2024-08-15 18:25:18,413 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 19 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable28 [2024-08-15 18:25:18,414 INFO L420 AbstractCegarLoop]: === Iteration 30 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-08-15 18:25:18,414 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-08-15 18:25:18,414 INFO L85 PathProgramCache]: Analyzing trace with hash 1619649692, now seen corresponding path program 1 times [2024-08-15 18:25:18,415 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-08-15 18:25:18,415 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [189260544] [2024-08-15 18:25:18,415 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-08-15 18:25:18,415 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-08-15 18:25:18,508 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-08-15 18:25:18,959 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2024-08-15 18:25:18,960 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-08-15 18:25:18,961 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2024-08-15 18:25:18,962 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-08-15 18:25:18,963 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 58 [2024-08-15 18:25:18,964 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-08-15 18:25:18,965 INFO L134 CoverageAnalysis]: Checked inductivity of 59 backedges. 48 proven. 0 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2024-08-15 18:25:18,965 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-08-15 18:25:18,965 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [189260544] [2024-08-15 18:25:18,965 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [189260544] provided 1 perfect and 0 imperfect interpolant sequences [2024-08-15 18:25:18,966 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-08-15 18:25:18,966 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-08-15 18:25:18,966 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [446867783] [2024-08-15 18:25:18,966 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-08-15 18:25:18,966 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-08-15 18:25:18,966 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-08-15 18:25:18,967 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-08-15 18:25:18,967 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2024-08-15 18:25:18,967 INFO L87 Difference]: Start difference. First operand 2613 states and 3589 transitions. Second operand has 6 states, 6 states have (on average 16.0) internal successors, (96), 6 states have internal predecessors, (96), 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:25:19,567 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-08-15 18:25:19,567 INFO L93 Difference]: Finished difference Result 2174 states and 2985 transitions. [2024-08-15 18:25:19,568 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-08-15 18:25:19,568 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 16.0) internal successors, (96), 6 states have internal predecessors, (96), 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 112 [2024-08-15 18:25:19,568 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-08-15 18:25:19,571 INFO L225 Difference]: With dead ends: 2174 [2024-08-15 18:25:19,571 INFO L226 Difference]: Without dead ends: 2174 [2024-08-15 18:25:19,571 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 13 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2024-08-15 18:25:19,572 INFO L413 NwaCegarLoop]: 91 mSDtfsCounter, 71 mSDsluCounter, 234 mSDsCounter, 0 mSdLazyCounter, 159 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 71 SdHoareTripleChecker+Valid, 325 SdHoareTripleChecker+Invalid, 160 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 159 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2024-08-15 18:25:19,572 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [71 Valid, 325 Invalid, 160 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 159 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2024-08-15 18:25:19,574 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2174 states. [2024-08-15 18:25:19,590 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2174 to 2174. [2024-08-15 18:25:19,592 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2174 states, 2164 states have (on average 1.3752310536044363) internal successors, (2976), 2165 states have internal predecessors, (2976), 5 states have call successors, (5), 5 states have call predecessors, (5), 4 states have return successors, (4), 3 states have call predecessors, (4), 4 states have call successors, (4) [2024-08-15 18:25:19,595 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2174 states to 2174 states and 2985 transitions. [2024-08-15 18:25:19,595 INFO L78 Accepts]: Start accepts. Automaton has 2174 states and 2985 transitions. Word has length 112 [2024-08-15 18:25:19,596 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-08-15 18:25:19,596 INFO L495 AbstractCegarLoop]: Abstraction has 2174 states and 2985 transitions. [2024-08-15 18:25:19,596 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 16.0) internal successors, (96), 6 states have internal predecessors, (96), 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:25:19,596 INFO L276 IsEmpty]: Start isEmpty. Operand 2174 states and 2985 transitions. [2024-08-15 18:25:19,599 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 113 [2024-08-15 18:25:19,600 INFO L187 NwaCegarLoop]: Found error trace [2024-08-15 18:25:19,600 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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] [2024-08-15 18:25:19,600 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable29 [2024-08-15 18:25:19,600 INFO L420 AbstractCegarLoop]: === Iteration 31 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-08-15 18:25:19,601 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-08-15 18:25:19,601 INFO L85 PathProgramCache]: Analyzing trace with hash -704378147, now seen corresponding path program 1 times [2024-08-15 18:25:19,601 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-08-15 18:25:19,601 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1368452257] [2024-08-15 18:25:19,601 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-08-15 18:25:19,601 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-08-15 18:25:19,706 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-08-15 18:25:22,027 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2024-08-15 18:25:22,028 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-08-15 18:25:22,029 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2024-08-15 18:25:22,030 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-08-15 18:25:22,032 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 58 [2024-08-15 18:25:22,032 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-08-15 18:25:22,035 INFO L134 CoverageAnalysis]: Checked inductivity of 59 backedges. 13 proven. 13 refuted. 0 times theorem prover too weak. 33 trivial. 0 not checked. [2024-08-15 18:25:22,035 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-08-15 18:25:22,035 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1368452257] [2024-08-15 18:25:22,035 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1368452257] provided 0 perfect and 1 imperfect interpolant sequences [2024-08-15 18:25:22,035 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1591870104] [2024-08-15 18:25:22,035 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-08-15 18:25:22,035 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-08-15 18:25:22,036 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-08-15 18:25:22,037 INFO L229 MonitoredProcess]: Starting monitored process 20 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:25:22,038 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (20)] Waiting until timeout for monitored process [2024-08-15 18:25:22,478 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-08-15 18:25:22,483 INFO L262 TraceCheckSpWp]: Trace formula consists of 639 conjuncts, 21 conjunts are in the unsatisfiable core [2024-08-15 18:25:22,487 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2024-08-15 18:25:23,376 INFO L134 CoverageAnalysis]: Checked inductivity of 59 backedges. 48 proven. 0 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2024-08-15 18:25:23,376 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-08-15 18:25:23,376 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1591870104] provided 1 perfect and 0 imperfect interpolant sequences [2024-08-15 18:25:23,376 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-08-15 18:25:23,376 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [15] total 20 [2024-08-15 18:25:23,376 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1042646682] [2024-08-15 18:25:23,377 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-08-15 18:25:23,377 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-08-15 18:25:23,377 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-08-15 18:25:23,377 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-08-15 18:25:23,377 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=43, Invalid=337, Unknown=0, NotChecked=0, Total=380 [2024-08-15 18:25:23,378 INFO L87 Difference]: Start difference. First operand 2174 states and 2985 transitions. Second operand has 7 states, 7 states have (on average 13.714285714285714) internal successors, (96), 7 states have internal predecessors, (96), 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:25:23,991 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-08-15 18:25:23,991 INFO L93 Difference]: Finished difference Result 1659 states and 2280 transitions. [2024-08-15 18:25:23,992 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-08-15 18:25:23,992 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 13.714285714285714) internal successors, (96), 7 states have internal predecessors, (96), 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 112 [2024-08-15 18:25:23,992 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-08-15 18:25:23,995 INFO L225 Difference]: With dead ends: 1659 [2024-08-15 18:25:23,995 INFO L226 Difference]: Without dead ends: 1653 [2024-08-15 18:25:23,995 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 139 GetRequests, 118 SyntacticMatches, 2 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 21 ImplicationChecksByTransitivity, 1.3s TimeCoverageRelationStatistics Valid=48, Invalid=372, Unknown=0, NotChecked=0, Total=420 [2024-08-15 18:25:23,996 INFO L413 NwaCegarLoop]: 90 mSDtfsCounter, 69 mSDsluCounter, 296 mSDsCounter, 0 mSdLazyCounter, 203 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 69 SdHoareTripleChecker+Valid, 386 SdHoareTripleChecker+Invalid, 204 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 203 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2024-08-15 18:25:23,996 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [69 Valid, 386 Invalid, 204 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 203 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2024-08-15 18:25:23,997 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1653 states. [2024-08-15 18:25:24,010 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1653 to 1653. [2024-08-15 18:25:24,012 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1653 states, 1643 states have (on average 1.3785757760194766) internal successors, (2265), 1644 states have internal predecessors, (2265), 5 states have call successors, (5), 5 states have call predecessors, (5), 4 states have return successors, (4), 3 states have call predecessors, (4), 4 states have call successors, (4) [2024-08-15 18:25:24,014 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1653 states to 1653 states and 2274 transitions. [2024-08-15 18:25:24,015 INFO L78 Accepts]: Start accepts. Automaton has 1653 states and 2274 transitions. Word has length 112 [2024-08-15 18:25:24,015 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-08-15 18:25:24,015 INFO L495 AbstractCegarLoop]: Abstraction has 1653 states and 2274 transitions. [2024-08-15 18:25:24,015 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 13.714285714285714) internal successors, (96), 7 states have internal predecessors, (96), 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:25:24,015 INFO L276 IsEmpty]: Start isEmpty. Operand 1653 states and 2274 transitions. [2024-08-15 18:25:24,019 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 114 [2024-08-15 18:25:24,019 INFO L187 NwaCegarLoop]: Found error trace [2024-08-15 18:25:24,019 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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] [2024-08-15 18:25:24,043 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (20)] Ended with exit code 0 [2024-08-15 18:25:24,220 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable30,20 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-08-15 18:25:24,220 INFO L420 AbstractCegarLoop]: === Iteration 32 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-08-15 18:25:24,221 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-08-15 18:25:24,221 INFO L85 PathProgramCache]: Analyzing trace with hash 253150287, now seen corresponding path program 1 times [2024-08-15 18:25:24,221 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-08-15 18:25:24,221 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1904137758] [2024-08-15 18:25:24,221 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-08-15 18:25:24,221 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-08-15 18:25:24,295 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-08-15 18:25:25,500 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2024-08-15 18:25:25,501 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-08-15 18:25:25,502 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2024-08-15 18:25:25,502 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-08-15 18:25:25,503 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 58 [2024-08-15 18:25:25,504 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-08-15 18:25:25,505 INFO L134 CoverageAnalysis]: Checked inductivity of 59 backedges. 44 proven. 1 refuted. 0 times theorem prover too weak. 14 trivial. 0 not checked. [2024-08-15 18:25:25,505 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-08-15 18:25:25,505 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1904137758] [2024-08-15 18:25:25,505 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1904137758] provided 0 perfect and 1 imperfect interpolant sequences [2024-08-15 18:25:25,505 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [475630471] [2024-08-15 18:25:25,506 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-08-15 18:25:25,506 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-08-15 18:25:25,506 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-08-15 18:25:25,507 INFO L229 MonitoredProcess]: Starting monitored process 21 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:25:25,508 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (21)] Waiting until timeout for monitored process [2024-08-15 18:25:25,899 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-08-15 18:25:25,902 INFO L262 TraceCheckSpWp]: Trace formula consists of 641 conjuncts, 58 conjunts are in the unsatisfiable core [2024-08-15 18:25:25,906 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2024-08-15 18:25:26,816 INFO L134 CoverageAnalysis]: Checked inductivity of 59 backedges. 41 proven. 0 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2024-08-15 18:25:26,816 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-08-15 18:25:26,816 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [475630471] provided 1 perfect and 0 imperfect interpolant sequences [2024-08-15 18:25:26,816 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-08-15 18:25:26,816 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [14] imperfect sequences [15] total 27 [2024-08-15 18:25:26,817 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1266433323] [2024-08-15 18:25:26,817 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-08-15 18:25:26,817 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2024-08-15 18:25:26,817 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-08-15 18:25:26,817 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2024-08-15 18:25:26,818 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=95, Invalid=607, Unknown=0, NotChecked=0, Total=702 [2024-08-15 18:25:26,818 INFO L87 Difference]: Start difference. First operand 1653 states and 2274 transitions. Second operand has 14 states, 14 states have (on average 6.5) internal successors, (91), 14 states have internal predecessors, (91), 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:25:27,555 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-08-15 18:25:27,555 INFO L93 Difference]: Finished difference Result 2357 states and 3193 transitions. [2024-08-15 18:25:27,555 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2024-08-15 18:25:27,555 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 14 states have (on average 6.5) internal successors, (91), 14 states have internal predecessors, (91), 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 113 [2024-08-15 18:25:27,556 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-08-15 18:25:27,559 INFO L225 Difference]: With dead ends: 2357 [2024-08-15 18:25:27,559 INFO L226 Difference]: Without dead ends: 2357 [2024-08-15 18:25:27,560 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 138 GetRequests, 113 SyntacticMatches, 0 SemanticMatches, 25 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 188 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=95, Invalid=607, Unknown=0, NotChecked=0, Total=702 [2024-08-15 18:25:27,560 INFO L413 NwaCegarLoop]: 108 mSDtfsCounter, 81 mSDsluCounter, 808 mSDsCounter, 0 mSdLazyCounter, 433 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 81 SdHoareTripleChecker+Valid, 916 SdHoareTripleChecker+Invalid, 434 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 433 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2024-08-15 18:25:27,560 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [81 Valid, 916 Invalid, 434 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 433 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2024-08-15 18:25:27,562 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2357 states. [2024-08-15 18:25:27,579 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2357 to 1977. [2024-08-15 18:25:27,581 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1977 states, 1967 states have (on average 1.369598373157092) internal successors, (2694), 1968 states have internal predecessors, (2694), 5 states have call successors, (5), 5 states have call predecessors, (5), 4 states have return successors, (4), 3 states have call predecessors, (4), 4 states have call successors, (4) [2024-08-15 18:25:27,584 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1977 states to 1977 states and 2703 transitions. [2024-08-15 18:25:27,584 INFO L78 Accepts]: Start accepts. Automaton has 1977 states and 2703 transitions. Word has length 113 [2024-08-15 18:25:27,584 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-08-15 18:25:27,584 INFO L495 AbstractCegarLoop]: Abstraction has 1977 states and 2703 transitions. [2024-08-15 18:25:27,585 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 14 states have (on average 6.5) internal successors, (91), 14 states have internal predecessors, (91), 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:25:27,585 INFO L276 IsEmpty]: Start isEmpty. Operand 1977 states and 2703 transitions. [2024-08-15 18:25:27,588 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 114 [2024-08-15 18:25:27,588 INFO L187 NwaCegarLoop]: Found error trace [2024-08-15 18:25:27,588 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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] [2024-08-15 18:25:27,612 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (21)] Ended with exit code 0 [2024-08-15 18:25:27,789 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 21 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable31 [2024-08-15 18:25:27,789 INFO L420 AbstractCegarLoop]: === Iteration 33 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-08-15 18:25:27,789 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-08-15 18:25:27,790 INFO L85 PathProgramCache]: Analyzing trace with hash 292251788, now seen corresponding path program 1 times [2024-08-15 18:25:27,790 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-08-15 18:25:27,790 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [170844166] [2024-08-15 18:25:27,790 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-08-15 18:25:27,790 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-08-15 18:25:27,832 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-08-15 18:25:28,710 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2024-08-15 18:25:28,711 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-08-15 18:25:28,712 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2024-08-15 18:25:28,713 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-08-15 18:25:28,713 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 58 [2024-08-15 18:25:28,714 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-08-15 18:25:28,715 INFO L134 CoverageAnalysis]: Checked inductivity of 59 backedges. 44 proven. 1 refuted. 0 times theorem prover too weak. 14 trivial. 0 not checked. [2024-08-15 18:25:28,715 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-08-15 18:25:28,716 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [170844166] [2024-08-15 18:25:28,716 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [170844166] provided 0 perfect and 1 imperfect interpolant sequences [2024-08-15 18:25:28,716 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [969439378] [2024-08-15 18:25:28,716 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-08-15 18:25:28,716 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-08-15 18:25:28,716 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-08-15 18:25:28,718 INFO L229 MonitoredProcess]: Starting monitored process 22 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:25:28,720 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (22)] Waiting until timeout for monitored process [2024-08-15 18:25:29,134 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-08-15 18:25:29,140 INFO L262 TraceCheckSpWp]: Trace formula consists of 641 conjuncts, 92 conjunts are in the unsatisfiable core [2024-08-15 18:25:29,145 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2024-08-15 18:25:31,702 INFO L134 CoverageAnalysis]: Checked inductivity of 59 backedges. 43 proven. 4 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2024-08-15 18:25:31,703 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2024-08-15 18:25:45,317 INFO L134 CoverageAnalysis]: Checked inductivity of 59 backedges. 33 proven. 14 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2024-08-15 18:25:45,318 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [969439378] provided 0 perfect and 2 imperfect interpolant sequences [2024-08-15 18:25:45,318 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-08-15 18:25:45,318 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 18, 26] total 53 [2024-08-15 18:25:45,318 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1951472626] [2024-08-15 18:25:45,318 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-08-15 18:25:45,319 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 53 states [2024-08-15 18:25:45,319 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-08-15 18:25:45,319 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 53 interpolants. [2024-08-15 18:25:45,320 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=308, Invalid=2448, Unknown=0, NotChecked=0, Total=2756 [2024-08-15 18:25:45,320 INFO L87 Difference]: Start difference. First operand 1977 states and 2703 transitions. Second operand has 53 states, 53 states have (on average 4.830188679245283) internal successors, (256), 53 states have internal predecessors, (256), 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:26:04,642 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-08-15 18:26:04,642 INFO L93 Difference]: Finished difference Result 2357 states and 3236 transitions. [2024-08-15 18:26:04,643 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 49 states. [2024-08-15 18:26:04,643 INFO L78 Accepts]: Start accepts. Automaton has has 53 states, 53 states have (on average 4.830188679245283) internal successors, (256), 53 states have internal predecessors, (256), 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 113 [2024-08-15 18:26:04,643 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-08-15 18:26:04,646 INFO L225 Difference]: With dead ends: 2357 [2024-08-15 18:26:04,647 INFO L226 Difference]: Without dead ends: 2354 [2024-08-15 18:26:04,648 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 281 GetRequests, 195 SyntacticMatches, 0 SemanticMatches, 86 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1840 ImplicationChecksByTransitivity, 14.3s TimeCoverageRelationStatistics Valid=830, Invalid=6826, Unknown=0, NotChecked=0, Total=7656 [2024-08-15 18:26:04,649 INFO L413 NwaCegarLoop]: 95 mSDtfsCounter, 775 mSDsluCounter, 2470 mSDsCounter, 0 mSdLazyCounter, 2477 mSolverCounterSat, 19 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 11.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 775 SdHoareTripleChecker+Valid, 2565 SdHoareTripleChecker+Invalid, 2496 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 19 IncrementalHoareTripleChecker+Valid, 2477 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 12.2s IncrementalHoareTripleChecker+Time [2024-08-15 18:26:04,650 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [775 Valid, 2565 Invalid, 2496 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [19 Valid, 2477 Invalid, 0 Unknown, 0 Unchecked, 12.2s Time] [2024-08-15 18:26:04,651 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2354 states. [2024-08-15 18:26:04,670 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2354 to 2248. [2024-08-15 18:26:04,672 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2248 states, 2238 states have (on average 1.3802502234137624) internal successors, (3089), 2239 states have internal predecessors, (3089), 5 states have call successors, (5), 5 states have call predecessors, (5), 4 states have return successors, (4), 3 states have call predecessors, (4), 4 states have call successors, (4) [2024-08-15 18:26:04,676 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2248 states to 2248 states and 3098 transitions. [2024-08-15 18:26:04,676 INFO L78 Accepts]: Start accepts. Automaton has 2248 states and 3098 transitions. Word has length 113 [2024-08-15 18:26:04,676 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-08-15 18:26:04,676 INFO L495 AbstractCegarLoop]: Abstraction has 2248 states and 3098 transitions. [2024-08-15 18:26:04,676 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 53 states, 53 states have (on average 4.830188679245283) internal successors, (256), 53 states have internal predecessors, (256), 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:26:04,677 INFO L276 IsEmpty]: Start isEmpty. Operand 2248 states and 3098 transitions. [2024-08-15 18:26:04,681 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 114 [2024-08-15 18:26:04,681 INFO L187 NwaCegarLoop]: Found error trace [2024-08-15 18:26:04,681 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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] [2024-08-15 18:26:04,705 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (22)] Ended with exit code 0 [2024-08-15 18:26:04,885 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 22 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable32 [2024-08-15 18:26:04,886 INFO L420 AbstractCegarLoop]: === Iteration 34 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-08-15 18:26:04,886 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-08-15 18:26:04,886 INFO L85 PathProgramCache]: Analyzing trace with hash 539943916, now seen corresponding path program 1 times [2024-08-15 18:26:04,886 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-08-15 18:26:04,886 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2136433085] [2024-08-15 18:26:04,886 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-08-15 18:26:04,887 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-08-15 18:26:04,961 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-08-15 18:26:05,778 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2024-08-15 18:26:05,779 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-08-15 18:26:05,780 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2024-08-15 18:26:05,780 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-08-15 18:26:05,781 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 58 [2024-08-15 18:26:05,781 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-08-15 18:26:05,782 INFO L134 CoverageAnalysis]: Checked inductivity of 59 backedges. 45 proven. 0 refuted. 0 times theorem prover too weak. 14 trivial. 0 not checked. [2024-08-15 18:26:05,782 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-08-15 18:26:05,782 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2136433085] [2024-08-15 18:26:05,782 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2136433085] provided 1 perfect and 0 imperfect interpolant sequences [2024-08-15 18:26:05,783 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-08-15 18:26:05,783 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2024-08-15 18:26:05,783 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [334757607] [2024-08-15 18:26:05,783 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-08-15 18:26:05,783 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2024-08-15 18:26:05,783 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-08-15 18:26:05,784 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2024-08-15 18:26:05,784 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=36, Invalid=96, Unknown=0, NotChecked=0, Total=132 [2024-08-15 18:26:05,784 INFO L87 Difference]: Start difference. First operand 2248 states and 3098 transitions. Second operand has 12 states, 12 states have (on average 7.833333333333333) internal successors, (94), 12 states have internal predecessors, (94), 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:26:06,442 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-08-15 18:26:06,442 INFO L93 Difference]: Finished difference Result 2284 states and 3138 transitions. [2024-08-15 18:26:06,442 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2024-08-15 18:26:06,443 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 12 states have (on average 7.833333333333333) internal successors, (94), 12 states have internal predecessors, (94), 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 113 [2024-08-15 18:26:06,443 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-08-15 18:26:06,445 INFO L225 Difference]: With dead ends: 2284 [2024-08-15 18:26:06,445 INFO L226 Difference]: Without dead ends: 2284 [2024-08-15 18:26:06,446 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 24 GetRequests, 12 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 23 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=45, Invalid=137, Unknown=0, NotChecked=0, Total=182 [2024-08-15 18:26:06,446 INFO L413 NwaCegarLoop]: 110 mSDtfsCounter, 156 mSDsluCounter, 622 mSDsCounter, 0 mSdLazyCounter, 289 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 157 SdHoareTripleChecker+Valid, 732 SdHoareTripleChecker+Invalid, 290 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 289 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2024-08-15 18:26:06,446 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [157 Valid, 732 Invalid, 290 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 289 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2024-08-15 18:26:06,447 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2284 states. [2024-08-15 18:26:06,463 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2284 to 2232. [2024-08-15 18:26:06,465 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2232 states, 2222 states have (on average 1.3793879387938794) internal successors, (3065), 2223 states have internal predecessors, (3065), 5 states have call successors, (5), 5 states have call predecessors, (5), 4 states have return successors, (4), 3 states have call predecessors, (4), 4 states have call successors, (4) [2024-08-15 18:26:06,469 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2232 states to 2232 states and 3074 transitions. [2024-08-15 18:26:06,469 INFO L78 Accepts]: Start accepts. Automaton has 2232 states and 3074 transitions. Word has length 113 [2024-08-15 18:26:06,471 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-08-15 18:26:06,471 INFO L495 AbstractCegarLoop]: Abstraction has 2232 states and 3074 transitions. [2024-08-15 18:26:06,472 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 7.833333333333333) internal successors, (94), 12 states have internal predecessors, (94), 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:26:06,472 INFO L276 IsEmpty]: Start isEmpty. Operand 2232 states and 3074 transitions. [2024-08-15 18:26:06,475 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 114 [2024-08-15 18:26:06,475 INFO L187 NwaCegarLoop]: Found error trace [2024-08-15 18:26:06,476 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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] [2024-08-15 18:26:06,476 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable33 [2024-08-15 18:26:06,476 INFO L420 AbstractCegarLoop]: === Iteration 35 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-08-15 18:26:06,476 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-08-15 18:26:06,476 INFO L85 PathProgramCache]: Analyzing trace with hash -1682510000, now seen corresponding path program 1 times [2024-08-15 18:26:06,477 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-08-15 18:26:06,477 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1279460164] [2024-08-15 18:26:06,477 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-08-15 18:26:06,477 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-08-15 18:26:06,594 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-08-15 18:26:09,568 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2024-08-15 18:26:09,569 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-08-15 18:26:09,570 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2024-08-15 18:26:09,571 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-08-15 18:26:09,574 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 58 [2024-08-15 18:26:09,575 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-08-15 18:26:09,578 INFO L134 CoverageAnalysis]: Checked inductivity of 59 backedges. 29 proven. 18 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2024-08-15 18:26:09,578 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-08-15 18:26:09,578 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1279460164] [2024-08-15 18:26:09,578 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1279460164] provided 0 perfect and 1 imperfect interpolant sequences [2024-08-15 18:26:09,578 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1076368164] [2024-08-15 18:26:09,578 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-08-15 18:26:09,579 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-08-15 18:26:09,579 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-08-15 18:26:09,580 INFO L229 MonitoredProcess]: Starting monitored process 23 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:26:09,581 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (23)] Waiting until timeout for monitored process [2024-08-15 18:26:10,042 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-08-15 18:26:10,046 INFO L262 TraceCheckSpWp]: Trace formula consists of 642 conjuncts, 50 conjunts are in the unsatisfiable core [2024-08-15 18:26:10,049 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2024-08-15 18:26:12,395 INFO L134 CoverageAnalysis]: Checked inductivity of 59 backedges. 43 proven. 4 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2024-08-15 18:26:12,395 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2024-08-15 18:26:24,064 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1076368164] provided 0 perfect and 1 imperfect interpolant sequences [2024-08-15 18:26:24,065 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-08-15 18:26:24,065 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [21, 11] total 30 [2024-08-15 18:26:24,065 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1099284148] [2024-08-15 18:26:24,065 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-08-15 18:26:24,065 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 30 states [2024-08-15 18:26:24,065 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-08-15 18:26:24,066 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 30 interpolants. [2024-08-15 18:26:24,066 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=140, Invalid=1666, Unknown=0, NotChecked=0, Total=1806 [2024-08-15 18:26:24,067 INFO L87 Difference]: Start difference. First operand 2232 states and 3074 transitions. Second operand has 30 states, 30 states have (on average 5.966666666666667) internal successors, (179), 30 states have internal predecessors, (179), 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:26:32,000 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-08-15 18:26:32,001 INFO L93 Difference]: Finished difference Result 2342 states and 3202 transitions. [2024-08-15 18:26:32,001 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2024-08-15 18:26:32,002 INFO L78 Accepts]: Start accepts. Automaton has has 30 states, 30 states have (on average 5.966666666666667) internal successors, (179), 30 states have internal predecessors, (179), 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 113 [2024-08-15 18:26:32,002 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-08-15 18:26:32,004 INFO L225 Difference]: With dead ends: 2342 [2024-08-15 18:26:32,004 INFO L226 Difference]: Without dead ends: 2342 [2024-08-15 18:26:32,005 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 216 GetRequests, 153 SyntacticMatches, 0 SemanticMatches, 63 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 531 ImplicationChecksByTransitivity, 11.1s TimeCoverageRelationStatistics Valid=468, Invalid=3692, Unknown=0, NotChecked=0, Total=4160 [2024-08-15 18:26:32,005 INFO L413 NwaCegarLoop]: 77 mSDtfsCounter, 293 mSDsluCounter, 1538 mSDsCounter, 0 mSdLazyCounter, 1097 mSolverCounterSat, 13 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 4.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 293 SdHoareTripleChecker+Valid, 1615 SdHoareTripleChecker+Invalid, 1110 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 13 IncrementalHoareTripleChecker+Valid, 1097 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 4.3s IncrementalHoareTripleChecker+Time [2024-08-15 18:26:32,006 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [293 Valid, 1615 Invalid, 1110 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [13 Valid, 1097 Invalid, 0 Unknown, 0 Unchecked, 4.3s Time] [2024-08-15 18:26:32,007 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2342 states. [2024-08-15 18:26:32,025 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2342 to 2229. [2024-08-15 18:26:32,028 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2229 states, 2219 states have (on average 1.3799008562415502) internal successors, (3062), 2220 states have internal predecessors, (3062), 5 states have call successors, (5), 5 states have call predecessors, (5), 4 states have return successors, (4), 3 states have call predecessors, (4), 4 states have call successors, (4) [2024-08-15 18:26:32,031 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2229 states to 2229 states and 3071 transitions. [2024-08-15 18:26:32,032 INFO L78 Accepts]: Start accepts. Automaton has 2229 states and 3071 transitions. Word has length 113 [2024-08-15 18:26:32,032 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-08-15 18:26:32,032 INFO L495 AbstractCegarLoop]: Abstraction has 2229 states and 3071 transitions. [2024-08-15 18:26:32,032 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 30 states, 30 states have (on average 5.966666666666667) internal successors, (179), 30 states have internal predecessors, (179), 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:26:32,033 INFO L276 IsEmpty]: Start isEmpty. Operand 2229 states and 3071 transitions. [2024-08-15 18:26:32,036 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 114 [2024-08-15 18:26:32,036 INFO L187 NwaCegarLoop]: Found error trace [2024-08-15 18:26:32,036 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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] [2024-08-15 18:26:32,060 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (23)] Ended with exit code 0 [2024-08-15 18:26:32,237 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable34,23 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-08-15 18:26:32,237 INFO L420 AbstractCegarLoop]: === Iteration 36 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-08-15 18:26:32,237 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-08-15 18:26:32,237 INFO L85 PathProgramCache]: Analyzing trace with hash 1615384943, now seen corresponding path program 1 times [2024-08-15 18:26:32,238 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-08-15 18:26:32,238 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1592001511] [2024-08-15 18:26:32,238 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-08-15 18:26:32,238 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-08-15 18:26:32,319 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-08-15 18:26:32,824 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2024-08-15 18:26:32,825 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-08-15 18:26:32,826 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2024-08-15 18:26:32,826 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-08-15 18:26:32,827 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 58 [2024-08-15 18:26:32,827 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-08-15 18:26:32,828 INFO L134 CoverageAnalysis]: Checked inductivity of 59 backedges. 46 proven. 0 refuted. 0 times theorem prover too weak. 13 trivial. 0 not checked. [2024-08-15 18:26:32,829 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-08-15 18:26:32,829 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1592001511] [2024-08-15 18:26:32,829 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1592001511] provided 1 perfect and 0 imperfect interpolant sequences [2024-08-15 18:26:32,829 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-08-15 18:26:32,829 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-08-15 18:26:32,829 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [495509500] [2024-08-15 18:26:32,829 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-08-15 18:26:32,830 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-08-15 18:26:32,830 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-08-15 18:26:32,830 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-08-15 18:26:32,831 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2024-08-15 18:26:32,831 INFO L87 Difference]: Start difference. First operand 2229 states and 3071 transitions. Second operand has 6 states, 6 states have (on average 15.833333333333334) internal successors, (95), 6 states have internal predecessors, (95), 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:26:33,108 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-08-15 18:26:33,108 INFO L93 Difference]: Finished difference Result 1843 states and 2526 transitions. [2024-08-15 18:26:33,108 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-08-15 18:26:33,109 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 15.833333333333334) internal successors, (95), 6 states have internal predecessors, (95), 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 113 [2024-08-15 18:26:33,109 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-08-15 18:26:33,110 INFO L225 Difference]: With dead ends: 1843 [2024-08-15 18:26:33,110 INFO L226 Difference]: Without dead ends: 1843 [2024-08-15 18:26:33,111 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 10 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2024-08-15 18:26:33,111 INFO L413 NwaCegarLoop]: 110 mSDtfsCounter, 10 mSDsluCounter, 271 mSDsCounter, 0 mSdLazyCounter, 96 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 10 SdHoareTripleChecker+Valid, 381 SdHoareTripleChecker+Invalid, 96 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 96 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-08-15 18:26:33,111 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [10 Valid, 381 Invalid, 96 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 96 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-08-15 18:26:33,112 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1843 states. [2024-08-15 18:26:33,127 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1843 to 1843. [2024-08-15 18:26:33,129 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1843 states, 1833 states have (on average 1.3731587561374796) internal successors, (2517), 1834 states have internal predecessors, (2517), 5 states have call successors, (5), 5 states have call predecessors, (5), 4 states have return successors, (4), 3 states have call predecessors, (4), 4 states have call successors, (4) [2024-08-15 18:26:33,131 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1843 states to 1843 states and 2526 transitions. [2024-08-15 18:26:33,131 INFO L78 Accepts]: Start accepts. Automaton has 1843 states and 2526 transitions. Word has length 113 [2024-08-15 18:26:33,132 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-08-15 18:26:33,132 INFO L495 AbstractCegarLoop]: Abstraction has 1843 states and 2526 transitions. [2024-08-15 18:26:33,132 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 15.833333333333334) internal successors, (95), 6 states have internal predecessors, (95), 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:26:33,132 INFO L276 IsEmpty]: Start isEmpty. Operand 1843 states and 2526 transitions. [2024-08-15 18:26:33,136 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 114 [2024-08-15 18:26:33,136 INFO L187 NwaCegarLoop]: Found error trace [2024-08-15 18:26:33,137 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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] [2024-08-15 18:26:33,137 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable35 [2024-08-15 18:26:33,137 INFO L420 AbstractCegarLoop]: === Iteration 37 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-08-15 18:26:33,137 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-08-15 18:26:33,138 INFO L85 PathProgramCache]: Analyzing trace with hash -121695169, now seen corresponding path program 1 times [2024-08-15 18:26:33,138 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-08-15 18:26:33,138 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [359261335] [2024-08-15 18:26:33,138 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-08-15 18:26:33,138 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-08-15 18:26:33,265 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-08-15 18:26:35,804 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2024-08-15 18:26:35,805 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-08-15 18:26:35,805 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2024-08-15 18:26:35,806 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-08-15 18:26:35,807 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 58 [2024-08-15 18:26:35,808 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-08-15 18:26:35,809 INFO L134 CoverageAnalysis]: Checked inductivity of 59 backedges. 30 proven. 15 refuted. 0 times theorem prover too weak. 14 trivial. 0 not checked. [2024-08-15 18:26:35,809 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-08-15 18:26:35,809 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [359261335] [2024-08-15 18:26:35,809 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [359261335] provided 0 perfect and 1 imperfect interpolant sequences [2024-08-15 18:26:35,810 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1592618412] [2024-08-15 18:26:35,810 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-08-15 18:26:35,810 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-08-15 18:26:35,810 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-08-15 18:26:35,811 INFO L229 MonitoredProcess]: Starting monitored process 24 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:26:35,812 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (24)] Waiting until timeout for monitored process [2024-08-15 18:26:36,322 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-08-15 18:26:36,326 INFO L262 TraceCheckSpWp]: Trace formula consists of 637 conjuncts, 57 conjunts are in the unsatisfiable core [2024-08-15 18:26:36,329 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2024-08-15 18:26:38,061 INFO L134 CoverageAnalysis]: Checked inductivity of 59 backedges. 31 proven. 14 refuted. 0 times theorem prover too weak. 14 trivial. 0 not checked. [2024-08-15 18:26:38,062 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2024-08-15 18:26:56,437 WARN L293 SmtUtils]: Spent 12.04s on a formula simplification that was a NOOP. DAG size: 35 (called from [L 391] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2024-08-15 18:27:21,836 INFO L134 CoverageAnalysis]: Checked inductivity of 59 backedges. 23 proven. 22 refuted. 0 times theorem prover too weak. 14 trivial. 0 not checked. [2024-08-15 18:27:21,836 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1592618412] provided 0 perfect and 2 imperfect interpolant sequences [2024-08-15 18:27:21,837 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-08-15 18:27:21,837 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [19, 17, 17] total 49 [2024-08-15 18:27:21,837 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [475688766] [2024-08-15 18:27:21,837 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-08-15 18:27:21,837 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 49 states [2024-08-15 18:27:21,837 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-08-15 18:27:21,838 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 49 interpolants. [2024-08-15 18:27:21,838 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=239, Invalid=2112, Unknown=1, NotChecked=0, Total=2352 [2024-08-15 18:27:21,839 INFO L87 Difference]: Start difference. First operand 1843 states and 2526 transitions. Second operand has 49 states, 49 states have (on average 4.979591836734694) internal successors, (244), 49 states have internal predecessors, (244), 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:27:29,265 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-08-15 18:27:29,266 INFO L93 Difference]: Finished difference Result 2048 states and 2807 transitions. [2024-08-15 18:27:29,266 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 29 states. [2024-08-15 18:27:29,266 INFO L78 Accepts]: Start accepts. Automaton has has 49 states, 49 states have (on average 4.979591836734694) internal successors, (244), 49 states have internal predecessors, (244), 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 113 [2024-08-15 18:27:29,266 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-08-15 18:27:29,269 INFO L225 Difference]: With dead ends: 2048 [2024-08-15 18:27:29,269 INFO L226 Difference]: Without dead ends: 2042 [2024-08-15 18:27:29,270 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 271 GetRequests, 204 SyntacticMatches, 0 SemanticMatches, 67 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1039 ImplicationChecksByTransitivity, 44.7s TimeCoverageRelationStatistics Valid=558, Invalid=4133, Unknown=1, NotChecked=0, Total=4692 [2024-08-15 18:27:29,271 INFO L413 NwaCegarLoop]: 111 mSDtfsCounter, 492 mSDsluCounter, 2587 mSDsCounter, 0 mSdLazyCounter, 1211 mSolverCounterSat, 10 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 4.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 492 SdHoareTripleChecker+Valid, 2698 SdHoareTripleChecker+Invalid, 1221 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 10 IncrementalHoareTripleChecker+Valid, 1211 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 4.3s IncrementalHoareTripleChecker+Time [2024-08-15 18:27:29,271 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [492 Valid, 2698 Invalid, 1221 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [10 Valid, 1211 Invalid, 0 Unknown, 0 Unchecked, 4.3s Time] [2024-08-15 18:27:29,273 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2042 states. [2024-08-15 18:27:29,288 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2042 to 1949. [2024-08-15 18:27:29,289 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1949 states, 1939 states have (on average 1.376998452810727) internal successors, (2670), 1940 states have internal predecessors, (2670), 5 states have call successors, (5), 5 states have call predecessors, (5), 4 states have return successors, (4), 3 states have call predecessors, (4), 4 states have call successors, (4) [2024-08-15 18:27:29,292 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1949 states to 1949 states and 2679 transitions. [2024-08-15 18:27:29,294 INFO L78 Accepts]: Start accepts. Automaton has 1949 states and 2679 transitions. Word has length 113 [2024-08-15 18:27:29,295 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-08-15 18:27:29,295 INFO L495 AbstractCegarLoop]: Abstraction has 1949 states and 2679 transitions. [2024-08-15 18:27:29,295 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 49 states, 49 states have (on average 4.979591836734694) internal successors, (244), 49 states have internal predecessors, (244), 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:27:29,295 INFO L276 IsEmpty]: Start isEmpty. Operand 1949 states and 2679 transitions. [2024-08-15 18:27:29,299 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 114 [2024-08-15 18:27:29,299 INFO L187 NwaCegarLoop]: Found error trace [2024-08-15 18:27:29,299 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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] [2024-08-15 18:27:29,323 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (24)] Ended with exit code 0 [2024-08-15 18:27:29,500 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable36,24 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-08-15 18:27:29,501 INFO L420 AbstractCegarLoop]: === Iteration 38 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-08-15 18:27:29,501 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-08-15 18:27:29,501 INFO L85 PathProgramCache]: Analyzing trace with hash 867923169, now seen corresponding path program 1 times [2024-08-15 18:27:29,502 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-08-15 18:27:29,502 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [142423591] [2024-08-15 18:27:29,502 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-08-15 18:27:29,502 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-08-15 18:27:29,660 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-08-15 18:27:31,939 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2024-08-15 18:27:31,940 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-08-15 18:27:31,941 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2024-08-15 18:27:31,942 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-08-15 18:27:31,943 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 58 [2024-08-15 18:27:31,944 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-08-15 18:27:31,945 INFO L134 CoverageAnalysis]: Checked inductivity of 59 backedges. 31 proven. 14 refuted. 0 times theorem prover too weak. 14 trivial. 0 not checked. [2024-08-15 18:27:31,945 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-08-15 18:27:31,946 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [142423591] [2024-08-15 18:27:31,946 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [142423591] provided 0 perfect and 1 imperfect interpolant sequences [2024-08-15 18:27:31,946 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1316203871] [2024-08-15 18:27:31,946 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-08-15 18:27:31,946 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-08-15 18:27:31,946 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-08-15 18:27:31,947 INFO L229 MonitoredProcess]: Starting monitored process 25 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:27:31,948 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (25)] Waiting until timeout for monitored process [2024-08-15 18:27:32,431 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-08-15 18:27:32,434 INFO L262 TraceCheckSpWp]: Trace formula consists of 636 conjuncts, 44 conjunts are in the unsatisfiable core [2024-08-15 18:27:32,437 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2024-08-15 18:27:33,623 INFO L134 CoverageAnalysis]: Checked inductivity of 59 backedges. 45 proven. 0 refuted. 0 times theorem prover too weak. 14 trivial. 0 not checked. [2024-08-15 18:27:33,624 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-08-15 18:27:33,624 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1316203871] provided 1 perfect and 0 imperfect interpolant sequences [2024-08-15 18:27:33,624 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-08-15 18:27:33,624 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [15] imperfect sequences [20] total 33 [2024-08-15 18:27:33,624 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [655893867] [2024-08-15 18:27:33,624 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-08-15 18:27:33,624 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 15 states [2024-08-15 18:27:33,625 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-08-15 18:27:33,625 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2024-08-15 18:27:33,625 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=153, Invalid=903, Unknown=0, NotChecked=0, Total=1056 [2024-08-15 18:27:33,626 INFO L87 Difference]: Start difference. First operand 1949 states and 2679 transitions. Second operand has 15 states, 15 states have (on average 6.266666666666667) internal successors, (94), 15 states have internal predecessors, (94), 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:27:34,179 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-08-15 18:27:34,179 INFO L93 Difference]: Finished difference Result 2109 states and 2904 transitions. [2024-08-15 18:27:34,180 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2024-08-15 18:27:34,180 INFO L78 Accepts]: Start accepts. Automaton has has 15 states, 15 states have (on average 6.266666666666667) internal successors, (94), 15 states have internal predecessors, (94), 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 113 [2024-08-15 18:27:34,180 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-08-15 18:27:34,182 INFO L225 Difference]: With dead ends: 2109 [2024-08-15 18:27:34,182 INFO L226 Difference]: Without dead ends: 2109 [2024-08-15 18:27:34,183 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 140 GetRequests, 108 SyntacticMatches, 0 SemanticMatches, 32 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 354 ImplicationChecksByTransitivity, 1.9s TimeCoverageRelationStatistics Valid=160, Invalid=962, Unknown=0, NotChecked=0, Total=1122 [2024-08-15 18:27:34,183 INFO L413 NwaCegarLoop]: 117 mSDtfsCounter, 172 mSDsluCounter, 965 mSDsCounter, 0 mSdLazyCounter, 236 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 172 SdHoareTripleChecker+Valid, 1082 SdHoareTripleChecker+Invalid, 236 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 236 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2024-08-15 18:27:34,183 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [172 Valid, 1082 Invalid, 236 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 236 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2024-08-15 18:27:34,184 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2109 states. [2024-08-15 18:27:34,196 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2109 to 1964. [2024-08-15 18:27:34,199 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1964 states, 1954 states have (on average 1.3792221084953942) internal successors, (2695), 1955 states have internal predecessors, (2695), 5 states have call successors, (5), 5 states have call predecessors, (5), 4 states have return successors, (4), 3 states have call predecessors, (4), 4 states have call successors, (4) [2024-08-15 18:27:34,203 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1964 states to 1964 states and 2704 transitions. [2024-08-15 18:27:34,203 INFO L78 Accepts]: Start accepts. Automaton has 1964 states and 2704 transitions. Word has length 113 [2024-08-15 18:27:34,203 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-08-15 18:27:34,204 INFO L495 AbstractCegarLoop]: Abstraction has 1964 states and 2704 transitions. [2024-08-15 18:27:34,204 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 15 states, 15 states have (on average 6.266666666666667) internal successors, (94), 15 states have internal predecessors, (94), 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:27:34,204 INFO L276 IsEmpty]: Start isEmpty. Operand 1964 states and 2704 transitions. [2024-08-15 18:27:34,207 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 114 [2024-08-15 18:27:34,207 INFO L187 NwaCegarLoop]: Found error trace [2024-08-15 18:27:34,207 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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] [2024-08-15 18:27:34,231 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (25)] Ended with exit code 0 [2024-08-15 18:27:34,408 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 25 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable37 [2024-08-15 18:27:34,409 INFO L420 AbstractCegarLoop]: === Iteration 39 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-08-15 18:27:34,409 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-08-15 18:27:34,409 INFO L85 PathProgramCache]: Analyzing trace with hash -672568097, now seen corresponding path program 1 times [2024-08-15 18:27:34,410 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-08-15 18:27:34,410 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1779510415] [2024-08-15 18:27:34,410 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-08-15 18:27:34,410 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-08-15 18:27:34,601 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-08-15 18:27:34,601 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-08-15 18:27:34,758 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-08-15 18:27:34,812 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-08-15 18:27:34,816 INFO L360 BasicCegarLoop]: Counterexample is feasible [2024-08-15 18:27:34,818 INFO L805 garLoopResultBuilder]: Registering result UNSAFE for location __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2024-08-15 18:27:34,827 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable38 [2024-08-15 18:27:34,835 INFO L445 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-08-15 18:27:34,843 INFO L176 ceAbstractionStarter]: Computing trace abstraction results [2024-08-15 18:27:34,921 INFO L201 PluginConnector]: Adding new model witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 15.08 06:27:34 BoogieIcfgContainer [2024-08-15 18:27:34,921 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2024-08-15 18:27:34,922 INFO L158 Benchmark]: Toolchain (without parser) took 291063.98ms. Allocated memory was 182.5MB in the beginning and 903.9MB in the end (delta: 721.4MB). Free memory was 123.4MB in the beginning and 673.8MB in the end (delta: -550.3MB). Peak memory consumption was 170.9MB. Max. memory is 16.1GB. [2024-08-15 18:27:34,922 INFO L158 Benchmark]: CDTParser took 0.41ms. Allocated memory is still 100.7MB. Free memory is still 55.3MB. There was no memory consumed. Max. memory is 16.1GB. [2024-08-15 18:27:34,922 INFO L158 Benchmark]: Witness Parser took 0.14ms. Allocated memory is still 182.5MB. Free memory is still 125.5MB. There was no memory consumed. Max. memory is 16.1GB. [2024-08-15 18:27:34,923 INFO L158 Benchmark]: CACSL2BoogieTranslator took 387.20ms. Allocated memory is still 182.5MB. Free memory was 122.6MB in the beginning and 145.3MB in the end (delta: -22.7MB). Peak memory consumption was 10.5MB. Max. memory is 16.1GB. [2024-08-15 18:27:34,923 INFO L158 Benchmark]: Boogie Preprocessor took 104.05ms. Allocated memory is still 182.5MB. Free memory was 145.3MB in the beginning and 141.9MB in the end (delta: 3.4MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2024-08-15 18:27:34,923 INFO L158 Benchmark]: IcfgBuilder took 774.67ms. Allocated memory is still 182.5MB. Free memory was 141.9MB in the beginning and 103.3MB in the end (delta: 38.5MB). Peak memory consumption was 39.8MB. Max. memory is 16.1GB. [2024-08-15 18:27:34,923 INFO L158 Benchmark]: TraceAbstraction took 289791.01ms. Allocated memory was 182.5MB in the beginning and 903.9MB in the end (delta: 721.4MB). Free memory was 102.7MB in the beginning and 673.8MB in the end (delta: -571.1MB). Peak memory consumption was 152.7MB. Max. memory is 16.1GB. [2024-08-15 18:27:34,925 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.41ms. Allocated memory is still 100.7MB. Free memory is still 55.3MB. There was no memory consumed. Max. memory is 16.1GB. * Witness Parser took 0.14ms. Allocated memory is still 182.5MB. Free memory is still 125.5MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 387.20ms. Allocated memory is still 182.5MB. Free memory was 122.6MB in the beginning and 145.3MB in the end (delta: -22.7MB). Peak memory consumption was 10.5MB. Max. memory is 16.1GB. * Boogie Preprocessor took 104.05ms. Allocated memory is still 182.5MB. Free memory was 145.3MB in the beginning and 141.9MB in the end (delta: 3.4MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * IcfgBuilder took 774.67ms. Allocated memory is still 182.5MB. Free memory was 141.9MB in the beginning and 103.3MB in the end (delta: 38.5MB). Peak memory consumption was 39.8MB. Max. memory is 16.1GB. * TraceAbstraction took 289791.01ms. Allocated memory was 182.5MB in the beginning and 903.9MB in the end (delta: 721.4MB). Free memory was 102.7MB in the beginning and 673.8MB in the end (delta: -571.1MB). Peak memory consumption was 152.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 bitwiseAnd at line 170. Possible FailurePath: [L26] const SORT_1 mask_SORT_1 = (SORT_1)-1 >> (sizeof(SORT_1) * 8 - 5); [L27] const SORT_1 msb_SORT_1 = (SORT_1)1 << (5 - 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_5 mask_SORT_5 = (SORT_5)-1 >> (sizeof(SORT_5) * 8 - 32); [L33] const SORT_5 msb_SORT_5 = (SORT_5)1 << (32 - 1); [L35] const SORT_22 mask_SORT_22 = (SORT_22)-1 >> (sizeof(SORT_22) * 8 - 31); [L36] const SORT_22 msb_SORT_22 = (SORT_22)1 << (31 - 1); [L38] const SORT_29 mask_SORT_29 = (SORT_29)-1 >> (sizeof(SORT_29) * 8 - 30); [L39] const SORT_29 msb_SORT_29 = (SORT_29)1 << (30 - 1); [L41] const SORT_31 mask_SORT_31 = (SORT_31)-1 >> (sizeof(SORT_31) * 8 - 2); [L42] const SORT_31 msb_SORT_31 = (SORT_31)1 << (2 - 1); [L44] const SORT_37 mask_SORT_37 = (SORT_37)-1 >> (sizeof(SORT_37) * 8 - 28); [L45] const SORT_37 msb_SORT_37 = (SORT_37)1 << (28 - 1); [L47] const SORT_39 mask_SORT_39 = (SORT_39)-1 >> (sizeof(SORT_39) * 8 - 4); [L48] const SORT_39 msb_SORT_39 = (SORT_39)1 << (4 - 1); [L50] const SORT_45 mask_SORT_45 = (SORT_45)-1 >> (sizeof(SORT_45) * 8 - 24); [L51] const SORT_45 msb_SORT_45 = (SORT_45)1 << (24 - 1); [L53] const SORT_47 mask_SORT_47 = (SORT_47)-1 >> (sizeof(SORT_47) * 8 - 8); [L54] const SORT_47 msb_SORT_47 = (SORT_47)1 << (8 - 1); [L56] const SORT_53 mask_SORT_53 = (SORT_53)-1 >> (sizeof(SORT_53) * 8 - 16); [L57] const SORT_53 msb_SORT_53 = (SORT_53)1 << (16 - 1); [L59] const SORT_5 var_7 = 0; [L60] const SORT_5 var_10 = 2863311530; [L61] const SORT_3 var_15 = 1; [L63] SORT_1 input_2; [L64] SORT_3 input_4; [L65] SORT_5 input_6; [L67] EXPR __VERIFIER_nondet_uint() & mask_SORT_5 [L67] EXPR __VERIFIER_nondet_uint() & mask_SORT_5 VAL [mask_SORT_22=2147483647, mask_SORT_29=1073741823, mask_SORT_37=268435455, mask_SORT_3=1, mask_SORT_45=16777215, mask_SORT_53=65535, mask_SORT_5=-1, var_10=2863311530, var_15=1, var_7=0] [L67] SORT_5 state_8 = __VERIFIER_nondet_uint() & mask_SORT_5; [L68] EXPR __VERIFIER_nondet_uint() & mask_SORT_5 [L68] EXPR __VERIFIER_nondet_uint() & mask_SORT_5 VAL [mask_SORT_22=2147483647, mask_SORT_29=1073741823, mask_SORT_37=268435455, mask_SORT_3=1, mask_SORT_45=16777215, mask_SORT_53=65535, mask_SORT_5=-1, var_10=2863311530, var_15=1, var_7=0] [L68] SORT_5 state_19 = __VERIFIER_nondet_uint() & mask_SORT_5; [L70] SORT_5 init_9_arg_1 = var_7; [L71] state_8 = init_9_arg_1 [L72] SORT_5 init_20_arg_1 = var_7; [L73] state_19 = init_20_arg_1 VAL [mask_SORT_22=2147483647, mask_SORT_29=1073741823, mask_SORT_37=268435455, mask_SORT_3=1, mask_SORT_45=16777215, mask_SORT_53=65535, mask_SORT_5=-1, state_19=0, state_8=0, var_10=2863311530, var_15=1] [L76] input_2 = __VERIFIER_nondet_uchar() [L77] input_4 = __VERIFIER_nondet_uchar() [L78] input_6 = __VERIFIER_nondet_uint() [L81] SORT_5 var_11_arg_0 = state_8; [L82] SORT_5 var_11_arg_1 = var_10; [L83] SORT_3 var_11 = var_11_arg_0 == var_11_arg_1; [L84] SORT_3 var_12_arg_0 = var_11; [L85] SORT_3 var_12 = ~var_12_arg_0; [L86] SORT_3 var_16_arg_0 = var_12; [L87] SORT_3 var_16 = ~var_16_arg_0; [L88] SORT_3 var_17_arg_0 = var_15; [L89] SORT_3 var_17_arg_1 = var_16; VAL [mask_SORT_22=2147483647, mask_SORT_29=1073741823, mask_SORT_37=268435455, mask_SORT_3=1, mask_SORT_45=16777215, mask_SORT_53=65535, mask_SORT_5=-1, state_19=0, var_10=2863311530, var_15=1, var_17_arg_0=1, var_17_arg_1=-256] [L90] EXPR var_17_arg_0 & var_17_arg_1 [L90] EXPR var_17_arg_0 & var_17_arg_1 VAL [mask_SORT_22=2147483647, mask_SORT_29=1073741823, mask_SORT_37=268435455, mask_SORT_3=1, mask_SORT_45=16777215, mask_SORT_53=65535, mask_SORT_5=-1, state_19=0, var_10=2863311530, var_15=1] [L90] SORT_3 var_17 = var_17_arg_0 & var_17_arg_1; [L91] EXPR var_17 & mask_SORT_3 [L91] EXPR var_17 & mask_SORT_3 VAL [mask_SORT_22=2147483647, mask_SORT_29=1073741823, mask_SORT_37=268435455, mask_SORT_3=1, mask_SORT_45=16777215, mask_SORT_53=65535, mask_SORT_5=-1, state_19=0, var_10=2863311530, var_15=1] [L91] var_17 = var_17 & mask_SORT_3 [L92] SORT_3 bad_18_arg_0 = var_17; VAL [bad_18_arg_0=0, mask_SORT_22=2147483647, mask_SORT_29=1073741823, mask_SORT_37=268435455, mask_SORT_3=1, mask_SORT_45=16777215, mask_SORT_53=65535, mask_SORT_5=-1, state_19=0, var_10=2863311530, var_15=1] [L93] CALL __VERIFIER_assert(!(bad_18_arg_0)) VAL [\old(cond)=1] [L21] COND FALSE !(!(cond)) VAL [\old(cond)=1] [L93] RET __VERIFIER_assert(!(bad_18_arg_0)) VAL [bad_18_arg_0=0, mask_SORT_22=2147483647, mask_SORT_29=1073741823, mask_SORT_37=268435455, mask_SORT_3=1, mask_SORT_45=16777215, mask_SORT_53=65535, mask_SORT_5=-1, state_19=0, var_10=2863311530, var_15=1] [L95] SORT_1 var_57_arg_0 = input_2; [L96] SORT_3 var_57 = var_57_arg_0 >> 4; VAL [bad_18_arg_0=0, input_2=0, mask_SORT_22=2147483647, mask_SORT_29=1073741823, mask_SORT_37=268435455, mask_SORT_3=1, mask_SORT_45=16777215, mask_SORT_53=65535, mask_SORT_5=-1, state_19=0, var_10=2863311530, var_15=1, var_57=0] [L97] EXPR var_57 & mask_SORT_3 [L97] EXPR var_57 & mask_SORT_3 VAL [bad_18_arg_0=0, input_2=0, mask_SORT_22=2147483647, mask_SORT_29=1073741823, mask_SORT_37=268435455, mask_SORT_3=1, mask_SORT_45=16777215, mask_SORT_53=65535, mask_SORT_5=-1, state_19=0, var_10=2863311530, var_15=1] [L97] var_57 = var_57 & mask_SORT_3 [L98] SORT_1 var_50_arg_0 = input_2; [L99] SORT_3 var_50 = var_50_arg_0 >> 3; VAL [bad_18_arg_0=0, input_2=0, mask_SORT_22=2147483647, mask_SORT_29=1073741823, mask_SORT_37=268435455, mask_SORT_3=1, mask_SORT_45=16777215, mask_SORT_53=65535, mask_SORT_5=-1, state_19=0, var_10=2863311530, var_15=1, var_50=0, var_57=0] [L100] EXPR var_50 & mask_SORT_3 [L100] EXPR var_50 & mask_SORT_3 VAL [bad_18_arg_0=0, input_2=0, mask_SORT_22=2147483647, mask_SORT_29=1073741823, mask_SORT_37=268435455, mask_SORT_3=1, mask_SORT_45=16777215, mask_SORT_53=65535, mask_SORT_5=-1, state_19=0, var_10=2863311530, var_15=1, var_57=0] [L100] var_50 = var_50 & mask_SORT_3 [L101] SORT_1 var_42_arg_0 = input_2; [L102] SORT_3 var_42 = var_42_arg_0 >> 2; VAL [bad_18_arg_0=0, input_2=0, mask_SORT_22=2147483647, mask_SORT_29=1073741823, mask_SORT_37=268435455, mask_SORT_3=1, mask_SORT_45=16777215, mask_SORT_53=65535, mask_SORT_5=-1, state_19=0, var_10=2863311530, var_15=1, var_42=0, var_50=0, var_57=0] [L103] EXPR var_42 & mask_SORT_3 [L103] EXPR var_42 & mask_SORT_3 VAL [bad_18_arg_0=0, input_2=0, mask_SORT_22=2147483647, mask_SORT_29=1073741823, mask_SORT_37=268435455, mask_SORT_3=1, mask_SORT_45=16777215, mask_SORT_53=65535, mask_SORT_5=-1, state_19=0, var_10=2863311530, var_15=1, var_50=0, var_57=0] [L103] var_42 = var_42 & mask_SORT_3 [L104] SORT_1 var_34_arg_0 = input_2; [L105] SORT_3 var_34 = var_34_arg_0 >> 1; VAL [bad_18_arg_0=0, input_2=0, mask_SORT_22=2147483647, mask_SORT_29=1073741823, mask_SORT_37=268435455, mask_SORT_3=1, mask_SORT_45=16777215, mask_SORT_53=65535, mask_SORT_5=-1, state_19=0, var_10=2863311530, var_15=1, var_34=0, var_42=0, var_50=0, var_57=0] [L106] EXPR var_34 & mask_SORT_3 [L106] EXPR var_34 & mask_SORT_3 VAL [bad_18_arg_0=0, input_2=0, mask_SORT_22=2147483647, mask_SORT_29=1073741823, mask_SORT_37=268435455, mask_SORT_3=1, mask_SORT_45=16777215, mask_SORT_53=65535, mask_SORT_5=-1, state_19=0, var_10=2863311530, var_15=1, var_42=0, var_50=0, var_57=0] [L106] var_34 = var_34 & mask_SORT_3 [L107] SORT_1 var_26_arg_0 = input_2; [L108] SORT_3 var_26 = var_26_arg_0 >> 0; VAL [bad_18_arg_0=0, mask_SORT_22=2147483647, mask_SORT_29=1073741823, mask_SORT_37=268435455, mask_SORT_3=1, mask_SORT_45=16777215, mask_SORT_53=65535, mask_SORT_5=-1, state_19=0, var_10=2863311530, var_15=1, var_26=0, var_34=0, var_42=0, var_50=0, var_57=0] [L109] EXPR var_26 & mask_SORT_3 [L109] EXPR var_26 & mask_SORT_3 VAL [bad_18_arg_0=0, mask_SORT_22=2147483647, mask_SORT_29=1073741823, mask_SORT_37=268435455, mask_SORT_3=1, mask_SORT_45=16777215, mask_SORT_53=65535, mask_SORT_5=-1, state_19=0, var_10=2863311530, var_15=1, var_34=0, var_42=0, var_50=0, var_57=0] [L109] var_26 = var_26 & mask_SORT_3 [L110] SORT_5 var_24_arg_0 = state_19; [L111] SORT_3 var_24 = var_24_arg_0 >> 0; [L112] SORT_5 var_23_arg_0 = state_19; [L113] SORT_22 var_23 = var_23_arg_0 >> 1; VAL [bad_18_arg_0=0, mask_SORT_22=2147483647, mask_SORT_29=1073741823, mask_SORT_37=268435455, mask_SORT_3=1, mask_SORT_45=16777215, mask_SORT_53=65535, mask_SORT_5=-1, state_19=0, var_10=2863311530, var_15=1, var_23=0, var_24=0, var_26=0, var_34=0, var_42=0, var_50=0, var_57=0] [L114] EXPR var_23 & mask_SORT_22 [L114] EXPR var_23 & mask_SORT_22 VAL [bad_18_arg_0=0, mask_SORT_22=2147483647, mask_SORT_29=1073741823, mask_SORT_37=268435455, mask_SORT_3=1, mask_SORT_45=16777215, mask_SORT_53=65535, mask_SORT_5=-1, state_19=0, var_10=2863311530, var_15=1, var_24=0, var_26=0, var_34=0, var_42=0, var_50=0, var_57=0] [L114] var_23 = var_23 & mask_SORT_22 [L115] SORT_3 var_25_arg_0 = var_24; [L116] SORT_22 var_25_arg_1 = var_23; VAL [bad_18_arg_0=0, mask_SORT_22=2147483647, mask_SORT_29=1073741823, mask_SORT_37=268435455, mask_SORT_3=1, mask_SORT_45=16777215, mask_SORT_53=65535, mask_SORT_5=-1, state_19=0, var_10=2863311530, var_15=1, var_25_arg_0=0, var_25_arg_1=0, var_26=0, var_34=0, var_42=0, var_50=0, var_57=0] [L117] EXPR ((SORT_5)var_25_arg_0 << 31) | var_25_arg_1 [L117] EXPR ((SORT_5)var_25_arg_0 << 31) | var_25_arg_1 VAL [bad_18_arg_0=0, mask_SORT_22=2147483647, mask_SORT_29=1073741823, mask_SORT_37=268435455, mask_SORT_3=1, mask_SORT_45=16777215, mask_SORT_53=65535, mask_SORT_5=-1, state_19=0, var_10=2863311530, var_15=1, var_26=0, var_34=0, var_42=0, var_50=0, var_57=0] [L117] SORT_5 var_25 = ((SORT_5)var_25_arg_0 << 31) | var_25_arg_1; [L118] SORT_3 var_27_arg_0 = var_26; [L119] SORT_5 var_27_arg_1 = var_25; [L120] SORT_5 var_27_arg_2 = state_19; [L121] SORT_5 var_27 = var_27_arg_0 ? var_27_arg_1 : var_27_arg_2; [L122] SORT_5 var_32_arg_0 = var_27; [L123] SORT_31 var_32 = var_32_arg_0 >> 0; [L124] SORT_5 var_30_arg_0 = var_27; [L125] SORT_29 var_30 = var_30_arg_0 >> 2; VAL [bad_18_arg_0=0, mask_SORT_22=2147483647, mask_SORT_29=1073741823, mask_SORT_37=268435455, mask_SORT_3=1, mask_SORT_45=16777215, mask_SORT_53=65535, mask_SORT_5=-1, var_10=2863311530, var_15=1, var_27=0, var_30=0, var_32=0, var_34=0, var_42=0, var_50=0, var_57=0] [L126] EXPR var_30 & mask_SORT_29 [L126] EXPR var_30 & mask_SORT_29 VAL [bad_18_arg_0=0, mask_SORT_22=2147483647, mask_SORT_29=1073741823, mask_SORT_37=268435455, mask_SORT_3=1, mask_SORT_45=16777215, mask_SORT_53=65535, mask_SORT_5=-1, var_10=2863311530, var_15=1, var_27=0, var_32=0, var_34=0, var_42=0, var_50=0, var_57=0] [L126] var_30 = var_30 & mask_SORT_29 [L127] SORT_31 var_33_arg_0 = var_32; [L128] SORT_29 var_33_arg_1 = var_30; VAL [bad_18_arg_0=0, mask_SORT_22=2147483647, mask_SORT_29=1073741823, mask_SORT_37=268435455, mask_SORT_3=1, mask_SORT_45=16777215, mask_SORT_53=65535, mask_SORT_5=-1, var_10=2863311530, var_15=1, var_27=0, var_33_arg_0=0, var_33_arg_1=0, var_34=0, var_42=0, var_50=0, var_57=0] [L129] EXPR ((SORT_5)var_33_arg_0 << 30) | var_33_arg_1 [L129] EXPR ((SORT_5)var_33_arg_0 << 30) | var_33_arg_1 VAL [bad_18_arg_0=0, mask_SORT_22=2147483647, mask_SORT_29=1073741823, mask_SORT_37=268435455, mask_SORT_3=1, mask_SORT_45=16777215, mask_SORT_53=65535, mask_SORT_5=-1, var_10=2863311530, var_15=1, var_27=0, var_34=0, var_42=0, var_50=0, var_57=0] [L129] SORT_5 var_33 = ((SORT_5)var_33_arg_0 << 30) | var_33_arg_1; [L130] SORT_3 var_35_arg_0 = var_34; [L131] SORT_5 var_35_arg_1 = var_33; [L132] SORT_5 var_35_arg_2 = var_27; [L133] SORT_5 var_35 = var_35_arg_0 ? var_35_arg_1 : var_35_arg_2; [L134] SORT_5 var_40_arg_0 = var_35; [L135] SORT_39 var_40 = var_40_arg_0 >> 0; [L136] SORT_5 var_38_arg_0 = var_35; [L137] SORT_37 var_38 = var_38_arg_0 >> 4; VAL [bad_18_arg_0=0, mask_SORT_22=2147483647, mask_SORT_29=1073741823, mask_SORT_37=268435455, mask_SORT_3=1, mask_SORT_45=16777215, mask_SORT_53=65535, mask_SORT_5=-1, var_10=2863311530, var_15=1, var_35=0, var_38=0, var_40=0, var_42=0, var_50=0, var_57=0] [L138] EXPR var_38 & mask_SORT_37 [L138] EXPR var_38 & mask_SORT_37 VAL [bad_18_arg_0=0, mask_SORT_22=2147483647, mask_SORT_29=1073741823, mask_SORT_37=268435455, mask_SORT_3=1, mask_SORT_45=16777215, mask_SORT_53=65535, mask_SORT_5=-1, var_10=2863311530, var_15=1, var_35=0, var_40=0, var_42=0, var_50=0, var_57=0] [L138] var_38 = var_38 & mask_SORT_37 [L139] SORT_39 var_41_arg_0 = var_40; [L140] SORT_37 var_41_arg_1 = var_38; VAL [bad_18_arg_0=0, mask_SORT_22=2147483647, mask_SORT_29=1073741823, mask_SORT_37=268435455, mask_SORT_3=1, mask_SORT_45=16777215, mask_SORT_53=65535, mask_SORT_5=-1, var_10=2863311530, var_15=1, var_35=0, var_41_arg_0=0, var_41_arg_1=0, var_42=0, var_50=0, var_57=0] [L141] EXPR ((SORT_5)var_41_arg_0 << 28) | var_41_arg_1 [L141] EXPR ((SORT_5)var_41_arg_0 << 28) | var_41_arg_1 VAL [bad_18_arg_0=0, mask_SORT_22=2147483647, mask_SORT_29=1073741823, mask_SORT_37=268435455, mask_SORT_3=1, mask_SORT_45=16777215, mask_SORT_53=65535, mask_SORT_5=-1, var_10=2863311530, var_15=1, var_35=0, var_42=0, var_50=0, var_57=0] [L141] SORT_5 var_41 = ((SORT_5)var_41_arg_0 << 28) | var_41_arg_1; [L142] SORT_3 var_43_arg_0 = var_42; [L143] SORT_5 var_43_arg_1 = var_41; [L144] SORT_5 var_43_arg_2 = var_35; [L145] SORT_5 var_43 = var_43_arg_0 ? var_43_arg_1 : var_43_arg_2; [L146] SORT_5 var_48_arg_0 = var_43; [L147] SORT_47 var_48 = var_48_arg_0 >> 0; [L148] SORT_5 var_46_arg_0 = var_43; [L149] SORT_45 var_46 = var_46_arg_0 >> 8; VAL [bad_18_arg_0=0, mask_SORT_22=2147483647, mask_SORT_29=1073741823, mask_SORT_37=268435455, mask_SORT_3=1, mask_SORT_45=16777215, mask_SORT_53=65535, mask_SORT_5=-1, var_10=2863311530, var_15=1, var_43=0, var_46=0, var_48=0, var_50=0, var_57=0] [L150] EXPR var_46 & mask_SORT_45 [L150] EXPR var_46 & mask_SORT_45 VAL [bad_18_arg_0=0, mask_SORT_22=2147483647, mask_SORT_29=1073741823, mask_SORT_37=268435455, mask_SORT_3=1, mask_SORT_45=16777215, mask_SORT_53=65535, mask_SORT_5=-1, var_10=2863311530, var_15=1, var_43=0, var_48=0, var_50=0, var_57=0] [L150] var_46 = var_46 & mask_SORT_45 [L151] SORT_47 var_49_arg_0 = var_48; [L152] SORT_45 var_49_arg_1 = var_46; VAL [bad_18_arg_0=0, mask_SORT_22=2147483647, mask_SORT_29=1073741823, mask_SORT_37=268435455, mask_SORT_3=1, mask_SORT_45=16777215, mask_SORT_53=65535, mask_SORT_5=-1, var_10=2863311530, var_15=1, var_43=0, var_49_arg_0=0, var_49_arg_1=0, var_50=0, var_57=0] [L153] EXPR ((SORT_5)var_49_arg_0 << 24) | var_49_arg_1 [L153] EXPR ((SORT_5)var_49_arg_0 << 24) | var_49_arg_1 VAL [bad_18_arg_0=0, mask_SORT_22=2147483647, mask_SORT_29=1073741823, mask_SORT_37=268435455, mask_SORT_3=1, mask_SORT_45=16777215, mask_SORT_53=65535, mask_SORT_5=-1, var_10=2863311530, var_15=1, var_43=0, var_50=0, var_57=0] [L153] SORT_5 var_49 = ((SORT_5)var_49_arg_0 << 24) | var_49_arg_1; [L154] SORT_3 var_51_arg_0 = var_50; [L155] SORT_5 var_51_arg_1 = var_49; [L156] SORT_5 var_51_arg_2 = var_43; [L157] SORT_5 var_51 = var_51_arg_0 ? var_51_arg_1 : var_51_arg_2; [L158] SORT_5 var_55_arg_0 = var_51; [L159] SORT_53 var_55 = var_55_arg_0 >> 0; [L160] SORT_5 var_54_arg_0 = var_51; [L161] SORT_53 var_54 = var_54_arg_0 >> 16; VAL [bad_18_arg_0=0, mask_SORT_22=2147483647, mask_SORT_29=1073741823, mask_SORT_37=268435455, mask_SORT_3=1, mask_SORT_45=16777215, mask_SORT_53=65535, mask_SORT_5=-1, var_10=2863311530, var_15=1, var_51=0, var_54=0, var_55=0, var_57=0] [L162] EXPR var_54 & mask_SORT_53 [L162] EXPR var_54 & mask_SORT_53 VAL [bad_18_arg_0=0, mask_SORT_22=2147483647, mask_SORT_29=1073741823, mask_SORT_37=268435455, mask_SORT_3=1, mask_SORT_45=16777215, mask_SORT_53=65535, mask_SORT_5=-1, var_10=2863311530, var_15=1, var_51=0, var_55=0, var_57=0] [L162] var_54 = var_54 & mask_SORT_53 [L163] SORT_53 var_56_arg_0 = var_55; [L164] SORT_53 var_56_arg_1 = var_54; VAL [bad_18_arg_0=0, mask_SORT_22=2147483647, mask_SORT_29=1073741823, mask_SORT_37=268435455, mask_SORT_3=1, mask_SORT_45=16777215, mask_SORT_53=65535, mask_SORT_5=-1, var_10=2863311530, var_15=1, var_51=0, var_56_arg_0=0, var_56_arg_1=0, var_57=0] [L165] EXPR ((SORT_5)var_56_arg_0 << 16) | var_56_arg_1 [L165] EXPR ((SORT_5)var_56_arg_0 << 16) | var_56_arg_1 VAL [bad_18_arg_0=0, mask_SORT_22=2147483647, mask_SORT_29=1073741823, mask_SORT_37=268435455, mask_SORT_3=1, mask_SORT_45=16777215, mask_SORT_53=65535, mask_SORT_5=-1, var_10=2863311530, var_15=1, var_51=0, var_57=0] [L165] SORT_5 var_56 = ((SORT_5)var_56_arg_0 << 16) | var_56_arg_1; [L166] SORT_3 var_58_arg_0 = var_57; [L167] SORT_5 var_58_arg_1 = var_56; [L168] SORT_5 var_58_arg_2 = var_51; [L169] SORT_5 var_58 = var_58_arg_0 ? var_58_arg_1 : var_58_arg_2; VAL [bad_18_arg_0=0, mask_SORT_22=2147483647, mask_SORT_29=1073741823, mask_SORT_37=268435455, mask_SORT_3=1, mask_SORT_45=16777215, mask_SORT_53=65535, mask_SORT_5=-1, var_10=2863311530, var_15=1, var_58=0] [L170] EXPR var_58 & mask_SORT_5 [L170] EXPR var_58 & mask_SORT_5 VAL [bad_18_arg_0=0, mask_SORT_22=2147483647, mask_SORT_29=1073741823, mask_SORT_37=268435455, mask_SORT_3=1, mask_SORT_45=16777215, mask_SORT_53=65535, mask_SORT_5=-1, var_10=2863311530, var_15=1] [L170] var_58 = var_58 & mask_SORT_5 [L171] SORT_5 next_60_arg_1 = var_58; [L172] SORT_5 next_61_arg_1 = input_6; [L174] state_8 = next_60_arg_1 [L175] state_19 = next_61_arg_1 [L76] input_2 = __VERIFIER_nondet_uchar() [L77] input_4 = __VERIFIER_nondet_uchar() [L78] input_6 = __VERIFIER_nondet_uint() [L81] SORT_5 var_11_arg_0 = state_8; [L82] SORT_5 var_11_arg_1 = var_10; [L83] SORT_3 var_11 = var_11_arg_0 == var_11_arg_1; [L84] SORT_3 var_12_arg_0 = var_11; [L85] SORT_3 var_12 = ~var_12_arg_0; [L86] SORT_3 var_16_arg_0 = var_12; [L87] SORT_3 var_16 = ~var_16_arg_0; [L88] SORT_3 var_17_arg_0 = var_15; [L89] SORT_3 var_17_arg_1 = var_16; VAL [mask_SORT_22=2147483647, mask_SORT_29=1073741823, mask_SORT_37=268435455, mask_SORT_3=1, mask_SORT_45=16777215, mask_SORT_53=65535, mask_SORT_5=-1, state_19=4294901760, var_10=2863311530, var_15=1, var_17_arg_0=1, var_17_arg_1=-256] [L90] EXPR var_17_arg_0 & var_17_arg_1 [L90] EXPR var_17_arg_0 & var_17_arg_1 VAL [mask_SORT_22=2147483647, mask_SORT_29=1073741823, mask_SORT_37=268435455, mask_SORT_3=1, mask_SORT_45=16777215, mask_SORT_53=65535, mask_SORT_5=-1, state_19=4294901760, var_10=2863311530, var_15=1] [L90] SORT_3 var_17 = var_17_arg_0 & var_17_arg_1; [L91] EXPR var_17 & mask_SORT_3 [L91] EXPR var_17 & mask_SORT_3 VAL [mask_SORT_22=2147483647, mask_SORT_29=1073741823, mask_SORT_37=268435455, mask_SORT_3=1, mask_SORT_45=16777215, mask_SORT_53=65535, mask_SORT_5=-1, state_19=4294901760, var_10=2863311530, var_15=1] [L91] var_17 = var_17 & mask_SORT_3 [L92] SORT_3 bad_18_arg_0 = var_17; VAL [bad_18_arg_0=0, mask_SORT_22=2147483647, mask_SORT_29=1073741823, mask_SORT_37=268435455, mask_SORT_3=1, mask_SORT_45=16777215, mask_SORT_53=65535, mask_SORT_5=-1, state_19=4294901760, var_10=2863311530, var_15=1] [L93] CALL __VERIFIER_assert(!(bad_18_arg_0)) VAL [\old(cond)=1] [L21] COND FALSE !(!(cond)) VAL [\old(cond)=1] [L93] RET __VERIFIER_assert(!(bad_18_arg_0)) VAL [bad_18_arg_0=0, mask_SORT_22=2147483647, mask_SORT_29=1073741823, mask_SORT_37=268435455, mask_SORT_3=1, mask_SORT_45=16777215, mask_SORT_53=65535, mask_SORT_5=-1, state_19=4294901760, var_10=2863311530, var_15=1] [L95] SORT_1 var_57_arg_0 = input_2; [L96] SORT_3 var_57 = var_57_arg_0 >> 4; VAL [bad_18_arg_0=0, input_2=0, mask_SORT_22=2147483647, mask_SORT_29=1073741823, mask_SORT_37=268435455, mask_SORT_3=1, mask_SORT_45=16777215, mask_SORT_53=65535, mask_SORT_5=-1, state_19=4294901760, var_10=2863311530, var_15=1, var_57=0] [L97] EXPR var_57 & mask_SORT_3 [L97] EXPR var_57 & mask_SORT_3 VAL [bad_18_arg_0=0, input_2=0, mask_SORT_22=2147483647, mask_SORT_29=1073741823, mask_SORT_37=268435455, mask_SORT_3=1, mask_SORT_45=16777215, mask_SORT_53=65535, mask_SORT_5=-1, state_19=4294901760, var_10=2863311530, var_15=1] [L97] var_57 = var_57 & mask_SORT_3 [L98] SORT_1 var_50_arg_0 = input_2; [L99] SORT_3 var_50 = var_50_arg_0 >> 3; VAL [bad_18_arg_0=0, input_2=0, mask_SORT_22=2147483647, mask_SORT_29=1073741823, mask_SORT_37=268435455, mask_SORT_3=1, mask_SORT_45=16777215, mask_SORT_53=65535, mask_SORT_5=-1, state_19=4294901760, var_10=2863311530, var_15=1, var_50=0, var_57=0] [L100] EXPR var_50 & mask_SORT_3 [L100] EXPR var_50 & mask_SORT_3 VAL [bad_18_arg_0=0, input_2=0, mask_SORT_22=2147483647, mask_SORT_29=1073741823, mask_SORT_37=268435455, mask_SORT_3=1, mask_SORT_45=16777215, mask_SORT_53=65535, mask_SORT_5=-1, state_19=4294901760, var_10=2863311530, var_15=1, var_57=0] [L100] var_50 = var_50 & mask_SORT_3 [L101] SORT_1 var_42_arg_0 = input_2; [L102] SORT_3 var_42 = var_42_arg_0 >> 2; VAL [bad_18_arg_0=0, input_2=0, mask_SORT_22=2147483647, mask_SORT_29=1073741823, mask_SORT_37=268435455, mask_SORT_3=1, mask_SORT_45=16777215, mask_SORT_53=65535, mask_SORT_5=-1, state_19=4294901760, var_10=2863311530, var_15=1, var_42=0, var_50=0, var_57=0] [L103] EXPR var_42 & mask_SORT_3 [L103] EXPR var_42 & mask_SORT_3 VAL [bad_18_arg_0=0, input_2=0, mask_SORT_22=2147483647, mask_SORT_29=1073741823, mask_SORT_37=268435455, mask_SORT_3=1, mask_SORT_45=16777215, mask_SORT_53=65535, mask_SORT_5=-1, state_19=4294901760, var_10=2863311530, var_15=1, var_50=0, var_57=0] [L103] var_42 = var_42 & mask_SORT_3 [L104] SORT_1 var_34_arg_0 = input_2; [L105] SORT_3 var_34 = var_34_arg_0 >> 1; VAL [bad_18_arg_0=0, input_2=0, mask_SORT_22=2147483647, mask_SORT_29=1073741823, mask_SORT_37=268435455, mask_SORT_3=1, mask_SORT_45=16777215, mask_SORT_53=65535, mask_SORT_5=-1, state_19=4294901760, var_10=2863311530, var_15=1, var_34=0, var_42=0, var_50=0, var_57=0] [L106] EXPR var_34 & mask_SORT_3 [L106] EXPR var_34 & mask_SORT_3 VAL [bad_18_arg_0=0, input_2=0, mask_SORT_22=2147483647, mask_SORT_29=1073741823, mask_SORT_37=268435455, mask_SORT_3=1, mask_SORT_45=16777215, mask_SORT_53=65535, mask_SORT_5=-1, state_19=4294901760, var_10=2863311530, var_15=1, var_42=0, var_50=0, var_57=0] [L106] var_34 = var_34 & mask_SORT_3 [L107] SORT_1 var_26_arg_0 = input_2; [L108] SORT_3 var_26 = var_26_arg_0 >> 0; VAL [bad_18_arg_0=0, mask_SORT_22=2147483647, mask_SORT_29=1073741823, mask_SORT_37=268435455, mask_SORT_3=1, mask_SORT_45=16777215, mask_SORT_53=65535, mask_SORT_5=-1, state_19=4294901760, var_10=2863311530, var_15=1, var_26=0, var_34=0, var_42=0, var_50=0, var_57=0] [L109] EXPR var_26 & mask_SORT_3 [L109] EXPR var_26 & mask_SORT_3 VAL [bad_18_arg_0=0, mask_SORT_22=2147483647, mask_SORT_29=1073741823, mask_SORT_37=268435455, mask_SORT_3=1, mask_SORT_45=16777215, mask_SORT_53=65535, mask_SORT_5=-1, state_19=4294901760, var_10=2863311530, var_15=1, var_34=0, var_42=0, var_50=0, var_57=0] [L109] var_26 = var_26 & mask_SORT_3 [L110] SORT_5 var_24_arg_0 = state_19; [L111] SORT_3 var_24 = var_24_arg_0 >> 0; [L112] SORT_5 var_23_arg_0 = state_19; [L113] SORT_22 var_23 = var_23_arg_0 >> 1; VAL [bad_18_arg_0=0, mask_SORT_22=2147483647, mask_SORT_29=1073741823, mask_SORT_37=268435455, mask_SORT_3=1, mask_SORT_45=16777215, mask_SORT_53=65535, mask_SORT_5=-1, state_19=4294901760, var_10=2863311530, var_15=1, var_23=2147450880, var_24=4294901760, var_26=0, var_34=0, var_42=0, var_50=0, var_57=0] [L114] EXPR var_23 & mask_SORT_22 VAL [bad_18_arg_0=0, mask_SORT_22=2147483647, mask_SORT_29=1073741823, mask_SORT_37=268435455, mask_SORT_3=1, mask_SORT_45=16777215, mask_SORT_53=65535, mask_SORT_5=-1, state_19=4294901760, var_10=2863311530, var_15=1, var_23=2147450880, var_24=4294901760, var_26=0, var_34=0, var_42=0, var_50=0, var_57=0] [L114] EXPR var_23 & mask_SORT_22 [L114] EXPR var_23 & mask_SORT_22 VAL [bad_18_arg_0=0, mask_SORT_22=2147483647, mask_SORT_29=1073741823, mask_SORT_37=268435455, mask_SORT_3=1, mask_SORT_45=16777215, mask_SORT_53=65535, mask_SORT_5=-1, state_19=4294901760, var_10=2863311530, var_15=1, var_24=4294901760, var_26=0, var_34=0, var_42=0, var_50=0, var_57=0] [L114] var_23 = var_23 & mask_SORT_22 [L115] SORT_3 var_25_arg_0 = var_24; [L116] SORT_22 var_25_arg_1 = var_23; VAL [bad_18_arg_0=0, mask_SORT_22=2147483647, mask_SORT_29=1073741823, mask_SORT_37=268435455, mask_SORT_3=1, mask_SORT_45=16777215, mask_SORT_53=65535, mask_SORT_5=-1, state_19=4294901760, var_10=2863311530, var_15=1, var_25_arg_0=4294901760, var_25_arg_1=4294967298, var_26=0, var_34=0, var_42=0, var_50=0, var_57=0] [L117] EXPR ((SORT_5)var_25_arg_0 << 31) | var_25_arg_1 [L117] EXPR ((SORT_5)var_25_arg_0 << 31) | var_25_arg_1 VAL [bad_18_arg_0=0, mask_SORT_22=2147483647, mask_SORT_29=1073741823, mask_SORT_37=268435455, mask_SORT_3=1, mask_SORT_45=16777215, mask_SORT_53=65535, mask_SORT_5=-1, state_19=4294901760, var_10=2863311530, var_15=1, var_26=0, var_34=0, var_42=0, var_50=0, var_57=0] [L117] SORT_5 var_25 = ((SORT_5)var_25_arg_0 << 31) | var_25_arg_1; [L118] SORT_3 var_27_arg_0 = var_26; [L119] SORT_5 var_27_arg_1 = var_25; [L120] SORT_5 var_27_arg_2 = state_19; [L121] SORT_5 var_27 = var_27_arg_0 ? var_27_arg_1 : var_27_arg_2; [L122] SORT_5 var_32_arg_0 = var_27; [L123] SORT_31 var_32 = var_32_arg_0 >> 0; [L124] SORT_5 var_30_arg_0 = var_27; [L125] SORT_29 var_30 = var_30_arg_0 >> 2; VAL [bad_18_arg_0=0, mask_SORT_22=2147483647, mask_SORT_29=1073741823, mask_SORT_37=268435455, mask_SORT_3=1, mask_SORT_45=16777215, mask_SORT_53=65535, mask_SORT_5=-1, var_10=2863311530, var_15=1, var_27=4294901760, var_30=1073725440, var_32=4294901760, var_34=0, var_42=0, var_50=0, var_57=0] [L126] EXPR var_30 & mask_SORT_29 VAL [bad_18_arg_0=0, mask_SORT_22=2147483647, mask_SORT_29=1073741823, mask_SORT_37=268435455, mask_SORT_3=1, mask_SORT_45=16777215, mask_SORT_53=65535, mask_SORT_5=-1, var_10=2863311530, var_15=1, var_27=4294901760, var_30=1073725440, var_32=4294901760, var_34=0, var_42=0, var_50=0, var_57=0] [L126] EXPR var_30 & mask_SORT_29 [L126] EXPR var_30 & mask_SORT_29 VAL [bad_18_arg_0=0, mask_SORT_22=2147483647, mask_SORT_29=1073741823, mask_SORT_37=268435455, mask_SORT_3=1, mask_SORT_45=16777215, mask_SORT_53=65535, mask_SORT_5=-1, var_10=2863311530, var_15=1, var_27=4294901760, var_32=4294901760, var_34=0, var_42=0, var_50=0, var_57=0] [L126] var_30 = var_30 & mask_SORT_29 [L127] SORT_31 var_33_arg_0 = var_32; [L128] SORT_29 var_33_arg_1 = var_30; VAL [bad_18_arg_0=0, mask_SORT_22=2147483647, mask_SORT_29=1073741823, mask_SORT_37=268435455, mask_SORT_3=1, mask_SORT_45=16777215, mask_SORT_53=65535, mask_SORT_5=-1, var_10=2863311530, var_15=1, var_27=4294901760, var_33_arg_0=4294901760, var_33_arg_1=1073725439, var_34=0, var_42=0, var_50=0, var_57=0] [L129] EXPR ((SORT_5)var_33_arg_0 << 30) | var_33_arg_1 [L129] EXPR ((SORT_5)var_33_arg_0 << 30) | var_33_arg_1 VAL [bad_18_arg_0=0, mask_SORT_22=2147483647, mask_SORT_29=1073741823, mask_SORT_37=268435455, mask_SORT_3=1, mask_SORT_45=16777215, mask_SORT_53=65535, mask_SORT_5=-1, var_10=2863311530, var_15=1, var_27=4294901760, var_34=0, var_42=0, var_50=0, var_57=0] [L129] SORT_5 var_33 = ((SORT_5)var_33_arg_0 << 30) | var_33_arg_1; [L130] SORT_3 var_35_arg_0 = var_34; [L131] SORT_5 var_35_arg_1 = var_33; [L132] SORT_5 var_35_arg_2 = var_27; [L133] SORT_5 var_35 = var_35_arg_0 ? var_35_arg_1 : var_35_arg_2; [L134] SORT_5 var_40_arg_0 = var_35; [L135] SORT_39 var_40 = var_40_arg_0 >> 0; [L136] SORT_5 var_38_arg_0 = var_35; [L137] SORT_37 var_38 = var_38_arg_0 >> 4; VAL [bad_18_arg_0=0, mask_SORT_22=2147483647, mask_SORT_29=1073741823, mask_SORT_37=268435455, mask_SORT_3=1, mask_SORT_45=16777215, mask_SORT_53=65535, mask_SORT_5=-1, var_10=2863311530, var_15=1, var_35=4294901760, var_38=268431360, var_40=4294901760, var_42=0, var_50=0, var_57=0] [L138] EXPR var_38 & mask_SORT_37 VAL [bad_18_arg_0=0, mask_SORT_22=2147483647, mask_SORT_29=1073741823, mask_SORT_37=268435455, mask_SORT_3=1, mask_SORT_45=16777215, mask_SORT_53=65535, mask_SORT_5=-1, var_10=2863311530, var_15=1, var_35=4294901760, var_38=268431360, var_40=4294901760, var_42=0, var_50=0, var_57=0] [L138] EXPR var_38 & mask_SORT_37 [L138] EXPR var_38 & mask_SORT_37 VAL [bad_18_arg_0=0, mask_SORT_22=2147483647, mask_SORT_29=1073741823, mask_SORT_37=268435455, mask_SORT_3=1, mask_SORT_45=16777215, mask_SORT_53=65535, mask_SORT_5=-1, var_10=2863311530, var_15=1, var_35=4294901760, var_40=4294901760, var_42=0, var_50=0, var_57=0] [L138] var_38 = var_38 & mask_SORT_37 [L139] SORT_39 var_41_arg_0 = var_40; [L140] SORT_37 var_41_arg_1 = var_38; VAL [bad_18_arg_0=0, mask_SORT_22=2147483647, mask_SORT_29=1073741823, mask_SORT_37=268435455, mask_SORT_3=1, mask_SORT_45=16777215, mask_SORT_53=65535, mask_SORT_5=-1, var_10=2863311530, var_15=1, var_35=4294901760, var_41_arg_0=4294901760, var_41_arg_1=-4294967296, var_42=0, var_50=0, var_57=0] [L141] EXPR ((SORT_5)var_41_arg_0 << 28) | var_41_arg_1 [L141] EXPR ((SORT_5)var_41_arg_0 << 28) | var_41_arg_1 VAL [bad_18_arg_0=0, mask_SORT_22=2147483647, mask_SORT_29=1073741823, mask_SORT_37=268435455, mask_SORT_3=1, mask_SORT_45=16777215, mask_SORT_53=65535, mask_SORT_5=-1, var_10=2863311530, var_15=1, var_35=4294901760, var_42=0, var_50=0, var_57=0] [L141] SORT_5 var_41 = ((SORT_5)var_41_arg_0 << 28) | var_41_arg_1; [L142] SORT_3 var_43_arg_0 = var_42; [L143] SORT_5 var_43_arg_1 = var_41; [L144] SORT_5 var_43_arg_2 = var_35; [L145] SORT_5 var_43 = var_43_arg_0 ? var_43_arg_1 : var_43_arg_2; [L146] SORT_5 var_48_arg_0 = var_43; [L147] SORT_47 var_48 = var_48_arg_0 >> 0; [L148] SORT_5 var_46_arg_0 = var_43; [L149] SORT_45 var_46 = var_46_arg_0 >> 8; VAL [bad_18_arg_0=0, mask_SORT_22=2147483647, mask_SORT_29=1073741823, mask_SORT_37=268435455, mask_SORT_3=1, mask_SORT_45=16777215, mask_SORT_53=65535, mask_SORT_5=-1, var_10=2863311530, var_15=1, var_43=4294901760, var_46=16776960, var_48=4294901760, var_50=0, var_57=0] [L150] EXPR var_46 & mask_SORT_45 VAL [bad_18_arg_0=0, mask_SORT_22=2147483647, mask_SORT_29=1073741823, mask_SORT_37=268435455, mask_SORT_3=1, mask_SORT_45=16777215, mask_SORT_53=65535, mask_SORT_5=-1, var_10=2863311530, var_15=1, var_43=4294901760, var_46=16776960, var_48=4294901760, var_50=0, var_57=0] [L150] EXPR var_46 & mask_SORT_45 [L150] EXPR var_46 & mask_SORT_45 VAL [bad_18_arg_0=0, mask_SORT_22=2147483647, mask_SORT_29=1073741823, mask_SORT_37=268435455, mask_SORT_3=1, mask_SORT_45=16777215, mask_SORT_53=65535, mask_SORT_5=-1, var_10=2863311530, var_15=1, var_43=4294901760, var_48=4294901760, var_50=0, var_57=0] [L150] var_46 = var_46 & mask_SORT_45 [L151] SORT_47 var_49_arg_0 = var_48; [L152] SORT_45 var_49_arg_1 = var_46; VAL [bad_18_arg_0=0, mask_SORT_22=2147483647, mask_SORT_29=1073741823, mask_SORT_37=268435455, mask_SORT_3=1, mask_SORT_45=16777215, mask_SORT_53=65535, mask_SORT_5=-1, var_10=2863311530, var_15=1, var_43=4294901760, var_49_arg_0=4294901760, var_49_arg_1=4294967297, var_50=0, var_57=0] [L153] EXPR ((SORT_5)var_49_arg_0 << 24) | var_49_arg_1 [L153] EXPR ((SORT_5)var_49_arg_0 << 24) | var_49_arg_1 VAL [bad_18_arg_0=0, mask_SORT_22=2147483647, mask_SORT_29=1073741823, mask_SORT_37=268435455, mask_SORT_3=1, mask_SORT_45=16777215, mask_SORT_53=65535, mask_SORT_5=-1, var_10=2863311530, var_15=1, var_43=4294901760, var_50=0, var_57=0] [L153] SORT_5 var_49 = ((SORT_5)var_49_arg_0 << 24) | var_49_arg_1; [L154] SORT_3 var_51_arg_0 = var_50; [L155] SORT_5 var_51_arg_1 = var_49; [L156] SORT_5 var_51_arg_2 = var_43; [L157] SORT_5 var_51 = var_51_arg_0 ? var_51_arg_1 : var_51_arg_2; [L158] SORT_5 var_55_arg_0 = var_51; [L159] SORT_53 var_55 = var_55_arg_0 >> 0; [L160] SORT_5 var_54_arg_0 = var_51; [L161] SORT_53 var_54 = var_54_arg_0 >> 16; VAL [bad_18_arg_0=0, mask_SORT_22=2147483647, mask_SORT_29=1073741823, mask_SORT_37=268435455, mask_SORT_3=1, mask_SORT_45=16777215, mask_SORT_53=65535, mask_SORT_5=-1, var_10=2863311530, var_15=1, var_51=4294901760, var_54=65535, var_55=4294901760, var_57=0] [L162] EXPR var_54 & mask_SORT_53 VAL [bad_18_arg_0=0, mask_SORT_22=2147483647, mask_SORT_29=1073741823, mask_SORT_37=268435455, mask_SORT_3=1, mask_SORT_45=16777215, mask_SORT_53=65535, mask_SORT_5=-1, var_10=2863311530, var_15=1, var_51=4294901760, var_54=65535, var_55=4294901760, var_57=0] [L162] EXPR var_54 & mask_SORT_53 [L162] EXPR var_54 & mask_SORT_53 VAL [bad_18_arg_0=0, mask_SORT_22=2147483647, mask_SORT_29=1073741823, mask_SORT_37=268435455, mask_SORT_3=1, mask_SORT_45=16777215, mask_SORT_53=65535, mask_SORT_5=-1, var_10=2863311530, var_15=1, var_51=4294901760, var_55=4294901760, var_57=0] [L162] var_54 = var_54 & mask_SORT_53 [L163] SORT_53 var_56_arg_0 = var_55; [L164] SORT_53 var_56_arg_1 = var_54; VAL [bad_18_arg_0=0, mask_SORT_22=2147483647, mask_SORT_29=1073741823, mask_SORT_37=268435455, mask_SORT_3=1, mask_SORT_45=16777215, mask_SORT_53=65535, mask_SORT_5=-1, var_10=2863311530, var_15=1, var_51=4294901760, var_56_arg_0=4294901760, var_56_arg_1=65535, var_57=0] [L165] EXPR ((SORT_5)var_56_arg_0 << 16) | var_56_arg_1 [L165] EXPR ((SORT_5)var_56_arg_0 << 16) | var_56_arg_1 VAL [bad_18_arg_0=0, mask_SORT_22=2147483647, mask_SORT_29=1073741823, mask_SORT_37=268435455, mask_SORT_3=1, mask_SORT_45=16777215, mask_SORT_53=65535, mask_SORT_5=-1, var_10=2863311530, var_15=1, var_51=4294901760, var_57=0] [L165] SORT_5 var_56 = ((SORT_5)var_56_arg_0 << 16) | var_56_arg_1; [L166] SORT_3 var_58_arg_0 = var_57; [L167] SORT_5 var_58_arg_1 = var_56; [L168] SORT_5 var_58_arg_2 = var_51; [L169] SORT_5 var_58 = var_58_arg_0 ? var_58_arg_1 : var_58_arg_2; VAL [bad_18_arg_0=0, mask_SORT_22=2147483647, mask_SORT_29=1073741823, mask_SORT_37=268435455, mask_SORT_3=1, mask_SORT_45=16777215, mask_SORT_53=65535, mask_SORT_5=-1, var_10=2863311530, var_15=1, var_58=4294901760] [L170] EXPR var_58 & mask_SORT_5 VAL [bad_18_arg_0=0, mask_SORT_22=2147483647, mask_SORT_29=1073741823, mask_SORT_37=268435455, mask_SORT_3=1, mask_SORT_45=16777215, mask_SORT_53=65535, mask_SORT_5=-1, var_10=2863311530, var_15=1, var_58=4294901760] [L170] EXPR var_58 & mask_SORT_5 [L170] EXPR var_58 & mask_SORT_5 VAL [bad_18_arg_0=0, mask_SORT_22=2147483647, mask_SORT_29=1073741823, mask_SORT_37=268435455, mask_SORT_3=1, mask_SORT_45=16777215, mask_SORT_53=65535, mask_SORT_5=-1, var_10=2863311530, var_15=1] [L170] var_58 = var_58 & mask_SORT_5 [L171] SORT_5 next_60_arg_1 = var_58; [L172] SORT_5 next_61_arg_1 = input_6; [L174] state_8 = next_60_arg_1 [L175] state_19 = next_61_arg_1 [L76] input_2 = __VERIFIER_nondet_uchar() [L77] input_4 = __VERIFIER_nondet_uchar() [L78] input_6 = __VERIFIER_nondet_uint() [L81] SORT_5 var_11_arg_0 = state_8; [L82] SORT_5 var_11_arg_1 = var_10; [L83] SORT_3 var_11 = var_11_arg_0 == var_11_arg_1; [L84] SORT_3 var_12_arg_0 = var_11; [L85] SORT_3 var_12 = ~var_12_arg_0; [L86] SORT_3 var_16_arg_0 = var_12; [L87] SORT_3 var_16 = ~var_16_arg_0; [L88] SORT_3 var_17_arg_0 = var_15; [L89] SORT_3 var_17_arg_1 = var_16; VAL [mask_SORT_22=2147483647, mask_SORT_29=1073741823, mask_SORT_37=268435455, mask_SORT_3=1, mask_SORT_45=16777215, mask_SORT_53=65535, mask_SORT_5=-1, state_19=4294967299, var_10=2863311530, var_15=1, var_17_arg_0=1, var_17_arg_1=-255] [L90] EXPR var_17_arg_0 & var_17_arg_1 VAL [mask_SORT_22=2147483647, mask_SORT_29=1073741823, mask_SORT_37=268435455, mask_SORT_3=1, mask_SORT_45=16777215, mask_SORT_53=65535, mask_SORT_5=-1, state_19=4294967299, var_10=2863311530, var_15=1, var_17_arg_0=1, var_17_arg_1=-255] [L90] EXPR var_17_arg_0 & var_17_arg_1 [L90] EXPR var_17_arg_0 & var_17_arg_1 VAL [mask_SORT_22=2147483647, mask_SORT_29=1073741823, mask_SORT_37=268435455, mask_SORT_3=1, mask_SORT_45=16777215, mask_SORT_53=65535, mask_SORT_5=-1, state_19=4294967299, var_10=2863311530, var_15=1] [L90] SORT_3 var_17 = var_17_arg_0 & var_17_arg_1; [L91] EXPR var_17 & mask_SORT_3 VAL [mask_SORT_22=2147483647, mask_SORT_29=1073741823, mask_SORT_37=268435455, mask_SORT_3=1, mask_SORT_45=16777215, mask_SORT_53=65535, mask_SORT_5=-1, state_19=4294967299, var_10=2863311530, var_15=1, var_17=1] [L91] EXPR var_17 & mask_SORT_3 [L91] EXPR var_17 & mask_SORT_3 VAL [mask_SORT_22=2147483647, mask_SORT_29=1073741823, mask_SORT_37=268435455, mask_SORT_3=1, mask_SORT_45=16777215, mask_SORT_53=65535, mask_SORT_5=-1, state_19=4294967299, var_10=2863311530, var_15=1] [L91] var_17 = var_17 & mask_SORT_3 [L92] SORT_3 bad_18_arg_0 = var_17; VAL [bad_18_arg_0=1, mask_SORT_22=2147483647, mask_SORT_29=1073741823, mask_SORT_37=268435455, mask_SORT_3=1, mask_SORT_45=16777215, mask_SORT_53=65535, mask_SORT_5=-1, state_19=4294967299, var_10=2863311530, var_15=1] [L93] CALL __VERIFIER_assert(!(bad_18_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, 88 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 289.6s, OverallIterations: 39, TraceHistogramMax: 3, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.1s, AutomataDifference: 79.0s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.2s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 9922 SdHoareTripleChecker+Valid, 47.3s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 9912 mSDsluCounter, 41760 SdHoareTripleChecker+Invalid, 43.9s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 37649 mSDsCounter, 227 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 23478 IncrementalHoareTripleChecker+Invalid, 23705 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 227 mSolverCounterUnsat, 4111 mSDtfsCounter, 23478 mSolverCounterSat, 0.3s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 5704 GetRequests, 4390 SyntacticMatches, 8 SemanticMatches, 1306 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 18425 ImplicationChecksByTransitivity, 133.6s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=2710occurred in iteration=28, InterpolantAutomatonStates: 707, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 1.0s AutomataMinimizationTime, 38 MinimizatonAttempts, 5309 StatesRemovedByMinimization, 31 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 1.0s SsaConstructionTime, 6.4s SatisfiabilityAnalysisTime, 190.6s InterpolantComputationTime, 7001 NumberOfCodeBlocks, 7001 NumberOfCodeBlocksAsserted, 63 NumberOfCheckSat, 8477 ConstructedInterpolants, 22 QuantifiedInterpolants, 90207 SizeOfPredicates, 88 NumberOfNonLiveVariables, 15216 ConjunctsInSsa, 1378 ConjunctsInUnsatCore, 77 InterpolantComputations, 25 PerfectInterpolantSequences, 4036/4543 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:27:35,031 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 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_rotate32.c ./svcomp-yaml-violation-generation.2024-08-01_14-26-22.files/Default/btor2c-lazyMod.vis_QF_BV_rotate32.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:27:37,320 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-08-15 18:27:37,404 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-64bit-Automizer_Bitvector.epf [2024-08-15 18:27:37,410 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-08-15 18:27:37,411 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-08-15 18:27:37,444 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-08-15 18:27:37,445 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-08-15 18:27:37,445 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-08-15 18:27:37,446 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-08-15 18:27:37,446 INFO L153 SettingsManager]: * Use memory slicer=true [2024-08-15 18:27:37,446 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-08-15 18:27:37,447 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-08-15 18:27:37,448 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-08-15 18:27:37,450 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-08-15 18:27:37,450 INFO L153 SettingsManager]: * Use SBE=true [2024-08-15 18:27:37,451 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-08-15 18:27:37,451 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-08-15 18:27:37,451 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-08-15 18:27:37,451 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-08-15 18:27:37,452 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-08-15 18:27:37,452 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-08-15 18:27:37,456 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2024-08-15 18:27:37,456 INFO L153 SettingsManager]: * Use bitvectors instead of ints=true [2024-08-15 18:27:37,456 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-08-15 18:27:37,457 INFO L153 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2024-08-15 18:27:37,457 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-08-15 18:27:37,457 INFO L153 SettingsManager]: * Use constant arrays=true [2024-08-15 18:27:37,457 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-08-15 18:27:37,458 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-08-15 18:27:37,458 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-08-15 18:27:37,458 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-08-15 18:27:37,458 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-08-15 18:27:37,459 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-08-15 18:27:37,459 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-08-15 18:27:37,459 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-08-15 18:27:37,459 INFO L153 SettingsManager]: * Trace refinement strategy=WOLF [2024-08-15 18:27:37,460 INFO L153 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2024-08-15 18:27:37,460 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-08-15 18:27:37,460 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-08-15 18:27:37,460 INFO L153 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2024-08-15 18:27:37,460 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-08-15 18:27:37,461 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-08-15 18:27:37,461 INFO L153 SettingsManager]: * Logic for external solver=AUFBV [2024-08-15 18:27:37,461 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:27:37,802 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-08-15 18:27:37,831 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-08-15 18:27:37,834 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-08-15 18:27:37,836 INFO L270 PluginConnector]: Initializing CDTParser... [2024-08-15 18:27:37,836 INFO L274 PluginConnector]: CDTParser initialized [2024-08-15 18:27:37,838 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_rotate32.c [2024-08-15 18:27:39,446 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-08-15 18:27:39,668 INFO L384 CDTParser]: Found 1 translation units. [2024-08-15 18:27:39,669 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/hardware-verification-bv/btor2c-lazyMod.vis_QF_BV_rotate32.c [2024-08-15 18:27:39,681 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/e19674e5c/067033c4a9e04a92b8b21d9f708b9574/FLAGfd2d1c4a2 [2024-08-15 18:27:40,018 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/e19674e5c/067033c4a9e04a92b8b21d9f708b9574 [2024-08-15 18:27:40,022 INFO L270 PluginConnector]: Initializing Witness Parser... [2024-08-15 18:27:40,023 INFO L274 PluginConnector]: Witness Parser initialized [2024-08-15 18:27:40,024 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_rotate32.yml/witness.yml [2024-08-15 18:27:40,098 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-08-15 18:27:40,099 INFO L133 ToolchainWalker]: Walking toolchain with 4 elements. [2024-08-15 18:27:40,102 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-08-15 18:27:40,103 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-08-15 18:27:40,107 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-08-15 18:27:40,108 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 15.08 06:27:40" (1/2) ... [2024-08-15 18:27:40,109 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@1de08344 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.08 06:27:40, skipping insertion in model container [2024-08-15 18:27:40,109 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 15.08 06:27:40" (1/2) ... [2024-08-15 18:27:40,111 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.CACSL2BoogieTranslatorObserver@32690514 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.08 06:27:40, skipping insertion in model container [2024-08-15 18:27:40,111 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "witness.yml de.uni_freiburg.informatik.ultimate.witnessparser VIOLATION_WITNESS 15.08 06:27:40" (2/2) ... [2024-08-15 18:27:40,111 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@1de08344 and model type witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator VIOLATION_WITNESS 15.08 06:27:40, skipping insertion in model container [2024-08-15 18:27:40,112 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "witness.yml de.uni_freiburg.informatik.ultimate.witnessparser VIOLATION_WITNESS 15.08 06:27:40" (2/2) ... [2024-08-15 18:27:40,143 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-08-15 18:27:40,309 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_rotate32.c[1258,1271] [2024-08-15 18:27:40,403 INFO L207 PostProcessor]: Analyzing one entry point: main [2024-08-15 18:27:40,423 INFO L200 MainTranslator]: Completed pre-run [2024-08-15 18:27:40,433 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_rotate32.c[1258,1271] [2024-08-15 18:27:40,480 INFO L207 PostProcessor]: Analyzing one entry point: main [2024-08-15 18:27:40,508 INFO L204 MainTranslator]: Completed translation [2024-08-15 18:27:40,509 INFO L201 PluginConnector]: Adding new model witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator VIOLATION_WITNESS 15.08 06:27:40 WrapperNode [2024-08-15 18:27:40,509 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-08-15 18:27:40,510 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-08-15 18:27:40,510 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-08-15 18:27:40,511 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-08-15 18:27:40,524 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:27:40" (1/1) ... [2024-08-15 18:27:40,524 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:27:40" (1/1) ... [2024-08-15 18:27:40,539 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:27:40" (1/1) ... [2024-08-15 18:27:40,561 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:27:40,561 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:27:40" (1/1) ... [2024-08-15 18:27:40,561 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:27:40" (1/1) ... [2024-08-15 18:27:40,570 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:27:40" (1/1) ... [2024-08-15 18:27:40,572 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:27:40" (1/1) ... [2024-08-15 18:27:40,578 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:27:40" (1/1) ... [2024-08-15 18:27:40,584 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-08-15 18:27:40,585 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2024-08-15 18:27:40,585 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2024-08-15 18:27:40,585 INFO L274 PluginConnector]: IcfgBuilder initialized [2024-08-15 18:27:40,586 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:27:40" (1/1) ... [2024-08-15 18:27:40,596 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-08-15 18:27:40,608 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-08-15 18:27:40,627 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:27:40,631 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:27:40,675 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2024-08-15 18:27:40,675 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-08-15 18:27:40,675 INFO L138 BoogieDeclarations]: Found implementation of procedure reach_error [2024-08-15 18:27:40,676 INFO L138 BoogieDeclarations]: Found implementation of procedure __VERIFIER_assert [2024-08-15 18:27:40,676 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2024-08-15 18:27:40,676 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2024-08-15 18:27:40,676 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_uchar [2024-08-15 18:27:40,676 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_ushort [2024-08-15 18:27:40,676 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_uint [2024-08-15 18:27:40,676 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_ulong [2024-08-15 18:27:40,676 INFO L130 BoogieDeclarations]: Found specification of procedure abort [2024-08-15 18:27:40,677 INFO L130 BoogieDeclarations]: Found specification of procedure __assert_fail [2024-08-15 18:27:40,677 INFO L130 BoogieDeclarations]: Found specification of procedure reach_error [2024-08-15 18:27:40,677 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-08-15 18:27:40,677 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2024-08-15 18:27:40,677 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2024-08-15 18:27:40,677 INFO L130 BoogieDeclarations]: Found specification of procedure main [2024-08-15 18:27:40,677 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2024-08-15 18:27:40,677 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#0 [2024-08-15 18:27:40,678 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-08-15 18:27:40,678 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE1#0 [2024-08-15 18:27:40,678 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE1#0 [2024-08-15 18:27:40,678 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2024-08-15 18:27:40,778 INFO L273 CfgBuilder]: Building ICFG [2024-08-15 18:27:40,781 INFO L304 CfgBuilder]: Building CFG for each procedure with an implementation [2024-08-15 18:27:41,146 INFO L? ?]: Removed 35 outVars from TransFormulas that were not future-live. [2024-08-15 18:27:41,147 INFO L327 CfgBuilder]: Performing block encoding [2024-08-15 18:27:41,159 INFO L349 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-08-15 18:27:41,161 INFO L354 CfgBuilder]: Removed 0 assume(true) statements. [2024-08-15 18:27:41,162 INFO L201 PluginConnector]: Adding new model witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 15.08 06:27:41 BoogieIcfgContainer [2024-08-15 18:27:41,162 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2024-08-15 18:27:41,164 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-08-15 18:27:41,165 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-08-15 18:27:41,168 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-08-15 18:27:41,169 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 15.08 06:27:40" (1/4) ... [2024-08-15 18:27:41,169 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3d725c0b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 15.08 06:27:41, skipping insertion in model container [2024-08-15 18:27:41,169 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "witness.yml de.uni_freiburg.informatik.ultimate.witnessparser VIOLATION_WITNESS 15.08 06:27:40" (2/4) ... [2024-08-15 18:27:41,170 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:27:41,171 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3d725c0b and model type witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction VIOLATION_WITNESS 15.08 06:27:41, skipping insertion in model container [2024-08-15 18:27:41,173 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:27:40" (3/4) ... [2024-08-15 18:27:41,173 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3d725c0b and model type witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction VIOLATION_WITNESS 15.08 06:27:41, skipping insertion in model container [2024-08-15 18:27:41,173 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:27:41" (4/4) ... [2024-08-15 18:27:41,174 INFO L128 eAbstractionObserver]: Analyzing ICFG btor2c-lazyMod.vis_QF_BV_rotate32.c [2024-08-15 18:27:41,193 INFO L201 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-08-15 18:27:41,194 INFO L160 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-08-15 18:27:41,227 INFO L90 WitnessUtils]: Constructing product of automaton with 21 states and violation witness of the following lengths: [9] [2024-08-15 18:27:41,277 INFO L95 WitnessUtils]: Product has 91 reachable states. [2024-08-15 18:27:41,300 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-08-15 18:27:41,309 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;@e4f8a2f, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-08-15 18:27:41,310 INFO L358 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-08-15 18:27:41,313 INFO L276 IsEmpty]: Start isEmpty. Operand 91 states and 103 transitions. [2024-08-15 18:27:41,321 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2024-08-15 18:27:41,322 INFO L187 NwaCegarLoop]: Found error trace [2024-08-15 18:27:41,323 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1] [2024-08-15 18:27:41,323 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-08-15 18:27:41,329 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-08-15 18:27:41,330 INFO L85 PathProgramCache]: Analyzing trace with hash 2090759925, now seen corresponding path program 1 times [2024-08-15 18:27:41,345 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-08-15 18:27:41,346 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1062983412] [2024-08-15 18:27:41,346 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-08-15 18:27:41,347 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:27:41,347 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-08-15 18:27:41,350 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:27:41,352 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (2)] Waiting until timeout for monitored process [2024-08-15 18:27:41,542 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-08-15 18:27:41,542 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-08-15 18:27:41,633 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-08-15 18:27:41,705 INFO L130 FreeRefinementEngine]: Strategy WOLF found a feasible trace [2024-08-15 18:27:41,707 INFO L360 BasicCegarLoop]: Counterexample is feasible [2024-08-15 18:27:41,709 INFO L805 garLoopResultBuilder]: Registering result UNSAFE for location __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2024-08-15 18:27:41,717 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:27:41,911 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:27:41,917 INFO L445 BasicCegarLoop]: Path program histogram: [1] [2024-08-15 18:27:41,921 INFO L176 ceAbstractionStarter]: Computing trace abstraction results [2024-08-15 18:27:41,955 INFO L201 PluginConnector]: Adding new model witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 15.08 06:27:41 BoogieIcfgContainer [2024-08-15 18:27:41,955 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2024-08-15 18:27:41,956 INFO L158 Benchmark]: Toolchain (without parser) took 1857.08ms. Allocated memory was 60.8MB in the beginning and 75.5MB in the end (delta: 14.7MB). Free memory was 34.5MB in the beginning and 45.6MB in the end (delta: -11.2MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. [2024-08-15 18:27:41,957 INFO L158 Benchmark]: CDTParser took 0.20ms. Allocated memory is still 60.8MB. Free memory was 37.2MB in the beginning and 37.1MB in the end (delta: 73.4kB). There was no memory consumed. Max. memory is 16.1GB. [2024-08-15 18:27:41,957 INFO L158 Benchmark]: Witness Parser took 0.09ms. Allocated memory is still 60.8MB. Free memory is still 36.6MB. There was no memory consumed. Max. memory is 16.1GB. [2024-08-15 18:27:41,957 INFO L158 Benchmark]: CACSL2BoogieTranslator took 407.15ms. Allocated memory was 60.8MB in the beginning and 75.5MB in the end (delta: 14.7MB). Free memory was 34.3MB in the beginning and 50.8MB in the end (delta: -16.5MB). Peak memory consumption was 11.5MB. Max. memory is 16.1GB. [2024-08-15 18:27:41,958 INFO L158 Benchmark]: Boogie Preprocessor took 74.05ms. Allocated memory is still 75.5MB. Free memory was 50.8MB in the beginning and 47.9MB in the end (delta: 2.8MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2024-08-15 18:27:41,958 INFO L158 Benchmark]: IcfgBuilder took 577.25ms. Allocated memory is still 75.5MB. Free memory was 47.9MB in the beginning and 48.3MB in the end (delta: -365.9kB). Peak memory consumption was 21.0MB. Max. memory is 16.1GB. [2024-08-15 18:27:41,959 INFO L158 Benchmark]: TraceAbstraction took 790.64ms. Allocated memory is still 75.5MB. Free memory was 47.8MB in the beginning and 45.6MB in the end (delta: 2.1MB). Peak memory consumption was 1.3MB. Max. memory is 16.1GB. [2024-08-15 18:27:41,961 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.20ms. Allocated memory is still 60.8MB. Free memory was 37.2MB in the beginning and 37.1MB in the end (delta: 73.4kB). There was no memory consumed. Max. memory is 16.1GB. * Witness Parser took 0.09ms. Allocated memory is still 60.8MB. Free memory is still 36.6MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 407.15ms. Allocated memory was 60.8MB in the beginning and 75.5MB in the end (delta: 14.7MB). Free memory was 34.3MB in the beginning and 50.8MB in the end (delta: -16.5MB). Peak memory consumption was 11.5MB. Max. memory is 16.1GB. * Boogie Preprocessor took 74.05ms. Allocated memory is still 75.5MB. Free memory was 50.8MB in the beginning and 47.9MB in the end (delta: 2.8MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * IcfgBuilder took 577.25ms. Allocated memory is still 75.5MB. Free memory was 47.9MB in the beginning and 48.3MB in the end (delta: -365.9kB). Peak memory consumption was 21.0MB. Max. memory is 16.1GB. * TraceAbstraction took 790.64ms. Allocated memory is still 75.5MB. Free memory was 47.8MB in the beginning and 45.6MB in the end (delta: 2.1MB). Peak memory consumption was 1.3MB. 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 - 5); [L27] const SORT_1 msb_SORT_1 = (SORT_1)1 << (5 - 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_5 mask_SORT_5 = (SORT_5)-1 >> (sizeof(SORT_5) * 8 - 32); [L33] const SORT_5 msb_SORT_5 = (SORT_5)1 << (32 - 1); [L35] const SORT_22 mask_SORT_22 = (SORT_22)-1 >> (sizeof(SORT_22) * 8 - 31); [L36] const SORT_22 msb_SORT_22 = (SORT_22)1 << (31 - 1); [L38] const SORT_29 mask_SORT_29 = (SORT_29)-1 >> (sizeof(SORT_29) * 8 - 30); [L39] const SORT_29 msb_SORT_29 = (SORT_29)1 << (30 - 1); [L41] const SORT_31 mask_SORT_31 = (SORT_31)-1 >> (sizeof(SORT_31) * 8 - 2); [L42] const SORT_31 msb_SORT_31 = (SORT_31)1 << (2 - 1); [L44] const SORT_37 mask_SORT_37 = (SORT_37)-1 >> (sizeof(SORT_37) * 8 - 28); [L45] const SORT_37 msb_SORT_37 = (SORT_37)1 << (28 - 1); [L47] const SORT_39 mask_SORT_39 = (SORT_39)-1 >> (sizeof(SORT_39) * 8 - 4); [L48] const SORT_39 msb_SORT_39 = (SORT_39)1 << (4 - 1); [L50] const SORT_45 mask_SORT_45 = (SORT_45)-1 >> (sizeof(SORT_45) * 8 - 24); [L51] const SORT_45 msb_SORT_45 = (SORT_45)1 << (24 - 1); [L53] const SORT_47 mask_SORT_47 = (SORT_47)-1 >> (sizeof(SORT_47) * 8 - 8); [L54] const SORT_47 msb_SORT_47 = (SORT_47)1 << (8 - 1); [L56] const SORT_53 mask_SORT_53 = (SORT_53)-1 >> (sizeof(SORT_53) * 8 - 16); [L57] const SORT_53 msb_SORT_53 = (SORT_53)1 << (16 - 1); [L59] const SORT_5 var_7 = 0; [L60] const SORT_5 var_10 = 2863311530; [L61] const SORT_3 var_15 = 1; [L63] SORT_1 input_2; [L64] SORT_3 input_4; [L65] SORT_5 input_6; [L67] SORT_5 state_8 = __VERIFIER_nondet_uint() & mask_SORT_5; [L68] SORT_5 state_19 = __VERIFIER_nondet_uint() & mask_SORT_5; [L70] SORT_5 init_9_arg_1 = var_7; [L71] state_8 = init_9_arg_1 [L72] SORT_5 init_20_arg_1 = var_7; [L73] state_19 = init_20_arg_1 VAL [mask_SORT_22=2147483647, mask_SORT_29=1073741823, mask_SORT_37=268435455, mask_SORT_3=1, mask_SORT_45=16777215, mask_SORT_53=-1, mask_SORT_5=-1, state_19=0, state_8=0, var_10=-1431655766, var_15=1] [L76] input_2 = __VERIFIER_nondet_uchar() [L77] input_4 = __VERIFIER_nondet_uchar() [L78] input_6 = __VERIFIER_nondet_uint() [L81] SORT_5 var_11_arg_0 = state_8; [L82] SORT_5 var_11_arg_1 = var_10; [L83] SORT_3 var_11 = var_11_arg_0 == var_11_arg_1; [L84] SORT_3 var_12_arg_0 = var_11; [L85] SORT_3 var_12 = ~var_12_arg_0; [L86] SORT_3 var_16_arg_0 = var_12; [L87] SORT_3 var_16 = ~var_16_arg_0; [L88] SORT_3 var_17_arg_0 = var_15; [L89] SORT_3 var_17_arg_1 = var_16; [L90] SORT_3 var_17 = var_17_arg_0 & var_17_arg_1; [L91] var_17 = var_17 & mask_SORT_3 [L92] SORT_3 bad_18_arg_0 = var_17; VAL [bad_18_arg_0=0, mask_SORT_22=2147483647, mask_SORT_29=1073741823, mask_SORT_37=268435455, mask_SORT_3=1, mask_SORT_45=16777215, mask_SORT_53=-1, mask_SORT_5=-1, state_19=0, var_10=-1431655766, var_15=1] [L93] CALL __VERIFIER_assert(!(bad_18_arg_0)) VAL [\old(cond)=1] [L21] COND FALSE !(!(cond)) VAL [\old(cond)=1] [L93] RET __VERIFIER_assert(!(bad_18_arg_0)) VAL [bad_18_arg_0=0, mask_SORT_22=2147483647, mask_SORT_29=1073741823, mask_SORT_37=268435455, mask_SORT_3=1, mask_SORT_45=16777215, mask_SORT_53=-1, mask_SORT_5=-1, state_19=0, var_10=-1431655766, var_15=1] [L95] SORT_1 var_57_arg_0 = input_2; [L96] SORT_3 var_57 = var_57_arg_0 >> 4; [L97] var_57 = var_57 & mask_SORT_3 [L98] SORT_1 var_50_arg_0 = input_2; [L99] SORT_3 var_50 = var_50_arg_0 >> 3; [L100] var_50 = var_50 & mask_SORT_3 [L101] SORT_1 var_42_arg_0 = input_2; [L102] SORT_3 var_42 = var_42_arg_0 >> 2; [L103] var_42 = var_42 & mask_SORT_3 [L104] SORT_1 var_34_arg_0 = input_2; [L105] SORT_3 var_34 = var_34_arg_0 >> 1; [L106] var_34 = var_34 & mask_SORT_3 [L107] SORT_1 var_26_arg_0 = input_2; [L108] SORT_3 var_26 = var_26_arg_0 >> 0; [L109] var_26 = var_26 & mask_SORT_3 [L110] SORT_5 var_24_arg_0 = state_19; [L111] SORT_3 var_24 = var_24_arg_0 >> 0; [L112] SORT_5 var_23_arg_0 = state_19; [L113] SORT_22 var_23 = var_23_arg_0 >> 1; [L114] var_23 = var_23 & mask_SORT_22 [L115] SORT_3 var_25_arg_0 = var_24; [L116] SORT_22 var_25_arg_1 = var_23; [L117] SORT_5 var_25 = ((SORT_5)var_25_arg_0 << 31) | var_25_arg_1; [L118] SORT_3 var_27_arg_0 = var_26; [L119] SORT_5 var_27_arg_1 = var_25; [L120] SORT_5 var_27_arg_2 = state_19; [L121] SORT_5 var_27 = var_27_arg_0 ? var_27_arg_1 : var_27_arg_2; [L122] SORT_5 var_32_arg_0 = var_27; [L123] SORT_31 var_32 = var_32_arg_0 >> 0; [L124] SORT_5 var_30_arg_0 = var_27; [L125] SORT_29 var_30 = var_30_arg_0 >> 2; [L126] var_30 = var_30 & mask_SORT_29 [L127] SORT_31 var_33_arg_0 = var_32; [L128] SORT_29 var_33_arg_1 = var_30; [L129] SORT_5 var_33 = ((SORT_5)var_33_arg_0 << 30) | var_33_arg_1; [L130] SORT_3 var_35_arg_0 = var_34; [L131] SORT_5 var_35_arg_1 = var_33; [L132] SORT_5 var_35_arg_2 = var_27; [L133] SORT_5 var_35 = var_35_arg_0 ? var_35_arg_1 : var_35_arg_2; [L134] SORT_5 var_40_arg_0 = var_35; [L135] SORT_39 var_40 = var_40_arg_0 >> 0; [L136] SORT_5 var_38_arg_0 = var_35; [L137] SORT_37 var_38 = var_38_arg_0 >> 4; [L138] var_38 = var_38 & mask_SORT_37 [L139] SORT_39 var_41_arg_0 = var_40; [L140] SORT_37 var_41_arg_1 = var_38; [L141] SORT_5 var_41 = ((SORT_5)var_41_arg_0 << 28) | var_41_arg_1; [L142] SORT_3 var_43_arg_0 = var_42; [L143] SORT_5 var_43_arg_1 = var_41; [L144] SORT_5 var_43_arg_2 = var_35; [L145] SORT_5 var_43 = var_43_arg_0 ? var_43_arg_1 : var_43_arg_2; [L146] SORT_5 var_48_arg_0 = var_43; [L147] SORT_47 var_48 = var_48_arg_0 >> 0; [L148] SORT_5 var_46_arg_0 = var_43; [L149] SORT_45 var_46 = var_46_arg_0 >> 8; [L150] var_46 = var_46 & mask_SORT_45 [L151] SORT_47 var_49_arg_0 = var_48; [L152] SORT_45 var_49_arg_1 = var_46; [L153] SORT_5 var_49 = ((SORT_5)var_49_arg_0 << 24) | var_49_arg_1; [L154] SORT_3 var_51_arg_0 = var_50; [L155] SORT_5 var_51_arg_1 = var_49; [L156] SORT_5 var_51_arg_2 = var_43; [L157] SORT_5 var_51 = var_51_arg_0 ? var_51_arg_1 : var_51_arg_2; [L158] SORT_5 var_55_arg_0 = var_51; [L159] SORT_53 var_55 = var_55_arg_0 >> 0; [L160] SORT_5 var_54_arg_0 = var_51; [L161] SORT_53 var_54 = var_54_arg_0 >> 16; [L162] var_54 = var_54 & mask_SORT_53 [L163] SORT_53 var_56_arg_0 = var_55; [L164] SORT_53 var_56_arg_1 = var_54; [L165] SORT_5 var_56 = ((SORT_5)var_56_arg_0 << 16) | var_56_arg_1; [L166] SORT_3 var_58_arg_0 = var_57; [L167] SORT_5 var_58_arg_1 = var_56; [L168] SORT_5 var_58_arg_2 = var_51; [L169] SORT_5 var_58 = var_58_arg_0 ? var_58_arg_1 : var_58_arg_2; [L170] var_58 = var_58 & mask_SORT_5 [L171] SORT_5 next_60_arg_1 = var_58; [L172] SORT_5 next_61_arg_1 = input_6; [L174] state_8 = next_60_arg_1 [L175] state_19 = next_61_arg_1 [L76] input_2 = __VERIFIER_nondet_uchar() [L77] input_4 = __VERIFIER_nondet_uchar() [L78] input_6 = __VERIFIER_nondet_uint() [L81] SORT_5 var_11_arg_0 = state_8; [L82] SORT_5 var_11_arg_1 = var_10; [L83] SORT_3 var_11 = var_11_arg_0 == var_11_arg_1; [L84] SORT_3 var_12_arg_0 = var_11; [L85] SORT_3 var_12 = ~var_12_arg_0; [L86] SORT_3 var_16_arg_0 = var_12; [L87] SORT_3 var_16 = ~var_16_arg_0; [L88] SORT_3 var_17_arg_0 = var_15; [L89] SORT_3 var_17_arg_1 = var_16; [L90] SORT_3 var_17 = var_17_arg_0 & var_17_arg_1; [L91] var_17 = var_17 & mask_SORT_3 [L92] SORT_3 bad_18_arg_0 = var_17; VAL [bad_18_arg_0=0, mask_SORT_22=2147483647, mask_SORT_29=1073741823, mask_SORT_37=268435455, mask_SORT_3=1, mask_SORT_45=16777215, mask_SORT_53=-1, mask_SORT_5=-1, state_19=1431655765, var_10=-1431655766, var_15=1] [L93] CALL __VERIFIER_assert(!(bad_18_arg_0)) VAL [\old(cond)=1] [L21] COND FALSE !(!(cond)) VAL [\old(cond)=1] [L93] RET __VERIFIER_assert(!(bad_18_arg_0)) VAL [bad_18_arg_0=0, mask_SORT_22=2147483647, mask_SORT_29=1073741823, mask_SORT_37=268435455, mask_SORT_3=1, mask_SORT_45=16777215, mask_SORT_53=-1, mask_SORT_5=-1, state_19=1431655765, var_10=-1431655766, var_15=1] [L95] SORT_1 var_57_arg_0 = input_2; [L96] SORT_3 var_57 = var_57_arg_0 >> 4; [L97] var_57 = var_57 & mask_SORT_3 [L98] SORT_1 var_50_arg_0 = input_2; [L99] SORT_3 var_50 = var_50_arg_0 >> 3; [L100] var_50 = var_50 & mask_SORT_3 [L101] SORT_1 var_42_arg_0 = input_2; [L102] SORT_3 var_42 = var_42_arg_0 >> 2; [L103] var_42 = var_42 & mask_SORT_3 [L104] SORT_1 var_34_arg_0 = input_2; [L105] SORT_3 var_34 = var_34_arg_0 >> 1; [L106] var_34 = var_34 & mask_SORT_3 [L107] SORT_1 var_26_arg_0 = input_2; [L108] SORT_3 var_26 = var_26_arg_0 >> 0; [L109] var_26 = var_26 & mask_SORT_3 [L110] SORT_5 var_24_arg_0 = state_19; [L111] SORT_3 var_24 = var_24_arg_0 >> 0; [L112] SORT_5 var_23_arg_0 = state_19; [L113] SORT_22 var_23 = var_23_arg_0 >> 1; [L114] var_23 = var_23 & mask_SORT_22 [L115] SORT_3 var_25_arg_0 = var_24; [L116] SORT_22 var_25_arg_1 = var_23; [L117] SORT_5 var_25 = ((SORT_5)var_25_arg_0 << 31) | var_25_arg_1; [L118] SORT_3 var_27_arg_0 = var_26; [L119] SORT_5 var_27_arg_1 = var_25; [L120] SORT_5 var_27_arg_2 = state_19; [L121] SORT_5 var_27 = var_27_arg_0 ? var_27_arg_1 : var_27_arg_2; [L122] SORT_5 var_32_arg_0 = var_27; [L123] SORT_31 var_32 = var_32_arg_0 >> 0; [L124] SORT_5 var_30_arg_0 = var_27; [L125] SORT_29 var_30 = var_30_arg_0 >> 2; [L126] var_30 = var_30 & mask_SORT_29 [L127] SORT_31 var_33_arg_0 = var_32; [L128] SORT_29 var_33_arg_1 = var_30; [L129] SORT_5 var_33 = ((SORT_5)var_33_arg_0 << 30) | var_33_arg_1; [L130] SORT_3 var_35_arg_0 = var_34; [L131] SORT_5 var_35_arg_1 = var_33; [L132] SORT_5 var_35_arg_2 = var_27; [L133] SORT_5 var_35 = var_35_arg_0 ? var_35_arg_1 : var_35_arg_2; [L134] SORT_5 var_40_arg_0 = var_35; [L135] SORT_39 var_40 = var_40_arg_0 >> 0; [L136] SORT_5 var_38_arg_0 = var_35; [L137] SORT_37 var_38 = var_38_arg_0 >> 4; [L138] var_38 = var_38 & mask_SORT_37 [L139] SORT_39 var_41_arg_0 = var_40; [L140] SORT_37 var_41_arg_1 = var_38; [L141] SORT_5 var_41 = ((SORT_5)var_41_arg_0 << 28) | var_41_arg_1; [L142] SORT_3 var_43_arg_0 = var_42; [L143] SORT_5 var_43_arg_1 = var_41; [L144] SORT_5 var_43_arg_2 = var_35; [L145] SORT_5 var_43 = var_43_arg_0 ? var_43_arg_1 : var_43_arg_2; [L146] SORT_5 var_48_arg_0 = var_43; [L147] SORT_47 var_48 = var_48_arg_0 >> 0; [L148] SORT_5 var_46_arg_0 = var_43; [L149] SORT_45 var_46 = var_46_arg_0 >> 8; [L150] var_46 = var_46 & mask_SORT_45 [L151] SORT_47 var_49_arg_0 = var_48; [L152] SORT_45 var_49_arg_1 = var_46; [L153] SORT_5 var_49 = ((SORT_5)var_49_arg_0 << 24) | var_49_arg_1; [L154] SORT_3 var_51_arg_0 = var_50; [L155] SORT_5 var_51_arg_1 = var_49; [L156] SORT_5 var_51_arg_2 = var_43; [L157] SORT_5 var_51 = var_51_arg_0 ? var_51_arg_1 : var_51_arg_2; [L158] SORT_5 var_55_arg_0 = var_51; [L159] SORT_53 var_55 = var_55_arg_0 >> 0; [L160] SORT_5 var_54_arg_0 = var_51; [L161] SORT_53 var_54 = var_54_arg_0 >> 16; [L162] var_54 = var_54 & mask_SORT_53 [L163] SORT_53 var_56_arg_0 = var_55; [L164] SORT_53 var_56_arg_1 = var_54; [L165] SORT_5 var_56 = ((SORT_5)var_56_arg_0 << 16) | var_56_arg_1; [L166] SORT_3 var_58_arg_0 = var_57; [L167] SORT_5 var_58_arg_1 = var_56; [L168] SORT_5 var_58_arg_2 = var_51; [L169] SORT_5 var_58 = var_58_arg_0 ? var_58_arg_1 : var_58_arg_2; [L170] var_58 = var_58 & mask_SORT_5 [L171] SORT_5 next_60_arg_1 = var_58; [L172] SORT_5 next_61_arg_1 = input_6; [L174] state_8 = next_60_arg_1 [L175] state_19 = next_61_arg_1 [L76] input_2 = __VERIFIER_nondet_uchar() [L77] input_4 = __VERIFIER_nondet_uchar() [L78] input_6 = __VERIFIER_nondet_uint() [L81] SORT_5 var_11_arg_0 = state_8; [L82] SORT_5 var_11_arg_1 = var_10; [L83] SORT_3 var_11 = var_11_arg_0 == var_11_arg_1; [L84] SORT_3 var_12_arg_0 = var_11; [L85] SORT_3 var_12 = ~var_12_arg_0; [L86] SORT_3 var_16_arg_0 = var_12; [L87] SORT_3 var_16 = ~var_16_arg_0; [L88] SORT_3 var_17_arg_0 = var_15; [L89] SORT_3 var_17_arg_1 = var_16; [L90] SORT_3 var_17 = var_17_arg_0 & var_17_arg_1; [L91] var_17 = var_17 & mask_SORT_3 [L92] SORT_3 bad_18_arg_0 = var_17; VAL [bad_18_arg_0=1, mask_SORT_22=2147483647, mask_SORT_29=1073741823, mask_SORT_37=268435455, mask_SORT_3=1, mask_SORT_45=16777215, mask_SORT_53=-1, mask_SORT_5=-1, state_19=5, var_10=-1431655766, var_15=1] [L93] CALL __VERIFIER_assert(!(bad_18_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: 3, 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=91occurred 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.1s SatisfiabilityAnalysisTime, 0.0s InterpolantComputationTime, 25 NumberOfCodeBlocks, 25 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:27:42,002 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