./Ultimate.py --spec ../../../trunk/examples/svcomp/properties/unreach-call.prp --file ../../../trunk/examples/svcomp/xcsp/AllInterval-008.c --full-output --witness-type violation_witness --validate ./svcomp-yaml-violation-generation.2024-08-01_14-26-22.files/Default/AllInterval-008.yml/witness.yml --preprocessor.replace.while.statements.and.if-then-else.statements false --icfgbuilder.size.of.a.code.block SequenceOfStatements --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 26998269 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/xcsp/AllInterval-008.c ./svcomp-yaml-violation-generation.2024-08-01_14-26-22.files/Default/AllInterval-008.yml/witness.yml -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-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-2699826-m [2024-08-14 14:35:09,319 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-08-14 14:35:09,417 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2024-08-14 14:35:09,424 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-08-14 14:35:09,425 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-08-14 14:35:09,451 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-08-14 14:35:09,453 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-08-14 14:35:09,453 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-08-14 14:35:09,454 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-08-14 14:35:09,456 INFO L153 SettingsManager]: * Use memory slicer=true [2024-08-14 14:35:09,456 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-08-14 14:35:09,456 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-08-14 14:35:09,457 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-08-14 14:35:09,458 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-08-14 14:35:09,458 INFO L153 SettingsManager]: * Use SBE=true [2024-08-14 14:35:09,459 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-08-14 14:35:09,459 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-08-14 14:35:09,459 INFO L153 SettingsManager]: * sizeof long=4 [2024-08-14 14:35:09,460 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-08-14 14:35:09,460 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-08-14 14:35:09,460 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-08-14 14:35:09,463 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-08-14 14:35:09,463 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-08-14 14:35:09,464 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-08-14 14:35:09,464 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-08-14 14:35:09,464 INFO L153 SettingsManager]: * sizeof long double=12 [2024-08-14 14:35:09,464 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-08-14 14:35:09,465 INFO L153 SettingsManager]: * Use constant arrays=true [2024-08-14 14:35:09,465 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-08-14 14:35:09,465 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-08-14 14:35:09,466 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-08-14 14:35:09,466 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-08-14 14:35:09,467 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-08-14 14:35:09,467 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-08-14 14:35:09,467 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-08-14 14:35:09,468 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-08-14 14:35:09,468 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-08-14 14:35:09,468 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-08-14 14:35:09,468 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-08-14 14:35:09,469 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-08-14 14:35:09,469 INFO L153 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2024-08-14 14:35:09,469 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-08-14 14:35:09,469 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-08-14 14:35:09,470 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-14 14:35:09,743 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-08-14 14:35:09,764 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-08-14 14:35:09,766 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-08-14 14:35:09,768 INFO L270 PluginConnector]: Initializing CDTParser... [2024-08-14 14:35:09,768 INFO L274 PluginConnector]: CDTParser initialized [2024-08-14 14:35:09,769 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/xcsp/AllInterval-008.c [2024-08-14 14:35:11,214 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-08-14 14:35:11,432 INFO L384 CDTParser]: Found 1 translation units. [2024-08-14 14:35:11,433 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/xcsp/AllInterval-008.c [2024-08-14 14:35:11,442 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/d8be59e26/94ed05ee4fb040a386250cd88c466880/FLAG5f93b6e8c [2024-08-14 14:35:11,458 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/d8be59e26/94ed05ee4fb040a386250cd88c466880 [2024-08-14 14:35:11,465 INFO L270 PluginConnector]: Initializing Witness Parser... [2024-08-14 14:35:11,466 INFO L274 PluginConnector]: Witness Parser initialized [2024-08-14 14:35:11,466 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/AllInterval-008.yml/witness.yml [2024-08-14 14:35:11,673 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-08-14 14:35:11,675 INFO L133 ToolchainWalker]: Walking toolchain with 4 elements. [2024-08-14 14:35:11,677 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-08-14 14:35:11,677 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-08-14 14:35:11,682 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-08-14 14:35:11,683 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 14.08 02:35:11" (1/2) ... [2024-08-14 14:35:11,684 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@2cb12061 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.08 02:35:11, skipping insertion in model container [2024-08-14 14:35:11,684 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 14.08 02:35:11" (1/2) ... [2024-08-14 14:35:11,686 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.CACSL2BoogieTranslatorObserver@14d8153a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.08 02:35:11, skipping insertion in model container [2024-08-14 14:35:11,687 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "witness.yml de.uni_freiburg.informatik.ultimate.witnessparser VIOLATION_WITNESS 14.08 02:35:11" (2/2) ... [2024-08-14 14:35:11,687 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@2cb12061 and model type witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator VIOLATION_WITNESS 14.08 02:35:11, skipping insertion in model container [2024-08-14 14:35:11,687 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "witness.yml de.uni_freiburg.informatik.ultimate.witnessparser VIOLATION_WITNESS 14.08 02:35:11" (2/2) ... [2024-08-14 14:35:11,713 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-08-14 14:35:11,906 WARN L247 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/xcsp/AllInterval-008.c[4334,4347] [2024-08-14 14:35:11,912 INFO L207 PostProcessor]: Analyzing one entry point: main [2024-08-14 14:35:11,928 INFO L200 MainTranslator]: Completed pre-run [2024-08-14 14:35:11,961 WARN L247 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/xcsp/AllInterval-008.c[4334,4347] [2024-08-14 14:35:11,962 INFO L207 PostProcessor]: Analyzing one entry point: main [2024-08-14 14:35:11,976 INFO L204 MainTranslator]: Completed translation [2024-08-14 14:35:11,977 INFO L201 PluginConnector]: Adding new model witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator VIOLATION_WITNESS 14.08 02:35:11 WrapperNode [2024-08-14 14:35:11,977 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-08-14 14:35:11,978 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-08-14 14:35:11,978 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-08-14 14:35:11,978 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-08-14 14:35:11,991 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator VIOLATION_WITNESS 14.08 02:35:11" (1/1) ... [2024-08-14 14:35:11,991 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator VIOLATION_WITNESS 14.08 02:35:11" (1/1) ... [2024-08-14 14:35:11,999 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator VIOLATION_WITNESS 14.08 02:35:11" (1/1) ... [2024-08-14 14:35:12,013 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-14 14:35:12,013 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator VIOLATION_WITNESS 14.08 02:35:11" (1/1) ... [2024-08-14 14:35:12,014 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator VIOLATION_WITNESS 14.08 02:35:11" (1/1) ... [2024-08-14 14:35:12,021 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator VIOLATION_WITNESS 14.08 02:35:11" (1/1) ... [2024-08-14 14:35:12,022 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator VIOLATION_WITNESS 14.08 02:35:11" (1/1) ... [2024-08-14 14:35:12,023 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator VIOLATION_WITNESS 14.08 02:35:11" (1/1) ... [2024-08-14 14:35:12,026 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-08-14 14:35:12,027 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2024-08-14 14:35:12,027 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2024-08-14 14:35:12,027 INFO L274 PluginConnector]: IcfgBuilder initialized [2024-08-14 14:35:12,029 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator VIOLATION_WITNESS 14.08 02:35:11" (1/1) ... [2024-08-14 14:35:12,054 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-08-14 14:35:12,067 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-08-14 14:35:12,082 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-14 14:35:12,084 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-14 14:35:12,133 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2024-08-14 14:35:12,133 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-08-14 14:35:12,133 INFO L138 BoogieDeclarations]: Found implementation of procedure reach_error [2024-08-14 14:35:12,133 INFO L138 BoogieDeclarations]: Found implementation of procedure assume [2024-08-14 14:35:12,133 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2024-08-14 14:35:12,133 INFO L130 BoogieDeclarations]: Found specification of procedure abort [2024-08-14 14:35:12,133 INFO L130 BoogieDeclarations]: Found specification of procedure __assert_fail [2024-08-14 14:35:12,134 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int [2024-08-14 14:35:12,134 INFO L130 BoogieDeclarations]: Found specification of procedure reach_error [2024-08-14 14:35:12,134 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-08-14 14:35:12,134 INFO L130 BoogieDeclarations]: Found specification of procedure assume [2024-08-14 14:35:12,134 INFO L130 BoogieDeclarations]: Found specification of procedure main [2024-08-14 14:35:12,134 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2024-08-14 14:35:12,134 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-08-14 14:35:12,134 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-08-14 14:35:12,135 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#0 [2024-08-14 14:35:12,135 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#0 [2024-08-14 14:35:12,136 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2024-08-14 14:35:12,207 INFO L273 CfgBuilder]: Building ICFG [2024-08-14 14:35:12,209 INFO L304 CfgBuilder]: Building CFG for each procedure with an implementation [2024-08-14 14:35:12,554 INFO L? ?]: Removed 12 outVars from TransFormulas that were not future-live. [2024-08-14 14:35:12,554 INFO L327 CfgBuilder]: Performing block encoding [2024-08-14 14:35:12,566 INFO L349 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-08-14 14:35:12,566 INFO L354 CfgBuilder]: Removed 0 assume(true) statements. [2024-08-14 14:35:12,567 INFO L201 PluginConnector]: Adding new model witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 14.08 02:35:12 BoogieIcfgContainer [2024-08-14 14:35:12,567 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2024-08-14 14:35:12,569 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-08-14 14:35:12,569 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-08-14 14:35:12,572 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-08-14 14:35:12,572 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 14.08 02:35:11" (1/4) ... [2024-08-14 14:35:12,573 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@b675883 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 14.08 02:35:12, skipping insertion in model container [2024-08-14 14:35:12,573 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "witness.yml de.uni_freiburg.informatik.ultimate.witnessparser VIOLATION_WITNESS 14.08 02:35:11" (2/4) ... [2024-08-14 14:35:12,573 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@b675883 and model type witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction VIOLATION_WITNESS 14.08 02:35:12, skipping insertion in model container [2024-08-14 14:35:12,574 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator VIOLATION_WITNESS 14.08 02:35:11" (3/4) ... [2024-08-14 14:35:12,574 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@b675883 and model type witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction VIOLATION_WITNESS 14.08 02:35:12, skipping insertion in model container [2024-08-14 14:35:12,574 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 14.08 02:35:12" (4/4) ... [2024-08-14 14:35:12,575 INFO L119 eAbstractionObserver]: Analyzing ICFG AllInterval-008.c [2024-08-14 14:35:12,575 WARN L130 eAbstractionObserver]: Found a witness in the YAML format. I will only consider traces that are accepted by the witness [2024-08-14 14:35:12,594 INFO L221 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-08-14 14:35:12,594 INFO L180 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-08-14 14:35:12,621 INFO L92 WitnessUtils]: Constructing product of automaton with 125 states and violation witness of the following lengths: [259] [2024-08-14 14:35:12,624 INFO L82 GeneralOperation]: Start removeDeadEnds. Operand has 125 states, 32 states have (on average 1.0625) internal successors, (34), 33 states have internal predecessors, (34), 88 states have call successors, (88), 3 states have call predecessors, (88), 3 states have return successors, (88), 88 states have call predecessors, (88), 88 states have call successors, (88) [2024-08-14 14:35:15,206 INFO L88 GeneralOperation]: Finished removeDeadEnds. Reduced from 10833 states to 460 states. [2024-08-14 14:35:15,227 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-08-14 14:35:15,239 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;@57d9f482, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-08-14 14:35:15,239 INFO L358 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-08-14 14:35:15,241 INFO L276 IsEmpty]: Start isEmpty. Operand 460 states. [2024-08-14 14:35:15,271 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 460 [2024-08-14 14:35:15,271 INFO L187 NwaCegarLoop]: Found error trace [2024-08-14 14:35:15,273 INFO L195 NwaCegarLoop]: trace histogram [86, 86, 86, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-14 14:35:15,273 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting mainErr0ASSERT_VIOLATIONERROR_FUNCTION === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-08-14 14:35:15,279 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-08-14 14:35:15,280 INFO L85 PathProgramCache]: Analyzing trace with hash -51602445, now seen corresponding path program 1 times [2024-08-14 14:35:15,289 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-08-14 14:35:15,290 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [794844468] [2024-08-14 14:35:15,290 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-08-14 14:35:15,291 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-08-14 14:35:16,702 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-08-14 14:35:16,703 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-08-14 14:35:18,214 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-08-14 14:35:18,291 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-08-14 14:35:18,294 INFO L360 BasicCegarLoop]: Counterexample is feasible [2024-08-14 14:35:18,296 INFO L805 garLoopResultBuilder]: Registering result UNSAFE for location mainErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2024-08-14 14:35:18,298 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-08-14 14:35:18,303 INFO L445 BasicCegarLoop]: Path program histogram: [1] [2024-08-14 14:35:18,308 INFO L196 ceAbstractionStarter]: Computing trace abstraction results [2024-08-14 14:35:18,451 INFO L201 PluginConnector]: Adding new model witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 14.08 02:35:18 BoogieIcfgContainer [2024-08-14 14:35:18,451 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2024-08-14 14:35:18,453 INFO L158 Benchmark]: Toolchain (without parser) took 6777.65ms. Allocated memory was 176.2MB in the beginning and 826.3MB in the end (delta: 650.1MB). Free memory was 105.8MB in the beginning and 769.3MB in the end (delta: -663.5MB). Peak memory consumption was 460.4MB. Max. memory is 16.1GB. [2024-08-14 14:35:18,456 INFO L158 Benchmark]: CDTParser took 0.18ms. Allocated memory is still 176.2MB. Free memory is still 138.7MB. There was no memory consumed. Max. memory is 16.1GB. [2024-08-14 14:35:18,456 INFO L158 Benchmark]: Witness Parser took 0.28ms. Allocated memory is still 176.2MB. Free memory is still 117.4MB. There was no memory consumed. Max. memory is 16.1GB. [2024-08-14 14:35:18,456 INFO L158 Benchmark]: CACSL2BoogieTranslator took 300.71ms. Allocated memory is still 176.2MB. Free memory was 105.3MB in the beginning and 92.0MB in the end (delta: 13.3MB). Peak memory consumption was 12.6MB. Max. memory is 16.1GB. [2024-08-14 14:35:18,457 INFO L158 Benchmark]: Boogie Preprocessor took 47.95ms. Allocated memory is still 176.2MB. Free memory was 92.0MB in the beginning and 89.5MB in the end (delta: 2.6MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. [2024-08-14 14:35:18,457 INFO L158 Benchmark]: IcfgBuilder took 540.24ms. Allocated memory is still 176.2MB. Free memory was 89.5MB in the beginning and 137.9MB in the end (delta: -48.5MB). Peak memory consumption was 17.2MB. Max. memory is 16.1GB. [2024-08-14 14:35:18,458 INFO L158 Benchmark]: TraceAbstraction took 5882.33ms. Allocated memory was 176.2MB in the beginning and 826.3MB in the end (delta: 650.1MB). Free memory was 136.8MB in the beginning and 769.3MB in the end (delta: -632.5MB). Peak memory consumption was 491.5MB. Max. memory is 16.1GB. [2024-08-14 14:35:18,460 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.18ms. Allocated memory is still 176.2MB. Free memory is still 138.7MB. There was no memory consumed. Max. memory is 16.1GB. * Witness Parser took 0.28ms. Allocated memory is still 176.2MB. Free memory is still 117.4MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 300.71ms. Allocated memory is still 176.2MB. Free memory was 105.3MB in the beginning and 92.0MB in the end (delta: 13.3MB). Peak memory consumption was 12.6MB. Max. memory is 16.1GB. * Boogie Preprocessor took 47.95ms. Allocated memory is still 176.2MB. Free memory was 92.0MB in the beginning and 89.5MB in the end (delta: 2.6MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. * IcfgBuilder took 540.24ms. Allocated memory is still 176.2MB. Free memory was 89.5MB in the beginning and 137.9MB in the end (delta: -48.5MB). Peak memory consumption was 17.2MB. Max. memory is 16.1GB. * TraceAbstraction took 5882.33ms. Allocated memory was 176.2MB in the beginning and 826.3MB in the end (delta: 650.1MB). Free memory was 136.8MB in the beginning and 769.3MB in the end (delta: -632.5MB). Peak memory consumption was 491.5MB. 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: 159]: a call to reach_error is reachable a call to reach_error is reachable We found a FailurePath: [L24] int cond0; [L25] int dummy = 0; [L26] int N; [L27] int var0; [L28] var0 = __VERIFIER_nondet_int() [L29] CALL assume(var0 >= 0) VAL [\old(cond)=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1] [L29] RET assume(var0 >= 0) VAL [var0=3] [L30] CALL assume(var0 <= 7) VAL [\old(cond)=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1] [L30] RET assume(var0 <= 7) VAL [var0=3] [L31] int var1; [L32] var1 = __VERIFIER_nondet_int() [L33] CALL assume(var1 >= 0) VAL [\old(cond)=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1] [L33] RET assume(var1 >= 0) VAL [var0=3, var1=4] [L34] CALL assume(var1 <= 7) VAL [\old(cond)=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1] [L34] RET assume(var1 <= 7) VAL [var0=3, var1=4] [L35] int var2; [L36] var2 = __VERIFIER_nondet_int() [L37] CALL assume(var2 >= 0) VAL [\old(cond)=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1] [L37] RET assume(var2 >= 0) VAL [var0=3, var1=4, var2=6] [L38] CALL assume(var2 <= 7) VAL [\old(cond)=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1] [L38] RET assume(var2 <= 7) VAL [var0=3, var1=4, var2=6] [L39] int var3; [L40] var3 = __VERIFIER_nondet_int() [L41] CALL assume(var3 >= 0) VAL [\old(cond)=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1] [L41] RET assume(var3 >= 0) VAL [var0=3, var1=4, var2=6, var3=2] [L42] CALL assume(var3 <= 7) VAL [\old(cond)=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1] [L42] RET assume(var3 <= 7) VAL [var0=3, var1=4, var2=6, var3=2] [L43] int var4; [L44] var4 = __VERIFIER_nondet_int() [L45] CALL assume(var4 >= 0) VAL [\old(cond)=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1] [L45] RET assume(var4 >= 0) VAL [var0=3, var1=4, var2=6, var3=2, var4=5] [L46] CALL assume(var4 <= 7) VAL [\old(cond)=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1] [L46] RET assume(var4 <= 7) VAL [var0=3, var1=4, var2=6, var3=2, var4=5] [L47] int var5; [L48] var5 = __VERIFIER_nondet_int() [L49] CALL assume(var5 >= 0) VAL [\old(cond)=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1] [L49] RET assume(var5 >= 0) VAL [var0=3, var1=4, var2=6, var3=2, var4=5, var5=0] [L50] CALL assume(var5 <= 7) VAL [\old(cond)=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1] [L50] RET assume(var5 <= 7) VAL [var0=3, var1=4, var2=6, var3=2, var4=5, var5=0] [L51] int var6; [L52] var6 = __VERIFIER_nondet_int() [L53] CALL assume(var6 >= 0) VAL [\old(cond)=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1] [L53] RET assume(var6 >= 0) VAL [var0=3, var1=4, var2=6, var3=2, var4=5, var5=0, var6=7] [L54] CALL assume(var6 <= 7) VAL [\old(cond)=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1] [L54] RET assume(var6 <= 7) VAL [var0=3, var1=4, var2=6, var3=2, var4=5, var5=0, var6=7] [L55] int var7; [L56] var7 = __VERIFIER_nondet_int() [L57] CALL assume(var7 >= 0) VAL [\old(cond)=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1] [L57] RET assume(var7 >= 0) VAL [var0=3, var1=4, var2=6, var3=2, var4=5, var5=0, var6=7, var7=1] [L58] CALL assume(var7 <= 7) VAL [\old(cond)=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1] [L58] RET assume(var7 <= 7) VAL [var0=3, var1=4, var2=6, var3=2, var4=5, var5=0, var6=7, var7=1] [L59] int var8; [L60] var8 = __VERIFIER_nondet_int() [L61] CALL assume(var8 >= 1) VAL [\old(cond)=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1] [L61] RET assume(var8 >= 1) VAL [var0=3, var1=4, var2=6, var3=2, var4=5, var5=0, var6=7, var7=1, var8=1] [L62] CALL assume(var8 <= 7) VAL [\old(cond)=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1] [L62] RET assume(var8 <= 7) VAL [var0=3, var1=4, var2=6, var3=2, var4=5, var5=0, var6=7, var7=1, var8=1] [L63] int var9; [L64] var9 = __VERIFIER_nondet_int() [L65] CALL assume(var9 >= 1) VAL [\old(cond)=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1] [L65] RET assume(var9 >= 1) VAL [var0=3, var1=4, var2=6, var3=2, var4=5, var5=0, var6=7, var7=1, var8=1, var9=2] [L66] CALL assume(var9 <= 7) VAL [\old(cond)=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1] [L66] RET assume(var9 <= 7) VAL [var0=3, var1=4, var2=6, var3=2, var4=5, var5=0, var6=7, var7=1, var8=1, var9=2] [L67] int var10; [L68] var10 = __VERIFIER_nondet_int() [L69] CALL assume(var10 >= 1) VAL [\old(cond)=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1] [L69] RET assume(var10 >= 1) VAL [var0=3, var10=4, var1=4, var2=6, var3=2, var4=5, var5=0, var6=7, var7=1, var8=1, var9=2] [L70] CALL assume(var10 <= 7) VAL [\old(cond)=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1] [L70] RET assume(var10 <= 7) VAL [var0=3, var10=4, var1=4, var2=6, var3=2, var4=5, var5=0, var6=7, var7=1, var8=1, var9=2] [L71] int var11; [L72] var11 = __VERIFIER_nondet_int() [L73] CALL assume(var11 >= 1) VAL [\old(cond)=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1] [L73] RET assume(var11 >= 1) VAL [var0=3, var10=4, var11=3, var1=4, var2=6, var3=2, var4=5, var5=0, var6=7, var7=1, var8=1, var9=2] [L74] CALL assume(var11 <= 7) VAL [\old(cond)=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1] [L74] RET assume(var11 <= 7) VAL [var0=3, var10=4, var11=3, var1=4, var2=6, var3=2, var4=5, var5=0, var6=7, var7=1, var8=1, var9=2] [L75] int var12; [L76] var12 = __VERIFIER_nondet_int() [L77] CALL assume(var12 >= 1) VAL [\old(cond)=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1] [L77] RET assume(var12 >= 1) VAL [var0=3, var10=4, var11=3, var12=5, var1=4, var2=6, var3=2, var4=5, var5=0, var6=7, var7=1, var8=1, var9=2] [L78] CALL assume(var12 <= 7) VAL [\old(cond)=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1] [L78] RET assume(var12 <= 7) VAL [var0=3, var10=4, var11=3, var12=5, var1=4, var2=6, var3=2, var4=5, var5=0, var6=7, var7=1, var8=1, var9=2] [L79] int var13; [L80] var13 = __VERIFIER_nondet_int() [L81] CALL assume(var13 >= 1) VAL [\old(cond)=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1] [L81] RET assume(var13 >= 1) VAL [var0=3, var10=4, var11=3, var12=5, var13=7, var1=4, var2=6, var3=2, var4=5, var5=0, var6=7, var7=1, var8=1, var9=2] [L82] CALL assume(var13 <= 7) VAL [\old(cond)=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1] [L82] RET assume(var13 <= 7) VAL [var0=3, var10=4, var11=3, var12=5, var13=7, var1=4, var2=6, var3=2, var4=5, var5=0, var6=7, var7=1, var8=1, var9=2] [L83] int var14; [L84] var14 = __VERIFIER_nondet_int() [L85] CALL assume(var14 >= 1) VAL [\old(cond)=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1] [L85] RET assume(var14 >= 1) VAL [var0=3, var10=4, var11=3, var12=5, var13=7, var14=6, var1=4, var2=6, var3=2, var4=5, var5=0, var6=7, var7=1, var8=1, var9=2] [L86] CALL assume(var14 <= 7) VAL [\old(cond)=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1] [L86] RET assume(var14 <= 7) VAL [var0=3, var10=4, var11=3, var12=5, var13=7, var14=6, var1=4, var2=6, var3=2, var4=5, var5=0, var6=7, var7=1, var8=1, var9=2] [L87] int myvar0 = 1; VAL [var0=3, var10=4, var11=3, var12=5, var13=7, var14=6, var1=4, var2=6, var3=2, var4=5, var5=0, var6=7, var7=1, var8=1, var9=2] [L88] CALL assume(var0 != var1) VAL [\old(cond)=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1] [L88] RET assume(var0 != var1) VAL [var0=3, var10=4, var11=3, var12=5, var13=7, var14=6, var1=4, var2=6, var3=2, var4=5, var5=0, var6=7, var7=1, var8=1, var9=2] [L89] CALL assume(var0 != var2) VAL [\old(cond)=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1] [L89] RET assume(var0 != var2) VAL [var0=3, var10=4, var11=3, var12=5, var13=7, var14=6, var1=4, var2=6, var3=2, var4=5, var5=0, var6=7, var7=1, var8=1, var9=2] [L90] CALL assume(var0 != var3) VAL [\old(cond)=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1] [L90] RET assume(var0 != var3) VAL [var0=3, var10=4, var11=3, var12=5, var13=7, var14=6, var1=4, var2=6, var3=2, var4=5, var5=0, var6=7, var7=1, var8=1, var9=2] [L91] CALL assume(var0 != var4) VAL [\old(cond)=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1] [L91] RET assume(var0 != var4) VAL [var0=3, var10=4, var11=3, var12=5, var13=7, var14=6, var1=4, var2=6, var3=2, var4=5, var5=0, var6=7, var7=1, var8=1, var9=2] [L92] CALL assume(var0 != var5) VAL [\old(cond)=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1] [L92] RET assume(var0 != var5) VAL [var0=3, var10=4, var11=3, var12=5, var13=7, var14=6, var1=4, var2=6, var3=2, var4=5, var5=0, var6=7, var7=1, var8=1, var9=2] [L93] CALL assume(var0 != var6) VAL [\old(cond)=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1] [L93] RET assume(var0 != var6) VAL [var0=3, var10=4, var11=3, var12=5, var13=7, var14=6, var1=4, var2=6, var3=2, var4=5, var5=0, var6=7, var7=1, var8=1, var9=2] [L94] CALL assume(var0 != var7) VAL [\old(cond)=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1] [L94] RET assume(var0 != var7) VAL [var0=3, var10=4, var11=3, var12=5, var13=7, var14=6, var1=4, var2=6, var3=2, var4=5, var5=0, var6=7, var7=1, var8=1, var9=2] [L95] CALL assume(var1 != var2) VAL [\old(cond)=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1] [L95] RET assume(var1 != var2) VAL [var0=3, var10=4, var11=3, var12=5, var13=7, var14=6, var1=4, var2=6, var3=2, var4=5, var5=0, var6=7, var7=1, var8=1, var9=2] [L96] CALL assume(var1 != var3) VAL [\old(cond)=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1] [L96] RET assume(var1 != var3) VAL [var0=3, var10=4, var11=3, var12=5, var13=7, var14=6, var1=4, var2=6, var3=2, var4=5, var5=0, var6=7, var7=1, var8=1, var9=2] [L97] CALL assume(var1 != var4) VAL [\old(cond)=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1] [L97] RET assume(var1 != var4) VAL [var0=3, var10=4, var11=3, var12=5, var13=7, var14=6, var1=4, var2=6, var3=2, var4=5, var5=0, var6=7, var7=1, var8=1, var9=2] [L98] CALL assume(var1 != var5) VAL [\old(cond)=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1] [L98] RET assume(var1 != var5) VAL [var0=3, var10=4, var11=3, var12=5, var13=7, var14=6, var1=4, var2=6, var3=2, var4=5, var5=0, var6=7, var7=1, var8=1, var9=2] [L99] CALL assume(var1 != var6) VAL [\old(cond)=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1] [L99] RET assume(var1 != var6) VAL [var0=3, var10=4, var11=3, var12=5, var13=7, var14=6, var1=4, var2=6, var3=2, var4=5, var5=0, var6=7, var7=1, var8=1, var9=2] [L100] CALL assume(var1 != var7) VAL [\old(cond)=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1] [L100] RET assume(var1 != var7) VAL [var0=3, var10=4, var11=3, var12=5, var13=7, var14=6, var1=4, var2=6, var3=2, var4=5, var5=0, var6=7, var7=1, var8=1, var9=2] [L101] CALL assume(var2 != var3) VAL [\old(cond)=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1] [L101] RET assume(var2 != var3) VAL [var0=3, var10=4, var11=3, var12=5, var13=7, var14=6, var1=4, var2=6, var3=2, var4=5, var5=0, var6=7, var7=1, var8=1, var9=2] [L102] CALL assume(var2 != var4) VAL [\old(cond)=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1] [L102] RET assume(var2 != var4) VAL [var0=3, var10=4, var11=3, var12=5, var13=7, var14=6, var1=4, var2=6, var3=2, var4=5, var5=0, var6=7, var7=1, var8=1, var9=2] [L103] CALL assume(var2 != var5) VAL [\old(cond)=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1] [L103] RET assume(var2 != var5) VAL [var0=3, var10=4, var11=3, var12=5, var13=7, var14=6, var1=4, var2=6, var3=2, var4=5, var5=0, var6=7, var7=1, var8=1, var9=2] [L104] CALL assume(var2 != var6) VAL [\old(cond)=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1] [L104] RET assume(var2 != var6) VAL [var0=3, var10=4, var11=3, var12=5, var13=7, var14=6, var1=4, var2=6, var3=2, var4=5, var5=0, var6=7, var7=1, var8=1, var9=2] [L105] CALL assume(var2 != var7) VAL [\old(cond)=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1] [L105] RET assume(var2 != var7) VAL [var0=3, var10=4, var11=3, var12=5, var13=7, var14=6, var1=4, var2=6, var3=2, var4=5, var5=0, var6=7, var7=1, var8=1, var9=2] [L106] CALL assume(var3 != var4) VAL [\old(cond)=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1] [L106] RET assume(var3 != var4) VAL [var0=3, var10=4, var11=3, var12=5, var13=7, var14=6, var1=4, var2=6, var3=2, var4=5, var5=0, var6=7, var7=1, var8=1, var9=2] [L107] CALL assume(var3 != var5) VAL [\old(cond)=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1] [L107] RET assume(var3 != var5) VAL [var0=3, var10=4, var11=3, var12=5, var13=7, var14=6, var1=4, var2=6, var3=2, var4=5, var5=0, var6=7, var7=1, var8=1, var9=2] [L108] CALL assume(var3 != var6) VAL [\old(cond)=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1] [L108] RET assume(var3 != var6) VAL [var0=3, var10=4, var11=3, var12=5, var13=7, var14=6, var1=4, var2=6, var3=2, var4=5, var5=0, var6=7, var7=1, var8=1, var9=2] [L109] CALL assume(var3 != var7) VAL [\old(cond)=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1] [L109] RET assume(var3 != var7) VAL [var0=3, var10=4, var11=3, var12=5, var13=7, var14=6, var1=4, var2=6, var3=2, var4=5, var5=0, var6=7, var7=1, var8=1, var9=2] [L110] CALL assume(var4 != var5) VAL [\old(cond)=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1] [L110] RET assume(var4 != var5) VAL [var0=3, var10=4, var11=3, var12=5, var13=7, var14=6, var1=4, var2=6, var3=2, var4=5, var5=0, var6=7, var7=1, var8=1, var9=2] [L111] CALL assume(var4 != var6) VAL [\old(cond)=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1] [L111] RET assume(var4 != var6) VAL [var0=3, var10=4, var11=3, var12=5, var13=7, var14=6, var1=4, var2=6, var3=2, var4=5, var5=0, var6=7, var7=1, var8=1, var9=2] [L112] CALL assume(var4 != var7) VAL [\old(cond)=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1] [L112] RET assume(var4 != var7) VAL [var0=3, var10=4, var11=3, var12=5, var13=7, var14=6, var1=4, var2=6, var3=2, var4=5, var5=0, var6=7, var7=1, var8=1, var9=2] [L113] CALL assume(var5 != var6) VAL [\old(cond)=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1] [L113] RET assume(var5 != var6) VAL [var0=3, var10=4, var11=3, var12=5, var13=7, var14=6, var1=4, var2=6, var3=2, var4=5, var5=0, var6=7, var7=1, var8=1, var9=2] [L114] CALL assume(var5 != var7) VAL [\old(cond)=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1] [L114] RET assume(var5 != var7) VAL [var0=3, var10=4, var11=3, var12=5, var13=7, var14=6, var1=4, var2=6, var3=2, var4=5, var5=0, var6=7, var7=1, var8=1, var9=2] [L115] CALL assume(var6 != var7) VAL [\old(cond)=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1] [L115] RET assume(var6 != var7) VAL [var0=3, var10=4, var11=3, var12=5, var13=7, var14=6, var1=4, var2=6, var3=2, var4=5, var5=0, var6=7, var7=1, var8=1, var9=2] [L116] CALL assume(var8 != var9) VAL [\old(cond)=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1] [L116] RET assume(var8 != var9) VAL [var0=3, var10=4, var11=3, var12=5, var13=7, var14=6, var1=4, var2=6, var3=2, var4=5, var5=0, var6=7, var7=1, var8=1, var9=2] [L117] CALL assume(var8 != var10) VAL [\old(cond)=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1] [L117] RET assume(var8 != var10) VAL [var0=3, var10=4, var11=3, var12=5, var13=7, var14=6, var1=4, var2=6, var3=2, var4=5, var5=0, var6=7, var7=1, var8=1, var9=2] [L118] CALL assume(var8 != var11) VAL [\old(cond)=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1] [L118] RET assume(var8 != var11) VAL [var0=3, var10=4, var11=3, var12=5, var13=7, var14=6, var1=4, var2=6, var3=2, var4=5, var5=0, var6=7, var7=1, var8=1, var9=2] [L119] CALL assume(var8 != var12) VAL [\old(cond)=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1] [L119] RET assume(var8 != var12) VAL [var0=3, var10=4, var11=3, var12=5, var13=7, var14=6, var1=4, var2=6, var3=2, var4=5, var5=0, var6=7, var7=1, var8=1, var9=2] [L120] CALL assume(var8 != var13) VAL [\old(cond)=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1] [L120] RET assume(var8 != var13) VAL [var0=3, var10=4, var11=3, var12=5, var13=7, var14=6, var1=4, var2=6, var3=2, var4=5, var5=0, var6=7, var7=1, var8=1, var9=2] [L121] CALL assume(var8 != var14) VAL [\old(cond)=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1] [L121] RET assume(var8 != var14) VAL [var0=3, var10=4, var11=3, var12=5, var13=7, var14=6, var1=4, var2=6, var3=2, var4=5, var5=0, var6=7, var7=1, var8=1, var9=2] [L122] CALL assume(var9 != var10) VAL [\old(cond)=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1] [L122] RET assume(var9 != var10) VAL [var0=3, var10=4, var11=3, var12=5, var13=7, var14=6, var1=4, var2=6, var3=2, var4=5, var5=0, var6=7, var7=1, var8=1, var9=2] [L123] CALL assume(var9 != var11) VAL [\old(cond)=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1] [L123] RET assume(var9 != var11) VAL [var0=3, var10=4, var11=3, var12=5, var13=7, var14=6, var1=4, var2=6, var3=2, var4=5, var5=0, var6=7, var7=1, var8=1, var9=2] [L124] CALL assume(var9 != var12) VAL [\old(cond)=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1] [L124] RET assume(var9 != var12) VAL [var0=3, var10=4, var11=3, var12=5, var13=7, var14=6, var1=4, var2=6, var3=2, var4=5, var5=0, var6=7, var7=1, var8=1, var9=2] [L125] CALL assume(var9 != var13) VAL [\old(cond)=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1] [L125] RET assume(var9 != var13) VAL [var0=3, var10=4, var11=3, var12=5, var13=7, var14=6, var1=4, var2=6, var3=2, var4=5, var5=0, var6=7, var7=1, var8=1, var9=2] [L126] CALL assume(var9 != var14) VAL [\old(cond)=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1] [L126] RET assume(var9 != var14) VAL [var0=3, var10=4, var11=3, var12=5, var13=7, var14=6, var1=4, var2=6, var3=2, var4=5, var5=0, var6=7, var7=1, var8=1, var9=2] [L127] CALL assume(var10 != var11) VAL [\old(cond)=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1] [L127] RET assume(var10 != var11) VAL [var0=3, var10=4, var11=3, var12=5, var13=7, var14=6, var1=4, var2=6, var3=2, var4=5, var5=0, var6=7, var7=1, var8=1, var9=2] [L128] CALL assume(var10 != var12) VAL [\old(cond)=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1] [L128] RET assume(var10 != var12) VAL [var0=3, var10=4, var11=3, var12=5, var13=7, var14=6, var1=4, var2=6, var3=2, var4=5, var5=0, var6=7, var7=1, var8=1, var9=2] [L129] CALL assume(var10 != var13) VAL [\old(cond)=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1] [L129] RET assume(var10 != var13) VAL [var0=3, var10=4, var11=3, var12=5, var13=7, var14=6, var1=4, var2=6, var3=2, var4=5, var5=0, var6=7, var7=1, var8=1, var9=2] [L130] CALL assume(var10 != var14) VAL [\old(cond)=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1] [L130] RET assume(var10 != var14) VAL [var0=3, var10=4, var11=3, var12=5, var13=7, var14=6, var1=4, var2=6, var3=2, var4=5, var5=0, var6=7, var7=1, var8=1, var9=2] [L131] CALL assume(var11 != var12) VAL [\old(cond)=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1] [L131] RET assume(var11 != var12) VAL [var0=3, var10=4, var11=3, var12=5, var13=7, var14=6, var1=4, var2=6, var3=2, var4=5, var5=0, var6=7, var7=1, var8=1, var9=2] [L132] CALL assume(var11 != var13) VAL [\old(cond)=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1] [L132] RET assume(var11 != var13) VAL [var0=3, var10=4, var11=3, var12=5, var13=7, var14=6, var1=4, var2=6, var3=2, var4=5, var5=0, var6=7, var7=1, var8=1, var9=2] [L133] CALL assume(var11 != var14) VAL [\old(cond)=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1] [L133] RET assume(var11 != var14) VAL [var0=3, var10=4, var11=3, var12=5, var13=7, var14=6, var1=4, var2=6, var3=2, var4=5, var5=0, var6=7, var7=1, var8=1, var9=2] [L134] CALL assume(var12 != var13) VAL [\old(cond)=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1] [L134] RET assume(var12 != var13) VAL [var0=3, var10=4, var11=3, var12=5, var13=7, var14=6, var1=4, var2=6, var3=2, var4=5, var5=0, var6=7, var7=1, var8=1, var9=2] [L135] CALL assume(var12 != var14) VAL [\old(cond)=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1] [L135] RET assume(var12 != var14) VAL [var0=3, var10=4, var11=3, var12=5, var13=7, var14=6, var1=4, var2=6, var3=2, var4=5, var5=0, var6=7, var7=1, var8=1, var9=2] [L136] CALL assume(var13 != var14) VAL [\old(cond)=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1] [L136] RET assume(var13 != var14) VAL [var0=3, var10=4, var11=3, var12=5, var13=7, var14=6, var1=4, var2=6, var3=2, var4=5, var5=0, var6=7, var7=1, var8=1, var9=2] [L137] int var_for_abs; [L138] var_for_abs = var0 - var1 [L139] var_for_abs = (var_for_abs >= 0) ? var_for_abs : var_for_abs * (-1) VAL [var10=4, var11=3, var12=5, var13=7, var14=6, var1=4, var2=6, var3=2, var4=5, var5=0, var6=7, var7=1, var8=1, var9=2, var_for_abs=1] [L140] CALL assume(var8 == var_for_abs) VAL [\old(cond)=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1] [L140] RET assume(var8 == var_for_abs) VAL [var10=4, var11=3, var12=5, var13=7, var14=6, var1=4, var2=6, var3=2, var4=5, var5=0, var6=7, var7=1, var8=1, var9=2, var_for_abs=1] [L141] var_for_abs = var1 - var2 [L142] var_for_abs = (var_for_abs >= 0) ? var_for_abs : var_for_abs * (-1) VAL [var10=4, var11=3, var12=5, var13=7, var14=6, var2=6, var3=2, var4=5, var5=0, var6=7, var7=1, var8=1, var9=2, var_for_abs=2] [L143] CALL assume(var9 == var_for_abs) VAL [\old(cond)=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1] [L143] RET assume(var9 == var_for_abs) VAL [var10=4, var11=3, var12=5, var13=7, var14=6, var2=6, var3=2, var4=5, var5=0, var6=7, var7=1, var8=1, var9=2, var_for_abs=2] [L144] var_for_abs = var2 - var3 [L145] var_for_abs = (var_for_abs >= 0) ? var_for_abs : var_for_abs * (-1) VAL [var10=4, var11=3, var12=5, var13=7, var14=6, var3=2, var4=5, var5=0, var6=7, var7=1, var8=1, var9=2, var_for_abs=4] [L146] CALL assume(var10 == var_for_abs) VAL [\old(cond)=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1] [L146] RET assume(var10 == var_for_abs) VAL [var10=4, var11=3, var12=5, var13=7, var14=6, var3=2, var4=5, var5=0, var6=7, var7=1, var8=1, var9=2, var_for_abs=4] [L147] var_for_abs = var3 - var4 [L148] var_for_abs = (var_for_abs >= 0) ? var_for_abs : var_for_abs * (-1) VAL [var10=4, var11=3, var12=5, var13=7, var14=6, var4=5, var5=0, var6=7, var7=1, var8=1, var9=2, var_for_abs=3] [L149] CALL assume(var11 == var_for_abs) VAL [\old(cond)=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1] [L149] RET assume(var11 == var_for_abs) VAL [var10=4, var11=3, var12=5, var13=7, var14=6, var4=5, var5=0, var6=7, var7=1, var8=1, var9=2, var_for_abs=3] [L150] var_for_abs = var4 - var5 [L151] var_for_abs = (var_for_abs >= 0) ? var_for_abs : var_for_abs * (-1) VAL [var10=4, var11=3, var12=5, var13=7, var14=6, var5=0, var6=7, var7=1, var8=1, var9=2, var_for_abs=5] [L152] CALL assume(var12 == var_for_abs) VAL [\old(cond)=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1] [L152] RET assume(var12 == var_for_abs) VAL [var10=4, var11=3, var12=5, var13=7, var14=6, var5=0, var6=7, var7=1, var8=1, var9=2, var_for_abs=5] [L153] var_for_abs = var5 - var6 [L154] var_for_abs = (var_for_abs >= 0) ? var_for_abs : var_for_abs * (-1) VAL [var10=4, var11=3, var12=5, var13=7, var14=6, var6=7, var7=1, var8=1, var9=2, var_for_abs=7] [L155] CALL assume(var13 == var_for_abs) VAL [\old(cond)=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1] [L155] RET assume(var13 == var_for_abs) VAL [var10=4, var11=3, var12=5, var13=7, var14=6, var6=7, var7=1, var8=1, var9=2, var_for_abs=7] [L156] var_for_abs = var6 - var7 [L157] var_for_abs = (var_for_abs >= 0) ? var_for_abs : var_for_abs * (-1) VAL [var10=4, var11=3, var12=5, var13=7, var14=6, var8=1, var9=2, var_for_abs=6] [L158] CALL assume(var14 == var_for_abs) VAL [\old(cond)=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1] [L158] RET assume(var14 == var_for_abs) VAL [var10=4, var11=3, var12=5, var13=7, var14=6, var8=1, var9=2, var_for_abs=6] [L159] reach_error() VAL [var10=4, var11=3, var12=5, var13=7, var14=6, var8=1, var9=2, var_for_abs=6] - StatisticsResult: Ultimate Automizer benchmark data CFG has 5 procedures, 128 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 5.7s, OverallIterations: 1, TraceHistogramMax: 86, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 0.0s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 2.6s, HoareTripleCheckerStatistics: , PredicateUnifierStatistics: No data available, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=460occurred 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, 1.3s SatisfiabilityAnalysisTime, 0.0s InterpolantComputationTime, 459 NumberOfCodeBlocks, 459 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-14 14:35:18,509 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (1)] Ended with exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Writing output log to file Ultimate.log Writing human readable error path to file UltimateCounterExample.errorpath Result: FALSE