./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/nla-digbench-scaling/divbin_unwindbound2.i --full-output --witness-type correctness_witness --validate ../results/automizer-verification-files/SV-COMP24_unreach-call/divbin_unwindbound2.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/divbin_unwindbound2.i ../results/automizer-verification-files/SV-COMP24_unreach-call/divbin_unwindbound2.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:31:43,910 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-09-13 05:31:43,956 INFO L114 SettingsManager]: Loading settings from /storage/repos/certificate-witnesses-artifact/automizer/config/svcomp-Reach-32bit-Automizer_Default.epf [2024-09-13 05:31:43,959 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-09-13 05:31:43,959 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-09-13 05:31:43,990 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-09-13 05:31:43,991 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-09-13 05:31:43,992 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-09-13 05:31:43,992 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-09-13 05:31:43,994 INFO L153 SettingsManager]: * Use memory slicer=true [2024-09-13 05:31:43,994 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-09-13 05:31:43,994 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-09-13 05:31:44,002 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-09-13 05:31:44,003 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-09-13 05:31:44,003 INFO L153 SettingsManager]: * Use SBE=true [2024-09-13 05:31:44,004 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-09-13 05:31:44,004 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-09-13 05:31:44,004 INFO L153 SettingsManager]: * sizeof long=4 [2024-09-13 05:31:44,006 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-09-13 05:31:44,007 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-09-13 05:31:44,007 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-09-13 05:31:44,007 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-09-13 05:31:44,007 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-09-13 05:31:44,007 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-09-13 05:31:44,007 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-09-13 05:31:44,007 INFO L153 SettingsManager]: * sizeof long double=12 [2024-09-13 05:31:44,008 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-09-13 05:31:44,008 INFO L153 SettingsManager]: * Use constant arrays=true [2024-09-13 05:31:44,008 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-09-13 05:31:44,008 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-09-13 05:31:44,008 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-09-13 05:31:44,008 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-09-13 05:31:44,008 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-09-13 05:31:44,009 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-09-13 05:31:44,009 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-09-13 05:31:44,009 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-09-13 05:31:44,009 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-09-13 05:31:44,009 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-09-13 05:31:44,009 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-09-13 05:31:44,009 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-09-13 05:31:44,009 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-09-13 05:31:44,011 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-09-13 05:31:44,011 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:31:44,187 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-09-13 05:31:44,211 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-09-13 05:31:44,213 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-09-13 05:31:44,214 INFO L270 PluginConnector]: Initializing CDTParser... [2024-09-13 05:31:44,214 INFO L274 PluginConnector]: CDTParser initialized [2024-09-13 05:31:44,215 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/certificate-witnesses-artifact/automizer/../sv-benchmarks/c/nla-digbench-scaling/divbin_unwindbound2.i [2024-09-13 05:31:45,388 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-09-13 05:31:45,532 INFO L384 CDTParser]: Found 1 translation units. [2024-09-13 05:31:45,533 INFO L180 CDTParser]: Scanning /storage/repos/certificate-witnesses-artifact/sv-benchmarks/c/nla-digbench-scaling/divbin_unwindbound2.i [2024-09-13 05:31:45,562 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/certificate-witnesses-artifact/automizer/data/56efc78d2/27a70fa4d3204bd895d623c3e2cb186f/FLAG7e87b5467 [2024-09-13 05:31:45,576 INFO L435 CDTParser]: Successfully deleted /storage/repos/certificate-witnesses-artifact/automizer/data/56efc78d2/27a70fa4d3204bd895d623c3e2cb186f [2024-09-13 05:31:45,578 INFO L270 PluginConnector]: Initializing Witness Parser... [2024-09-13 05:31:45,579 INFO L274 PluginConnector]: Witness Parser initialized [2024-09-13 05:31:45,580 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/certificate-witnesses-artifact/automizer/../results/automizer-verification-files/SV-COMP24_unreach-call/divbin_unwindbound2.yml/witness-2.1.yml [2024-09-13 05:31:45,637 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-09-13 05:31:45,638 INFO L133 ToolchainWalker]: Walking toolchain with 5 elements. [2024-09-13 05:31:45,640 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-09-13 05:31:45,640 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-09-13 05:31:45,644 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-09-13 05:31:45,644 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 13.09 05:31:45" (1/2) ... [2024-09-13 05:31:45,645 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@2a376ab0 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.09 05:31:45, skipping insertion in model container [2024-09-13 05:31:45,646 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 13.09 05:31:45" (1/2) ... [2024-09-13 05:31:45,647 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.CACSL2BoogieTranslatorObserver@7dd76618 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.09 05:31:45, skipping insertion in model container [2024-09-13 05:31:45,647 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:31:45" (2/2) ... [2024-09-13 05:31:45,648 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@2a376ab0 and model type witness-2.1.yml de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator CORRECTNESS_WITNESS 13.09 05:31:45, skipping insertion in model container [2024-09-13 05:31:45,648 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:31:45" (2/2) ... [2024-09-13 05:31:45,656 INFO L93 nessWitnessExtractor]: Found the following entries in the witness: [2024-09-13 05:31:45,658 INFO L1541 ArrayList]: Loop invariant at [L40-L49] (((((2 <= counter) && (A == r)) && (q == 0)) || ((((b + ((B / 4294967296) * 4294967296)) == (B + ((b / 4294967296) * 4294967296))) && (A == r)) && (q == 0))) && (\old(counter) == 0)) [2024-09-13 05:31:45,659 INFO L1541 ArrayList]: Loop invariant at [L36-L39] ((((((2 <= counter) && (A == r)) && (q == 0)) || (((((b + ((B / 4294967296) * 4294967296)) == (B + ((b / 4294967296) * 4294967296))) && (A == r)) && (counter == 0)) && (q == 0))) || (((A == r) && (q == 0)) && (counter == 1))) && (\old(counter) == 0)) [2024-09-13 05:31:45,659 INFO L1541 ArrayList]: Function contract at [L26]: requires (counter == 0), ensures (\old(counter) == 0) [2024-09-13 05:31:45,659 INFO L1541 ArrayList]: Function contract at [L15]: requires (counter == 0), ensures (counter == 0) [2024-09-13 05:31:45,659 INFO L1541 ArrayList]: Function contract at [L18]: requires (1 <= \old(cond)), ensures (1 <= \old(cond)) [2024-09-13 05:31:45,673 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-09-13 05:31:45,789 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/divbin_unwindbound2.i[950,963] [2024-09-13 05:31:45,804 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-09-13 05:31:45,810 INFO L200 MainTranslator]: Completed pre-run Start Parsing Global Start Parsing Global Start Parsing Global Start Parsing Global [2024-09-13 05:31:45,837 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/divbin_unwindbound2.i[950,963] Start Parsing Global Start Parsing Global Start Parsing Local Start Parsing Local [2024-09-13 05:31:45,851 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-09-13 05:31:45,863 INFO L204 MainTranslator]: Completed translation [2024-09-13 05:31:45,863 INFO L201 PluginConnector]: Adding new model witness-2.1.yml de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator CORRECTNESS_WITNESS 13.09 05:31:45 WrapperNode [2024-09-13 05:31:45,863 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-09-13 05:31:45,864 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-09-13 05:31:45,864 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-09-13 05:31:45,865 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-09-13 05:31:45,870 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:31:45" (1/1) ... [2024-09-13 05:31:45,877 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:31:45" (1/1) ... [2024-09-13 05:31:45,902 INFO L138 Inliner]: procedures = 16, calls = 10, calls flagged for inlining = 2, calls inlined = 2, statements flattened = 56 [2024-09-13 05:31:45,902 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-09-13 05:31:45,903 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-09-13 05:31:45,903 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-09-13 05:31:45,903 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-09-13 05:31:45,912 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:31:45" (1/1) ... [2024-09-13 05:31:45,912 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:31:45" (1/1) ... [2024-09-13 05:31:45,915 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:31:45" (1/1) ... [2024-09-13 05:31:45,923 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:31:45,924 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:31:45" (1/1) ... [2024-09-13 05:31:45,924 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:31:45" (1/1) ... [2024-09-13 05:31:45,927 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:31:45" (1/1) ... [2024-09-13 05:31:45,932 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:31:45" (1/1) ... [2024-09-13 05:31:45,933 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:31:45" (1/1) ... [2024-09-13 05:31:45,934 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:31:45" (1/1) ... [2024-09-13 05:31:45,935 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-09-13 05:31:45,936 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-09-13 05:31:45,936 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-09-13 05:31:45,936 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-09-13 05:31:45,937 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:31:45" (1/1) ... [2024-09-13 05:31:45,941 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-09-13 05:31:45,947 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/certificate-witnesses-artifact/automizer/z3 [2024-09-13 05:31:45,959 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:31:45,960 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:31:45,996 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-09-13 05:31:45,996 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2024-09-13 05:31:45,996 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2024-09-13 05:31:45,996 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2024-09-13 05:31:45,996 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-09-13 05:31:45,996 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-09-13 05:31:45,996 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2024-09-13 05:31:45,997 INFO L138 BoogieDeclarations]: Found implementation of procedure __VERIFIER_assert [2024-09-13 05:31:46,049 INFO L242 CfgBuilder]: Building ICFG [2024-09-13 05:31:46,050 INFO L268 CfgBuilder]: Building CFG for each procedure with an implementation [2024-09-13 05:31:46,208 WARN L783 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2024-09-13 05:31:46,213 WARN L783 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2024-09-13 05:31:46,228 INFO L? ?]: Removed 32 outVars from TransFormulas that were not future-live. [2024-09-13 05:31:46,228 INFO L291 CfgBuilder]: Performing block encoding [2024-09-13 05:31:46,253 INFO L313 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-09-13 05:31:46,254 INFO L318 CfgBuilder]: Removed 2 assume(true) statements. [2024-09-13 05:31:46,255 INFO L201 PluginConnector]: Adding new model witness-2.1.yml de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 13.09 05:31:46 BoogieIcfgContainer [2024-09-13 05:31:46,255 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-09-13 05:31:46,257 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-09-13 05:31:46,258 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-09-13 05:31:46,260 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-09-13 05:31:46,260 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 13.09 05:31:45" (1/4) ... [2024-09-13 05:31:46,262 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@454984d0 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 13.09 05:31:46, skipping insertion in model container [2024-09-13 05:31:46,262 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:31:45" (2/4) ... [2024-09-13 05:31:46,262 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@454984d0 and model type witness-2.1.yml de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CORRECTNESS_WITNESS 13.09 05:31:46, skipping insertion in model container [2024-09-13 05:31:46,262 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:31:45" (3/4) ... [2024-09-13 05:31:46,263 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@454984d0 and model type witness-2.1.yml de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CORRECTNESS_WITNESS 13.09 05:31:46, skipping insertion in model container [2024-09-13 05:31:46,263 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:31:46" (4/4) ... [2024-09-13 05:31:46,264 INFO L112 eAbstractionObserver]: Analyzing ICFG divbin_unwindbound2.i [2024-09-13 05:31:46,277 INFO L209 ceAbstractionStarter]: Automizer settings: Hoare:None NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-09-13 05:31:46,277 INFO L149 ceAbstractionStarter]: Applying trace abstraction to program that has 11 error locations. [2024-09-13 05:31:46,309 INFO L335 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-09-13 05:31:46,315 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;@2f4bd120, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-09-13 05:31:46,315 INFO L337 AbstractCegarLoop]: Starting to check reachability of 11 error locations. [2024-09-13 05:31:46,320 INFO L276 IsEmpty]: Start isEmpty. Operand has 39 states, 25 states have (on average 1.64) internal successors, (41), 32 states have internal predecessors, (41), 4 states have call successors, (4), 2 states have call predecessors, (4), 2 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2024-09-13 05:31:46,324 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 3 [2024-09-13 05:31:46,324 INFO L208 NwaCegarLoop]: Found error trace [2024-09-13 05:31:46,325 INFO L216 NwaCegarLoop]: trace histogram [1, 1] [2024-09-13 05:31:46,325 INFO L399 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONPRE_CONDITION === [ULTIMATE.startErr0ASSERT_VIOLATIONPRE_CONDITION, ULTIMATE.startErr1REQUIRES_VIOLATIONPRE_CONDITION, ULTIMATE.startErr2REQUIRES_VIOLATIONPRE_CONDITION (and 8 more)] === [2024-09-13 05:31:46,330 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-13 05:31:46,331 INFO L85 PathProgramCache]: Analyzing trace with hash 3909, now seen corresponding path program 1 times [2024-09-13 05:31:46,339 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-09-13 05:31:46,339 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1929643481] [2024-09-13 05:31:46,339 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-09-13 05:31:46,340 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-09-13 05:31:46,396 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-13 05:31:46,431 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:31:46,431 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-09-13 05:31:46,432 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1929643481] [2024-09-13 05:31:46,432 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1929643481] provided 1 perfect and 0 imperfect interpolant sequences [2024-09-13 05:31:46,432 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-09-13 05:31:46,432 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2024-09-13 05:31:46,433 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1135437518] [2024-09-13 05:31:46,434 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-09-13 05:31:46,438 INFO L551 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-09-13 05:31:46,438 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-09-13 05:31:46,460 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-09-13 05:31:46,461 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-09-13 05:31:46,462 INFO L87 Difference]: Start difference. First operand has 39 states, 25 states have (on average 1.64) internal successors, (41), 32 states have internal predecessors, (41), 4 states have call successors, (4), 2 states have call predecessors, (4), 2 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) Second operand has 3 states, 2 states have (on average 1.0) internal successors, (2), 2 states have internal predecessors, (2), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-09-13 05:31:46,504 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-09-13 05:31:46,504 INFO L93 Difference]: Finished difference Result 38 states and 44 transitions. [2024-09-13 05:31:46,505 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-09-13 05:31:46,506 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 1.0) internal successors, (2), 2 states have internal predecessors, (2), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 2 [2024-09-13 05:31:46,507 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-09-13 05:31:46,511 INFO L225 Difference]: With dead ends: 38 [2024-09-13 05:31:46,511 INFO L226 Difference]: Without dead ends: 37 [2024-09-13 05:31:46,512 INFO L433 NwaCegarLoop]: 0 DeclaredPredicates, 1 GetRequests, 0 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:31:46,514 INFO L434 NwaCegarLoop]: 32 mSDtfsCounter, 11 mSDsluCounter, 23 mSDsCounter, 0 mSdLazyCounter, 17 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 11 SdHoareTripleChecker+Valid, 55 SdHoareTripleChecker+Invalid, 20 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 17 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-09-13 05:31:46,515 INFO L435 NwaCegarLoop]: SdHoareTripleChecker [11 Valid, 55 Invalid, 20 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 17 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-09-13 05:31:46,526 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 37 states. [2024-09-13 05:31:46,536 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 37 to 34. [2024-09-13 05:31:46,538 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 34 states, 23 states have (on average 1.391304347826087) internal successors, (32), 27 states have internal predecessors, (32), 4 states have call successors, (4), 2 states have call predecessors, (4), 2 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2024-09-13 05:31:46,538 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 34 states to 34 states and 40 transitions. [2024-09-13 05:31:46,539 INFO L78 Accepts]: Start accepts. Automaton has 34 states and 40 transitions. Word has length 2 [2024-09-13 05:31:46,539 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-09-13 05:31:46,540 INFO L474 AbstractCegarLoop]: Abstraction has 34 states and 40 transitions. [2024-09-13 05:31:46,540 INFO L475 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 1.0) internal successors, (2), 2 states have internal predecessors, (2), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-09-13 05:31:46,540 INFO L276 IsEmpty]: Start isEmpty. Operand 34 states and 40 transitions. [2024-09-13 05:31:46,540 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2024-09-13 05:31:46,541 INFO L208 NwaCegarLoop]: Found error trace [2024-09-13 05:31:46,541 INFO L216 NwaCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1] [2024-09-13 05:31:46,541 WARN L456 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-09-13 05:31:46,541 INFO L399 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr3ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONPRE_CONDITION, ULTIMATE.startErr1REQUIRES_VIOLATIONPRE_CONDITION, ULTIMATE.startErr2REQUIRES_VIOLATIONPRE_CONDITION (and 8 more)] === [2024-09-13 05:31:46,541 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-13 05:31:46,542 INFO L85 PathProgramCache]: Analyzing trace with hash 797245676, now seen corresponding path program 1 times [2024-09-13 05:31:46,542 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-09-13 05:31:46,542 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1290446505] [2024-09-13 05:31:46,542 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-09-13 05:31:46,542 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-09-13 05:31:46,643 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-13 05:31:47,106 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-09-13 05:31:47,111 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-13 05:31:47,125 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2024-09-13 05:31:47,127 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-13 05:31:47,140 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2024-09-13 05:31:47,140 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-09-13 05:31:47,140 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1290446505] [2024-09-13 05:31:47,140 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1290446505] provided 1 perfect and 0 imperfect interpolant sequences [2024-09-13 05:31:47,140 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-09-13 05:31:47,140 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-09-13 05:31:47,140 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1278621655] [2024-09-13 05:31:47,140 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-09-13 05:31:47,141 INFO L551 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-09-13 05:31:47,141 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-09-13 05:31:47,142 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-09-13 05:31:47,142 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2024-09-13 05:31:47,143 INFO L87 Difference]: Start difference. First operand 34 states and 40 transitions. Second operand has 5 states, 4 states have (on average 1.75) internal successors, (7), 4 states have internal predecessors, (7), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2024-09-13 05:31:47,223 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-09-13 05:31:47,224 INFO L93 Difference]: Finished difference Result 36 states and 42 transitions. [2024-09-13 05:31:47,224 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-09-13 05:31:47,224 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 1.75) internal successors, (7), 4 states have internal predecessors, (7), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) Word has length 14 [2024-09-13 05:31:47,225 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-09-13 05:31:47,226 INFO L225 Difference]: With dead ends: 36 [2024-09-13 05:31:47,226 INFO L226 Difference]: Without dead ends: 36 [2024-09-13 05:31:47,226 INFO L433 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2024-09-13 05:31:47,227 INFO L434 NwaCegarLoop]: 31 mSDtfsCounter, 1 mSDsluCounter, 39 mSDsCounter, 0 mSdLazyCounter, 44 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 70 SdHoareTripleChecker+Invalid, 46 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 44 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-09-13 05:31:47,228 INFO L435 NwaCegarLoop]: SdHoareTripleChecker [1 Valid, 70 Invalid, 46 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 44 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-09-13 05:31:47,228 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 36 states. [2024-09-13 05:31:47,232 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 36 to 35. [2024-09-13 05:31:47,232 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 35 states, 24 states have (on average 1.375) internal successors, (33), 28 states have internal predecessors, (33), 4 states have call successors, (4), 2 states have call predecessors, (4), 2 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2024-09-13 05:31:47,233 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 35 states to 35 states and 41 transitions. [2024-09-13 05:31:47,234 INFO L78 Accepts]: Start accepts. Automaton has 35 states and 41 transitions. Word has length 14 [2024-09-13 05:31:47,235 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-09-13 05:31:47,236 INFO L474 AbstractCegarLoop]: Abstraction has 35 states and 41 transitions. [2024-09-13 05:31:47,236 INFO L475 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 1.75) internal successors, (7), 4 states have internal predecessors, (7), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2024-09-13 05:31:47,236 INFO L276 IsEmpty]: Start isEmpty. Operand 35 states and 41 transitions. [2024-09-13 05:31:47,237 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2024-09-13 05:31:47,237 INFO L208 NwaCegarLoop]: Found error trace [2024-09-13 05:31:47,237 INFO L216 NwaCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-09-13 05:31:47,238 WARN L456 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-09-13 05:31:47,238 INFO L399 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr4ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONPRE_CONDITION, ULTIMATE.startErr1REQUIRES_VIOLATIONPRE_CONDITION, ULTIMATE.startErr2REQUIRES_VIOLATIONPRE_CONDITION (and 8 more)] === [2024-09-13 05:31:47,238 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-13 05:31:47,239 INFO L85 PathProgramCache]: Analyzing trace with hash -423167378, now seen corresponding path program 1 times [2024-09-13 05:31:47,239 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-09-13 05:31:47,239 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1411821052] [2024-09-13 05:31:47,240 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-09-13 05:31:47,240 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-09-13 05:31:47,249 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-13 05:31:47,305 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-09-13 05:31:47,307 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-13 05:31:47,314 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2024-09-13 05:31:47,317 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-13 05:31:47,325 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2024-09-13 05:31:47,326 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-09-13 05:31:47,326 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1411821052] [2024-09-13 05:31:47,326 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1411821052] provided 1 perfect and 0 imperfect interpolant sequences [2024-09-13 05:31:47,326 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-09-13 05:31:47,326 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-09-13 05:31:47,326 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1733018051] [2024-09-13 05:31:47,326 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-09-13 05:31:47,327 INFO L551 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-09-13 05:31:47,327 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-09-13 05:31:47,327 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-09-13 05:31:47,327 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-09-13 05:31:47,328 INFO L87 Difference]: Start difference. First operand 35 states and 41 transitions. Second operand has 4 states, 4 states have (on average 2.5) internal successors, (10), 3 states have internal predecessors, (10), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2024-09-13 05:31:47,363 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-09-13 05:31:47,364 INFO L93 Difference]: Finished difference Result 37 states and 43 transitions. [2024-09-13 05:31:47,364 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-09-13 05:31:47,364 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 2.5) internal successors, (10), 3 states have internal predecessors, (10), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) Word has length 17 [2024-09-13 05:31:47,364 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-09-13 05:31:47,365 INFO L225 Difference]: With dead ends: 37 [2024-09-13 05:31:47,365 INFO L226 Difference]: Without dead ends: 37 [2024-09-13 05:31:47,365 INFO L433 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 5 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:31:47,367 INFO L434 NwaCegarLoop]: 32 mSDtfsCounter, 2 mSDsluCounter, 53 mSDsCounter, 0 mSdLazyCounter, 25 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2 SdHoareTripleChecker+Valid, 85 SdHoareTripleChecker+Invalid, 25 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 25 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-09-13 05:31:47,368 INFO L435 NwaCegarLoop]: SdHoareTripleChecker [2 Valid, 85 Invalid, 25 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 25 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-09-13 05:31:47,369 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 37 states. [2024-09-13 05:31:47,371 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 37 to 37. [2024-09-13 05:31:47,371 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 37 states, 26 states have (on average 1.3461538461538463) internal successors, (35), 30 states have internal predecessors, (35), 4 states have call successors, (4), 2 states have call predecessors, (4), 2 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2024-09-13 05:31:47,375 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 37 states to 37 states and 43 transitions. [2024-09-13 05:31:47,375 INFO L78 Accepts]: Start accepts. Automaton has 37 states and 43 transitions. Word has length 17 [2024-09-13 05:31:47,375 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-09-13 05:31:47,376 INFO L474 AbstractCegarLoop]: Abstraction has 37 states and 43 transitions. [2024-09-13 05:31:47,376 INFO L475 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 2.5) internal successors, (10), 3 states have internal predecessors, (10), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2024-09-13 05:31:47,376 INFO L276 IsEmpty]: Start isEmpty. Operand 37 states and 43 transitions. [2024-09-13 05:31:47,376 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2024-09-13 05:31:47,376 INFO L208 NwaCegarLoop]: Found error trace [2024-09-13 05:31:47,376 INFO L216 NwaCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-09-13 05:31:47,376 WARN L456 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-09-13 05:31:47,377 INFO L399 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr4ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONPRE_CONDITION, ULTIMATE.startErr1REQUIRES_VIOLATIONPRE_CONDITION, ULTIMATE.startErr2REQUIRES_VIOLATIONPRE_CONDITION (and 8 more)] === [2024-09-13 05:31:47,377 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-13 05:31:47,377 INFO L85 PathProgramCache]: Analyzing trace with hash -233285064, now seen corresponding path program 1 times [2024-09-13 05:31:47,377 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-09-13 05:31:47,377 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2094764420] [2024-09-13 05:31:47,377 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-09-13 05:31:47,378 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-09-13 05:31:47,388 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-13 05:31:47,544 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-09-13 05:31:47,546 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-13 05:31:47,559 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2024-09-13 05:31:47,563 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-13 05:31:47,572 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2024-09-13 05:31:47,572 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-09-13 05:31:47,572 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2094764420] [2024-09-13 05:31:47,573 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2094764420] provided 1 perfect and 0 imperfect interpolant sequences [2024-09-13 05:31:47,573 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-09-13 05:31:47,573 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-09-13 05:31:47,573 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [558529845] [2024-09-13 05:31:47,573 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-09-13 05:31:47,574 INFO L551 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-09-13 05:31:47,574 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-09-13 05:31:47,574 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-09-13 05:31:47,575 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2024-09-13 05:31:47,575 INFO L87 Difference]: Start difference. First operand 37 states and 43 transitions. Second operand has 5 states, 4 states have (on average 2.75) internal successors, (11), 4 states have internal predecessors, (11), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2024-09-13 05:31:51,643 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:31:55,646 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:31:59,662 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:32:03,667 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:32:07,677 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:32:11,680 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:32:15,687 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:32:19,693 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:32:23,719 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:32:27,734 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.01s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-09-13 05:32:27,755 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-09-13 05:32:27,755 INFO L93 Difference]: Finished difference Result 46 states and 57 transitions. [2024-09-13 05:32:27,756 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-09-13 05:32:27,756 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 2.75) internal successors, (11), 4 states have internal predecessors, (11), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) Word has length 18 [2024-09-13 05:32:27,756 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-09-13 05:32:27,757 INFO L225 Difference]: With dead ends: 46 [2024-09-13 05:32:27,757 INFO L226 Difference]: Without dead ends: 44 [2024-09-13 05:32:27,757 INFO L433 NwaCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2024-09-13 05:32:27,758 INFO L434 NwaCegarLoop]: 27 mSDtfsCounter, 6 mSDsluCounter, 57 mSDsCounter, 0 mSdLazyCounter, 58 mSolverCounterSat, 5 mSolverCounterUnsat, 10 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 40.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 8 SdHoareTripleChecker+Valid, 84 SdHoareTripleChecker+Invalid, 73 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 58 IncrementalHoareTripleChecker+Invalid, 10 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 40.1s IncrementalHoareTripleChecker+Time [2024-09-13 05:32:27,758 INFO L435 NwaCegarLoop]: SdHoareTripleChecker [8 Valid, 84 Invalid, 73 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 58 Invalid, 10 Unknown, 0 Unchecked, 40.1s Time] [2024-09-13 05:32:27,758 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 44 states. [2024-09-13 05:32:27,761 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 44 to 44. [2024-09-13 05:32:27,761 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 44 states, 33 states have (on average 1.3333333333333333) internal successors, (44), 36 states have internal predecessors, (44), 6 states have call successors, (6), 2 states have call predecessors, (6), 2 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) [2024-09-13 05:32:27,761 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 44 states to 44 states and 55 transitions. [2024-09-13 05:32:27,762 INFO L78 Accepts]: Start accepts. Automaton has 44 states and 55 transitions. Word has length 18 [2024-09-13 05:32:27,762 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-09-13 05:32:27,762 INFO L474 AbstractCegarLoop]: Abstraction has 44 states and 55 transitions. [2024-09-13 05:32:27,762 INFO L475 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 2.75) internal successors, (11), 4 states have internal predecessors, (11), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2024-09-13 05:32:27,762 INFO L276 IsEmpty]: Start isEmpty. Operand 44 states and 55 transitions. [2024-09-13 05:32:27,763 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2024-09-13 05:32:27,763 INFO L208 NwaCegarLoop]: Found error trace [2024-09-13 05:32:27,763 INFO L216 NwaCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-09-13 05:32:27,763 WARN L456 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2024-09-13 05:32:27,763 INFO L399 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr3ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONPRE_CONDITION, ULTIMATE.startErr1REQUIRES_VIOLATIONPRE_CONDITION, ULTIMATE.startErr2REQUIRES_VIOLATIONPRE_CONDITION (and 8 more)] === [2024-09-13 05:32:27,763 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-13 05:32:27,764 INFO L85 PathProgramCache]: Analyzing trace with hash -233285021, now seen corresponding path program 1 times [2024-09-13 05:32:27,764 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-09-13 05:32:27,764 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [50299822] [2024-09-13 05:32:27,764 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-09-13 05:32:27,764 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-09-13 05:32:27,772 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-13 05:32:27,917 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-09-13 05:32:27,918 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-13 05:32:27,929 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2024-09-13 05:32:27,931 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-13 05:32:27,937 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2024-09-13 05:32:27,938 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-09-13 05:32:27,938 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [50299822] [2024-09-13 05:32:27,938 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [50299822] provided 0 perfect and 1 imperfect interpolant sequences [2024-09-13 05:32:27,939 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1225392337] [2024-09-13 05:32:27,939 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-09-13 05:32:27,939 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-09-13 05:32:27,939 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/certificate-witnesses-artifact/automizer/z3 [2024-09-13 05:32:27,941 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:32:27,942 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:32:27,978 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-13 05:32:27,979 INFO L262 TraceCheckSpWp]: Trace formula consists of 65 conjuncts, 8 conjuncts are in the unsatisfiable core [2024-09-13 05:32:27,984 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2024-09-13 05:32:28,118 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2024-09-13 05:32:28,118 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2024-09-13 05:32:28,308 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2024-09-13 05:32:28,309 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1225392337] provided 1 perfect and 1 imperfect interpolant sequences [2024-09-13 05:32:28,309 INFO L185 FreeRefinementEngine]: Found 1 perfect and 2 imperfect interpolant sequences. [2024-09-13 05:32:28,309 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [5, 3] total 6 [2024-09-13 05:32:28,309 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1094353896] [2024-09-13 05:32:28,310 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-09-13 05:32:28,310 INFO L551 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-09-13 05:32:28,310 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-09-13 05:32:28,310 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-09-13 05:32:28,310 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=26, Unknown=0, NotChecked=0, Total=42 [2024-09-13 05:32:28,311 INFO L87 Difference]: Start difference. First operand 44 states and 55 transitions. Second operand has 4 states, 3 states have (on average 3.6666666666666665) internal successors, (11), 4 states have internal predecessors, (11), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2024-09-13 05:32:32,337 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:32:36,340 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:32:40,354 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:32:44,358 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:32:48,366 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:32:52,375 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:32:56,384 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:33:00,387 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:33:04,393 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:33:08,396 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:33:08,441 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-09-13 05:33:08,442 INFO L93 Difference]: Finished difference Result 52 states and 70 transitions. [2024-09-13 05:33:08,442 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-09-13 05:33:08,442 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 3.6666666666666665) internal successors, (11), 4 states have internal predecessors, (11), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) Word has length 18 [2024-09-13 05:33:08,442 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-09-13 05:33:08,443 INFO L225 Difference]: With dead ends: 52 [2024-09-13 05:33:08,443 INFO L226 Difference]: Without dead ends: 50 [2024-09-13 05:33:08,443 INFO L433 NwaCegarLoop]: 0 DeclaredPredicates, 41 GetRequests, 34 SyntacticMatches, 2 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=16, Invalid=26, Unknown=0, NotChecked=0, Total=42 [2024-09-13 05:33:08,444 INFO L434 NwaCegarLoop]: 27 mSDtfsCounter, 9 mSDsluCounter, 36 mSDsCounter, 0 mSdLazyCounter, 45 mSolverCounterSat, 3 mSolverCounterUnsat, 10 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 40.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 11 SdHoareTripleChecker+Valid, 63 SdHoareTripleChecker+Invalid, 58 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 45 IncrementalHoareTripleChecker+Invalid, 10 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 40.1s IncrementalHoareTripleChecker+Time [2024-09-13 05:33:08,444 INFO L435 NwaCegarLoop]: SdHoareTripleChecker [11 Valid, 63 Invalid, 58 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 45 Invalid, 10 Unknown, 0 Unchecked, 40.1s Time] [2024-09-13 05:33:08,444 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 50 states. [2024-09-13 05:33:08,451 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 50 to 49. [2024-09-13 05:33:08,451 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 49 states, 39 states have (on average 1.358974358974359) internal successors, (53), 40 states have internal predecessors, (53), 7 states have call successors, (7), 2 states have call predecessors, (7), 2 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2024-09-13 05:33:08,452 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 49 states to 49 states and 66 transitions. [2024-09-13 05:33:08,452 INFO L78 Accepts]: Start accepts. Automaton has 49 states and 66 transitions. Word has length 18 [2024-09-13 05:33:08,452 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-09-13 05:33:08,452 INFO L474 AbstractCegarLoop]: Abstraction has 49 states and 66 transitions. [2024-09-13 05:33:08,452 INFO L475 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 3.6666666666666665) internal successors, (11), 4 states have internal predecessors, (11), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2024-09-13 05:33:08,452 INFO L276 IsEmpty]: Start isEmpty. Operand 49 states and 66 transitions. [2024-09-13 05:33:08,453 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2024-09-13 05:33:08,453 INFO L208 NwaCegarLoop]: Found error trace [2024-09-13 05:33:08,453 INFO L216 NwaCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-09-13 05:33:08,470 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:33:08,658 WARN L456 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4,2 /storage/repos/certificate-witnesses-artifact/automizer/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-09-13 05:33:08,659 INFO L399 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr6REQUIRES_VIOLATIONPRE_CONDITION === [ULTIMATE.startErr0ASSERT_VIOLATIONPRE_CONDITION, ULTIMATE.startErr1REQUIRES_VIOLATIONPRE_CONDITION, ULTIMATE.startErr2REQUIRES_VIOLATIONPRE_CONDITION (and 8 more)] === [2024-09-13 05:33:08,659 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-13 05:33:08,659 INFO L85 PathProgramCache]: Analyzing trace with hash -538192034, now seen corresponding path program 1 times [2024-09-13 05:33:08,659 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-09-13 05:33:08,659 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1554046847] [2024-09-13 05:33:08,660 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-09-13 05:33:08,660 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-09-13 05:33:08,666 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-13 05:33:08,713 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-09-13 05:33:08,714 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-13 05:33:08,717 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2024-09-13 05:33:08,718 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-13 05:33:08,722 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2024-09-13 05:33:08,723 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-09-13 05:33:08,723 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1554046847] [2024-09-13 05:33:08,723 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1554046847] provided 1 perfect and 0 imperfect interpolant sequences [2024-09-13 05:33:08,723 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-09-13 05:33:08,723 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-09-13 05:33:08,723 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [63737998] [2024-09-13 05:33:08,723 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-09-13 05:33:08,724 INFO L551 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-09-13 05:33:08,724 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-09-13 05:33:08,724 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-09-13 05:33:08,725 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2024-09-13 05:33:08,725 INFO L87 Difference]: Start difference. First operand 49 states and 66 transitions. Second operand has 5 states, 5 states have (on average 2.8) internal successors, (14), 4 states have internal predecessors, (14), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2024-09-13 05:33:08,768 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-09-13 05:33:08,771 INFO L93 Difference]: Finished difference Result 51 states and 67 transitions. [2024-09-13 05:33:08,772 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-09-13 05:33:08,772 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 2.8) internal successors, (14), 4 states have internal predecessors, (14), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) Word has length 21 [2024-09-13 05:33:08,772 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-09-13 05:33:08,772 INFO L225 Difference]: With dead ends: 51 [2024-09-13 05:33:08,772 INFO L226 Difference]: Without dead ends: 51 [2024-09-13 05:33:08,773 INFO L433 NwaCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2024-09-13 05:33:08,773 INFO L434 NwaCegarLoop]: 29 mSDtfsCounter, 4 mSDsluCounter, 72 mSDsCounter, 0 mSdLazyCounter, 35 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4 SdHoareTripleChecker+Valid, 101 SdHoareTripleChecker+Invalid, 35 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 35 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-09-13 05:33:08,773 INFO L435 NwaCegarLoop]: SdHoareTripleChecker [4 Valid, 101 Invalid, 35 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 35 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-09-13 05:33:08,774 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 51 states. [2024-09-13 05:33:08,776 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 51 to 49. [2024-09-13 05:33:08,778 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 49 states, 39 states have (on average 1.3333333333333333) internal successors, (52), 40 states have internal predecessors, (52), 7 states have call successors, (7), 2 states have call predecessors, (7), 2 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2024-09-13 05:33:08,779 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 49 states to 49 states and 65 transitions. [2024-09-13 05:33:08,780 INFO L78 Accepts]: Start accepts. Automaton has 49 states and 65 transitions. Word has length 21 [2024-09-13 05:33:08,780 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-09-13 05:33:08,780 INFO L474 AbstractCegarLoop]: Abstraction has 49 states and 65 transitions. [2024-09-13 05:33:08,780 INFO L475 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 2.8) internal successors, (14), 4 states have internal predecessors, (14), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2024-09-13 05:33:08,781 INFO L276 IsEmpty]: Start isEmpty. Operand 49 states and 65 transitions. [2024-09-13 05:33:08,781 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2024-09-13 05:33:08,781 INFO L208 NwaCegarLoop]: Found error trace [2024-09-13 05:33:08,781 INFO L216 NwaCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-09-13 05:33:08,782 WARN L456 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2024-09-13 05:33:08,782 INFO L399 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr5REQUIRES_VIOLATIONPRE_CONDITION === [ULTIMATE.startErr0ASSERT_VIOLATIONPRE_CONDITION, ULTIMATE.startErr1REQUIRES_VIOLATIONPRE_CONDITION, ULTIMATE.startErr2REQUIRES_VIOLATIONPRE_CONDITION (and 8 more)] === [2024-09-13 05:33:08,782 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-13 05:33:08,782 INFO L85 PathProgramCache]: Analyzing trace with hash -538191988, now seen corresponding path program 1 times [2024-09-13 05:33:08,782 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-09-13 05:33:08,782 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1426818861] [2024-09-13 05:33:08,783 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-09-13 05:33:08,783 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-09-13 05:33:08,798 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unknown [2024-09-13 05:33:08,801 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1538651836] [2024-09-13 05:33:08,801 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-09-13 05:33:08,801 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-09-13 05:33:08,801 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/certificate-witnesses-artifact/automizer/z3 [2024-09-13 05:33:08,803 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:33:08,804 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:33:08,841 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-13 05:33:08,842 INFO L262 TraceCheckSpWp]: Trace formula consists of 71 conjuncts, 8 conjuncts are in the unsatisfiable core [2024-09-13 05:33:08,843 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2024-09-13 05:33:08,947 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2024-09-13 05:33:08,948 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-09-13 05:33:08,948 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-09-13 05:33:08,948 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1426818861] [2024-09-13 05:33:08,948 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2024-09-13 05:33:08,949 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1538651836] [2024-09-13 05:33:08,949 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1538651836] provided 1 perfect and 0 imperfect interpolant sequences [2024-09-13 05:33:08,949 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-09-13 05:33:08,949 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-09-13 05:33:08,949 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [743718782] [2024-09-13 05:33:08,949 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-09-13 05:33:08,949 INFO L551 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-09-13 05:33:08,950 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-09-13 05:33:08,950 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-09-13 05:33:08,950 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2024-09-13 05:33:08,950 INFO L87 Difference]: Start difference. First operand 49 states and 65 transitions. Second operand has 6 states, 5 states have (on average 2.8) internal successors, (14), 5 states have internal predecessors, (14), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2024-09-13 05:33:09,052 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-09-13 05:33:09,053 INFO L93 Difference]: Finished difference Result 55 states and 72 transitions. [2024-09-13 05:33:09,053 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-09-13 05:33:09,054 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 2.8) internal successors, (14), 5 states have internal predecessors, (14), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) Word has length 21 [2024-09-13 05:33:09,054 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-09-13 05:33:09,055 INFO L225 Difference]: With dead ends: 55 [2024-09-13 05:33:09,055 INFO L226 Difference]: Without dead ends: 55 [2024-09-13 05:33:09,055 INFO L433 NwaCegarLoop]: 0 DeclaredPredicates, 20 GetRequests, 16 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2024-09-13 05:33:09,055 INFO L434 NwaCegarLoop]: 26 mSDtfsCounter, 11 mSDsluCounter, 78 mSDsCounter, 0 mSdLazyCounter, 89 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 13 SdHoareTripleChecker+Valid, 104 SdHoareTripleChecker+Invalid, 93 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 89 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-09-13 05:33:09,055 INFO L435 NwaCegarLoop]: SdHoareTripleChecker [13 Valid, 104 Invalid, 93 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 89 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-09-13 05:33:09,056 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 55 states. [2024-09-13 05:33:09,062 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 55 to 49. [2024-09-13 05:33:09,065 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 49 states, 36 states have (on average 1.3611111111111112) internal successors, (49), 40 states have internal predecessors, (49), 7 states have call successors, (7), 2 states have call predecessors, (7), 2 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2024-09-13 05:33:09,065 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 49 states to 49 states and 62 transitions. [2024-09-13 05:33:09,065 INFO L78 Accepts]: Start accepts. Automaton has 49 states and 62 transitions. Word has length 21 [2024-09-13 05:33:09,065 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-09-13 05:33:09,065 INFO L474 AbstractCegarLoop]: Abstraction has 49 states and 62 transitions. [2024-09-13 05:33:09,066 INFO L475 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 2.8) internal successors, (14), 5 states have internal predecessors, (14), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2024-09-13 05:33:09,066 INFO L276 IsEmpty]: Start isEmpty. Operand 49 states and 62 transitions. [2024-09-13 05:33:09,066 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2024-09-13 05:33:09,066 INFO L208 NwaCegarLoop]: Found error trace [2024-09-13 05:33:09,066 INFO L216 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-09-13 05:33:09,080 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:33:09,267 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:33:09,267 INFO L399 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr4ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONPRE_CONDITION, ULTIMATE.startErr1REQUIRES_VIOLATIONPRE_CONDITION, ULTIMATE.startErr2REQUIRES_VIOLATIONPRE_CONDITION (and 8 more)] === [2024-09-13 05:33:09,268 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-13 05:33:09,268 INFO L85 PathProgramCache]: Analyzing trace with hash -536929897, now seen corresponding path program 1 times [2024-09-13 05:33:09,268 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-09-13 05:33:09,269 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1746821561] [2024-09-13 05:33:09,269 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-09-13 05:33:09,269 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-09-13 05:33:09,275 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-13 05:33:09,314 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-09-13 05:33:09,315 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-13 05:33:09,319 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2024-09-13 05:33:09,319 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-13 05:33:09,323 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2024-09-13 05:33:09,323 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-09-13 05:33:09,323 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1746821561] [2024-09-13 05:33:09,323 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1746821561] provided 0 perfect and 1 imperfect interpolant sequences [2024-09-13 05:33:09,324 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1769360716] [2024-09-13 05:33:09,324 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-09-13 05:33:09,324 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-09-13 05:33:09,324 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/certificate-witnesses-artifact/automizer/z3 [2024-09-13 05:33:09,325 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:33:09,327 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:33:09,357 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-13 05:33:09,357 INFO L262 TraceCheckSpWp]: Trace formula consists of 73 conjuncts, 5 conjuncts are in the unsatisfiable core [2024-09-13 05:33:09,358 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2024-09-13 05:33:09,391 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2024-09-13 05:33:09,391 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2024-09-13 05:33:09,424 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2024-09-13 05:33:09,424 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1769360716] provided 0 perfect and 2 imperfect interpolant sequences [2024-09-13 05:33:09,424 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-09-13 05:33:09,424 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 4, 5] total 6 [2024-09-13 05:33:09,424 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1616939261] [2024-09-13 05:33:09,424 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-09-13 05:33:09,425 INFO L551 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-09-13 05:33:09,425 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-09-13 05:33:09,425 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-09-13 05:33:09,425 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2024-09-13 05:33:09,425 INFO L87 Difference]: Start difference. First operand 49 states and 62 transitions. Second operand has 6 states, 6 states have (on average 4.166666666666667) internal successors, (25), 6 states have internal predecessors, (25), 2 states have call successors, (6), 2 states have call predecessors, (6), 3 states have return successors, (6), 2 states have call predecessors, (6), 2 states have call successors, (6) [2024-09-13 05:33:09,472 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-09-13 05:33:09,472 INFO L93 Difference]: Finished difference Result 52 states and 65 transitions. [2024-09-13 05:33:09,473 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-09-13 05:33:09,474 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 4.166666666666667) internal successors, (25), 6 states have internal predecessors, (25), 2 states have call successors, (6), 2 states have call predecessors, (6), 3 states have return successors, (6), 2 states have call predecessors, (6), 2 states have call successors, (6) Word has length 21 [2024-09-13 05:33:09,474 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-09-13 05:33:09,474 INFO L225 Difference]: With dead ends: 52 [2024-09-13 05:33:09,474 INFO L226 Difference]: Without dead ends: 52 [2024-09-13 05:33:09,474 INFO L433 NwaCegarLoop]: 0 DeclaredPredicates, 49 GetRequests, 41 SyntacticMatches, 3 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=16, Invalid=26, Unknown=0, NotChecked=0, Total=42 [2024-09-13 05:33:09,475 INFO L434 NwaCegarLoop]: 29 mSDtfsCounter, 4 mSDsluCounter, 72 mSDsCounter, 0 mSdLazyCounter, 35 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4 SdHoareTripleChecker+Valid, 101 SdHoareTripleChecker+Invalid, 35 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 35 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-09-13 05:33:09,475 INFO L435 NwaCegarLoop]: SdHoareTripleChecker [4 Valid, 101 Invalid, 35 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 35 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-09-13 05:33:09,476 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 52 states. [2024-09-13 05:33:09,480 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 52 to 52. [2024-09-13 05:33:09,481 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 52 states, 39 states have (on average 1.3333333333333333) internal successors, (52), 43 states have internal predecessors, (52), 7 states have call successors, (7), 2 states have call predecessors, (7), 2 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2024-09-13 05:33:09,482 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 52 states to 52 states and 65 transitions. [2024-09-13 05:33:09,483 INFO L78 Accepts]: Start accepts. Automaton has 52 states and 65 transitions. Word has length 21 [2024-09-13 05:33:09,483 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-09-13 05:33:09,483 INFO L474 AbstractCegarLoop]: Abstraction has 52 states and 65 transitions. [2024-09-13 05:33:09,483 INFO L475 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 4.166666666666667) internal successors, (25), 6 states have internal predecessors, (25), 2 states have call successors, (6), 2 states have call predecessors, (6), 3 states have return successors, (6), 2 states have call predecessors, (6), 2 states have call successors, (6) [2024-09-13 05:33:09,483 INFO L276 IsEmpty]: Start isEmpty. Operand 52 states and 65 transitions. [2024-09-13 05:33:09,484 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2024-09-13 05:33:09,484 INFO L208 NwaCegarLoop]: Found error trace [2024-09-13 05:33:09,484 INFO L216 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-09-13 05:33:09,497 INFO L552 MonitoredProcess]: [MP /storage/repos/certificate-witnesses-artifact/automizer/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Ended with exit code 0 [2024-09-13 05:33:09,684 WARN L456 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 /storage/repos/certificate-witnesses-artifact/automizer/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable7 [2024-09-13 05:33:09,684 INFO L399 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr4ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONPRE_CONDITION, ULTIMATE.startErr1REQUIRES_VIOLATIONPRE_CONDITION, ULTIMATE.startErr2REQUIRES_VIOLATIONPRE_CONDITION (and 8 more)] === [2024-09-13 05:33:09,685 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-13 05:33:09,685 INFO L85 PathProgramCache]: Analyzing trace with hash 535044143, now seen corresponding path program 1 times [2024-09-13 05:33:09,685 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-09-13 05:33:09,685 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [220445039] [2024-09-13 05:33:09,686 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-09-13 05:33:09,687 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-09-13 05:33:09,695 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-13 05:33:09,830 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-09-13 05:33:09,832 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-13 05:33:09,842 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2024-09-13 05:33:09,844 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-13 05:33:09,848 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2024-09-13 05:33:09,849 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-09-13 05:33:09,849 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [220445039] [2024-09-13 05:33:09,849 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [220445039] provided 0 perfect and 1 imperfect interpolant sequences [2024-09-13 05:33:09,849 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [870420089] [2024-09-13 05:33:09,849 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-09-13 05:33:09,849 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-09-13 05:33:09,849 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/certificate-witnesses-artifact/automizer/z3 [2024-09-13 05:33:09,851 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/certificate-witnesses-artifact/automizer/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-09-13 05:33:09,852 INFO L327 MonitoredProcess]: [MP /storage/repos/certificate-witnesses-artifact/automizer/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2024-09-13 05:33:09,885 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-13 05:33:09,886 INFO L262 TraceCheckSpWp]: Trace formula consists of 74 conjuncts, 10 conjuncts are in the unsatisfiable core [2024-09-13 05:33:09,887 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2024-09-13 05:33:10,040 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 2 proven. 2 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2024-09-13 05:33:10,040 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2024-09-13 05:33:10,238 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2024-09-13 05:33:10,239 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [870420089] provided 1 perfect and 1 imperfect interpolant sequences [2024-09-13 05:33:10,239 INFO L185 FreeRefinementEngine]: Found 1 perfect and 2 imperfect interpolant sequences. [2024-09-13 05:33:10,239 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [6, 4] total 8 [2024-09-13 05:33:10,239 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [224708852] [2024-09-13 05:33:10,239 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-09-13 05:33:10,240 INFO L551 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-09-13 05:33:10,240 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-09-13 05:33:10,240 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-09-13 05:33:10,240 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=50, Unknown=0, NotChecked=0, Total=72 [2024-09-13 05:33:10,240 INFO L87 Difference]: Start difference. First operand 52 states and 65 transitions. Second operand has 5 states, 4 states have (on average 3.75) internal successors, (15), 5 states have internal predecessors, (15), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2024-09-13 05:33:14,270 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:33:18,274 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:33:22,277 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:33:26,314 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:33:30,318 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:33:34,321 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:33:34,349 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-09-13 05:33:34,350 INFO L93 Difference]: Finished difference Result 52 states and 64 transitions. [2024-09-13 05:33:34,353 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-09-13 05:33:34,354 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 3.75) internal successors, (15), 5 states have internal predecessors, (15), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) Word has length 22 [2024-09-13 05:33:34,354 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-09-13 05:33:34,354 INFO L225 Difference]: With dead ends: 52 [2024-09-13 05:33:34,354 INFO L226 Difference]: Without dead ends: 52 [2024-09-13 05:33:34,354 INFO L433 NwaCegarLoop]: 0 DeclaredPredicates, 50 GetRequests, 41 SyntacticMatches, 2 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 13 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=22, Invalid=50, Unknown=0, NotChecked=0, Total=72 [2024-09-13 05:33:34,355 INFO L434 NwaCegarLoop]: 29 mSDtfsCounter, 17 mSDsluCounter, 19 mSDsCounter, 0 mSdLazyCounter, 41 mSolverCounterSat, 5 mSolverCounterUnsat, 6 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 24.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 18 SdHoareTripleChecker+Valid, 48 SdHoareTripleChecker+Invalid, 52 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 41 IncrementalHoareTripleChecker+Invalid, 6 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 24.1s IncrementalHoareTripleChecker+Time [2024-09-13 05:33:34,355 INFO L435 NwaCegarLoop]: SdHoareTripleChecker [18 Valid, 48 Invalid, 52 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 41 Invalid, 6 Unknown, 0 Unchecked, 24.1s Time] [2024-09-13 05:33:34,355 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 52 states. [2024-09-13 05:33:34,363 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 52 to 52. [2024-09-13 05:33:34,363 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 52 states, 39 states have (on average 1.3076923076923077) internal successors, (51), 43 states have internal predecessors, (51), 7 states have call successors, (7), 2 states have call predecessors, (7), 2 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2024-09-13 05:33:34,363 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 52 states to 52 states and 64 transitions. [2024-09-13 05:33:34,364 INFO L78 Accepts]: Start accepts. Automaton has 52 states and 64 transitions. Word has length 22 [2024-09-13 05:33:34,364 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-09-13 05:33:34,365 INFO L474 AbstractCegarLoop]: Abstraction has 52 states and 64 transitions. [2024-09-13 05:33:34,365 INFO L475 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 3.75) internal successors, (15), 5 states have internal predecessors, (15), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2024-09-13 05:33:34,365 INFO L276 IsEmpty]: Start isEmpty. Operand 52 states and 64 transitions. [2024-09-13 05:33:34,365 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2024-09-13 05:33:34,365 INFO L208 NwaCegarLoop]: Found error trace [2024-09-13 05:33:34,365 INFO L216 NwaCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-09-13 05:33:34,386 INFO L552 MonitoredProcess]: [MP /storage/repos/certificate-witnesses-artifact/automizer/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Ended with exit code 0 [2024-09-13 05:33:34,566 WARN L456 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8,5 /storage/repos/certificate-witnesses-artifact/automizer/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-09-13 05:33:34,566 INFO L399 AbstractCegarLoop]: === Iteration 10 === Targeting __VERIFIER_assertErr1ENSURES_VIOLATIONPOST_CONDITION === [ULTIMATE.startErr0ASSERT_VIOLATIONPRE_CONDITION, ULTIMATE.startErr1REQUIRES_VIOLATIONPRE_CONDITION, ULTIMATE.startErr2REQUIRES_VIOLATIONPRE_CONDITION (and 8 more)] === [2024-09-13 05:33:34,566 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-13 05:33:34,567 INFO L85 PathProgramCache]: Analyzing trace with hash -163041944, now seen corresponding path program 1 times [2024-09-13 05:33:34,567 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-09-13 05:33:34,567 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2029525435] [2024-09-13 05:33:34,567 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-09-13 05:33:34,567 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-09-13 05:33:34,575 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-13 05:33:34,589 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-09-13 05:33:34,590 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-13 05:33:34,591 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2024-09-13 05:33:34,592 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-13 05:33:34,593 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2024-09-13 05:33:34,593 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-09-13 05:33:34,594 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2029525435] [2024-09-13 05:33:34,594 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2029525435] provided 1 perfect and 0 imperfect interpolant sequences [2024-09-13 05:33:34,594 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-09-13 05:33:34,594 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-09-13 05:33:34,594 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [913939742] [2024-09-13 05:33:34,594 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-09-13 05:33:34,594 INFO L551 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-09-13 05:33:34,594 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-09-13 05:33:34,595 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-09-13 05:33:34,595 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-09-13 05:33:34,595 INFO L87 Difference]: Start difference. First operand 52 states and 64 transitions. Second operand has 3 states, 2 states have (on average 8.0) internal successors, (16), 3 states have internal predecessors, (16), 1 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2024-09-13 05:33:34,608 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-09-13 05:33:34,608 INFO L93 Difference]: Finished difference Result 51 states and 63 transitions. [2024-09-13 05:33:34,609 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-09-13 05:33:34,609 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 8.0) internal successors, (16), 3 states have internal predecessors, (16), 1 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) Word has length 24 [2024-09-13 05:33:34,609 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-09-13 05:33:34,609 INFO L225 Difference]: With dead ends: 51 [2024-09-13 05:33:34,609 INFO L226 Difference]: Without dead ends: 51 [2024-09-13 05:33:34,610 INFO L433 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 5 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:33:34,610 INFO L434 NwaCegarLoop]: 32 mSDtfsCounter, 3 mSDsluCounter, 27 mSDsCounter, 0 mSdLazyCounter, 12 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3 SdHoareTripleChecker+Valid, 59 SdHoareTripleChecker+Invalid, 12 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 12 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-09-13 05:33:34,611 INFO L435 NwaCegarLoop]: SdHoareTripleChecker [3 Valid, 59 Invalid, 12 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 12 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-09-13 05:33:34,612 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 51 states. [2024-09-13 05:33:34,614 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 51 to 51. [2024-09-13 05:33:34,616 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 51 states, 39 states have (on average 1.2820512820512822) internal successors, (50), 42 states have internal predecessors, (50), 7 states have call successors, (7), 2 states have call predecessors, (7), 2 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2024-09-13 05:33:34,616 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 51 states to 51 states and 63 transitions. [2024-09-13 05:33:34,616 INFO L78 Accepts]: Start accepts. Automaton has 51 states and 63 transitions. Word has length 24 [2024-09-13 05:33:34,616 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-09-13 05:33:34,616 INFO L474 AbstractCegarLoop]: Abstraction has 51 states and 63 transitions. [2024-09-13 05:33:34,617 INFO L475 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 8.0) internal successors, (16), 3 states have internal predecessors, (16), 1 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2024-09-13 05:33:34,617 INFO L276 IsEmpty]: Start isEmpty. Operand 51 states and 63 transitions. [2024-09-13 05:33:34,617 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2024-09-13 05:33:34,617 INFO L208 NwaCegarLoop]: Found error trace [2024-09-13 05:33:34,617 INFO L216 NwaCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-09-13 05:33:34,617 WARN L456 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2024-09-13 05:33:34,617 INFO L399 AbstractCegarLoop]: === Iteration 11 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONPRE_CONDITION, ULTIMATE.startErr1REQUIRES_VIOLATIONPRE_CONDITION, ULTIMATE.startErr2REQUIRES_VIOLATIONPRE_CONDITION (and 8 more)] === [2024-09-13 05:33:34,617 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-13 05:33:34,618 INFO L85 PathProgramCache]: Analyzing trace with hash -163042105, now seen corresponding path program 1 times [2024-09-13 05:33:34,618 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-09-13 05:33:34,618 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2102858865] [2024-09-13 05:33:34,618 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-09-13 05:33:34,618 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-09-13 05:33:34,625 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-13 05:33:34,646 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-09-13 05:33:34,647 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-13 05:33:34,648 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2024-09-13 05:33:34,648 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-13 05:33:34,649 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2024-09-13 05:33:34,649 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-09-13 05:33:34,649 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2102858865] [2024-09-13 05:33:34,650 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2102858865] provided 1 perfect and 0 imperfect interpolant sequences [2024-09-13 05:33:34,650 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-09-13 05:33:34,650 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-09-13 05:33:34,653 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2050387030] [2024-09-13 05:33:34,653 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-09-13 05:33:34,654 INFO L551 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-09-13 05:33:34,654 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-09-13 05:33:34,656 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-09-13 05:33:34,657 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-09-13 05:33:34,657 INFO L87 Difference]: Start difference. First operand 51 states and 63 transitions. Second operand has 3 states, 3 states have (on average 5.333333333333333) internal successors, (16), 3 states have internal predecessors, (16), 1 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2024-09-13 05:33:34,663 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-09-13 05:33:34,663 INFO L93 Difference]: Finished difference Result 49 states and 61 transitions. [2024-09-13 05:33:34,663 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-09-13 05:33:34,663 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 5.333333333333333) internal successors, (16), 3 states have internal predecessors, (16), 1 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) Word has length 24 [2024-09-13 05:33:34,664 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-09-13 05:33:34,664 INFO L225 Difference]: With dead ends: 49 [2024-09-13 05:33:34,664 INFO L226 Difference]: Without dead ends: 43 [2024-09-13 05:33:34,664 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:33:34,665 INFO L434 NwaCegarLoop]: 32 mSDtfsCounter, 0 mSDsluCounter, 32 mSDsCounter, 0 mSdLazyCounter, 7 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 64 SdHoareTripleChecker+Invalid, 7 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 7 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-09-13 05:33:34,666 INFO L435 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 64 Invalid, 7 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 7 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-09-13 05:33:34,667 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 43 states. [2024-09-13 05:33:34,668 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 43 to 43. [2024-09-13 05:33:34,670 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 43 states, 34 states have (on average 1.2058823529411764) internal successors, (41), 35 states have internal predecessors, (41), 5 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) [2024-09-13 05:33:34,670 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 43 states to 43 states and 51 transitions. [2024-09-13 05:33:34,671 INFO L78 Accepts]: Start accepts. Automaton has 43 states and 51 transitions. Word has length 24 [2024-09-13 05:33:34,671 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-09-13 05:33:34,671 INFO L474 AbstractCegarLoop]: Abstraction has 43 states and 51 transitions. [2024-09-13 05:33:34,671 INFO L475 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 5.333333333333333) internal successors, (16), 3 states have internal predecessors, (16), 1 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2024-09-13 05:33:34,671 INFO L276 IsEmpty]: Start isEmpty. Operand 43 states and 51 transitions. [2024-09-13 05:33:34,671 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2024-09-13 05:33:34,671 INFO L208 NwaCegarLoop]: Found error trace [2024-09-13 05:33:34,671 INFO L216 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-09-13 05:33:34,672 WARN L456 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2024-09-13 05:33:34,672 INFO L399 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr4ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONPRE_CONDITION, ULTIMATE.startErr1REQUIRES_VIOLATIONPRE_CONDITION, ULTIMATE.startErr2REQUIRES_VIOLATIONPRE_CONDITION (and 8 more)] === [2024-09-13 05:33:34,672 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-13 05:33:34,672 INFO L85 PathProgramCache]: Analyzing trace with hash 1686218717, now seen corresponding path program 1 times [2024-09-13 05:33:34,672 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-09-13 05:33:34,672 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [27976789] [2024-09-13 05:33:34,672 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-09-13 05:33:34,672 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-09-13 05:33:34,693 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-13 05:33:34,745 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-09-13 05:33:34,747 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-13 05:33:34,754 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2024-09-13 05:33:34,755 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-13 05:33:34,759 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2024-09-13 05:33:34,760 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-13 05:33:34,762 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 3 proven. 2 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2024-09-13 05:33:34,762 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-09-13 05:33:34,763 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [27976789] [2024-09-13 05:33:34,763 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [27976789] provided 0 perfect and 1 imperfect interpolant sequences [2024-09-13 05:33:34,763 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [695068862] [2024-09-13 05:33:34,763 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-09-13 05:33:34,764 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-09-13 05:33:34,764 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/certificate-witnesses-artifact/automizer/z3 [2024-09-13 05:33:34,765 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/certificate-witnesses-artifact/automizer/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-09-13 05:33:34,766 INFO L327 MonitoredProcess]: [MP /storage/repos/certificate-witnesses-artifact/automizer/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2024-09-13 05:33:34,802 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-13 05:33:34,803 INFO L262 TraceCheckSpWp]: Trace formula consists of 102 conjuncts, 7 conjuncts are in the unsatisfiable core [2024-09-13 05:33:34,804 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2024-09-13 05:33:34,843 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 5 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2024-09-13 05:33:34,843 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-09-13 05:33:34,844 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [695068862] provided 1 perfect and 0 imperfect interpolant sequences [2024-09-13 05:33:34,844 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-09-13 05:33:34,844 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [6] total 7 [2024-09-13 05:33:34,844 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2108183722] [2024-09-13 05:33:34,844 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-09-13 05:33:34,844 INFO L551 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-09-13 05:33:34,846 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-09-13 05:33:34,846 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-09-13 05:33:34,846 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2024-09-13 05:33:34,847 INFO L87 Difference]: Start difference. First operand 43 states and 51 transitions. Second operand has 6 states, 6 states have (on average 3.8333333333333335) internal successors, (23), 5 states have internal predecessors, (23), 2 states have call successors, (3), 2 states have call predecessors, (3), 2 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2024-09-13 05:33:34,884 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-09-13 05:33:34,885 INFO L93 Difference]: Finished difference Result 23 states and 25 transitions. [2024-09-13 05:33:34,885 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-09-13 05:33:34,885 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 3.8333333333333335) internal successors, (23), 5 states have internal predecessors, (23), 2 states have call successors, (3), 2 states have call predecessors, (3), 2 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) Word has length 32 [2024-09-13 05:33:34,885 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-09-13 05:33:34,885 INFO L225 Difference]: With dead ends: 23 [2024-09-13 05:33:34,885 INFO L226 Difference]: Without dead ends: 0 [2024-09-13 05:33:34,886 INFO L433 NwaCegarLoop]: 0 DeclaredPredicates, 43 GetRequests, 37 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=21, Invalid=35, Unknown=0, NotChecked=0, Total=56 [2024-09-13 05:33:34,886 INFO L434 NwaCegarLoop]: 12 mSDtfsCounter, 4 mSDsluCounter, 16 mSDsCounter, 0 mSdLazyCounter, 34 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4 SdHoareTripleChecker+Valid, 28 SdHoareTripleChecker+Invalid, 36 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 34 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-09-13 05:33:34,886 INFO L435 NwaCegarLoop]: SdHoareTripleChecker [4 Valid, 28 Invalid, 36 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 34 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-09-13 05:33:34,887 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2024-09-13 05:33:34,887 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2024-09-13 05:33:34,887 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 0 states, 0 states have (on average 0.0) internal successors, (0), 0 states have internal predecessors, (0), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-09-13 05:33:34,887 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2024-09-13 05:33:34,887 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 32 [2024-09-13 05:33:34,887 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-09-13 05:33:34,888 INFO L474 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2024-09-13 05:33:34,888 INFO L475 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 3.8333333333333335) internal successors, (23), 5 states have internal predecessors, (23), 2 states have call successors, (3), 2 states have call predecessors, (3), 2 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2024-09-13 05:33:34,888 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2024-09-13 05:33:34,888 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2024-09-13 05:33:34,890 INFO L785 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONPRE_CONDITION (10 of 11 remaining) [2024-09-13 05:33:34,890 INFO L785 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr1REQUIRES_VIOLATIONPRE_CONDITION (9 of 11 remaining) [2024-09-13 05:33:34,890 INFO L785 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr2REQUIRES_VIOLATIONPRE_CONDITION (8 of 11 remaining) [2024-09-13 05:33:34,891 INFO L785 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr3ASSERT_VIOLATIONWITNESS_INVARIANT (7 of 11 remaining) [2024-09-13 05:33:34,891 INFO L785 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr4ASSERT_VIOLATIONWITNESS_INVARIANT (6 of 11 remaining) [2024-09-13 05:33:34,891 INFO L785 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr5REQUIRES_VIOLATIONPRE_CONDITION (5 of 11 remaining) [2024-09-13 05:33:34,891 INFO L785 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr6REQUIRES_VIOLATIONPRE_CONDITION (4 of 11 remaining) [2024-09-13 05:33:34,891 INFO L785 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr7ASSERT_VIOLATIONPOST_CONDITION (3 of 11 remaining) [2024-09-13 05:33:34,891 INFO L785 garLoopResultBuilder]: Registering result SAFE for location assume_abort_if_notErr0ENSURES_VIOLATIONPOST_CONDITION (2 of 11 remaining) [2024-09-13 05:33:34,891 INFO L785 garLoopResultBuilder]: Registering result SAFE for location __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION (1 of 11 remaining) [2024-09-13 05:33:34,891 INFO L785 garLoopResultBuilder]: Registering result SAFE for location __VERIFIER_assertErr1ENSURES_VIOLATIONPOST_CONDITION (0 of 11 remaining) [2024-09-13 05:33:34,903 INFO L540 MonitoredProcess]: [MP /storage/repos/certificate-witnesses-artifact/automizer/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Forceful destruction successful, exit code 0 [2024-09-13 05:33:35,092 WARN L456 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 /storage/repos/certificate-witnesses-artifact/automizer/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable11 [2024-09-13 05:33:35,095 INFO L408 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-09-13 05:33:35,096 INFO L165 ceAbstractionStarter]: Computing trace abstraction results [2024-09-13 05:33:35,097 INFO L469 ceAbstractionStarter]: Automizer considered 2 witness invariants [2024-09-13 05:33:35,097 INFO L470 ceAbstractionStarter]: WitnessConsidered=2 [2024-09-13 05:33:35,098 INFO L201 PluginConnector]: Adding new model witness-2.1.yml de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 13.09 05:33:35 BoogieIcfgContainer [2024-09-13 05:33:35,098 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2024-09-13 05:33:35,099 INFO L158 Benchmark]: Toolchain (without parser) took 109460.50ms. Allocated memory was 165.7MB in the beginning and 199.2MB in the end (delta: 33.6MB). Free memory was 136.1MB in the beginning and 126.9MB in the end (delta: 9.2MB). Peak memory consumption was 42.1MB. Max. memory is 16.1GB. [2024-09-13 05:33:35,099 INFO L158 Benchmark]: CDTParser took 0.43ms. Allocated memory is still 125.8MB. Free memory is still 90.2MB. There was no memory consumed. Max. memory is 16.1GB. [2024-09-13 05:33:35,099 INFO L158 Benchmark]: Witness Parser took 0.16ms. Allocated memory is still 165.7MB. Free memory was 136.9MB in the beginning and 136.9MB in the end (delta: 35.7kB). There was no memory consumed. Max. memory is 16.1GB. [2024-09-13 05:33:35,100 INFO L158 Benchmark]: CACSL2BoogieTranslator took 223.81ms. Allocated memory is still 165.7MB. Free memory was 136.1MB in the beginning and 121.9MB in the end (delta: 14.1MB). Peak memory consumption was 14.7MB. Max. memory is 16.1GB. [2024-09-13 05:33:35,101 INFO L158 Benchmark]: Boogie Procedure Inliner took 38.13ms. Allocated memory is still 165.7MB. Free memory was 121.9MB in the beginning and 120.0MB in the end (delta: 1.9MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2024-09-13 05:33:35,101 INFO L158 Benchmark]: Boogie Preprocessor took 32.28ms. Allocated memory is still 165.7MB. Free memory was 120.0MB in the beginning and 118.6MB in the end (delta: 1.4MB). There was no memory consumed. Max. memory is 16.1GB. [2024-09-13 05:33:35,101 INFO L158 Benchmark]: RCFGBuilder took 319.50ms. Allocated memory is still 165.7MB. Free memory was 118.6MB in the beginning and 101.1MB in the end (delta: 17.5MB). Peak memory consumption was 18.9MB. Max. memory is 16.1GB. [2024-09-13 05:33:35,101 INFO L158 Benchmark]: TraceAbstraction took 108841.36ms. Allocated memory was 165.7MB in the beginning and 199.2MB in the end (delta: 33.6MB). Free memory was 100.4MB in the beginning and 126.9MB in the end (delta: -26.5MB). Peak memory consumption was 6.4MB. Max. memory is 16.1GB. [2024-09-13 05:33:35,102 INFO L338 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.43ms. Allocated memory is still 125.8MB. Free memory is still 90.2MB. There was no memory consumed. Max. memory is 16.1GB. * Witness Parser took 0.16ms. Allocated memory is still 165.7MB. Free memory was 136.9MB in the beginning and 136.9MB in the end (delta: 35.7kB). There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 223.81ms. Allocated memory is still 165.7MB. Free memory was 136.1MB in the beginning and 121.9MB in the end (delta: 14.1MB). Peak memory consumption was 14.7MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 38.13ms. Allocated memory is still 165.7MB. Free memory was 121.9MB in the beginning and 120.0MB in the end (delta: 1.9MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * Boogie Preprocessor took 32.28ms. Allocated memory is still 165.7MB. Free memory was 120.0MB in the beginning and 118.6MB in the end (delta: 1.4MB). There was no memory consumed. Max. memory is 16.1GB. * RCFGBuilder took 319.50ms. Allocated memory is still 165.7MB. Free memory was 118.6MB in the beginning and 101.1MB in the end (delta: 17.5MB). Peak memory consumption was 18.9MB. Max. memory is 16.1GB. * TraceAbstraction took 108841.36ms. Allocated memory was 165.7MB in the beginning and 199.2MB in the end (delta: 33.6MB). Free memory was 100.4MB in the beginning and 126.9MB in the end (delta: -26.5MB). Peak memory consumption was 6.4MB. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: ErrorAutomatonStatistics NumberErrorTraces: 0, NumberStatementsAllTraces: 0, NumberRelevantStatements: 0, 0.0s ErrorAutomatonConstructionTimeTotal, 0.0s FaulLocalizationTime, NumberStatementsFirstTrace: -1, TraceLengthAvg: 0, 0.0s ErrorAutomatonConstructionTimeAvg, 0.0s ErrorAutomatonDifferenceTimeAvg, 0.0s ErrorAutomatonDifferenceTimeTotal, NumberOfNoEnhancement: 0, NumberOfFiniteEnhancement: 0, NumberOfInfiniteEnhancement: 0 - PositiveResult [Line: 26]: procedure precondition always holds For all program executions holds that procedure precondition always holds at this location - PositiveResult [Line: 15]: procedure precondition always holds For all program executions holds that procedure precondition always holds at this location - PositiveResult [Line: 15]: procedure precondition always holds For all program executions holds that procedure precondition always holds at this location - PositiveResult [Line: 36]: invariant of correctness witness holds For all program executions holds that invariant of correctness witness holds at this location - PositiveResult [Line: 40]: invariant of correctness witness holds For all program executions holds that invariant of correctness witness holds at this location - PositiveResult [Line: 18]: procedure precondition always holds For all program executions holds that procedure precondition always holds at this location - PositiveResult [Line: 18]: procedure precondition always holds For all program executions holds that procedure precondition always holds at this location - PositiveResult [Line: 26]: procedure postcondition always holds For all program executions holds that procedure postcondition always holds at this location - PositiveResult [Line: 15]: procedure postcondition always holds For all program executions holds that procedure postcondition always holds at this location - PositiveResult [Line: 21]: a call to reach_error is unreachable For all program executions holds that a call to reach_error is unreachable at this location - PositiveResult [Line: 18]: procedure postcondition always holds For all program executions holds that procedure postcondition always holds at this location - StatisticsResult: Ultimate Automizer benchmark data CFG has 3 procedures, 39 locations, 11 error locations. Started 1 CEGAR loops. OverallTime: 108.8s, OverallIterations: 12, TraceHistogramMax: 2, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 104.9s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 26 mSolverCounterUnknown, 79 SdHoareTripleChecker+Valid, 104.7s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 72 mSDsluCounter, 862 SdHoareTripleChecker+Invalid, 104.5s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 524 mSDsCounter, 24 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 442 IncrementalHoareTripleChecker+Invalid, 492 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 24 mSolverCounterUnsat, 338 mSDtfsCounter, 442 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 26 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 247 GetRequests, 198 SyntacticMatches, 7 SemanticMatches, 42 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 36 ImplicationChecksByTransitivity, 0.3s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=52occurred in iteration=8, InterpolantAutomatonStates: 56, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.1s AutomataMinimizationTime, 12 MinimizatonAttempts, 13 StatesRemovedByMinimization, 5 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.2s SatisfiabilityAnalysisTime, 2.2s InterpolantComputationTime, 348 NumberOfCodeBlocks, 348 NumberOfCodeBlocksAsserted, 17 NumberOfCheckSat, 369 ConstructedInterpolants, 0 QuantifiedInterpolants, 2049 SizeOfPredicates, 24 NumberOfNonLiveVariables, 385 ConjunctsInSsa, 38 ConjunctsInUnsatCore, 19 InterpolantComputations, 11 PerfectInterpolantSequences, 87/106 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available - AllSpecificationsHoldResult: All specifications hold 11 specifications checked. All of them hold RESULT: Ultimate proved your program to be correct! [2024-09-13 05:33:35,160 INFO L552 MonitoredProcess]: [MP /storage/repos/certificate-witnesses-artifact/automizer/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Ended with exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Writing output log to file Ultimate.log Result: TRUE