./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/nla-digbench-scaling/hard-u_valuebound1.c --full-output --witness-type correctness_witness --validate ../results/automizer-verification-files/SV-COMP24_unreach-call/hard-u_valuebound1.yml/witness-2.1.yml --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 5189fb62 Calling Ultimate with: /root/.sdkman/candidates/java/current/bin/java -Dosgi.configuration.area=/storage/repos/certificate-witnesses-artifact/automizer/data/config -Xmx15G -Xms4m -jar /storage/repos/certificate-witnesses-artifact/automizer/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/certificate-witnesses-artifact/automizer/data -tc /storage/repos/certificate-witnesses-artifact/automizer/config/AutomizerReachWitnessValidation.xml -i ../sv-benchmarks/c/nla-digbench-scaling/hard-u_valuebound1.c ../results/automizer-verification-files/SV-COMP24_unreach-call/hard-u_valuebound1.yml/witness-2.1.yml -s /storage/repos/certificate-witnesses-artifact/automizer/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --traceabstraction.positions.where.we.compute.the.hoare.annotation None --- Real Ultimate output --- This is Ultimate 0.2.4-dev-5189fb6-m [2024-09-13 05:49:29,651 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-09-13 05:49:29,692 INFO L114 SettingsManager]: Loading settings from /storage/repos/certificate-witnesses-artifact/automizer/config/svcomp-Reach-32bit-Automizer_Default.epf [2024-09-13 05:49:29,706 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-09-13 05:49:29,706 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-09-13 05:49:29,733 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-09-13 05:49:29,734 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-09-13 05:49:29,734 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-09-13 05:49:29,734 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-09-13 05:49:29,735 INFO L153 SettingsManager]: * Use memory slicer=true [2024-09-13 05:49:29,735 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-09-13 05:49:29,735 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-09-13 05:49:29,736 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-09-13 05:49:29,736 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-09-13 05:49:29,736 INFO L153 SettingsManager]: * Use SBE=true [2024-09-13 05:49:29,736 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-09-13 05:49:29,737 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-09-13 05:49:29,737 INFO L153 SettingsManager]: * sizeof long=4 [2024-09-13 05:49:29,737 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-09-13 05:49:29,737 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-09-13 05:49:29,737 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-09-13 05:49:29,738 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-09-13 05:49:29,738 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-09-13 05:49:29,739 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-09-13 05:49:29,740 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-09-13 05:49:29,740 INFO L153 SettingsManager]: * sizeof long double=12 [2024-09-13 05:49:29,740 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-09-13 05:49:29,740 INFO L153 SettingsManager]: * Use constant arrays=true [2024-09-13 05:49:29,740 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-09-13 05:49:29,740 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-09-13 05:49:29,741 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-09-13 05:49:29,741 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-09-13 05:49:29,741 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-09-13 05:49:29,741 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-09-13 05:49:29,741 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-09-13 05:49:29,741 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-09-13 05:49:29,741 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-09-13 05:49:29,742 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-09-13 05:49:29,742 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-09-13 05:49:29,742 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-09-13 05:49:29,742 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-09-13 05:49:29,743 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-09-13 05:49:29,743 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/certificate-witnesses-artifact/automizer/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: Positions where we compute the Hoare Annotation -> None [2024-09-13 05:49:29,912 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-09-13 05:49:29,929 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-09-13 05:49:29,931 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-09-13 05:49:29,932 INFO L270 PluginConnector]: Initializing CDTParser... [2024-09-13 05:49:29,932 INFO L274 PluginConnector]: CDTParser initialized [2024-09-13 05:49:29,933 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/certificate-witnesses-artifact/automizer/../sv-benchmarks/c/nla-digbench-scaling/hard-u_valuebound1.c [2024-09-13 05:49:31,113 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-09-13 05:49:31,240 INFO L384 CDTParser]: Found 1 translation units. [2024-09-13 05:49:31,241 INFO L180 CDTParser]: Scanning /storage/repos/certificate-witnesses-artifact/sv-benchmarks/c/nla-digbench-scaling/hard-u_valuebound1.c [2024-09-13 05:49:31,247 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/certificate-witnesses-artifact/automizer/data/74e21f4c5/6394bd60092e44e1928ca9b7bae88bae/FLAG3ab962070 [2024-09-13 05:49:31,675 INFO L435 CDTParser]: Successfully deleted /storage/repos/certificate-witnesses-artifact/automizer/data/74e21f4c5/6394bd60092e44e1928ca9b7bae88bae [2024-09-13 05:49:31,677 INFO L270 PluginConnector]: Initializing Witness Parser... [2024-09-13 05:49:31,678 INFO L274 PluginConnector]: Witness Parser initialized [2024-09-13 05:49:31,680 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/certificate-witnesses-artifact/automizer/../results/automizer-verification-files/SV-COMP24_unreach-call/hard-u_valuebound1.yml/witness-2.1.yml [2024-09-13 05:49:31,716 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-09-13 05:49:31,717 INFO L133 ToolchainWalker]: Walking toolchain with 5 elements. [2024-09-13 05:49:31,718 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-09-13 05:49:31,718 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-09-13 05:49:31,724 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-09-13 05:49:31,725 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 13.09 05:49:31" (1/2) ... [2024-09-13 05:49:31,725 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@2f11ebbc and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.09 05:49:31, skipping insertion in model container [2024-09-13 05:49:31,725 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 13.09 05:49:31" (1/2) ... [2024-09-13 05:49:31,726 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.CACSL2BoogieTranslatorObserver@6be8780f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.09 05:49:31, skipping insertion in model container [2024-09-13 05:49:31,727 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "witness-2.1.yml de.uni_freiburg.informatik.ultimate.witnessparser CORRECTNESS_WITNESS 13.09 05:49:31" (2/2) ... [2024-09-13 05:49:31,727 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@2f11ebbc and model type witness-2.1.yml de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator CORRECTNESS_WITNESS 13.09 05:49:31, skipping insertion in model container [2024-09-13 05:49:31,727 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "witness-2.1.yml de.uni_freiburg.informatik.ultimate.witnessparser CORRECTNESS_WITNESS 13.09 05:49:31" (2/2) ... [2024-09-13 05:49:31,734 INFO L93 nessWitnessExtractor]: Found the following entries in the witness: [2024-09-13 05:49:31,736 INFO L1541 ArrayList]: Loop invariant at [L46-L58] (((((((((((A % 4294967296) == ((B + r) % 4294967296)) && ((A % 4294967296) <= 1)) && ((A / 4294967296) == (r / 4294967296))) && (d == 1)) && ((r % 4294967296) < 1)) && (q == 1)) && (1 <= (((B % 2147483648) + r) % 4294967296))) && (p == 1)) || ((((((((B % 4294967296) == 1) && (((long long) B * 2) == d)) && (p == 2)) && ((A % 4294967296) == 1)) && ((A / 4294967296) == (r / 4294967296))) && ((r % 4294967296) == 1)) && (q == 0))) || (((((((r % 4294967296) <= 0) && (A == r)) && ((d % 4294967296) == 1)) && (q == 0)) && (B == d)) && (p == 1))) [2024-09-13 05:49:31,736 INFO L1541 ArrayList]: Loop invariant at [L36-L44] (((((((((d % 4294967296) == 1) && ((A % 4294967296) <= 1)) && ((A / 4294967296) == (r / 4294967296))) && ((A + ((r / 4294967296) * 4294967296)) == (r + ((A / 4294967296) * 4294967296)))) && (q == 0)) && (B == d)) && (p == 1)) || ((((((((B % 4294967296) == 1) && (((long long) B * 2) == d)) && (p == 2)) && ((A / 4294967296) == (r / 4294967296))) && ((r % 4294967296) == 1)) && ((A + ((r / 4294967296) * 4294967296)) == (r + ((A / 4294967296) * 4294967296)))) && (q == 0))) [2024-09-13 05:49:31,736 INFO L1541 ArrayList]: Function contract at [L14]: requires (1 <= \old(cond)), ensures (1 <= \old(cond)) [2024-09-13 05:49:31,737 INFO L1541 ArrayList]: Function contract at [L11]: requires null, ensures (\old(cond) != 0) [2024-09-13 05:49:31,750 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-09-13 05:49:31,858 WARN L247 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/certificate-witnesses-artifact/sv-benchmarks/c/nla-digbench-scaling/hard-u_valuebound1.c[537,550] [2024-09-13 05:49:31,876 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-09-13 05:49:31,882 INFO L200 MainTranslator]: Completed pre-run Start Parsing Global Start Parsing Global Start Parsing Global [2024-09-13 05:49:31,915 WARN L247 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/certificate-witnesses-artifact/sv-benchmarks/c/nla-digbench-scaling/hard-u_valuebound1.c[537,550] Start Parsing Local Start Parsing Local [2024-09-13 05:49:31,938 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-09-13 05:49:31,949 INFO L204 MainTranslator]: Completed translation [2024-09-13 05:49:31,949 INFO L201 PluginConnector]: Adding new model witness-2.1.yml de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator CORRECTNESS_WITNESS 13.09 05:49:31 WrapperNode [2024-09-13 05:49:31,949 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-09-13 05:49:31,950 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-09-13 05:49:31,950 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-09-13 05:49:31,950 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-09-13 05:49:31,955 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "witness-2.1.yml de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator CORRECTNESS_WITNESS 13.09 05:49:31" (1/1) ... [2024-09-13 05:49:31,960 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "witness-2.1.yml de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator CORRECTNESS_WITNESS 13.09 05:49:31" (1/1) ... [2024-09-13 05:49:31,990 INFO L138 Inliner]: procedures = 14, calls = 17, calls flagged for inlining = 2, calls inlined = 2, statements flattened = 56 [2024-09-13 05:49:31,990 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-09-13 05:49:31,991 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-09-13 05:49:31,991 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-09-13 05:49:31,991 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-09-13 05:49:32,000 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "witness-2.1.yml de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator CORRECTNESS_WITNESS 13.09 05:49:31" (1/1) ... [2024-09-13 05:49:32,000 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "witness-2.1.yml de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator CORRECTNESS_WITNESS 13.09 05:49:31" (1/1) ... [2024-09-13 05:49:32,002 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "witness-2.1.yml de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator CORRECTNESS_WITNESS 13.09 05:49:31" (1/1) ... [2024-09-13 05:49:32,007 WARN L109 MemorySlicer]: Omit memory slicing because it failed with the following exception: Unsupported: Procedure assume_abort_if_not is not part of the Ultimate memory model but has specification other that is not a ModifiesSpecification [2024-09-13 05:49:32,007 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "witness-2.1.yml de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator CORRECTNESS_WITNESS 13.09 05:49:31" (1/1) ... [2024-09-13 05:49:32,007 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "witness-2.1.yml de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator CORRECTNESS_WITNESS 13.09 05:49:31" (1/1) ... [2024-09-13 05:49:32,016 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "witness-2.1.yml de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator CORRECTNESS_WITNESS 13.09 05:49:31" (1/1) ... [2024-09-13 05:49:32,019 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "witness-2.1.yml de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator CORRECTNESS_WITNESS 13.09 05:49:31" (1/1) ... [2024-09-13 05:49:32,020 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "witness-2.1.yml de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator CORRECTNESS_WITNESS 13.09 05:49:31" (1/1) ... [2024-09-13 05:49:32,022 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "witness-2.1.yml de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator CORRECTNESS_WITNESS 13.09 05:49:31" (1/1) ... [2024-09-13 05:49:32,024 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-09-13 05:49:32,025 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-09-13 05:49:32,025 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-09-13 05:49:32,025 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-09-13 05:49:32,026 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "witness-2.1.yml de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator CORRECTNESS_WITNESS 13.09 05:49:31" (1/1) ... [2024-09-13 05:49:32,031 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-09-13 05:49:32,036 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/certificate-witnesses-artifact/automizer/z3 [2024-09-13 05:49:32,050 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/certificate-witnesses-artifact/automizer/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2024-09-13 05:49:32,052 INFO L327 MonitoredProcess]: [MP /storage/repos/certificate-witnesses-artifact/automizer/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2024-09-13 05:49:32,082 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-09-13 05:49:32,083 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2024-09-13 05:49:32,083 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2024-09-13 05:49:32,083 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2024-09-13 05:49:32,083 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-09-13 05:49:32,083 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-09-13 05:49:32,083 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2024-09-13 05:49:32,083 INFO L138 BoogieDeclarations]: Found implementation of procedure __VERIFIER_assert [2024-09-13 05:49:32,128 INFO L242 CfgBuilder]: Building ICFG [2024-09-13 05:49:32,129 INFO L268 CfgBuilder]: Building CFG for each procedure with an implementation [2024-09-13 05:49:32,369 WARN L783 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2024-09-13 05:49:32,397 INFO L? ?]: Removed 42 outVars from TransFormulas that were not future-live. [2024-09-13 05:49:32,397 INFO L291 CfgBuilder]: Performing block encoding [2024-09-13 05:49:32,416 INFO L313 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-09-13 05:49:32,417 INFO L318 CfgBuilder]: Removed 2 assume(true) statements. [2024-09-13 05:49:32,418 INFO L201 PluginConnector]: Adding new model witness-2.1.yml de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 13.09 05:49:32 BoogieIcfgContainer [2024-09-13 05:49:32,419 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-09-13 05:49:32,421 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-09-13 05:49:32,421 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-09-13 05:49:32,424 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-09-13 05:49:32,424 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 13.09 05:49:31" (1/4) ... [2024-09-13 05:49:32,425 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@c9a89a5 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 13.09 05:49:32, skipping insertion in model container [2024-09-13 05:49:32,425 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "witness-2.1.yml de.uni_freiburg.informatik.ultimate.witnessparser CORRECTNESS_WITNESS 13.09 05:49:31" (2/4) ... [2024-09-13 05:49:32,425 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@c9a89a5 and model type witness-2.1.yml de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CORRECTNESS_WITNESS 13.09 05:49:32, skipping insertion in model container [2024-09-13 05:49:32,426 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "witness-2.1.yml de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator CORRECTNESS_WITNESS 13.09 05:49:31" (3/4) ... [2024-09-13 05:49:32,426 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@c9a89a5 and model type witness-2.1.yml de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CORRECTNESS_WITNESS 13.09 05:49:32, skipping insertion in model container [2024-09-13 05:49:32,427 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "witness-2.1.yml de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 13.09 05:49:32" (4/4) ... [2024-09-13 05:49:32,427 INFO L112 eAbstractionObserver]: Analyzing ICFG hard-u_valuebound1.c [2024-09-13 05:49:32,443 INFO L209 ceAbstractionStarter]: Automizer settings: Hoare:None NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-09-13 05:49:32,444 INFO L149 ceAbstractionStarter]: Applying trace abstraction to program that has 12 error locations. [2024-09-13 05:49:32,475 INFO L335 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-09-13 05:49:32,481 INFO L336 AbstractCegarLoop]: Settings: SEPARATE_VIOLATION_CHECK=true, mInterprocedural=true, mMaxIterations=1000000, mWatchIteration=1000000, mArtifact=RCFG, mInterpolation=FPandBP, mInterpolantAutomaton=STRAIGHT_LINE, mDumpAutomata=false, mAutomataFormat=ATS_NUMERATE, mDumpPath=., mDeterminiation=PREDICATE_ABSTRACTION, mMinimize=MINIMIZE_SEVPA, mAutomataTypeConcurrency=PETRI_NET, mHoareTripleChecks=INCREMENTAL, mHoareAnnotationPositions=None, 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;@4c4ea122, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-09-13 05:49:32,481 INFO L337 AbstractCegarLoop]: Starting to check reachability of 12 error locations. [2024-09-13 05:49:32,485 INFO L276 IsEmpty]: Start isEmpty. Operand has 43 states, 25 states have (on average 1.56) internal successors, (39), 30 states have internal predecessors, (39), 10 states have call successors, (10), 2 states have call predecessors, (10), 2 states have return successors, (10), 10 states have call predecessors, (10), 10 states have call successors, (10) [2024-09-13 05:49:32,490 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2024-09-13 05:49:32,490 INFO L208 NwaCegarLoop]: Found error trace [2024-09-13 05:49:32,491 INFO L216 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1] [2024-09-13 05:49:32,491 INFO L399 AbstractCegarLoop]: === Iteration 1 === Targeting assume_abort_if_notErr0ENSURES_VIOLATIONPOST_CONDITION === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1REQUIRES_VIOLATIONPRE_CONDITION, ULTIMATE.startErr2REQUIRES_VIOLATIONPRE_CONDITION (and 9 more)] === [2024-09-13 05:49:32,497 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-13 05:49:32,497 INFO L85 PathProgramCache]: Analyzing trace with hash 134843102, now seen corresponding path program 1 times [2024-09-13 05:49:32,504 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-09-13 05:49:32,505 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [281275194] [2024-09-13 05:49:32,505 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-09-13 05:49:32,505 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-09-13 05:49:32,571 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-13 05:49:32,603 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-09-13 05:49:32,603 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-09-13 05:49:32,603 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [281275194] [2024-09-13 05:49:32,604 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [281275194] provided 1 perfect and 0 imperfect interpolant sequences [2024-09-13 05:49:32,604 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-09-13 05:49:32,604 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-09-13 05:49:32,605 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2083513108] [2024-09-13 05:49:32,605 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-09-13 05:49:32,608 INFO L551 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-09-13 05:49:32,608 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-09-13 05:49:32,629 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-09-13 05:49:32,629 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-09-13 05:49:32,631 INFO L87 Difference]: Start difference. First operand has 43 states, 25 states have (on average 1.56) internal successors, (39), 30 states have internal predecessors, (39), 10 states have call successors, (10), 2 states have call predecessors, (10), 2 states have return successors, (10), 10 states have call predecessors, (10), 10 states have call successors, (10) Second operand has 2 states, 2 states have (on average 2.0) internal successors, (4), 2 states have internal predecessors, (4), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-09-13 05:49:32,649 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-09-13 05:49:32,649 INFO L93 Difference]: Finished difference Result 43 states and 53 transitions. [2024-09-13 05:49:32,650 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-09-13 05:49:32,651 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 2.0) internal successors, (4), 2 states have internal predecessors, (4), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 5 [2024-09-13 05:49:32,651 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-09-13 05:49:32,655 INFO L225 Difference]: With dead ends: 43 [2024-09-13 05:49:32,655 INFO L226 Difference]: Without dead ends: 41 [2024-09-13 05:49:32,656 INFO L433 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-09-13 05:49:32,658 INFO L434 NwaCegarLoop]: 50 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 3 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 50 SdHoareTripleChecker+Invalid, 3 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 3 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-09-13 05:49:32,659 INFO L435 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 50 Invalid, 3 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 3 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-09-13 05:49:32,669 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 41 states. [2024-09-13 05:49:32,680 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 41 to 41. [2024-09-13 05:49:32,681 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 41 states, 24 states have (on average 1.3333333333333333) internal successors, (32), 29 states have internal predecessors, (32), 10 states have call successors, (10), 2 states have call predecessors, (10), 2 states have return successors, (9), 9 states have call predecessors, (9), 9 states have call successors, (9) [2024-09-13 05:49:32,682 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 41 states to 41 states and 51 transitions. [2024-09-13 05:49:32,683 INFO L78 Accepts]: Start accepts. Automaton has 41 states and 51 transitions. Word has length 5 [2024-09-13 05:49:32,683 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-09-13 05:49:32,683 INFO L474 AbstractCegarLoop]: Abstraction has 41 states and 51 transitions. [2024-09-13 05:49:32,683 INFO L475 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 2.0) internal successors, (4), 2 states have internal predecessors, (4), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-09-13 05:49:32,683 INFO L276 IsEmpty]: Start isEmpty. Operand 41 states and 51 transitions. [2024-09-13 05:49:32,684 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2024-09-13 05:49:32,684 INFO L208 NwaCegarLoop]: Found error trace [2024-09-13 05:49:32,684 INFO L216 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1] [2024-09-13 05:49:32,684 WARN L456 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-09-13 05:49:32,684 INFO L399 AbstractCegarLoop]: === Iteration 2 === Targeting assume_abort_if_notErr0ENSURES_VIOLATIONPOST_CONDITION === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1REQUIRES_VIOLATIONPRE_CONDITION, ULTIMATE.startErr2REQUIRES_VIOLATIONPRE_CONDITION (and 9 more)] === [2024-09-13 05:49:32,685 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-13 05:49:32,685 INFO L85 PathProgramCache]: Analyzing trace with hash 134843164, now seen corresponding path program 1 times [2024-09-13 05:49:32,685 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-09-13 05:49:32,685 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1822040826] [2024-09-13 05:49:32,685 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-09-13 05:49:32,686 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-09-13 05:49:32,693 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-13 05:49:32,734 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-09-13 05:49:32,734 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-09-13 05:49:32,734 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1822040826] [2024-09-13 05:49:32,735 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1822040826] provided 1 perfect and 0 imperfect interpolant sequences [2024-09-13 05:49:32,735 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-09-13 05:49:32,735 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-09-13 05:49:32,735 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1227436076] [2024-09-13 05:49:32,735 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-09-13 05:49:32,736 INFO L551 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-09-13 05:49:32,736 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-09-13 05:49:32,737 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-09-13 05:49:32,737 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-09-13 05:49:32,737 INFO L87 Difference]: Start difference. First operand 41 states and 51 transitions. Second operand has 4 states, 3 states have (on average 1.3333333333333333) internal successors, (4), 4 states have internal predecessors, (4), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-09-13 05:49:32,780 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-09-13 05:49:32,780 INFO L93 Difference]: Finished difference Result 40 states and 50 transitions. [2024-09-13 05:49:32,781 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-09-13 05:49:32,781 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 1.3333333333333333) internal successors, (4), 4 states have internal predecessors, (4), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 5 [2024-09-13 05:49:32,781 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-09-13 05:49:32,782 INFO L225 Difference]: With dead ends: 40 [2024-09-13 05:49:32,782 INFO L226 Difference]: Without dead ends: 40 [2024-09-13 05:49:32,782 INFO L433 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 1 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-09-13 05:49:32,783 INFO L434 NwaCegarLoop]: 43 mSDtfsCounter, 1 mSDsluCounter, 78 mSDsCounter, 0 mSdLazyCounter, 26 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 121 SdHoareTripleChecker+Invalid, 26 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 26 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-09-13 05:49:32,783 INFO L435 NwaCegarLoop]: SdHoareTripleChecker [1 Valid, 121 Invalid, 26 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 26 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-09-13 05:49:32,783 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 40 states. [2024-09-13 05:49:32,788 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 40 to 40. [2024-09-13 05:49:32,789 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 40 states, 24 states have (on average 1.2916666666666667) internal successors, (31), 28 states have internal predecessors, (31), 10 states have call successors, (10), 2 states have call predecessors, (10), 2 states have return successors, (9), 9 states have call predecessors, (9), 9 states have call successors, (9) [2024-09-13 05:49:32,790 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 40 states to 40 states and 50 transitions. [2024-09-13 05:49:32,790 INFO L78 Accepts]: Start accepts. Automaton has 40 states and 50 transitions. Word has length 5 [2024-09-13 05:49:32,790 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-09-13 05:49:32,791 INFO L474 AbstractCegarLoop]: Abstraction has 40 states and 50 transitions. [2024-09-13 05:49:32,791 INFO L475 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 1.3333333333333333) internal successors, (4), 4 states have internal predecessors, (4), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-09-13 05:49:32,791 INFO L276 IsEmpty]: Start isEmpty. Operand 40 states and 50 transitions. [2024-09-13 05:49:32,792 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2024-09-13 05:49:32,792 INFO L208 NwaCegarLoop]: Found error trace [2024-09-13 05:49:32,792 INFO L216 NwaCegarLoop]: trace histogram [3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-09-13 05:49:32,792 WARN L456 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-09-13 05:49:32,792 INFO L399 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1REQUIRES_VIOLATIONPRE_CONDITION, ULTIMATE.startErr2REQUIRES_VIOLATIONPRE_CONDITION (and 9 more)] === [2024-09-13 05:49:32,793 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-13 05:49:32,809 INFO L85 PathProgramCache]: Analyzing trace with hash 363565673, now seen corresponding path program 1 times [2024-09-13 05:49:32,810 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-09-13 05:49:32,811 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1293287213] [2024-09-13 05:49:32,811 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-09-13 05:49:32,811 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-09-13 05:49:32,879 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-13 05:49:33,598 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-09-13 05:49:33,602 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-13 05:49:33,631 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2024-09-13 05:49:33,633 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-13 05:49:33,649 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2024-09-13 05:49:33,652 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-13 05:49:33,666 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2024-09-13 05:49:33,666 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-09-13 05:49:33,666 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1293287213] [2024-09-13 05:49:33,667 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1293287213] provided 1 perfect and 0 imperfect interpolant sequences [2024-09-13 05:49:33,667 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-09-13 05:49:33,667 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-09-13 05:49:33,668 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1651833609] [2024-09-13 05:49:33,668 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-09-13 05:49:33,668 INFO L551 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-09-13 05:49:33,669 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-09-13 05:49:33,669 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-09-13 05:49:33,670 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=38, Unknown=0, NotChecked=0, Total=56 [2024-09-13 05:49:33,672 INFO L87 Difference]: Start difference. First operand 40 states and 50 transitions. Second operand has 8 states, 6 states have (on average 1.1666666666666667) internal successors, (7), 6 states have internal predecessors, (7), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2024-09-13 05:49:33,894 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-09-13 05:49:33,894 INFO L93 Difference]: Finished difference Result 51 states and 68 transitions. [2024-09-13 05:49:33,894 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-09-13 05:49:33,895 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 6 states have (on average 1.1666666666666667) internal successors, (7), 6 states have internal predecessors, (7), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) Word has length 19 [2024-09-13 05:49:33,895 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-09-13 05:49:33,895 INFO L225 Difference]: With dead ends: 51 [2024-09-13 05:49:33,896 INFO L226 Difference]: Without dead ends: 51 [2024-09-13 05:49:33,897 INFO L433 NwaCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 8 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=24, Invalid=48, Unknown=0, NotChecked=0, Total=72 [2024-09-13 05:49:33,897 INFO L434 NwaCegarLoop]: 29 mSDtfsCounter, 52 mSDsluCounter, 84 mSDsCounter, 0 mSdLazyCounter, 109 mSolverCounterSat, 23 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 64 SdHoareTripleChecker+Valid, 113 SdHoareTripleChecker+Invalid, 132 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 23 IncrementalHoareTripleChecker+Valid, 109 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-09-13 05:49:33,898 INFO L435 NwaCegarLoop]: SdHoareTripleChecker [64 Valid, 113 Invalid, 132 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [23 Valid, 109 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-09-13 05:49:33,899 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 51 states. [2024-09-13 05:49:33,904 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 51 to 51. [2024-09-13 05:49:33,905 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 51 states, 30 states have (on average 1.3) internal successors, (39), 34 states have internal predecessors, (39), 15 states have call successors, (15), 2 states have call predecessors, (15), 2 states have return successors, (14), 14 states have call predecessors, (14), 14 states have call successors, (14) [2024-09-13 05:49:33,906 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 51 states to 51 states and 68 transitions. [2024-09-13 05:49:33,907 INFO L78 Accepts]: Start accepts. Automaton has 51 states and 68 transitions. Word has length 19 [2024-09-13 05:49:33,907 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-09-13 05:49:33,908 INFO L474 AbstractCegarLoop]: Abstraction has 51 states and 68 transitions. [2024-09-13 05:49:33,908 INFO L475 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 6 states have (on average 1.1666666666666667) internal successors, (7), 6 states have internal predecessors, (7), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2024-09-13 05:49:33,908 INFO L276 IsEmpty]: Start isEmpty. Operand 51 states and 68 transitions. [2024-09-13 05:49:33,908 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2024-09-13 05:49:33,908 INFO L208 NwaCegarLoop]: Found error trace [2024-09-13 05:49:33,909 INFO L216 NwaCegarLoop]: trace histogram [3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-09-13 05:49:33,909 WARN L456 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-09-13 05:49:33,909 INFO L399 AbstractCegarLoop]: === Iteration 4 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1REQUIRES_VIOLATIONPRE_CONDITION, ULTIMATE.startErr2REQUIRES_VIOLATIONPRE_CONDITION (and 9 more)] === [2024-09-13 05:49:33,910 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-13 05:49:33,910 INFO L85 PathProgramCache]: Analyzing trace with hash -1764960997, now seen corresponding path program 1 times [2024-09-13 05:49:33,910 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-09-13 05:49:33,910 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1507955330] [2024-09-13 05:49:33,910 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-09-13 05:49:33,910 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-09-13 05:49:33,918 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-13 05:49:33,960 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-09-13 05:49:33,961 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-13 05:49:33,962 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2024-09-13 05:49:33,962 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-13 05:49:33,965 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2024-09-13 05:49:33,966 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-13 05:49:33,967 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2024-09-13 05:49:33,968 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-09-13 05:49:33,968 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1507955330] [2024-09-13 05:49:33,968 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1507955330] provided 1 perfect and 0 imperfect interpolant sequences [2024-09-13 05:49:33,968 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-09-13 05:49:33,968 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-09-13 05:49:33,968 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [577675426] [2024-09-13 05:49:33,969 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-09-13 05:49:33,969 INFO L551 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-09-13 05:49:33,969 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-09-13 05:49:33,969 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-09-13 05:49:33,970 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-09-13 05:49:33,970 INFO L87 Difference]: Start difference. First operand 51 states and 68 transitions. Second operand has 3 states, 3 states have (on average 3.6666666666666665) internal successors, (11), 3 states have internal predecessors, (11), 1 states have call successors, (4), 1 states have call predecessors, (4), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2024-09-13 05:49:33,977 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-09-13 05:49:33,979 INFO L93 Difference]: Finished difference Result 49 states and 66 transitions. [2024-09-13 05:49:33,979 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-09-13 05:49:33,979 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 3.6666666666666665) internal successors, (11), 3 states have internal predecessors, (11), 1 states have call successors, (4), 1 states have call predecessors, (4), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) Word has length 24 [2024-09-13 05:49:33,979 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-09-13 05:49:33,980 INFO L225 Difference]: With dead ends: 49 [2024-09-13 05:49:33,980 INFO L226 Difference]: Without dead ends: 49 [2024-09-13 05:49:33,980 INFO L433 NwaCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 10 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-09-13 05:49:33,981 INFO L434 NwaCegarLoop]: 45 mSDtfsCounter, 0 mSDsluCounter, 45 mSDsCounter, 0 mSdLazyCounter, 5 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 90 SdHoareTripleChecker+Invalid, 5 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 5 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-09-13 05:49:33,981 INFO L435 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 90 Invalid, 5 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 5 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-09-13 05:49:33,981 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 49 states. [2024-09-13 05:49:33,987 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 49 to 49. [2024-09-13 05:49:33,988 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 49 states, 29 states have (on average 1.2758620689655173) internal successors, (37), 32 states have internal predecessors, (37), 15 states have call successors, (15), 2 states have call predecessors, (15), 2 states have return successors, (14), 14 states have call predecessors, (14), 14 states have call successors, (14) [2024-09-13 05:49:33,988 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 49 states to 49 states and 66 transitions. [2024-09-13 05:49:33,988 INFO L78 Accepts]: Start accepts. Automaton has 49 states and 66 transitions. Word has length 24 [2024-09-13 05:49:33,989 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-09-13 05:49:33,989 INFO L474 AbstractCegarLoop]: Abstraction has 49 states and 66 transitions. [2024-09-13 05:49:33,989 INFO L475 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 3.6666666666666665) internal successors, (11), 3 states have internal predecessors, (11), 1 states have call successors, (4), 1 states have call predecessors, (4), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2024-09-13 05:49:33,989 INFO L276 IsEmpty]: Start isEmpty. Operand 49 states and 66 transitions. [2024-09-13 05:49:33,989 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2024-09-13 05:49:33,989 INFO L208 NwaCegarLoop]: Found error trace [2024-09-13 05:49:33,990 INFO L216 NwaCegarLoop]: trace histogram [3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-09-13 05:49:33,990 WARN L456 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2024-09-13 05:49:33,990 INFO L399 AbstractCegarLoop]: === Iteration 5 === Targeting __VERIFIER_assertErr1ENSURES_VIOLATIONPOST_CONDITION === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1REQUIRES_VIOLATIONPRE_CONDITION, ULTIMATE.startErr2REQUIRES_VIOLATIONPRE_CONDITION (and 9 more)] === [2024-09-13 05:49:33,990 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-13 05:49:33,990 INFO L85 PathProgramCache]: Analyzing trace with hash -1764960836, now seen corresponding path program 1 times [2024-09-13 05:49:33,990 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-09-13 05:49:33,991 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [392360967] [2024-09-13 05:49:33,991 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-09-13 05:49:33,991 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-09-13 05:49:34,001 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-13 05:49:34,031 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-09-13 05:49:34,032 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-13 05:49:34,034 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2024-09-13 05:49:34,037 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-13 05:49:34,038 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2024-09-13 05:49:34,039 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-13 05:49:34,042 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2024-09-13 05:49:34,042 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-09-13 05:49:34,042 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [392360967] [2024-09-13 05:49:34,043 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [392360967] provided 1 perfect and 0 imperfect interpolant sequences [2024-09-13 05:49:34,043 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-09-13 05:49:34,043 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-09-13 05:49:34,043 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1069182148] [2024-09-13 05:49:34,044 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-09-13 05:49:34,044 INFO L551 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-09-13 05:49:34,044 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-09-13 05:49:34,045 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-09-13 05:49:34,045 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-09-13 05:49:34,045 INFO L87 Difference]: Start difference. First operand 49 states and 66 transitions. Second operand has 3 states, 2 states have (on average 5.5) internal successors, (11), 3 states have internal predecessors, (11), 1 states have call successors, (4), 1 states have call predecessors, (4), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2024-09-13 05:49:34,077 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-09-13 05:49:34,077 INFO L93 Difference]: Finished difference Result 48 states and 65 transitions. [2024-09-13 05:49:34,077 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-09-13 05:49:34,078 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 5.5) internal successors, (11), 3 states have internal predecessors, (11), 1 states have call successors, (4), 1 states have call predecessors, (4), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) Word has length 24 [2024-09-13 05:49:34,078 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-09-13 05:49:34,079 INFO L225 Difference]: With dead ends: 48 [2024-09-13 05:49:34,080 INFO L226 Difference]: Without dead ends: 48 [2024-09-13 05:49:34,080 INFO L433 NwaCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 7 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-09-13 05:49:34,081 INFO L434 NwaCegarLoop]: 38 mSDtfsCounter, 1 mSDsluCounter, 30 mSDsCounter, 0 mSdLazyCounter, 23 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 68 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-09-13 05:49:34,081 INFO L435 NwaCegarLoop]: SdHoareTripleChecker [1 Valid, 68 Invalid, 23 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 23 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-09-13 05:49:34,082 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 48 states. [2024-09-13 05:49:34,087 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 48 to 48. [2024-09-13 05:49:34,088 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 48 states, 29 states have (on average 1.2413793103448276) internal successors, (36), 31 states have internal predecessors, (36), 14 states have call successors, (14), 2 states have call predecessors, (14), 2 states have return successors, (14), 14 states have call predecessors, (14), 14 states have call successors, (14) [2024-09-13 05:49:34,089 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 48 states to 48 states and 64 transitions. [2024-09-13 05:49:34,089 INFO L78 Accepts]: Start accepts. Automaton has 48 states and 64 transitions. Word has length 24 [2024-09-13 05:49:34,089 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-09-13 05:49:34,089 INFO L474 AbstractCegarLoop]: Abstraction has 48 states and 64 transitions. [2024-09-13 05:49:34,089 INFO L475 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 5.5) internal successors, (11), 3 states have internal predecessors, (11), 1 states have call successors, (4), 1 states have call predecessors, (4), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2024-09-13 05:49:34,089 INFO L276 IsEmpty]: Start isEmpty. Operand 48 states and 64 transitions. [2024-09-13 05:49:34,090 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2024-09-13 05:49:34,090 INFO L208 NwaCegarLoop]: Found error trace [2024-09-13 05:49:34,090 INFO L216 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-09-13 05:49:34,090 WARN L456 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2024-09-13 05:49:34,091 INFO L399 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr4ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1REQUIRES_VIOLATIONPRE_CONDITION, ULTIMATE.startErr2REQUIRES_VIOLATIONPRE_CONDITION (and 9 more)] === [2024-09-13 05:49:34,091 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-13 05:49:34,091 INFO L85 PathProgramCache]: Analyzing trace with hash -1154352943, now seen corresponding path program 1 times [2024-09-13 05:49:34,091 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-09-13 05:49:34,091 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1729379060] [2024-09-13 05:49:34,091 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-09-13 05:49:34,091 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-09-13 05:49:34,111 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-13 05:49:34,374 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-09-13 05:49:34,375 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-13 05:49:34,376 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2024-09-13 05:49:34,380 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-13 05:49:34,382 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2024-09-13 05:49:34,382 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-13 05:49:34,383 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2024-09-13 05:49:34,385 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-13 05:49:34,391 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 25 [2024-09-13 05:49:34,394 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-13 05:49:34,413 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 30 [2024-09-13 05:49:34,415 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-13 05:49:34,424 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 3 proven. 3 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2024-09-13 05:49:34,424 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-09-13 05:49:34,425 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1729379060] [2024-09-13 05:49:34,425 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1729379060] provided 0 perfect and 1 imperfect interpolant sequences [2024-09-13 05:49:34,425 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [162963690] [2024-09-13 05:49:34,425 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-09-13 05:49:34,425 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-09-13 05:49:34,426 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/certificate-witnesses-artifact/automizer/z3 [2024-09-13 05:49:34,427 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/certificate-witnesses-artifact/automizer/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-09-13 05:49:34,432 INFO L327 MonitoredProcess]: [MP /storage/repos/certificate-witnesses-artifact/automizer/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2024-09-13 05:49:34,478 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-13 05:49:34,480 INFO L262 TraceCheckSpWp]: Trace formula consists of 93 conjuncts, 4 conjuncts are in the unsatisfiable core [2024-09-13 05:49:34,484 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2024-09-13 05:49:35,030 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 24 trivial. 0 not checked. [2024-09-13 05:49:35,030 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-09-13 05:49:35,030 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [162963690] provided 1 perfect and 0 imperfect interpolant sequences [2024-09-13 05:49:35,030 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-09-13 05:49:35,030 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [6] total 8 [2024-09-13 05:49:35,031 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1291264198] [2024-09-13 05:49:35,031 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-09-13 05:49:35,031 INFO L551 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-09-13 05:49:35,031 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-09-13 05:49:35,031 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-09-13 05:49:35,031 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=48, Unknown=0, NotChecked=0, Total=72 [2024-09-13 05:49:35,032 INFO L87 Difference]: Start difference. First operand 48 states and 64 transitions. Second operand has 4 states, 3 states have (on average 4.333333333333333) internal successors, (13), 4 states have internal predecessors, (13), 2 states have call successors, (6), 1 states have call predecessors, (6), 1 states have return successors, (6), 2 states have call predecessors, (6), 2 states have call successors, (6) [2024-09-13 05:49:39,055 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-09-13 05:49:43,093 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers [] [2024-09-13 05:49:47,102 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.01s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers [] [2024-09-13 05:49:51,109 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.01s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers [] [2024-09-13 05:49:55,121 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers [] [2024-09-13 05:49:59,124 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers [] [2024-09-13 05:50:03,127 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers [] [2024-09-13 05:50:07,131 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers [] [2024-09-13 05:50:11,136 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers [] [2024-09-13 05:50:15,138 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers [] [2024-09-13 05:50:15,284 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-09-13 05:50:15,284 INFO L93 Difference]: Finished difference Result 51 states and 71 transitions. [2024-09-13 05:50:15,284 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-09-13 05:50:15,285 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 4.333333333333333) internal successors, (13), 4 states have internal predecessors, (13), 2 states have call successors, (6), 1 states have call predecessors, (6), 1 states have return successors, (6), 2 states have call predecessors, (6), 2 states have call successors, (6) Word has length 37 [2024-09-13 05:50:15,285 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-09-13 05:50:15,285 INFO L225 Difference]: With dead ends: 51 [2024-09-13 05:50:15,285 INFO L226 Difference]: Without dead ends: 51 [2024-09-13 05:50:15,285 INFO L433 NwaCegarLoop]: 0 DeclaredPredicates, 53 GetRequests, 46 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=24, Invalid=48, Unknown=0, NotChecked=0, Total=72 [2024-09-13 05:50:15,286 INFO L434 NwaCegarLoop]: 40 mSDtfsCounter, 7 mSDsluCounter, 25 mSDsCounter, 0 mSdLazyCounter, 29 mSolverCounterSat, 10 mSolverCounterUnsat, 10 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 40.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 12 SdHoareTripleChecker+Valid, 65 SdHoareTripleChecker+Invalid, 49 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 10 IncrementalHoareTripleChecker+Valid, 29 IncrementalHoareTripleChecker+Invalid, 10 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 40.2s IncrementalHoareTripleChecker+Time [2024-09-13 05:50:15,286 INFO L435 NwaCegarLoop]: SdHoareTripleChecker [12 Valid, 65 Invalid, 49 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [10 Valid, 29 Invalid, 10 Unknown, 0 Unchecked, 40.2s Time] [2024-09-13 05:50:15,287 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 51 states. [2024-09-13 05:50:15,290 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 51 to 51. [2024-09-13 05:50:15,291 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 51 states, 33 states have (on average 1.1818181818181819) internal successors, (39), 32 states have internal predecessors, (39), 16 states have call successors, (16), 2 states have call predecessors, (16), 2 states have return successors, (16), 16 states have call predecessors, (16), 16 states have call successors, (16) [2024-09-13 05:50:15,291 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 51 states to 51 states and 71 transitions. [2024-09-13 05:50:15,292 INFO L78 Accepts]: Start accepts. Automaton has 51 states and 71 transitions. Word has length 37 [2024-09-13 05:50:15,292 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-09-13 05:50:15,293 INFO L474 AbstractCegarLoop]: Abstraction has 51 states and 71 transitions. [2024-09-13 05:50:15,293 INFO L475 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 4.333333333333333) internal successors, (13), 4 states have internal predecessors, (13), 2 states have call successors, (6), 1 states have call predecessors, (6), 1 states have return successors, (6), 2 states have call predecessors, (6), 2 states have call successors, (6) [2024-09-13 05:50:15,293 INFO L276 IsEmpty]: Start isEmpty. Operand 51 states and 71 transitions. [2024-09-13 05:50:15,294 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 50 [2024-09-13 05:50:15,294 INFO L208 NwaCegarLoop]: Found error trace [2024-09-13 05:50:15,294 INFO L216 NwaCegarLoop]: trace histogram [5, 5, 5, 3, 3, 3, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-09-13 05:50:15,307 INFO L540 MonitoredProcess]: [MP /storage/repos/certificate-witnesses-artifact/automizer/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2024-09-13 05:50:15,494 WARN L456 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/certificate-witnesses-artifact/automizer/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable5 [2024-09-13 05:50:15,495 INFO L399 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr3REQUIRES_VIOLATIONPRE_CONDITION === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1REQUIRES_VIOLATIONPRE_CONDITION, ULTIMATE.startErr2REQUIRES_VIOLATIONPRE_CONDITION (and 9 more)] === [2024-09-13 05:50:15,495 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-13 05:50:15,495 INFO L85 PathProgramCache]: Analyzing trace with hash -1529731622, now seen corresponding path program 1 times [2024-09-13 05:50:15,495 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-09-13 05:50:15,495 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [991013713] [2024-09-13 05:50:15,495 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-09-13 05:50:15,495 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-09-13 05:50:15,518 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unknown [2024-09-13 05:50:15,520 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1128399486] [2024-09-13 05:50:15,520 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-09-13 05:50:15,520 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-09-13 05:50:15,520 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/certificate-witnesses-artifact/automizer/z3 [2024-09-13 05:50:15,521 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/certificate-witnesses-artifact/automizer/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-09-13 05:50:15,522 INFO L327 MonitoredProcess]: [MP /storage/repos/certificate-witnesses-artifact/automizer/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2024-09-13 05:50:15,603 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-13 05:50:15,604 INFO L262 TraceCheckSpWp]: Trace formula consists of 117 conjuncts, 12 conjuncts are in the unsatisfiable core [2024-09-13 05:50:15,606 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2024-09-13 05:50:15,839 INFO L134 CoverageAnalysis]: Checked inductivity of 57 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 52 trivial. 0 not checked. [2024-09-13 05:50:15,839 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2024-09-13 05:50:31,933 WARN L293 SmtUtils]: Spent 12.01s on a formula simplification that was a NOOP. DAG size: 6 (called from [L 731] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2024-09-13 05:50:39,952 WARN L293 SmtUtils]: Spent 8.02s on a formula simplification that was a NOOP. DAG size: 6 (called from [L 731] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2024-09-13 05:50:51,964 WARN L293 SmtUtils]: Spent 12.01s on a formula simplification that was a NOOP. DAG size: 6 (called from [L 731] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2024-09-13 05:51:08,023 WARN L293 SmtUtils]: Spent 12.01s on a formula simplification that was a NOOP. DAG size: 6 (called from [L 731] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2024-09-13 05:51:28,101 WARN L293 SmtUtils]: Spent 16.02s on a formula simplification that was a NOOP. DAG size: 13 (called from [L 731] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2024-09-13 05:51:40,113 WARN L293 SmtUtils]: Spent 12.01s on a formula simplification that was a NOOP. DAG size: 5 (called from [L 731] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2024-09-13 05:51:52,131 WARN L293 SmtUtils]: Spent 12.02s on a formula simplification that was a NOOP. DAG size: 6 (called from [L 731] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2024-09-13 05:52:08,203 WARN L876 $PredicateComparison]: unable to prove that (let ((.cse4 (mod |c_ULTIMATE.start_main_~d~0#1| 4294967296))) (or (let ((.cse1 (not (= (mod |c_ULTIMATE.start_main_~B~0#1| 4294967296) 1))) (.cse3 (mod |c_ULTIMATE.start_main_~p~0#1| 4294967296)) (.cse2 (mod |c_ULTIMATE.start_main_~r~0#1| 4294967296)) (.cse0 (mod |c_ULTIMATE.start_main_~A~0#1| 4294967296)) (.cse5 (not (= (mod |c_ULTIMATE.start_main_~q~0#1| 4294967296) 0)))) (and (or (not (= .cse0 1)) .cse1 (not (= .cse2 1)) (not (= 2 .cse3)) (not (= .cse4 2)) .cse5) (or (not (= .cse4 1)) .cse1 (not (= .cse3 1)) (not (= (+ (* (div .cse2 4294967296) 4294967296) .cse0) (+ (* (div .cse0 4294967296) 4294967296) .cse2))) (< 1 .cse0) .cse5))) (= .cse4 (mod (* |c_ULTIMATE.start_main_~p~0#1| |c_ULTIMATE.start_main_~B~0#1|) 4294967296)))) is different from true [2024-09-13 05:52:20,230 WARN L293 SmtUtils]: Spent 12.01s on a formula simplification that was a NOOP. DAG size: 5 (called from [L 731] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2024-09-13 05:52:32,240 WARN L293 SmtUtils]: Spent 12.01s on a formula simplification that was a NOOP. DAG size: 6 (called from [L 731] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2024-09-13 05:52:44,252 WARN L293 SmtUtils]: Spent 12.01s on a formula simplification that was a NOOP. DAG size: 6 (called from [L 731] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2024-09-13 05:53:00,283 WARN L293 SmtUtils]: Spent 12.02s on a formula simplification that was a NOOP. DAG size: 6 (called from [L 731] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2024-09-13 05:53:20,356 WARN L293 SmtUtils]: Spent 12.01s on a formula simplification that was a NOOP. DAG size: 6 (called from [L 731] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2024-09-13 05:53:24,364 WARN L876 $PredicateComparison]: unable to prove that (or (not (= (mod |c_ULTIMATE.start_main_~d~0#1| 2147483648) 1)) (not (= (mod |c_ULTIMATE.start_main_~A~0#1| 4294967296) 1)) (not (= (mod |c_ULTIMATE.start_main_~B~0#1| 4294967296) 1)) (< 1 (mod |c_ULTIMATE.start_main_~d~0#1| 4294967296)) (not (= (mod |c_ULTIMATE.start_main_~r~0#1| 4294967296) 1)) (not (= (mod |c_ULTIMATE.start_main_~p~0#1| 2147483648) 1)) (= (mod (* |c_ULTIMATE.start_main_~p~0#1| |c_ULTIMATE.start_main_~B~0#1|) 2147483648) 1) (not (= (mod |c_ULTIMATE.start_main_~q~0#1| 4294967296) 0))) is different from true [2024-09-13 05:53:36,383 WARN L293 SmtUtils]: Spent 12.01s on a formula simplification that was a NOOP. DAG size: 5 (called from [L 731] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2024-09-13 05:53:48,397 WARN L293 SmtUtils]: Spent 12.01s on a formula simplification that was a NOOP. DAG size: 6 (called from [L 731] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2024-09-13 05:54:00,406 WARN L293 SmtUtils]: Spent 12.01s on a formula simplification that was a NOOP. DAG size: 6 (called from [L 731] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2024-09-13 05:54:16,433 WARN L293 SmtUtils]: Spent 12.01s on a formula simplification that was a NOOP. DAG size: 6 (called from [L 731] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2024-09-13 05:54:36,459 WARN L293 SmtUtils]: Spent 12.01s on a formula simplification that was a NOOP. DAG size: 6 (called from [L 731] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2024-09-13 05:54:48,481 WARN L293 SmtUtils]: Spent 12.01s on a formula simplification that was a NOOP. DAG size: 5 (called from [L 731] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2024-09-13 05:55:00,493 WARN L293 SmtUtils]: Spent 12.01s on a formula simplification that was a NOOP. DAG size: 6 (called from [L 731] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2024-09-13 05:55:12,554 WARN L293 SmtUtils]: Spent 12.06s on a formula simplification that was a NOOP. DAG size: 6 (called from [L 731] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2024-09-13 05:55:29,071 WARN L293 SmtUtils]: Spent 12.01s on a formula simplification that was a NOOP. DAG size: 6 (called from [L 731] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2024-09-13 05:55:49,094 WARN L293 SmtUtils]: Spent 12.01s on a formula simplification that was a NOOP. DAG size: 6 (called from [L 731] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2024-09-13 05:56:01,133 WARN L293 SmtUtils]: Spent 12.03s on a formula simplification that was a NOOP. DAG size: 5 (called from [L 731] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2024-09-13 05:56:13,145 WARN L293 SmtUtils]: Spent 12.01s on a formula simplification that was a NOOP. DAG size: 6 (called from [L 731] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2024-09-13 05:56:25,155 WARN L293 SmtUtils]: Spent 12.01s on a formula simplification that was a NOOP. DAG size: 6 (called from [L 731] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2024-09-13 05:56:41,179 WARN L293 SmtUtils]: Spent 12.02s on a formula simplification that was a NOOP. DAG size: 6 (called from [L 731] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2024-09-13 05:56:46,253 WARN L293 SmtUtils]: Spent 5.07s on a formula simplification that was a NOOP. DAG size: 6 (called from [L 731] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2024-09-13 05:57:02,288 WARN L293 SmtUtils]: Spent 12.03s on a formula simplification that was a NOOP. DAG size: 6 (called from [L 731] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2024-09-13 05:57:14,304 WARN L293 SmtUtils]: Spent 12.01s on a formula simplification that was a NOOP. DAG size: 5 (called from [L 731] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2024-09-13 05:57:26,316 WARN L293 SmtUtils]: Spent 12.01s on a formula simplification that was a NOOP. DAG size: 6 (called from [L 731] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2024-09-13 05:57:38,325 WARN L293 SmtUtils]: Spent 12.01s on a formula simplification that was a NOOP. DAG size: 6 (called from [L 731] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2024-09-13 05:57:54,341 WARN L293 SmtUtils]: Spent 12.01s on a formula simplification that was a NOOP. DAG size: 6 (called from [L 731] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2024-09-13 05:58:14,364 WARN L293 SmtUtils]: Spent 12.01s on a formula simplification that was a NOOP. DAG size: 6 (called from [L 731] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2024-09-13 05:58:34,467 WARN L293 SmtUtils]: Spent 12.04s on a formula simplification that was a NOOP. DAG size: 6 (called from [L 731] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2024-09-13 05:58:42,480 WARN L876 $PredicateComparison]: unable to prove that (or (not (= (mod |c_ULTIMATE.start_main_~d~0#1| 4294967296) 1)) (not (= (mod |c_ULTIMATE.start_main_~B~0#1| 4294967296) 1)) (not (= (mod |c_ULTIMATE.start_main_~p~0#1| 4294967296) 1)) (= (mod (* |c_ULTIMATE.start_main_~p~0#1| |c_ULTIMATE.start_main_~B~0#1|) 2147483648) 1)) is different from true [2024-09-13 05:58:42,505 INFO L134 CoverageAnalysis]: Checked inductivity of 57 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 52 trivial. 5 not checked. [2024-09-13 05:58:42,505 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-09-13 05:58:42,505 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [991013713] [2024-09-13 05:58:42,505 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2024-09-13 05:58:42,506 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1128399486] [2024-09-13 05:58:42,506 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1128399486] provided 0 perfect and 2 imperfect interpolant sequences [2024-09-13 05:58:42,506 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-09-13 05:58:42,506 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5] total 9 [2024-09-13 05:58:42,506 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1447034900] [2024-09-13 05:58:42,506 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-09-13 05:58:42,506 INFO L551 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-09-13 05:58:42,506 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-09-13 05:58:42,507 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-09-13 05:58:42,507 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=28, Unknown=3, NotChecked=36, Total=90 [2024-09-13 05:58:42,507 INFO L87 Difference]: Start difference. First operand 51 states and 71 transitions. Second operand has 10 states, 9 states have (on average 2.4444444444444446) internal successors, (22), 10 states have internal predecessors, (22), 5 states have call successors, (13), 1 states have call predecessors, (13), 1 states have return successors, (13), 5 states have call predecessors, (13), 5 states have call successors, (13) [2024-09-13 05:58:46,588 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-09-13 05:58:50,605 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-09-13 05:58:54,676 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.04s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers [] [2024-09-13 05:58:58,682 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers [] [2024-09-13 05:59:02,695 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.01s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers [] [2024-09-13 05:59:06,704 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.01s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers [] [2024-09-13 05:59:10,707 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers [] [2024-09-13 05:59:14,710 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers [] [2024-09-13 05:59:18,723 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-09-13 05:59:22,727 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-09-13 05:59:27,808 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.01s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers [] [2024-09-13 05:59:27,814 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-09-13 05:59:27,814 INFO L93 Difference]: Finished difference Result 66 states and 99 transitions. [2024-09-13 05:59:27,814 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-09-13 05:59:27,814 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 9 states have (on average 2.4444444444444446) internal successors, (22), 10 states have internal predecessors, (22), 5 states have call successors, (13), 1 states have call predecessors, (13), 1 states have return successors, (13), 5 states have call predecessors, (13), 5 states have call successors, (13) Word has length 49 [2024-09-13 05:59:27,815 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-09-13 05:59:27,815 INFO L225 Difference]: With dead ends: 66 [2024-09-13 05:59:27,816 INFO L226 Difference]: Without dead ends: 66 [2024-09-13 05:59:27,816 INFO L433 NwaCegarLoop]: 0 DeclaredPredicates, 99 GetRequests, 88 SyntacticMatches, 3 SemanticMatches, 8 ConstructedPredicates, 3 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 12.1s TimeCoverageRelationStatistics Valid=23, Invalid=28, Unknown=3, NotChecked=36, Total=90 [2024-09-13 05:59:27,816 INFO L434 NwaCegarLoop]: 42 mSDtfsCounter, 18 mSDsluCounter, 76 mSDsCounter, 0 mSdLazyCounter, 70 mSolverCounterSat, 9 mSolverCounterUnsat, 11 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 45.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 27 SdHoareTripleChecker+Valid, 118 SdHoareTripleChecker+Invalid, 317 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 9 IncrementalHoareTripleChecker+Valid, 70 IncrementalHoareTripleChecker+Invalid, 11 IncrementalHoareTripleChecker+Unknown, 227 IncrementalHoareTripleChecker+Unchecked, 45.3s IncrementalHoareTripleChecker+Time [2024-09-13 05:59:27,816 INFO L435 NwaCegarLoop]: SdHoareTripleChecker [27 Valid, 118 Invalid, 317 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [9 Valid, 70 Invalid, 11 Unknown, 227 Unchecked, 45.3s Time] [2024-09-13 05:59:27,817 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 66 states. [2024-09-13 05:59:27,821 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 66 to 64. [2024-09-13 05:59:27,821 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 64 states, 43 states have (on average 1.186046511627907) internal successors, (51), 41 states have internal predecessors, (51), 22 states have call successors, (22), 2 states have call predecessors, (22), 2 states have return successors, (22), 20 states have call predecessors, (22), 22 states have call successors, (22) [2024-09-13 05:59:27,822 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 64 states to 64 states and 95 transitions. [2024-09-13 05:59:27,822 INFO L78 Accepts]: Start accepts. Automaton has 64 states and 95 transitions. Word has length 49 [2024-09-13 05:59:27,822 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-09-13 05:59:27,822 INFO L474 AbstractCegarLoop]: Abstraction has 64 states and 95 transitions. [2024-09-13 05:59:27,822 INFO L475 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 9 states have (on average 2.4444444444444446) internal successors, (22), 10 states have internal predecessors, (22), 5 states have call successors, (13), 1 states have call predecessors, (13), 1 states have return successors, (13), 5 states have call predecessors, (13), 5 states have call successors, (13) [2024-09-13 05:59:27,823 INFO L276 IsEmpty]: Start isEmpty. Operand 64 states and 95 transitions. [2024-09-13 05:59:27,823 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 51 [2024-09-13 05:59:27,823 INFO L208 NwaCegarLoop]: Found error trace [2024-09-13 05:59:27,824 INFO L216 NwaCegarLoop]: trace histogram [5, 5, 5, 3, 3, 3, 1, 1, 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-09-13 05:59:27,830 INFO L552 MonitoredProcess]: [MP /storage/repos/certificate-witnesses-artifact/automizer/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Ended with exit code 0 [2024-09-13 05:59:28,024 WARN L456 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/certificate-witnesses-artifact/automizer/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable6 [2024-09-13 05:59:28,024 INFO L399 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr7REQUIRES_VIOLATIONPRE_CONDITION === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1REQUIRES_VIOLATIONPRE_CONDITION, ULTIMATE.startErr2REQUIRES_VIOLATIONPRE_CONDITION (and 9 more)] === [2024-09-13 05:59:28,025 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-13 05:59:28,025 INFO L85 PathProgramCache]: Analyzing trace with hash -1515868503, now seen corresponding path program 1 times [2024-09-13 05:59:28,025 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-09-13 05:59:28,025 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1815051249] [2024-09-13 05:59:28,025 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-09-13 05:59:28,025 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-09-13 05:59:28,042 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unknown [2024-09-13 05:59:28,043 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [475033092] [2024-09-13 05:59:28,043 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-09-13 05:59:28,043 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-09-13 05:59:28,044 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/certificate-witnesses-artifact/automizer/z3 [2024-09-13 05:59:28,045 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/certificate-witnesses-artifact/automizer/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-09-13 05:59:28,046 INFO L327 MonitoredProcess]: [MP /storage/repos/certificate-witnesses-artifact/automizer/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2024-09-13 05:59:28,086 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-13 05:59:28,086 INFO L262 TraceCheckSpWp]: Trace formula consists of 115 conjuncts, 9 conjuncts are in the unsatisfiable core [2024-09-13 05:59:28,088 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2024-09-13 05:59:28,827 INFO L134 CoverageAnalysis]: Checked inductivity of 52 backedges. 9 proven. 3 refuted. 0 times theorem prover too weak. 40 trivial. 0 not checked. [2024-09-13 05:59:28,827 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2024-09-13 05:59:49,077 WARN L293 SmtUtils]: Spent 16.04s on a formula simplification that was a NOOP. DAG size: 11 (called from [L 731] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2024-09-13 06:00:01,098 WARN L293 SmtUtils]: Spent 12.02s on a formula simplification that was a NOOP. DAG size: 6 (called from [L 731] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2024-09-13 06:00:13,177 WARN L293 SmtUtils]: Spent 12.08s on a formula simplification that was a NOOP. DAG size: 6 (called from [L 731] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2024-09-13 06:00:25,224 WARN L293 SmtUtils]: Spent 12.05s on a formula simplification that was a NOOP. DAG size: 6 (called from [L 731] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2024-09-13 06:00:37,267 WARN L293 SmtUtils]: Spent 12.04s on a formula simplification that was a NOOP. DAG size: 6 (called from [L 731] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2024-09-13 06:00:53,338 WARN L293 SmtUtils]: Spent 16.07s on a formula simplification that was a NOOP. DAG size: 7 (called from [L 731] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2024-09-13 06:01:05,358 WARN L293 SmtUtils]: Spent 12.02s on a formula simplification that was a NOOP. DAG size: 5 (called from [L 731] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2024-09-13 06:01:21,413 WARN L293 SmtUtils]: Spent 16.05s on a formula simplification that was a NOOP. DAG size: 9 (called from [L 731] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2024-09-13 06:01:33,443 WARN L293 SmtUtils]: Spent 12.02s on a formula simplification that was a NOOP. DAG size: 5 (called from [L 731] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2024-09-13 06:01:45,469 WARN L293 SmtUtils]: Spent 12.03s on a formula simplification that was a NOOP. DAG size: 6 (called from [L 731] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2024-09-13 06:01:57,530 WARN L293 SmtUtils]: Spent 12.06s on a formula simplification that was a NOOP. DAG size: 6 (called from [L 731] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2024-09-13 06:02:13,633 WARN L876 $PredicateComparison]: unable to prove that (let ((.cse0 (mod |c_ULTIMATE.start_main_~A~0#1| 4294967296))) (or (= (mod (+ (* |c_ULTIMATE.start_main_~d~0#1| |c_ULTIMATE.start_main_~q~0#1|) |c_ULTIMATE.start_main_~r~0#1|) 4294967296) .cse0) (not (= (mod (+ (* |c_ULTIMATE.start_main_~B~0#1| |c_ULTIMATE.start_main_~q~0#1|) |c_ULTIMATE.start_main_~r~0#1|) 4294967296) .cse0)) (let ((.cse5 (mod |c_ULTIMATE.start_main_~r~0#1| 4294967296))) (let ((.cse1 (not (= (mod |c_ULTIMATE.start_main_~d~0#1| 4294967296) 1))) (.cse2 (< 0 .cse5)) (.cse4 (not (= (mod |c_ULTIMATE.start_main_~p~0#1| 4294967296) 1))) (.cse3 (mod |c_ULTIMATE.start_main_~q~0#1| 4294967296))) (and (or .cse1 .cse2 (not (= .cse3 1)) .cse4 (not (= .cse0 (mod (+ |c_ULTIMATE.start_main_~r~0#1| |c_ULTIMATE.start_main_~B~0#1|) 4294967296))) (< (mod (+ (mod |c_ULTIMATE.start_main_~B~0#1| 2147483648) |c_ULTIMATE.start_main_~r~0#1|) 4294967296) 1) (< 1 .cse0)) (or .cse1 .cse2 (not (= (mod |c_ULTIMATE.start_main_~B~0#1| 4294967296) 1)) (not (= .cse0 .cse5)) .cse4 (not (= .cse3 0)))))))) is different from true [2024-09-13 06:02:33,715 WARN L293 SmtUtils]: Spent 16.03s on a formula simplification that was a NOOP. DAG size: 9 (called from [L 731] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2024-09-13 06:02:45,758 WARN L293 SmtUtils]: Spent 12.04s on a formula simplification that was a NOOP. DAG size: 5 (called from [L 731] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2024-09-13 06:02:57,781 WARN L293 SmtUtils]: Spent 12.02s on a formula simplification that was a NOOP. DAG size: 6 (called from [L 731] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2024-09-13 06:03:09,801 WARN L293 SmtUtils]: Spent 12.02s on a formula simplification that was a NOOP. DAG size: 6 (called from [L 731] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2024-09-13 06:03:21,854 WARN L293 SmtUtils]: Spent 12.05s on a formula simplification that was a NOOP. DAG size: 6 (called from [L 731] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2024-09-13 06:03:37,930 WARN L293 SmtUtils]: Spent 12.04s on a formula simplification that was a NOOP. DAG size: 6 (called from [L 731] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2024-09-13 06:03:49,969 WARN L293 SmtUtils]: Spent 12.04s on a formula simplification that was a NOOP. DAG size: 6 (called from [L 731] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2024-09-13 06:04:02,008 WARN L293 SmtUtils]: Spent 12.04s on a formula simplification that was a NOOP. DAG size: 6 (called from [L 731] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2024-09-13 06:04:14,050 WARN L293 SmtUtils]: Spent 12.04s on a formula simplification that was a NOOP. DAG size: 6 (called from [L 731] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) Killed by 15