./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/verifythis/elimination_max_rec_onepoint.c --full-output --procedureinliner.inline.calls.to.implemented.procedures NEVER --traceabstraction.positions.where.we.compute.the.hoare.annotation All --witnessprinter.yaml.format.version 2.1 --witnessprinter.generate.graphml.witnesses false --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version f1d7dc9d 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/AutomizerReach.xml -i ../sv-benchmarks/c/verifythis/elimination_max_rec_onepoint.c -s /storage/repos/certificate-witnesses-artifact/automizer/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/certificate-witnesses-artifact/automizer --witnessprinter.witness.filename witness --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! call(reach_error())) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash 3a80fea07b3dad363ac033c87feb8bfcf28a57d2e75bc95b67f90908b133efe1 --procedureinliner.inline.calls.to.implemented.procedures NEVER --traceabstraction.positions.where.we.compute.the.hoare.annotation All --witnessprinter.yaml.format.version 2.1 --witnessprinter.generate.graphml.witnesses false --- Real Ultimate output --- This is Ultimate 0.2.4-tmp.dk.referee-eval-f1d7dc9-m [2024-09-20 13:08:14,759 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-09-20 13:08:14,824 INFO L114 SettingsManager]: Loading settings from /storage/repos/certificate-witnesses-artifact/automizer/config/svcomp-Reach-32bit-Automizer_Default.epf [2024-09-20 13:08:14,828 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-09-20 13:08:14,828 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-09-20 13:08:14,864 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-09-20 13:08:14,864 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-09-20 13:08:14,865 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-09-20 13:08:14,865 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-09-20 13:08:14,865 INFO L153 SettingsManager]: * Use memory slicer=true [2024-09-20 13:08:14,866 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-09-20 13:08:14,866 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-09-20 13:08:14,866 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-09-20 13:08:14,867 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-09-20 13:08:14,868 INFO L153 SettingsManager]: * Use SBE=true [2024-09-20 13:08:14,869 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-09-20 13:08:14,870 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-09-20 13:08:14,870 INFO L153 SettingsManager]: * sizeof long=4 [2024-09-20 13:08:14,870 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-09-20 13:08:14,870 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-09-20 13:08:14,871 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-09-20 13:08:14,873 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-09-20 13:08:14,873 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-09-20 13:08:14,873 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-09-20 13:08:14,874 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-09-20 13:08:14,874 INFO L153 SettingsManager]: * sizeof long double=12 [2024-09-20 13:08:14,874 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-09-20 13:08:14,875 INFO L153 SettingsManager]: * Use constant arrays=true [2024-09-20 13:08:14,875 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-09-20 13:08:14,875 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-09-20 13:08:14,876 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-09-20 13:08:14,876 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-09-20 13:08:14,877 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-09-20 13:08:14,877 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-09-20 13:08:14,877 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-09-20 13:08:14,878 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-09-20 13:08:14,878 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-09-20 13:08:14,878 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-09-20 13:08:14,878 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-09-20 13:08:14,879 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-09-20 13:08:14,879 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-09-20 13:08:14,879 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-09-20 13:08:14,879 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.witnessprinter: Witness directory -> /storage/repos/certificate-witnesses-artifact/automizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G ! call(reach_error())) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> 3a80fea07b3dad363ac033c87feb8bfcf28a57d2e75bc95b67f90908b133efe1 Applying setting for plugin de.uni_freiburg.informatik.ultimate.boogie.procedureinliner: Inline calls to implemented procedures -> NEVER Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: Positions where we compute the Hoare Annotation -> All Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: YAML Format version -> 2.1 Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Generate GraphML witnesses -> false [2024-09-20 13:08:15,123 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-09-20 13:08:15,146 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-09-20 13:08:15,150 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-09-20 13:08:15,151 INFO L270 PluginConnector]: Initializing CDTParser... [2024-09-20 13:08:15,151 INFO L274 PluginConnector]: CDTParser initialized [2024-09-20 13:08:15,152 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/certificate-witnesses-artifact/automizer/../sv-benchmarks/c/verifythis/elimination_max_rec_onepoint.c [2024-09-20 13:08:16,528 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-09-20 13:08:16,701 INFO L384 CDTParser]: Found 1 translation units. [2024-09-20 13:08:16,702 INFO L180 CDTParser]: Scanning /storage/repos/certificate-witnesses-artifact/sv-benchmarks/c/verifythis/elimination_max_rec_onepoint.c [2024-09-20 13:08:16,709 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/certificate-witnesses-artifact/automizer/data/898131782/40b483defb8b467192522b60c2a281e5/FLAG6fab0da7e [2024-09-20 13:08:17,106 INFO L435 CDTParser]: Successfully deleted /storage/repos/certificate-witnesses-artifact/automizer/data/898131782/40b483defb8b467192522b60c2a281e5 [2024-09-20 13:08:17,108 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-09-20 13:08:17,110 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-09-20 13:08:17,112 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-09-20 13:08:17,112 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-09-20 13:08:17,116 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-09-20 13:08:17,117 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 20.09 01:08:17" (1/1) ... [2024-09-20 13:08:17,118 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@18a4ff08 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.09 01:08:17, skipping insertion in model container [2024-09-20 13:08:17,118 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 20.09 01:08:17" (1/1) ... [2024-09-20 13:08:17,135 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-09-20 13:08:17,287 WARN L248 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/certificate-witnesses-artifact/sv-benchmarks/c/verifythis/elimination_max_rec_onepoint.c[502,515] [2024-09-20 13:08:17,304 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-09-20 13:08:17,315 INFO L200 MainTranslator]: Completed pre-run [2024-09-20 13:08:17,324 WARN L248 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/certificate-witnesses-artifact/sv-benchmarks/c/verifythis/elimination_max_rec_onepoint.c[502,515] [2024-09-20 13:08:17,333 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-09-20 13:08:17,353 INFO L204 MainTranslator]: Completed translation [2024-09-20 13:08:17,354 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.09 01:08:17 WrapperNode [2024-09-20 13:08:17,354 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-09-20 13:08:17,355 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-09-20 13:08:17,355 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-09-20 13:08:17,356 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-09-20 13:08:17,365 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.09 01:08:17" (1/1) ... [2024-09-20 13:08:17,373 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.09 01:08:17" (1/1) ... [2024-09-20 13:08:17,380 INFO L138 Inliner]: procedures = 19, calls = 24, calls flagged for inlining = 0, calls inlined = 0, statements flattened = 0 [2024-09-20 13:08:17,381 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-09-20 13:08:17,381 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-09-20 13:08:17,382 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-09-20 13:08:17,382 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-09-20 13:08:17,413 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.09 01:08:17" (1/1) ... [2024-09-20 13:08:17,413 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.09 01:08:17" (1/1) ... [2024-09-20 13:08:17,425 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.09 01:08:17" (1/1) ... [2024-09-20 13:08:17,458 INFO L175 MemorySlicer]: Split 9 memory accesses to 2 slices as follows [2, 7]. 78 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2, 0]. The 1 writes are split as follows [0, 1]. [2024-09-20 13:08:17,459 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.09 01:08:17" (1/1) ... [2024-09-20 13:08:17,459 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.09 01:08:17" (1/1) ... [2024-09-20 13:08:17,473 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.09 01:08:17" (1/1) ... [2024-09-20 13:08:17,474 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.09 01:08:17" (1/1) ... [2024-09-20 13:08:17,475 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.09 01:08:17" (1/1) ... [2024-09-20 13:08:17,476 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.09 01:08:17" (1/1) ... [2024-09-20 13:08:17,478 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-09-20 13:08:17,483 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-09-20 13:08:17,483 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-09-20 13:08:17,483 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-09-20 13:08:17,484 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.09 01:08:17" (1/1) ... [2024-09-20 13:08:17,489 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-09-20 13:08:17,497 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/certificate-witnesses-artifact/automizer/z3 [2024-09-20 13:08:17,512 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-20 13:08:17,515 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-20 13:08:17,562 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-09-20 13:08:17,562 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2024-09-20 13:08:17,562 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2024-09-20 13:08:17,562 INFO L130 BoogieDeclarations]: Found specification of procedure main [2024-09-20 13:08:17,562 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2024-09-20 13:08:17,563 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-09-20 13:08:17,563 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#1 [2024-09-20 13:08:17,563 INFO L130 BoogieDeclarations]: Found specification of procedure check [2024-09-20 13:08:17,564 INFO L138 BoogieDeclarations]: Found implementation of procedure check [2024-09-20 13:08:17,565 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2024-09-20 13:08:17,565 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2024-09-20 13:08:17,565 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2024-09-20 13:08:17,565 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-09-20 13:08:17,565 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-09-20 13:08:17,566 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#0 [2024-09-20 13:08:17,566 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#1 [2024-09-20 13:08:17,566 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.meminit [2024-09-20 13:08:17,567 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.meminit [2024-09-20 13:08:17,567 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2024-09-20 13:08:17,567 INFO L138 BoogieDeclarations]: Found implementation of procedure __VERIFIER_assert [2024-09-20 13:08:17,567 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2024-09-20 13:08:17,673 INFO L242 CfgBuilder]: Building ICFG [2024-09-20 13:08:17,675 INFO L268 CfgBuilder]: Building CFG for each procedure with an implementation [2024-09-20 13:08:17,866 INFO L? ?]: Removed 22 outVars from TransFormulas that were not future-live. [2024-09-20 13:08:17,866 INFO L291 CfgBuilder]: Performing block encoding [2024-09-20 13:08:17,897 INFO L313 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-09-20 13:08:17,898 INFO L318 CfgBuilder]: Removed 0 assume(true) statements. [2024-09-20 13:08:17,899 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 20.09 01:08:17 BoogieIcfgContainer [2024-09-20 13:08:17,899 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-09-20 13:08:17,901 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-09-20 13:08:17,901 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-09-20 13:08:17,906 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-09-20 13:08:17,907 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 20.09 01:08:17" (1/3) ... [2024-09-20 13:08:17,907 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4943bd60 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 20.09 01:08:17, skipping insertion in model container [2024-09-20 13:08:17,908 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.09 01:08:17" (2/3) ... [2024-09-20 13:08:17,909 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4943bd60 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 20.09 01:08:17, skipping insertion in model container [2024-09-20 13:08:17,909 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 20.09 01:08:17" (3/3) ... [2024-09-20 13:08:17,911 INFO L112 eAbstractionObserver]: Analyzing ICFG elimination_max_rec_onepoint.c [2024-09-20 13:08:17,923 INFO L209 ceAbstractionStarter]: Automizer settings: Hoare:All NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-09-20 13:08:17,924 INFO L149 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-09-20 13:08:17,967 INFO L335 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-09-20 13:08:17,972 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=All, 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;@1bf81e48, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-09-20 13:08:17,973 INFO L337 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-09-20 13:08:17,976 INFO L276 IsEmpty]: Start isEmpty. Operand has 42 states, 23 states have (on average 1.2173913043478262) internal successors, (28), 24 states have internal predecessors, (28), 11 states have call successors, (11), 6 states have call predecessors, (11), 6 states have return successors, (11), 11 states have call predecessors, (11), 11 states have call successors, (11) [2024-09-20 13:08:17,983 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2024-09-20 13:08:17,983 INFO L208 NwaCegarLoop]: Found error trace [2024-09-20 13:08:17,984 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, 1, 1, 1, 1] [2024-09-20 13:08:17,984 INFO L399 AbstractCegarLoop]: === Iteration 1 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-09-20 13:08:17,989 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-20 13:08:17,989 INFO L85 PathProgramCache]: Analyzing trace with hash 1437097425, now seen corresponding path program 1 times [2024-09-20 13:08:17,996 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-09-20 13:08:17,997 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [786784294] [2024-09-20 13:08:17,997 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-09-20 13:08:17,997 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-09-20 13:08:18,087 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-20 13:08:18,137 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2024-09-20 13:08:18,140 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-20 13:08:18,148 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-09-20 13:08:18,150 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-20 13:08:18,153 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-09-20 13:08:18,155 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-20 13:08:18,171 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-09-20 13:08:18,176 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-20 13:08:18,185 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-20 13:08:18,186 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-09-20 13:08:18,186 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [786784294] [2024-09-20 13:08:18,186 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [786784294] provided 1 perfect and 0 imperfect interpolant sequences [2024-09-20 13:08:18,187 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-09-20 13:08:18,187 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-09-20 13:08:18,192 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1302146987] [2024-09-20 13:08:18,193 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-09-20 13:08:18,201 INFO L551 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-09-20 13:08:18,201 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-09-20 13:08:18,229 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-09-20 13:08:18,229 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-09-20 13:08:18,231 INFO L87 Difference]: Start difference. First operand has 42 states, 23 states have (on average 1.2173913043478262) internal successors, (28), 24 states have internal predecessors, (28), 11 states have call successors, (11), 6 states have call predecessors, (11), 6 states have return successors, (11), 11 states have call predecessors, (11), 11 states have call successors, (11) Second operand has 3 states, 3 states have (on average 4.666666666666667) internal successors, (14), 2 states have internal predecessors, (14), 2 states have call successors, (7), 3 states have call predecessors, (7), 2 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) [2024-09-20 13:08:18,329 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-09-20 13:08:18,329 INFO L93 Difference]: Finished difference Result 78 states and 101 transitions. [2024-09-20 13:08:18,331 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-09-20 13:08:18,332 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 4.666666666666667) internal successors, (14), 2 states have internal predecessors, (14), 2 states have call successors, (7), 3 states have call predecessors, (7), 2 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) Word has length 28 [2024-09-20 13:08:18,332 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-09-20 13:08:18,339 INFO L225 Difference]: With dead ends: 78 [2024-09-20 13:08:18,339 INFO L226 Difference]: Without dead ends: 38 [2024-09-20 13:08:18,343 INFO L433 NwaCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 11 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-20 13:08:18,346 INFO L434 NwaCegarLoop]: 18 mSDtfsCounter, 25 mSDsluCounter, 3 mSDsCounter, 0 mSdLazyCounter, 37 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 31 SdHoareTripleChecker+Valid, 21 SdHoareTripleChecker+Invalid, 44 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 37 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-09-20 13:08:18,347 INFO L435 NwaCegarLoop]: SdHoareTripleChecker [31 Valid, 21 Invalid, 44 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 37 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-09-20 13:08:18,361 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 38 states. [2024-09-20 13:08:18,376 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 38 to 38. [2024-09-20 13:08:18,377 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 38 states, 21 states have (on average 1.1428571428571428) internal successors, (24), 22 states have internal predecessors, (24), 11 states have call successors, (11), 6 states have call predecessors, (11), 5 states have return successors, (9), 9 states have call predecessors, (9), 9 states have call successors, (9) [2024-09-20 13:08:18,378 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 38 states to 38 states and 44 transitions. [2024-09-20 13:08:18,380 INFO L78 Accepts]: Start accepts. Automaton has 38 states and 44 transitions. Word has length 28 [2024-09-20 13:08:18,380 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-09-20 13:08:18,380 INFO L474 AbstractCegarLoop]: Abstraction has 38 states and 44 transitions. [2024-09-20 13:08:18,381 INFO L475 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 4.666666666666667) internal successors, (14), 2 states have internal predecessors, (14), 2 states have call successors, (7), 3 states have call predecessors, (7), 2 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) [2024-09-20 13:08:18,381 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-20 13:08:18,381 INFO L276 IsEmpty]: Start isEmpty. Operand 38 states and 44 transitions. [2024-09-20 13:08:18,382 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2024-09-20 13:08:18,382 INFO L208 NwaCegarLoop]: Found error trace [2024-09-20 13:08:18,383 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, 1, 1, 1, 1] [2024-09-20 13:08:18,383 WARN L456 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-09-20 13:08:18,383 INFO L399 AbstractCegarLoop]: === Iteration 2 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-09-20 13:08:18,384 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-20 13:08:18,384 INFO L85 PathProgramCache]: Analyzing trace with hash 579935573, now seen corresponding path program 1 times [2024-09-20 13:08:18,384 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-09-20 13:08:18,384 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1800515104] [2024-09-20 13:08:18,384 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-09-20 13:08:18,384 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-09-20 13:08:18,426 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-20 13:08:18,736 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2024-09-20 13:08:18,738 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-20 13:08:18,743 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-09-20 13:08:18,744 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-20 13:08:18,748 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-09-20 13:08:18,749 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-20 13:08:18,759 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-09-20 13:08:18,760 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-20 13:08:18,767 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-20 13:08:18,769 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-09-20 13:08:18,769 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1800515104] [2024-09-20 13:08:18,769 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1800515104] provided 1 perfect and 0 imperfect interpolant sequences [2024-09-20 13:08:18,769 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-09-20 13:08:18,769 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-09-20 13:08:18,771 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1795356666] [2024-09-20 13:08:18,771 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-09-20 13:08:18,772 INFO L551 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-09-20 13:08:18,773 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-09-20 13:08:18,774 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-09-20 13:08:18,774 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2024-09-20 13:08:18,775 INFO L87 Difference]: Start difference. First operand 38 states and 44 transitions. Second operand has 7 states, 7 states have (on average 2.0) internal successors, (14), 4 states have internal predecessors, (14), 2 states have call successors, (7), 4 states have call predecessors, (7), 1 states have return successors, (4), 1 states have call predecessors, (4), 1 states have call successors, (4) [2024-09-20 13:08:19,067 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-09-20 13:08:19,067 INFO L93 Difference]: Finished difference Result 62 states and 75 transitions. [2024-09-20 13:08:19,068 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-09-20 13:08:19,068 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 2.0) internal successors, (14), 4 states have internal predecessors, (14), 2 states have call successors, (7), 4 states have call predecessors, (7), 1 states have return successors, (4), 1 states have call predecessors, (4), 1 states have call successors, (4) Word has length 28 [2024-09-20 13:08:19,068 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-09-20 13:08:19,071 INFO L225 Difference]: With dead ends: 62 [2024-09-20 13:08:19,072 INFO L226 Difference]: Without dead ends: 60 [2024-09-20 13:08:19,073 INFO L433 NwaCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 9 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=31, Invalid=79, Unknown=0, NotChecked=0, Total=110 [2024-09-20 13:08:19,075 INFO L434 NwaCegarLoop]: 14 mSDtfsCounter, 53 mSDsluCounter, 51 mSDsCounter, 0 mSdLazyCounter, 189 mSolverCounterSat, 25 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 59 SdHoareTripleChecker+Valid, 65 SdHoareTripleChecker+Invalid, 214 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 25 IncrementalHoareTripleChecker+Valid, 189 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-09-20 13:08:19,075 INFO L435 NwaCegarLoop]: SdHoareTripleChecker [59 Valid, 65 Invalid, 214 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [25 Valid, 189 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-09-20 13:08:19,110 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 60 states. [2024-09-20 13:08:19,133 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 60 to 55. [2024-09-20 13:08:19,134 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 55 states, 31 states have (on average 1.1612903225806452) internal successors, (36), 33 states have internal predecessors, (36), 16 states have call successors, (16), 8 states have call predecessors, (16), 7 states have return successors, (14), 13 states have call predecessors, (14), 14 states have call successors, (14) [2024-09-20 13:08:19,135 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 55 states to 55 states and 66 transitions. [2024-09-20 13:08:19,137 INFO L78 Accepts]: Start accepts. Automaton has 55 states and 66 transitions. Word has length 28 [2024-09-20 13:08:19,137 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-09-20 13:08:19,138 INFO L474 AbstractCegarLoop]: Abstraction has 55 states and 66 transitions. [2024-09-20 13:08:19,139 INFO L475 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 2.0) internal successors, (14), 4 states have internal predecessors, (14), 2 states have call successors, (7), 4 states have call predecessors, (7), 1 states have return successors, (4), 1 states have call predecessors, (4), 1 states have call successors, (4) [2024-09-20 13:08:19,139 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-20 13:08:19,139 INFO L276 IsEmpty]: Start isEmpty. Operand 55 states and 66 transitions. [2024-09-20 13:08:19,140 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2024-09-20 13:08:19,140 INFO L208 NwaCegarLoop]: Found error trace [2024-09-20 13:08:19,141 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, 1, 1, 1, 1, 1, 1, 1] [2024-09-20 13:08:19,141 WARN L456 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-09-20 13:08:19,142 INFO L399 AbstractCegarLoop]: === Iteration 3 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-09-20 13:08:19,142 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-20 13:08:19,142 INFO L85 PathProgramCache]: Analyzing trace with hash 2135763327, now seen corresponding path program 1 times [2024-09-20 13:08:19,142 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-09-20 13:08:19,142 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [128277119] [2024-09-20 13:08:19,143 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-09-20 13:08:19,143 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-09-20 13:08:19,173 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-20 13:08:19,396 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2024-09-20 13:08:19,397 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-20 13:08:19,399 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-09-20 13:08:19,402 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-20 13:08:19,403 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-09-20 13:08:19,405 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-20 13:08:19,417 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-09-20 13:08:19,420 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-20 13:08:19,445 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2024-09-20 13:08:19,448 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-20 13:08:19,451 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-20 13:08:19,451 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-09-20 13:08:19,452 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [128277119] [2024-09-20 13:08:19,455 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [128277119] provided 1 perfect and 0 imperfect interpolant sequences [2024-09-20 13:08:19,455 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-09-20 13:08:19,455 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2024-09-20 13:08:19,455 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [485142711] [2024-09-20 13:08:19,456 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-09-20 13:08:19,456 INFO L551 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-09-20 13:08:19,456 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-09-20 13:08:19,457 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-09-20 13:08:19,457 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2024-09-20 13:08:19,457 INFO L87 Difference]: Start difference. First operand 55 states and 66 transitions. Second operand has 9 states, 7 states have (on average 2.2857142857142856) internal successors, (16), 6 states have internal predecessors, (16), 3 states have call successors, (7), 3 states have call predecessors, (7), 2 states have return successors, (5), 3 states have call predecessors, (5), 2 states have call successors, (5) [2024-09-20 13:08:19,693 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-09-20 13:08:19,693 INFO L93 Difference]: Finished difference Result 61 states and 71 transitions. [2024-09-20 13:08:19,695 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-09-20 13:08:19,695 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 7 states have (on average 2.2857142857142856) internal successors, (16), 6 states have internal predecessors, (16), 3 states have call successors, (7), 3 states have call predecessors, (7), 2 states have return successors, (5), 3 states have call predecessors, (5), 2 states have call successors, (5) Word has length 31 [2024-09-20 13:08:19,695 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-09-20 13:08:19,696 INFO L225 Difference]: With dead ends: 61 [2024-09-20 13:08:19,697 INFO L226 Difference]: Without dead ends: 53 [2024-09-20 13:08:19,697 INFO L433 NwaCegarLoop]: 0 DeclaredPredicates, 20 GetRequests, 10 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=29, Invalid=103, Unknown=0, NotChecked=0, Total=132 [2024-09-20 13:08:19,698 INFO L434 NwaCegarLoop]: 11 mSDtfsCounter, 29 mSDsluCounter, 43 mSDsCounter, 0 mSdLazyCounter, 270 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 35 SdHoareTripleChecker+Valid, 54 SdHoareTripleChecker+Invalid, 276 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 270 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-09-20 13:08:19,699 INFO L435 NwaCegarLoop]: SdHoareTripleChecker [35 Valid, 54 Invalid, 276 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 270 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-09-20 13:08:19,699 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 53 states. [2024-09-20 13:08:19,709 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 53 to 53. [2024-09-20 13:08:19,709 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 53 states, 30 states have (on average 1.1666666666666667) internal successors, (35), 32 states have internal predecessors, (35), 15 states have call successors, (15), 8 states have call predecessors, (15), 7 states have return successors, (13), 12 states have call predecessors, (13), 13 states have call successors, (13) [2024-09-20 13:08:19,712 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 53 states to 53 states and 63 transitions. [2024-09-20 13:08:19,712 INFO L78 Accepts]: Start accepts. Automaton has 53 states and 63 transitions. Word has length 31 [2024-09-20 13:08:19,712 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-09-20 13:08:19,712 INFO L474 AbstractCegarLoop]: Abstraction has 53 states and 63 transitions. [2024-09-20 13:08:19,712 INFO L475 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 7 states have (on average 2.2857142857142856) internal successors, (16), 6 states have internal predecessors, (16), 3 states have call successors, (7), 3 states have call predecessors, (7), 2 states have return successors, (5), 3 states have call predecessors, (5), 2 states have call successors, (5) [2024-09-20 13:08:19,713 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-20 13:08:19,713 INFO L276 IsEmpty]: Start isEmpty. Operand 53 states and 63 transitions. [2024-09-20 13:08:19,716 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 44 [2024-09-20 13:08:19,716 INFO L208 NwaCegarLoop]: Found error trace [2024-09-20 13:08:19,716 INFO L216 NwaCegarLoop]: trace histogram [3, 3, 3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-09-20 13:08:19,717 WARN L456 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-09-20 13:08:19,717 INFO L399 AbstractCegarLoop]: === Iteration 4 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-09-20 13:08:19,717 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-20 13:08:19,717 INFO L85 PathProgramCache]: Analyzing trace with hash 1566356218, now seen corresponding path program 1 times [2024-09-20 13:08:19,718 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-09-20 13:08:19,718 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [470823838] [2024-09-20 13:08:19,718 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-09-20 13:08:19,718 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-09-20 13:08:19,737 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-20 13:08:19,969 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2024-09-20 13:08:19,971 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-20 13:08:19,973 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-09-20 13:08:19,974 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-20 13:08:19,975 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-09-20 13:08:19,976 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-20 13:08:19,987 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-09-20 13:08:19,988 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-20 13:08:19,990 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2024-09-20 13:08:19,992 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-20 13:08:19,995 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-09-20 13:08:19,997 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-20 13:08:20,002 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 2 proven. 3 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2024-09-20 13:08:20,002 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-09-20 13:08:20,002 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [470823838] [2024-09-20 13:08:20,002 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [470823838] provided 0 perfect and 1 imperfect interpolant sequences [2024-09-20 13:08:20,003 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [381409397] [2024-09-20 13:08:20,003 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-09-20 13:08:20,003 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-09-20 13:08:20,003 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/certificate-witnesses-artifact/automizer/z3 [2024-09-20 13:08:20,005 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-20 13:08:20,007 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-20 13:08:20,083 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-20 13:08:20,090 INFO L262 TraceCheckSpWp]: Trace formula consists of 179 conjuncts, 17 conjuncts are in the unsatisfiable core [2024-09-20 13:08:20,105 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2024-09-20 13:08:20,266 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 5 proven. 0 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2024-09-20 13:08:20,267 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-09-20 13:08:20,268 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [381409397] provided 1 perfect and 0 imperfect interpolant sequences [2024-09-20 13:08:20,269 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-09-20 13:08:20,269 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [9] total 13 [2024-09-20 13:08:20,269 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [536320802] [2024-09-20 13:08:20,270 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-09-20 13:08:20,272 INFO L551 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-09-20 13:08:20,272 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-09-20 13:08:20,273 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-09-20 13:08:20,273 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=29, Invalid=127, Unknown=0, NotChecked=0, Total=156 [2024-09-20 13:08:20,273 INFO L87 Difference]: Start difference. First operand 53 states and 63 transitions. Second operand has 8 states, 8 states have (on average 2.625) internal successors, (21), 5 states have internal predecessors, (21), 3 states have call successors, (10), 4 states have call predecessors, (10), 1 states have return successors, (6), 2 states have call predecessors, (6), 2 states have call successors, (6) [2024-09-20 13:08:20,516 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-09-20 13:08:20,516 INFO L93 Difference]: Finished difference Result 68 states and 79 transitions. [2024-09-20 13:08:20,516 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-09-20 13:08:20,517 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 2.625) internal successors, (21), 5 states have internal predecessors, (21), 3 states have call successors, (10), 4 states have call predecessors, (10), 1 states have return successors, (6), 2 states have call predecessors, (6), 2 states have call successors, (6) Word has length 43 [2024-09-20 13:08:20,517 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-09-20 13:08:20,518 INFO L225 Difference]: With dead ends: 68 [2024-09-20 13:08:20,520 INFO L226 Difference]: Without dead ends: 66 [2024-09-20 13:08:20,521 INFO L433 NwaCegarLoop]: 0 DeclaredPredicates, 67 GetRequests, 52 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 15 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=53, Invalid=219, Unknown=0, NotChecked=0, Total=272 [2024-09-20 13:08:20,522 INFO L434 NwaCegarLoop]: 41 mSDtfsCounter, 30 mSDsluCounter, 160 mSDsCounter, 0 mSdLazyCounter, 127 mSolverCounterSat, 20 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 30 SdHoareTripleChecker+Valid, 201 SdHoareTripleChecker+Invalid, 147 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 20 IncrementalHoareTripleChecker+Valid, 127 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-09-20 13:08:20,522 INFO L435 NwaCegarLoop]: SdHoareTripleChecker [30 Valid, 201 Invalid, 147 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [20 Valid, 127 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-09-20 13:08:20,524 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 66 states. [2024-09-20 13:08:20,539 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 66 to 40. [2024-09-20 13:08:20,539 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 40 states, 23 states have (on average 1.1304347826086956) internal successors, (26), 24 states have internal predecessors, (26), 10 states have call successors, (10), 7 states have call predecessors, (10), 6 states have return successors, (8), 8 states have call predecessors, (8), 8 states have call successors, (8) [2024-09-20 13:08:20,540 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 40 states to 40 states and 44 transitions. [2024-09-20 13:08:20,541 INFO L78 Accepts]: Start accepts. Automaton has 40 states and 44 transitions. Word has length 43 [2024-09-20 13:08:20,542 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-09-20 13:08:20,543 INFO L474 AbstractCegarLoop]: Abstraction has 40 states and 44 transitions. [2024-09-20 13:08:20,543 INFO L475 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 2.625) internal successors, (21), 5 states have internal predecessors, (21), 3 states have call successors, (10), 4 states have call predecessors, (10), 1 states have return successors, (6), 2 states have call predecessors, (6), 2 states have call successors, (6) [2024-09-20 13:08:20,543 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-20 13:08:20,544 INFO L276 IsEmpty]: Start isEmpty. Operand 40 states and 44 transitions. [2024-09-20 13:08:20,544 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 47 [2024-09-20 13:08:20,545 INFO L208 NwaCegarLoop]: Found error trace [2024-09-20 13:08:20,545 INFO L216 NwaCegarLoop]: trace histogram [3, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-09-20 13:08:20,558 INFO L552 MonitoredProcess]: [MP /storage/repos/certificate-witnesses-artifact/automizer/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2024-09-20 13:08:20,747 WARN L456 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3,2 /storage/repos/certificate-witnesses-artifact/automizer/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-09-20 13:08:20,748 INFO L399 AbstractCegarLoop]: === Iteration 5 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-09-20 13:08:20,749 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-20 13:08:20,749 INFO L85 PathProgramCache]: Analyzing trace with hash -920124993, now seen corresponding path program 1 times [2024-09-20 13:08:20,749 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-09-20 13:08:20,750 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [428070492] [2024-09-20 13:08:20,750 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-09-20 13:08:20,750 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-09-20 13:08:20,777 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-20 13:08:20,933 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2024-09-20 13:08:20,934 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-20 13:08:20,936 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-09-20 13:08:20,936 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-20 13:08:20,938 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-09-20 13:08:20,938 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-20 13:08:20,947 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-09-20 13:08:20,949 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-20 13:08:20,964 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2024-09-20 13:08:20,966 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-20 13:08:20,968 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-09-20 13:08:20,970 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-20 13:08:20,973 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 36 [2024-09-20 13:08:20,974 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-20 13:08:20,975 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 2 proven. 2 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2024-09-20 13:08:20,976 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-09-20 13:08:20,976 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [428070492] [2024-09-20 13:08:20,976 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [428070492] provided 0 perfect and 1 imperfect interpolant sequences [2024-09-20 13:08:20,976 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [81173992] [2024-09-20 13:08:20,976 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-09-20 13:08:20,976 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-09-20 13:08:20,976 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/certificate-witnesses-artifact/automizer/z3 [2024-09-20 13:08:20,978 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-20 13:08:20,980 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-20 13:08:21,064 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-20 13:08:21,066 INFO L262 TraceCheckSpWp]: Trace formula consists of 192 conjuncts, 17 conjuncts are in the unsatisfiable core [2024-09-20 13:08:21,068 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2024-09-20 13:08:21,094 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 7 treesize of output 6 [2024-09-20 13:08:21,213 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 29 treesize of output 23 [2024-09-20 13:08:21,254 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 12 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2024-09-20 13:08:21,254 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-09-20 13:08:21,255 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [81173992] provided 1 perfect and 0 imperfect interpolant sequences [2024-09-20 13:08:21,255 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-09-20 13:08:21,255 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [9] total 12 [2024-09-20 13:08:21,255 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [415069878] [2024-09-20 13:08:21,255 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-09-20 13:08:21,255 INFO L551 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-09-20 13:08:21,255 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-09-20 13:08:21,256 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-09-20 13:08:21,256 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=104, Unknown=0, NotChecked=0, Total=132 [2024-09-20 13:08:21,256 INFO L87 Difference]: Start difference. First operand 40 states and 44 transitions. Second operand has 9 states, 7 states have (on average 3.7142857142857144) internal successors, (26), 7 states have internal predecessors, (26), 4 states have call successors, (10), 4 states have call predecessors, (10), 4 states have return successors, (7), 4 states have call predecessors, (7), 3 states have call successors, (7) [2024-09-20 13:08:21,374 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-09-20 13:08:21,374 INFO L93 Difference]: Finished difference Result 72 states and 78 transitions. [2024-09-20 13:08:21,376 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-09-20 13:08:21,376 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 7 states have (on average 3.7142857142857144) internal successors, (26), 7 states have internal predecessors, (26), 4 states have call successors, (10), 4 states have call predecessors, (10), 4 states have return successors, (7), 4 states have call predecessors, (7), 3 states have call successors, (7) Word has length 46 [2024-09-20 13:08:21,377 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-09-20 13:08:21,377 INFO L225 Difference]: With dead ends: 72 [2024-09-20 13:08:21,377 INFO L226 Difference]: Without dead ends: 46 [2024-09-20 13:08:21,378 INFO L433 NwaCegarLoop]: 0 DeclaredPredicates, 69 GetRequests, 54 SyntacticMatches, 3 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=42, Invalid=140, Unknown=0, NotChecked=0, Total=182 [2024-09-20 13:08:21,379 INFO L434 NwaCegarLoop]: 31 mSDtfsCounter, 15 mSDsluCounter, 112 mSDsCounter, 0 mSdLazyCounter, 87 mSolverCounterSat, 8 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 16 SdHoareTripleChecker+Valid, 143 SdHoareTripleChecker+Invalid, 95 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 8 IncrementalHoareTripleChecker+Valid, 87 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-09-20 13:08:21,379 INFO L435 NwaCegarLoop]: SdHoareTripleChecker [16 Valid, 143 Invalid, 95 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [8 Valid, 87 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-09-20 13:08:21,379 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 46 states. [2024-09-20 13:08:21,394 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 46 to 44. [2024-09-20 13:08:21,396 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 44 states, 26 states have (on average 1.0769230769230769) internal successors, (28), 27 states have internal predecessors, (28), 10 states have call successors, (10), 8 states have call predecessors, (10), 7 states have return successors, (8), 8 states have call predecessors, (8), 8 states have call successors, (8) [2024-09-20 13:08:21,397 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 44 states to 44 states and 46 transitions. [2024-09-20 13:08:21,397 INFO L78 Accepts]: Start accepts. Automaton has 44 states and 46 transitions. Word has length 46 [2024-09-20 13:08:21,398 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-09-20 13:08:21,398 INFO L474 AbstractCegarLoop]: Abstraction has 44 states and 46 transitions. [2024-09-20 13:08:21,399 INFO L475 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 7 states have (on average 3.7142857142857144) internal successors, (26), 7 states have internal predecessors, (26), 4 states have call successors, (10), 4 states have call predecessors, (10), 4 states have return successors, (7), 4 states have call predecessors, (7), 3 states have call successors, (7) [2024-09-20 13:08:21,399 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-20 13:08:21,399 INFO L276 IsEmpty]: Start isEmpty. Operand 44 states and 46 transitions. [2024-09-20 13:08:21,400 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 47 [2024-09-20 13:08:21,401 INFO L208 NwaCegarLoop]: Found error trace [2024-09-20 13:08:21,401 INFO L216 NwaCegarLoop]: trace histogram [3, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-09-20 13:08:21,417 INFO L552 MonitoredProcess]: [MP /storage/repos/certificate-witnesses-artifact/automizer/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Ended with exit code 0 [2024-09-20 13:08:21,602 WARN L456 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4,3 /storage/repos/certificate-witnesses-artifact/automizer/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-09-20 13:08:21,602 INFO L399 AbstractCegarLoop]: === Iteration 6 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-09-20 13:08:21,602 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-20 13:08:21,603 INFO L85 PathProgramCache]: Analyzing trace with hash -1621189571, now seen corresponding path program 1 times [2024-09-20 13:08:21,603 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-09-20 13:08:21,603 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [942163468] [2024-09-20 13:08:21,603 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-09-20 13:08:21,603 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-09-20 13:08:21,624 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-20 13:08:21,793 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2024-09-20 13:08:21,794 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-20 13:08:21,796 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-09-20 13:08:21,798 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-20 13:08:21,799 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-09-20 13:08:21,799 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-20 13:08:21,809 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-09-20 13:08:21,811 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-20 13:08:21,836 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2024-09-20 13:08:21,837 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-20 13:08:21,840 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-09-20 13:08:21,841 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-20 13:08:21,844 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 36 [2024-09-20 13:08:21,846 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-20 13:08:21,848 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 2 proven. 2 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2024-09-20 13:08:21,851 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-09-20 13:08:21,851 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [942163468] [2024-09-20 13:08:21,851 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [942163468] provided 0 perfect and 1 imperfect interpolant sequences [2024-09-20 13:08:21,851 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [35535632] [2024-09-20 13:08:21,852 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-09-20 13:08:21,852 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-09-20 13:08:21,852 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/certificate-witnesses-artifact/automizer/z3 [2024-09-20 13:08:21,856 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-20 13:08:21,859 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-20 13:08:21,926 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-20 13:08:21,928 INFO L262 TraceCheckSpWp]: Trace formula consists of 192 conjuncts, 32 conjuncts are in the unsatisfiable core [2024-09-20 13:08:21,931 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2024-09-20 13:08:21,978 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 7 treesize of output 6 [2024-09-20 13:08:22,216 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 29 treesize of output 23 [2024-09-20 13:08:22,316 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 5 proven. 10 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2024-09-20 13:08:22,318 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2024-09-20 13:08:30,407 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [35535632] provided 0 perfect and 1 imperfect interpolant sequences [2024-09-20 13:08:30,408 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-09-20 13:08:30,408 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 15] total 22 [2024-09-20 13:08:30,408 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [607700159] [2024-09-20 13:08:30,408 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-09-20 13:08:30,408 INFO L551 AbstractCegarLoop]: INTERPOLANT automaton has 22 states [2024-09-20 13:08:30,408 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-09-20 13:08:30,409 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 22 interpolants. [2024-09-20 13:08:30,409 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=63, Invalid=443, Unknown=0, NotChecked=0, Total=506 [2024-09-20 13:08:30,409 INFO L87 Difference]: Start difference. First operand 44 states and 46 transitions. Second operand has 22 states, 17 states have (on average 2.588235294117647) internal successors, (44), 15 states have internal predecessors, (44), 7 states have call successors, (17), 7 states have call predecessors, (17), 4 states have return successors, (13), 5 states have call predecessors, (13), 3 states have call successors, (13) [2024-09-20 13:08:30,986 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-09-20 13:08:30,987 INFO L93 Difference]: Finished difference Result 46 states and 48 transitions. [2024-09-20 13:08:30,987 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2024-09-20 13:08:30,988 INFO L78 Accepts]: Start accepts. Automaton has has 22 states, 17 states have (on average 2.588235294117647) internal successors, (44), 15 states have internal predecessors, (44), 7 states have call successors, (17), 7 states have call predecessors, (17), 4 states have return successors, (13), 5 states have call predecessors, (13), 3 states have call successors, (13) Word has length 46 [2024-09-20 13:08:30,989 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-09-20 13:08:30,989 INFO L225 Difference]: With dead ends: 46 [2024-09-20 13:08:30,989 INFO L226 Difference]: Without dead ends: 0 [2024-09-20 13:08:30,990 INFO L433 NwaCegarLoop]: 0 DeclaredPredicates, 90 GetRequests, 52 SyntacticMatches, 5 SemanticMatches, 33 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 208 ImplicationChecksByTransitivity, 8.5s TimeCoverageRelationStatistics Valid=149, Invalid=1041, Unknown=0, NotChecked=0, Total=1190 [2024-09-20 13:08:30,991 INFO L434 NwaCegarLoop]: 9 mSDtfsCounter, 37 mSDsluCounter, 82 mSDsCounter, 0 mSdLazyCounter, 597 mSolverCounterSat, 28 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 38 SdHoareTripleChecker+Valid, 91 SdHoareTripleChecker+Invalid, 625 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 28 IncrementalHoareTripleChecker+Valid, 597 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2024-09-20 13:08:30,991 INFO L435 NwaCegarLoop]: SdHoareTripleChecker [38 Valid, 91 Invalid, 625 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [28 Valid, 597 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2024-09-20 13:08:30,991 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2024-09-20 13:08:30,993 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2024-09-20 13:08:30,993 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-20 13:08:30,993 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2024-09-20 13:08:30,993 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 46 [2024-09-20 13:08:30,993 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-09-20 13:08:30,993 INFO L474 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2024-09-20 13:08:30,994 INFO L475 AbstractCegarLoop]: INTERPOLANT automaton has has 22 states, 17 states have (on average 2.588235294117647) internal successors, (44), 15 states have internal predecessors, (44), 7 states have call successors, (17), 7 states have call predecessors, (17), 4 states have return successors, (13), 5 states have call predecessors, (13), 3 states have call successors, (13) [2024-09-20 13:08:30,994 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-20 13:08:30,994 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2024-09-20 13:08:30,994 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2024-09-20 13:08:30,999 INFO L785 garLoopResultBuilder]: Registering result SAFE for location __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2024-09-20 13:08:31,016 INFO L552 MonitoredProcess]: [MP /storage/repos/certificate-witnesses-artifact/automizer/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Ended with exit code 0 [2024-09-20 13:08:31,203 WARN L456 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 /storage/repos/certificate-witnesses-artifact/automizer/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable5 [2024-09-20 13:08:31,206 INFO L408 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1] [2024-09-20 13:08:31,208 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2024-09-20 13:08:32,580 INFO L165 ceAbstractionStarter]: Computing trace abstraction results [2024-09-20 13:08:32,596 FATAL L? ?]: The Plugin de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction has thrown an exception: java.lang.IllegalArgumentException: unknown symbol (const Int (Array Int Int)) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.boogie.Term2Expression.translate(Term2Expression.java:272) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.boogie.Term2Expression.translate(Term2Expression.java:137) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.boogie.Term2Expression.translate(Term2Expression.java:173) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.boogie.Term2Expression.translate(Term2Expression.java:137) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.boogie.Term2Expression.translate(Term2Expression.java:173) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.boogie.Term2Expression.translate(Term2Expression.java:137) at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.RCFGBacktranslator.translateExpression(RCFGBacktranslator.java:401) at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.RCFGBacktranslator.translateExpression(RCFGBacktranslator.java:1) at de.uni_freiburg.informatik.ultimate.core.coreplugin.services.ModelTranslationContainer.translateExpression(ModelTranslationContainer.java:126) at de.uni_freiburg.informatik.ultimate.core.coreplugin.services.ModelTranslationContainer.translateExpressionToString(ModelTranslationContainer.java:109) at de.uni_freiburg.informatik.ultimate.core.coreplugin.services.BacktranslationService.translateExpressionToString(BacktranslationService.java:92) at de.uni_freiburg.informatik.ultimate.core.lib.results.ProcedureContractResult.translateTerm(ProcedureContractResult.java:69) at de.uni_freiburg.informatik.ultimate.core.lib.results.ProcedureContractResult.(ProcedureContractResult.java:59) at de.uni_freiburg.informatik.ultimate.lib.proofs.floydhoare.FloydHoareUtils.createProcedureContractResults(FloydHoareUtils.java:152) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.runCegarLoops(TraceAbstractionStarter.java:194) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.(TraceAbstractionStarter.java:141) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver.finish(TraceAbstractionObserver.java:124) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runObserver(PluginConnector.java:167) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runTool(PluginConnector.java:150) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.run(PluginConnector.java:127) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.executePluginConnector(ToolchainWalker.java:233) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.processPlugin(ToolchainWalker.java:227) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walkUnprotected(ToolchainWalker.java:144) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walk(ToolchainWalker.java:106) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainManager$Toolchain.processToolchain(ToolchainManager.java:319) at de.uni_freiburg.informatik.ultimate.core.coreplugin.toolchain.DefaultToolchainJob.run(DefaultToolchainJob.java:145) at org.eclipse.core.internal.jobs.Worker.run(Worker.java:63) [2024-09-20 13:08:32,602 INFO L158 Benchmark]: Toolchain (without parser) took 15492.09ms. Allocated memory was 161.5MB in the beginning and 234.9MB in the end (delta: 73.4MB). Free memory was 93.6MB in the beginning and 128.4MB in the end (delta: -34.8MB). Peak memory consumption was 97.4MB. Max. memory is 16.1GB. [2024-09-20 13:08:32,602 INFO L158 Benchmark]: CDTParser took 0.20ms. Allocated memory is still 161.5MB. Free memory is still 118.7MB. There was no memory consumed. Max. memory is 16.1GB. [2024-09-20 13:08:32,602 INFO L158 Benchmark]: CACSL2BoogieTranslator took 242.55ms. Allocated memory is still 161.5MB. Free memory was 93.5MB in the beginning and 81.7MB in the end (delta: 11.8MB). Peak memory consumption was 12.6MB. Max. memory is 16.1GB. [2024-09-20 13:08:32,602 INFO L158 Benchmark]: Boogie Procedure Inliner took 25.54ms. Allocated memory is still 161.5MB. Free memory was 81.7MB in the beginning and 80.6MB in the end (delta: 1.0MB). There was no memory consumed. Max. memory is 16.1GB. [2024-09-20 13:08:32,603 INFO L158 Benchmark]: Boogie Preprocessor took 100.61ms. Allocated memory is still 161.5MB. Free memory was 80.6MB in the beginning and 133.0MB in the end (delta: -52.4MB). Peak memory consumption was 3.8MB. Max. memory is 16.1GB. [2024-09-20 13:08:32,603 INFO L158 Benchmark]: RCFGBuilder took 416.15ms. Allocated memory is still 161.5MB. Free memory was 133.0MB in the beginning and 117.3MB in the end (delta: 15.8MB). Peak memory consumption was 14.7MB. Max. memory is 16.1GB. [2024-09-20 13:08:32,603 INFO L158 Benchmark]: TraceAbstraction took 14700.36ms. Allocated memory was 161.5MB in the beginning and 234.9MB in the end (delta: 73.4MB). Free memory was 116.4MB in the beginning and 128.4MB in the end (delta: -12.0MB). Peak memory consumption was 120.9MB. Max. memory is 16.1GB. [2024-09-20 13:08:32,605 INFO L338 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.20ms. Allocated memory is still 161.5MB. Free memory is still 118.7MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 242.55ms. Allocated memory is still 161.5MB. Free memory was 93.5MB in the beginning and 81.7MB in the end (delta: 11.8MB). Peak memory consumption was 12.6MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 25.54ms. Allocated memory is still 161.5MB. Free memory was 81.7MB in the beginning and 80.6MB in the end (delta: 1.0MB). There was no memory consumed. Max. memory is 16.1GB. * Boogie Preprocessor took 100.61ms. Allocated memory is still 161.5MB. Free memory was 80.6MB in the beginning and 133.0MB in the end (delta: -52.4MB). Peak memory consumption was 3.8MB. Max. memory is 16.1GB. * RCFGBuilder took 416.15ms. Allocated memory is still 161.5MB. Free memory was 133.0MB in the beginning and 117.3MB in the end (delta: 15.8MB). Peak memory consumption was 14.7MB. Max. memory is 16.1GB. * TraceAbstraction took 14700.36ms. Allocated memory was 161.5MB in the beginning and 234.9MB in the end (delta: 73.4MB). Free memory was 116.4MB in the beginning and 128.4MB in the end (delta: -12.0MB). Peak memory consumption was 120.9MB. 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: 11]: a call to reach_error is unreachable For all program executions holds that a call to reach_error is unreachable at this location - StatisticsResult: Ultimate Automizer benchmark data CFG has 7 procedures, 42 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 13.3s, OverallIterations: 6, TraceHistogramMax: 3, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 1.7s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 209 SdHoareTripleChecker+Valid, 1.1s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 189 mSDsluCounter, 575 SdHoareTripleChecker+Invalid, 0.9s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 451 mSDsCounter, 94 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 1307 IncrementalHoareTripleChecker+Invalid, 1401 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 94 mSolverCounterUnsat, 124 mSDtfsCounter, 1307 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 276 GetRequests, 188 SyntacticMatches, 8 SemanticMatches, 80 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 237 ImplicationChecksByTransitivity, 9.0s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=55occurred in iteration=2, InterpolantAutomatonStates: 55, 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, 6 MinimizatonAttempts, 33 StatesRemovedByMinimization, 3 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 0.2s SatisfiabilityAnalysisTime, 10.3s InterpolantComputationTime, 357 NumberOfCodeBlocks, 357 NumberOfCodeBlocksAsserted, 9 NumberOfCheckSat, 348 ConstructedInterpolants, 22 QuantifiedInterpolants, 1064 SizeOfPredicates, 21 NumberOfNonLiveVariables, 563 ConjunctsInSsa, 66 ConjunctsInUnsatCore, 9 InterpolantComputations, 5 PerfectInterpolantSequences, 93/110 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 1 specifications checked. All of them hold - ProcedureContractResult [Line: 7]: Procedure Contract for assume_abort_if_not Derived contract for procedure assume_abort_if_not. Ensures: (\old(cond) != 0) - ExceptionOrErrorResult: IllegalArgumentException: unknown symbol (const Int (Array Int Int)) de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: IllegalArgumentException: unknown symbol (const Int (Array Int Int)): de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.boogie.Term2Expression.translate(Term2Expression.java:272) RESULT: Ultimate could not prove your program: Toolchain returned no result. [2024-09-20 13:08:32,633 INFO L540 MonitoredProcess]: [MP /storage/repos/certificate-witnesses-artifact/automizer/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Forceful destruction successful, exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Using bit-precise analysis Retrying with bit-precise analysis ### Bit-precise run ### Calling Ultimate with: /root/.sdkman/candidates/java/current/bin/java -Dosgi.configuration.area=/storage/repos/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/AutomizerReach.xml -i ../sv-benchmarks/c/verifythis/elimination_max_rec_onepoint.c -s /storage/repos/certificate-witnesses-artifact/automizer/config/svcomp-Reach-32bit-Automizer_Bitvector.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/certificate-witnesses-artifact/automizer --witnessprinter.witness.filename witness --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! call(reach_error())) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash 3a80fea07b3dad363ac033c87feb8bfcf28a57d2e75bc95b67f90908b133efe1 --procedureinliner.inline.calls.to.implemented.procedures NEVER --traceabstraction.positions.where.we.compute.the.hoare.annotation All --witnessprinter.yaml.format.version 2.1 --witnessprinter.generate.graphml.witnesses false --- Real Ultimate output --- This is Ultimate 0.2.4-tmp.dk.referee-eval-f1d7dc9-m [2024-09-20 13:08:34,731 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-09-20 13:08:34,796 INFO L114 SettingsManager]: Loading settings from /storage/repos/certificate-witnesses-artifact/automizer/config/svcomp-Reach-32bit-Automizer_Bitvector.epf [2024-09-20 13:08:34,801 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-09-20 13:08:34,802 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-09-20 13:08:34,849 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-09-20 13:08:34,849 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-09-20 13:08:34,850 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-09-20 13:08:34,850 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-09-20 13:08:34,850 INFO L153 SettingsManager]: * Use memory slicer=true [2024-09-20 13:08:34,851 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-09-20 13:08:34,851 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-09-20 13:08:34,852 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-09-20 13:08:34,852 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-09-20 13:08:34,852 INFO L153 SettingsManager]: * Use SBE=true [2024-09-20 13:08:34,853 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-09-20 13:08:34,853 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-09-20 13:08:34,853 INFO L153 SettingsManager]: * sizeof long=4 [2024-09-20 13:08:34,854 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-09-20 13:08:34,854 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-09-20 13:08:34,854 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-09-20 13:08:34,855 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-09-20 13:08:34,855 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-09-20 13:08:34,856 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2024-09-20 13:08:34,856 INFO L153 SettingsManager]: * Use bitvectors instead of ints=true [2024-09-20 13:08:34,858 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-09-20 13:08:34,858 INFO L153 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2024-09-20 13:08:34,859 INFO L153 SettingsManager]: * sizeof long double=12 [2024-09-20 13:08:34,859 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-09-20 13:08:34,859 INFO L153 SettingsManager]: * Use constant arrays=true [2024-09-20 13:08:34,859 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-09-20 13:08:34,859 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-09-20 13:08:34,860 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-09-20 13:08:34,860 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-09-20 13:08:34,860 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-09-20 13:08:34,860 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-09-20 13:08:34,860 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-09-20 13:08:34,861 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-09-20 13:08:34,861 INFO L153 SettingsManager]: * Trace refinement strategy=WOLF [2024-09-20 13:08:34,861 INFO L153 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2024-09-20 13:08:34,861 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-09-20 13:08:34,863 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-09-20 13:08:34,863 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-09-20 13:08:34,864 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-09-20 13:08:34,864 INFO L153 SettingsManager]: * Logic for external solver=AUFBV [2024-09-20 13:08:34,865 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.witnessprinter: Witness directory -> /storage/repos/certificate-witnesses-artifact/automizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G ! call(reach_error())) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> 3a80fea07b3dad363ac033c87feb8bfcf28a57d2e75bc95b67f90908b133efe1 Applying setting for plugin de.uni_freiburg.informatik.ultimate.boogie.procedureinliner: Inline calls to implemented procedures -> NEVER Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: Positions where we compute the Hoare Annotation -> All Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: YAML Format version -> 2.1 Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Generate GraphML witnesses -> false [2024-09-20 13:08:35,172 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-09-20 13:08:35,192 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-09-20 13:08:35,196 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-09-20 13:08:35,197 INFO L270 PluginConnector]: Initializing CDTParser... [2024-09-20 13:08:35,197 INFO L274 PluginConnector]: CDTParser initialized [2024-09-20 13:08:35,198 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/certificate-witnesses-artifact/automizer/../sv-benchmarks/c/verifythis/elimination_max_rec_onepoint.c [2024-09-20 13:08:36,663 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-09-20 13:08:36,858 INFO L384 CDTParser]: Found 1 translation units. [2024-09-20 13:08:36,859 INFO L180 CDTParser]: Scanning /storage/repos/certificate-witnesses-artifact/sv-benchmarks/c/verifythis/elimination_max_rec_onepoint.c [2024-09-20 13:08:36,865 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/certificate-witnesses-artifact/automizer/data/d7fb47e0b/08c02156ec3f4a4293e4bc3c7eec1a5a/FLAGce290056c [2024-09-20 13:08:37,242 INFO L435 CDTParser]: Successfully deleted /storage/repos/certificate-witnesses-artifact/automizer/data/d7fb47e0b/08c02156ec3f4a4293e4bc3c7eec1a5a [2024-09-20 13:08:37,245 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-09-20 13:08:37,246 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-09-20 13:08:37,247 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-09-20 13:08:37,247 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-09-20 13:08:37,254 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-09-20 13:08:37,255 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 20.09 01:08:37" (1/1) ... [2024-09-20 13:08:37,255 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@1036f51d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.09 01:08:37, skipping insertion in model container [2024-09-20 13:08:37,256 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 20.09 01:08:37" (1/1) ... [2024-09-20 13:08:37,275 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-09-20 13:08:37,442 WARN L248 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/certificate-witnesses-artifact/sv-benchmarks/c/verifythis/elimination_max_rec_onepoint.c[502,515] [2024-09-20 13:08:37,470 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-09-20 13:08:37,496 INFO L200 MainTranslator]: Completed pre-run [2024-09-20 13:08:37,510 WARN L248 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/certificate-witnesses-artifact/sv-benchmarks/c/verifythis/elimination_max_rec_onepoint.c[502,515] [2024-09-20 13:08:37,519 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-09-20 13:08:37,536 INFO L204 MainTranslator]: Completed translation [2024-09-20 13:08:37,537 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.09 01:08:37 WrapperNode [2024-09-20 13:08:37,537 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-09-20 13:08:37,538 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-09-20 13:08:37,538 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-09-20 13:08:37,538 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-09-20 13:08:37,545 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.09 01:08:37" (1/1) ... [2024-09-20 13:08:37,553 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.09 01:08:37" (1/1) ... [2024-09-20 13:08:37,561 INFO L138 Inliner]: procedures = 21, calls = 24, calls flagged for inlining = 0, calls inlined = 0, statements flattened = 0 [2024-09-20 13:08:37,562 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-09-20 13:08:37,563 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-09-20 13:08:37,563 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-09-20 13:08:37,564 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-09-20 13:08:37,573 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.09 01:08:37" (1/1) ... [2024-09-20 13:08:37,573 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.09 01:08:37" (1/1) ... [2024-09-20 13:08:37,581 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.09 01:08:37" (1/1) ... [2024-09-20 13:08:37,601 INFO L175 MemorySlicer]: Split 9 memory accesses to 2 slices as follows [2, 7]. 78 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2, 0]. The 1 writes are split as follows [0, 1]. [2024-09-20 13:08:37,601 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.09 01:08:37" (1/1) ... [2024-09-20 13:08:37,605 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.09 01:08:37" (1/1) ... [2024-09-20 13:08:37,611 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.09 01:08:37" (1/1) ... [2024-09-20 13:08:37,615 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.09 01:08:37" (1/1) ... [2024-09-20 13:08:37,617 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.09 01:08:37" (1/1) ... [2024-09-20 13:08:37,621 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.09 01:08:37" (1/1) ... [2024-09-20 13:08:37,624 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-09-20 13:08:37,625 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-09-20 13:08:37,625 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-09-20 13:08:37,626 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-09-20 13:08:37,626 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.09 01:08:37" (1/1) ... [2024-09-20 13:08:37,631 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-09-20 13:08:37,642 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/certificate-witnesses-artifact/automizer/z3 [2024-09-20 13:08:37,658 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-20 13:08:37,661 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-20 13:08:37,708 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-09-20 13:08:37,709 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#0 [2024-09-20 13:08:37,709 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#1 [2024-09-20 13:08:37,709 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2024-09-20 13:08:37,709 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2024-09-20 13:08:37,711 INFO L130 BoogieDeclarations]: Found specification of procedure main [2024-09-20 13:08:37,711 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2024-09-20 13:08:37,711 INFO L130 BoogieDeclarations]: Found specification of procedure check [2024-09-20 13:08:37,711 INFO L138 BoogieDeclarations]: Found implementation of procedure check [2024-09-20 13:08:37,711 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2024-09-20 13:08:37,711 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2024-09-20 13:08:37,711 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2024-09-20 13:08:37,712 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4#0 [2024-09-20 13:08:37,712 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4#1 [2024-09-20 13:08:37,712 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-09-20 13:08:37,712 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-09-20 13:08:37,712 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.meminit [2024-09-20 13:08:37,712 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.meminit [2024-09-20 13:08:37,713 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2024-09-20 13:08:37,713 INFO L138 BoogieDeclarations]: Found implementation of procedure __VERIFIER_assert [2024-09-20 13:08:37,713 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2024-09-20 13:08:37,820 INFO L242 CfgBuilder]: Building ICFG [2024-09-20 13:08:37,822 INFO L268 CfgBuilder]: Building CFG for each procedure with an implementation [2024-09-20 13:08:38,050 INFO L? ?]: Removed 22 outVars from TransFormulas that were not future-live. [2024-09-20 13:08:38,052 INFO L291 CfgBuilder]: Performing block encoding [2024-09-20 13:08:38,083 INFO L313 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-09-20 13:08:38,083 INFO L318 CfgBuilder]: Removed 0 assume(true) statements. [2024-09-20 13:08:38,083 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 20.09 01:08:38 BoogieIcfgContainer [2024-09-20 13:08:38,083 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-09-20 13:08:38,085 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-09-20 13:08:38,085 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-09-20 13:08:38,092 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-09-20 13:08:38,092 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 20.09 01:08:37" (1/3) ... [2024-09-20 13:08:38,093 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@30a77490 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 20.09 01:08:38, skipping insertion in model container [2024-09-20 13:08:38,093 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.09 01:08:37" (2/3) ... [2024-09-20 13:08:38,093 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@30a77490 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 20.09 01:08:38, skipping insertion in model container [2024-09-20 13:08:38,093 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 20.09 01:08:38" (3/3) ... [2024-09-20 13:08:38,095 INFO L112 eAbstractionObserver]: Analyzing ICFG elimination_max_rec_onepoint.c [2024-09-20 13:08:38,118 INFO L209 ceAbstractionStarter]: Automizer settings: Hoare:All NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-09-20 13:08:38,118 INFO L149 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-09-20 13:08:38,178 INFO L335 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-09-20 13:08:38,187 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=All, 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;@1511e533, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-09-20 13:08:38,187 INFO L337 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-09-20 13:08:38,191 INFO L276 IsEmpty]: Start isEmpty. Operand has 42 states, 23 states have (on average 1.2173913043478262) internal successors, (28), 24 states have internal predecessors, (28), 11 states have call successors, (11), 6 states have call predecessors, (11), 6 states have return successors, (11), 11 states have call predecessors, (11), 11 states have call successors, (11) [2024-09-20 13:08:38,199 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2024-09-20 13:08:38,199 INFO L208 NwaCegarLoop]: Found error trace [2024-09-20 13:08:38,200 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, 1, 1, 1, 1] [2024-09-20 13:08:38,201 INFO L399 AbstractCegarLoop]: === Iteration 1 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-09-20 13:08:38,205 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-20 13:08:38,206 INFO L85 PathProgramCache]: Analyzing trace with hash 1437097425, now seen corresponding path program 1 times [2024-09-20 13:08:38,217 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-09-20 13:08:38,218 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [366616728] [2024-09-20 13:08:38,218 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-09-20 13:08:38,218 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-09-20 13:08:38,219 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/certificate-witnesses-artifact/automizer/mathsat [2024-09-20 13:08:38,221 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/certificate-witnesses-artifact/automizer/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-09-20 13:08:38,223 INFO L327 MonitoredProcess]: [MP /storage/repos/certificate-witnesses-artifact/automizer/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (2)] Waiting until timeout for monitored process [2024-09-20 13:08:38,331 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-20 13:08:38,334 INFO L262 TraceCheckSpWp]: Trace formula consists of 80 conjuncts, 1 conjuncts are in the unsatisfiable core [2024-09-20 13:08:38,340 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2024-09-20 13:08:38,352 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2024-09-20 13:08:38,353 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-09-20 13:08:38,353 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-09-20 13:08:38,353 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [366616728] [2024-09-20 13:08:38,354 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [366616728] provided 1 perfect and 0 imperfect interpolant sequences [2024-09-20 13:08:38,354 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-09-20 13:08:38,354 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-09-20 13:08:38,356 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1669427645] [2024-09-20 13:08:38,356 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-09-20 13:08:38,360 INFO L551 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-09-20 13:08:38,361 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-09-20 13:08:38,384 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-09-20 13:08:38,385 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-09-20 13:08:38,386 INFO L87 Difference]: Start difference. First operand has 42 states, 23 states have (on average 1.2173913043478262) internal successors, (28), 24 states have internal predecessors, (28), 11 states have call successors, (11), 6 states have call predecessors, (11), 6 states have return successors, (11), 11 states have call predecessors, (11), 11 states have call successors, (11) Second operand has 2 states, 2 states have (on average 8.0) internal successors, (16), 2 states have internal predecessors, (16), 2 states have call successors, (7), 2 states have call predecessors, (7), 2 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) [2024-09-20 13:08:38,419 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-09-20 13:08:38,421 INFO L93 Difference]: Finished difference Result 78 states and 101 transitions. [2024-09-20 13:08:38,422 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-09-20 13:08:38,424 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 8.0) internal successors, (16), 2 states have internal predecessors, (16), 2 states have call successors, (7), 2 states have call predecessors, (7), 2 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) Word has length 28 [2024-09-20 13:08:38,424 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-09-20 13:08:38,431 INFO L225 Difference]: With dead ends: 78 [2024-09-20 13:08:38,431 INFO L226 Difference]: Without dead ends: 38 [2024-09-20 13:08:38,435 INFO L433 NwaCegarLoop]: 0 DeclaredPredicates, 27 GetRequests, 27 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-09-20 13:08:38,438 INFO L434 NwaCegarLoop]: 45 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 3 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 45 SdHoareTripleChecker+Invalid, 3 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 3 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-09-20 13:08:38,439 INFO L435 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 45 Invalid, 3 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 3 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-09-20 13:08:38,454 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 38 states. [2024-09-20 13:08:38,469 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 38 to 38. [2024-09-20 13:08:38,470 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 38 states, 21 states have (on average 1.1428571428571428) internal successors, (24), 22 states have internal predecessors, (24), 11 states have call successors, (11), 6 states have call predecessors, (11), 5 states have return successors, (9), 9 states have call predecessors, (9), 9 states have call successors, (9) [2024-09-20 13:08:38,472 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 38 states to 38 states and 44 transitions. [2024-09-20 13:08:38,473 INFO L78 Accepts]: Start accepts. Automaton has 38 states and 44 transitions. Word has length 28 [2024-09-20 13:08:38,474 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-09-20 13:08:38,474 INFO L474 AbstractCegarLoop]: Abstraction has 38 states and 44 transitions. [2024-09-20 13:08:38,474 INFO L475 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 8.0) internal successors, (16), 2 states have internal predecessors, (16), 2 states have call successors, (7), 2 states have call predecessors, (7), 2 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) [2024-09-20 13:08:38,475 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-20 13:08:38,475 INFO L276 IsEmpty]: Start isEmpty. Operand 38 states and 44 transitions. [2024-09-20 13:08:38,476 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2024-09-20 13:08:38,477 INFO L208 NwaCegarLoop]: Found error trace [2024-09-20 13:08:38,477 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, 1, 1, 1, 1] [2024-09-20 13:08:38,482 INFO L540 MonitoredProcess]: [MP /storage/repos/certificate-witnesses-artifact/automizer/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (2)] Forceful destruction successful, exit code 0 [2024-09-20 13:08:38,680 WARN L456 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/certificate-witnesses-artifact/automizer/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-09-20 13:08:38,680 INFO L399 AbstractCegarLoop]: === Iteration 2 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-09-20 13:08:38,681 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-20 13:08:38,681 INFO L85 PathProgramCache]: Analyzing trace with hash 579935573, now seen corresponding path program 1 times [2024-09-20 13:08:38,682 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-09-20 13:08:38,682 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [28190311] [2024-09-20 13:08:38,682 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-09-20 13:08:38,682 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-09-20 13:08:38,682 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/certificate-witnesses-artifact/automizer/mathsat [2024-09-20 13:08:38,685 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/certificate-witnesses-artifact/automizer/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-09-20 13:08:38,687 INFO L327 MonitoredProcess]: [MP /storage/repos/certificate-witnesses-artifact/automizer/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (3)] Waiting until timeout for monitored process [2024-09-20 13:08:38,765 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-20 13:08:38,767 INFO L262 TraceCheckSpWp]: Trace formula consists of 80 conjuncts, 16 conjuncts are in the unsatisfiable core [2024-09-20 13:08:38,770 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2024-09-20 13:08:39,221 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-20 13:08:39,221 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-09-20 13:08:39,221 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-09-20 13:08:39,221 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [28190311] [2024-09-20 13:08:39,222 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [28190311] provided 1 perfect and 0 imperfect interpolant sequences [2024-09-20 13:08:39,222 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-09-20 13:08:39,222 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2024-09-20 13:08:39,222 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [501745153] [2024-09-20 13:08:39,222 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-09-20 13:08:39,223 INFO L551 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2024-09-20 13:08:39,224 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-09-20 13:08:39,226 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2024-09-20 13:08:39,226 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=89, Unknown=0, NotChecked=0, Total=110 [2024-09-20 13:08:39,228 INFO L87 Difference]: Start difference. First operand 38 states and 44 transitions. Second operand has 11 states, 10 states have (on average 1.4) internal successors, (14), 9 states have internal predecessors, (14), 4 states have call successors, (7), 3 states have call predecessors, (7), 2 states have return successors, (4), 3 states have call predecessors, (4), 3 states have call successors, (4) [2024-09-20 13:08:39,618 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-09-20 13:08:39,619 INFO L93 Difference]: Finished difference Result 56 states and 66 transitions. [2024-09-20 13:08:39,620 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2024-09-20 13:08:39,620 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 10 states have (on average 1.4) internal successors, (14), 9 states have internal predecessors, (14), 4 states have call successors, (7), 3 states have call predecessors, (7), 2 states have return successors, (4), 3 states have call predecessors, (4), 3 states have call successors, (4) Word has length 28 [2024-09-20 13:08:39,620 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-09-20 13:08:39,621 INFO L225 Difference]: With dead ends: 56 [2024-09-20 13:08:39,621 INFO L226 Difference]: Without dead ends: 54 [2024-09-20 13:08:39,622 INFO L433 NwaCegarLoop]: 0 DeclaredPredicates, 30 GetRequests, 18 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 13 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=35, Invalid=147, Unknown=0, NotChecked=0, Total=182 [2024-09-20 13:08:39,625 INFO L434 NwaCegarLoop]: 27 mSDtfsCounter, 15 mSDsluCounter, 193 mSDsCounter, 0 mSdLazyCounter, 159 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 18 SdHoareTripleChecker+Valid, 220 SdHoareTripleChecker+Invalid, 165 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 159 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-09-20 13:08:39,626 INFO L435 NwaCegarLoop]: SdHoareTripleChecker [18 Valid, 220 Invalid, 165 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 159 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-09-20 13:08:39,627 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 54 states. [2024-09-20 13:08:39,648 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 54 to 54. [2024-09-20 13:08:39,649 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 54 states, 31 states have (on average 1.1612903225806452) internal successors, (36), 32 states have internal predecessors, (36), 15 states have call successors, (15), 8 states have call predecessors, (15), 7 states have return successors, (13), 13 states have call predecessors, (13), 13 states have call successors, (13) [2024-09-20 13:08:39,651 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 54 states to 54 states and 64 transitions. [2024-09-20 13:08:39,652 INFO L78 Accepts]: Start accepts. Automaton has 54 states and 64 transitions. Word has length 28 [2024-09-20 13:08:39,653 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-09-20 13:08:39,653 INFO L474 AbstractCegarLoop]: Abstraction has 54 states and 64 transitions. [2024-09-20 13:08:39,653 INFO L475 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 10 states have (on average 1.4) internal successors, (14), 9 states have internal predecessors, (14), 4 states have call successors, (7), 3 states have call predecessors, (7), 2 states have return successors, (4), 3 states have call predecessors, (4), 3 states have call successors, (4) [2024-09-20 13:08:39,654 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-20 13:08:39,654 INFO L276 IsEmpty]: Start isEmpty. Operand 54 states and 64 transitions. [2024-09-20 13:08:39,655 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2024-09-20 13:08:39,655 INFO L208 NwaCegarLoop]: Found error trace [2024-09-20 13:08:39,656 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, 1, 1, 1, 1, 1, 1, 1] [2024-09-20 13:08:39,659 INFO L552 MonitoredProcess]: [MP /storage/repos/certificate-witnesses-artifact/automizer/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (3)] Ended with exit code 0 [2024-09-20 13:08:39,858 WARN L456 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/certificate-witnesses-artifact/automizer/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-09-20 13:08:39,859 INFO L399 AbstractCegarLoop]: === Iteration 3 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-09-20 13:08:39,859 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-20 13:08:39,859 INFO L85 PathProgramCache]: Analyzing trace with hash 2135763327, now seen corresponding path program 1 times [2024-09-20 13:08:39,860 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-09-20 13:08:39,860 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [917175698] [2024-09-20 13:08:39,860 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-09-20 13:08:39,860 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-09-20 13:08:39,860 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/certificate-witnesses-artifact/automizer/mathsat [2024-09-20 13:08:39,862 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/certificate-witnesses-artifact/automizer/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-09-20 13:08:39,863 INFO L327 MonitoredProcess]: [MP /storage/repos/certificate-witnesses-artifact/automizer/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (4)] Waiting until timeout for monitored process [2024-09-20 13:08:39,943 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-20 13:08:39,945 INFO L262 TraceCheckSpWp]: Trace formula consists of 86 conjuncts, 21 conjuncts are in the unsatisfiable core [2024-09-20 13:08:39,949 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2024-09-20 13:08:40,271 INFO L173 IndexEqualityManager]: detected equality via solver [2024-09-20 13:08:40,278 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-09-20 13:08:40,279 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 17 treesize of output 10 [2024-09-20 13:08:40,368 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-20 13:08:40,368 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-09-20 13:08:40,368 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-09-20 13:08:40,368 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [917175698] [2024-09-20 13:08:40,369 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [917175698] provided 1 perfect and 0 imperfect interpolant sequences [2024-09-20 13:08:40,369 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-09-20 13:08:40,369 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [14] imperfect sequences [] total 14 [2024-09-20 13:08:40,369 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1264341185] [2024-09-20 13:08:40,369 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-09-20 13:08:40,369 INFO L551 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2024-09-20 13:08:40,369 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-09-20 13:08:40,371 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2024-09-20 13:08:40,372 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=152, Unknown=0, NotChecked=0, Total=182 [2024-09-20 13:08:40,372 INFO L87 Difference]: Start difference. First operand 54 states and 64 transitions. Second operand has 14 states, 12 states have (on average 1.3333333333333333) internal successors, (16), 11 states have internal predecessors, (16), 5 states have call successors, (7), 2 states have call predecessors, (7), 3 states have return successors, (5), 5 states have call predecessors, (5), 4 states have call successors, (5) [2024-09-20 13:08:40,718 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-09-20 13:08:40,718 INFO L93 Difference]: Finished difference Result 66 states and 76 transitions. [2024-09-20 13:08:40,719 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2024-09-20 13:08:40,719 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 12 states have (on average 1.3333333333333333) internal successors, (16), 11 states have internal predecessors, (16), 5 states have call successors, (7), 2 states have call predecessors, (7), 3 states have return successors, (5), 5 states have call predecessors, (5), 4 states have call successors, (5) Word has length 31 [2024-09-20 13:08:40,720 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-09-20 13:08:40,722 INFO L225 Difference]: With dead ends: 66 [2024-09-20 13:08:40,722 INFO L226 Difference]: Without dead ends: 56 [2024-09-20 13:08:40,722 INFO L433 NwaCegarLoop]: 0 DeclaredPredicates, 33 GetRequests, 18 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 26 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=44, Invalid=228, Unknown=0, NotChecked=0, Total=272 [2024-09-20 13:08:40,723 INFO L434 NwaCegarLoop]: 29 mSDtfsCounter, 7 mSDsluCounter, 256 mSDsCounter, 0 mSdLazyCounter, 215 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 11 SdHoareTripleChecker+Valid, 285 SdHoareTripleChecker+Invalid, 219 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 215 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2024-09-20 13:08:40,724 INFO L435 NwaCegarLoop]: SdHoareTripleChecker [11 Valid, 285 Invalid, 219 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 215 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2024-09-20 13:08:40,725 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 56 states. [2024-09-20 13:08:40,742 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 56 to 54. [2024-09-20 13:08:40,743 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 54 states, 31 states have (on average 1.1290322580645162) internal successors, (35), 32 states have internal predecessors, (35), 15 states have call successors, (15), 8 states have call predecessors, (15), 7 states have return successors, (13), 13 states have call predecessors, (13), 13 states have call successors, (13) [2024-09-20 13:08:40,744 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 54 states to 54 states and 63 transitions. [2024-09-20 13:08:40,745 INFO L78 Accepts]: Start accepts. Automaton has 54 states and 63 transitions. Word has length 31 [2024-09-20 13:08:40,745 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-09-20 13:08:40,745 INFO L474 AbstractCegarLoop]: Abstraction has 54 states and 63 transitions. [2024-09-20 13:08:40,745 INFO L475 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 12 states have (on average 1.3333333333333333) internal successors, (16), 11 states have internal predecessors, (16), 5 states have call successors, (7), 2 states have call predecessors, (7), 3 states have return successors, (5), 5 states have call predecessors, (5), 4 states have call successors, (5) [2024-09-20 13:08:40,746 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-20 13:08:40,746 INFO L276 IsEmpty]: Start isEmpty. Operand 54 states and 63 transitions. [2024-09-20 13:08:40,749 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 44 [2024-09-20 13:08:40,749 INFO L208 NwaCegarLoop]: Found error trace [2024-09-20 13:08:40,749 INFO L216 NwaCegarLoop]: trace histogram [3, 3, 3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-09-20 13:08:40,754 INFO L540 MonitoredProcess]: [MP /storage/repos/certificate-witnesses-artifact/automizer/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (4)] Forceful destruction successful, exit code 0 [2024-09-20 13:08:40,950 WARN L456 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 /storage/repos/certificate-witnesses-artifact/automizer/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-09-20 13:08:40,950 INFO L399 AbstractCegarLoop]: === Iteration 4 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-09-20 13:08:40,951 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-20 13:08:40,951 INFO L85 PathProgramCache]: Analyzing trace with hash 757009592, now seen corresponding path program 1 times [2024-09-20 13:08:40,951 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-09-20 13:08:40,952 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1270073053] [2024-09-20 13:08:40,952 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-09-20 13:08:40,952 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-09-20 13:08:40,952 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/certificate-witnesses-artifact/automizer/mathsat [2024-09-20 13:08:40,955 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/certificate-witnesses-artifact/automizer/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-09-20 13:08:40,956 INFO L327 MonitoredProcess]: [MP /storage/repos/certificate-witnesses-artifact/automizer/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (5)] Waiting until timeout for monitored process [2024-09-20 13:08:41,026 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-20 13:08:41,030 INFO L262 TraceCheckSpWp]: Trace formula consists of 116 conjuncts, 28 conjuncts are in the unsatisfiable core [2024-09-20 13:08:41,034 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2024-09-20 13:08:41,603 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 1 proven. 10 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2024-09-20 13:08:41,603 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2024-09-20 13:08:42,215 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 3 proven. 2 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2024-09-20 13:08:42,216 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-09-20 13:08:42,216 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1270073053] [2024-09-20 13:08:42,216 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1270073053] provided 0 perfect and 2 imperfect interpolant sequences [2024-09-20 13:08:42,216 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-09-20 13:08:42,217 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [16, 10] total 23 [2024-09-20 13:08:42,217 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [842158294] [2024-09-20 13:08:42,217 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-09-20 13:08:42,217 INFO L551 AbstractCegarLoop]: INTERPOLANT automaton has 23 states [2024-09-20 13:08:42,218 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-09-20 13:08:42,218 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 23 interpolants. [2024-09-20 13:08:42,219 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=71, Invalid=435, Unknown=0, NotChecked=0, Total=506 [2024-09-20 13:08:42,219 INFO L87 Difference]: Start difference. First operand 54 states and 63 transitions. Second operand has 23 states, 20 states have (on average 1.85) internal successors, (37), 19 states have internal predecessors, (37), 10 states have call successors, (17), 6 states have call predecessors, (17), 3 states have return successors, (11), 5 states have call predecessors, (11), 6 states have call successors, (11) [2024-09-20 13:08:43,952 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-09-20 13:08:43,952 INFO L93 Difference]: Finished difference Result 108 states and 140 transitions. [2024-09-20 13:08:43,952 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 26 states. [2024-09-20 13:08:43,953 INFO L78 Accepts]: Start accepts. Automaton has has 23 states, 20 states have (on average 1.85) internal successors, (37), 19 states have internal predecessors, (37), 10 states have call successors, (17), 6 states have call predecessors, (17), 3 states have return successors, (11), 5 states have call predecessors, (11), 6 states have call successors, (11) Word has length 43 [2024-09-20 13:08:43,953 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-09-20 13:08:43,954 INFO L225 Difference]: With dead ends: 108 [2024-09-20 13:08:43,955 INFO L226 Difference]: Without dead ends: 106 [2024-09-20 13:08:43,955 INFO L433 NwaCegarLoop]: 0 DeclaredPredicates, 98 GetRequests, 64 SyntacticMatches, 1 SemanticMatches, 33 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 193 ImplicationChecksByTransitivity, 1.4s TimeCoverageRelationStatistics Valid=205, Invalid=985, Unknown=0, NotChecked=0, Total=1190 [2024-09-20 13:08:43,956 INFO L434 NwaCegarLoop]: 32 mSDtfsCounter, 80 mSDsluCounter, 409 mSDsCounter, 0 mSdLazyCounter, 520 mSolverCounterSat, 62 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 86 SdHoareTripleChecker+Valid, 441 SdHoareTripleChecker+Invalid, 582 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 62 IncrementalHoareTripleChecker+Valid, 520 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.9s IncrementalHoareTripleChecker+Time [2024-09-20 13:08:43,957 INFO L435 NwaCegarLoop]: SdHoareTripleChecker [86 Valid, 441 Invalid, 582 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [62 Valid, 520 Invalid, 0 Unknown, 0 Unchecked, 0.9s Time] [2024-09-20 13:08:43,957 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 106 states. [2024-09-20 13:08:43,979 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 106 to 85. [2024-09-20 13:08:43,980 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 85 states, 48 states have (on average 1.1666666666666667) internal successors, (56), 52 states have internal predecessors, (56), 26 states have call successors, (26), 11 states have call predecessors, (26), 10 states have return successors, (24), 21 states have call predecessors, (24), 24 states have call successors, (24) [2024-09-20 13:08:43,981 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 85 states to 85 states and 106 transitions. [2024-09-20 13:08:43,982 INFO L78 Accepts]: Start accepts. Automaton has 85 states and 106 transitions. Word has length 43 [2024-09-20 13:08:43,982 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-09-20 13:08:43,982 INFO L474 AbstractCegarLoop]: Abstraction has 85 states and 106 transitions. [2024-09-20 13:08:43,982 INFO L475 AbstractCegarLoop]: INTERPOLANT automaton has has 23 states, 20 states have (on average 1.85) internal successors, (37), 19 states have internal predecessors, (37), 10 states have call successors, (17), 6 states have call predecessors, (17), 3 states have return successors, (11), 5 states have call predecessors, (11), 6 states have call successors, (11) [2024-09-20 13:08:43,983 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-20 13:08:43,983 INFO L276 IsEmpty]: Start isEmpty. Operand 85 states and 106 transitions. [2024-09-20 13:08:43,984 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 47 [2024-09-20 13:08:43,984 INFO L208 NwaCegarLoop]: Found error trace [2024-09-20 13:08:43,984 INFO L216 NwaCegarLoop]: trace histogram [3, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-09-20 13:08:43,990 INFO L552 MonitoredProcess]: [MP /storage/repos/certificate-witnesses-artifact/automizer/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (5)] Ended with exit code 0 [2024-09-20 13:08:44,185 WARN L456 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 /storage/repos/certificate-witnesses-artifact/automizer/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-09-20 13:08:44,185 INFO L399 AbstractCegarLoop]: === Iteration 5 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-09-20 13:08:44,186 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-20 13:08:44,186 INFO L85 PathProgramCache]: Analyzing trace with hash -920124993, now seen corresponding path program 1 times [2024-09-20 13:08:44,186 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-09-20 13:08:44,186 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [896150985] [2024-09-20 13:08:44,187 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-09-20 13:08:44,187 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-09-20 13:08:44,187 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/certificate-witnesses-artifact/automizer/mathsat [2024-09-20 13:08:44,188 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/certificate-witnesses-artifact/automizer/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-09-20 13:08:44,190 INFO L327 MonitoredProcess]: [MP /storage/repos/certificate-witnesses-artifact/automizer/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (6)] Waiting until timeout for monitored process [2024-09-20 13:08:44,269 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-20 13:08:44,271 INFO L262 TraceCheckSpWp]: Trace formula consists of 122 conjuncts, 35 conjuncts are in the unsatisfiable core [2024-09-20 13:08:44,274 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2024-09-20 13:08:45,241 INFO L349 Elim1Store]: treesize reduction 80, result has 41.6 percent of original size [2024-09-20 13:08:45,242 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 5 select indices, 5 select index equivalence classes, 0 disjoint index pairs (out of 10 index pairs), introduced 5 new quantified variables, introduced 10 case distinctions, treesize of input 49 treesize of output 71 [2024-09-20 13:08:45,523 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 2 proven. 8 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2024-09-20 13:08:45,523 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2024-09-20 13:08:58,568 INFO L349 Elim1Store]: treesize reduction 15, result has 59.5 percent of original size [2024-09-20 13:08:58,568 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 39 treesize of output 28 [2024-09-20 13:08:59,730 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 5 proven. 5 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2024-09-20 13:08:59,733 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-09-20 13:08:59,733 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [896150985] [2024-09-20 13:08:59,733 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [896150985] provided 0 perfect and 2 imperfect interpolant sequences [2024-09-20 13:08:59,733 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-09-20 13:08:59,733 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [20, 16] total 33 [2024-09-20 13:08:59,733 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [692239844] [2024-09-20 13:08:59,733 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-09-20 13:08:59,734 INFO L551 AbstractCegarLoop]: INTERPOLANT automaton has 33 states [2024-09-20 13:08:59,734 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-09-20 13:08:59,735 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 33 interpolants. [2024-09-20 13:08:59,735 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=102, Invalid=951, Unknown=3, NotChecked=0, Total=1056 [2024-09-20 13:08:59,735 INFO L87 Difference]: Start difference. First operand 85 states and 106 transitions. Second operand has 33 states, 28 states have (on average 1.4642857142857142) internal successors, (41), 25 states have internal predecessors, (41), 11 states have call successors, (17), 6 states have call predecessors, (17), 4 states have return successors, (13), 9 states have call predecessors, (13), 8 states have call successors, (13) [2024-09-20 13:09:14,437 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2024-09-20 13:09:18,641 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 3.71s for a HTC check with result INVALID. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-09-20 13:09:21,305 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-09-20 13:09:21,305 INFO L93 Difference]: Finished difference Result 165 states and 203 transitions. [2024-09-20 13:09:21,306 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 35 states. [2024-09-20 13:09:21,306 INFO L78 Accepts]: Start accepts. Automaton has has 33 states, 28 states have (on average 1.4642857142857142) internal successors, (41), 25 states have internal predecessors, (41), 11 states have call successors, (17), 6 states have call predecessors, (17), 4 states have return successors, (13), 9 states have call predecessors, (13), 8 states have call successors, (13) Word has length 46 [2024-09-20 13:09:21,306 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-09-20 13:09:21,308 INFO L225 Difference]: With dead ends: 165 [2024-09-20 13:09:21,308 INFO L226 Difference]: Without dead ends: 163 [2024-09-20 13:09:21,310 INFO L433 NwaCegarLoop]: 0 DeclaredPredicates, 112 GetRequests, 61 SyntacticMatches, 0 SemanticMatches, 51 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 572 ImplicationChecksByTransitivity, 25.1s TimeCoverageRelationStatistics Valid=258, Invalid=2494, Unknown=4, NotChecked=0, Total=2756 [2024-09-20 13:09:21,310 INFO L434 NwaCegarLoop]: 35 mSDtfsCounter, 85 mSDsluCounter, 597 mSDsCounter, 0 mSdLazyCounter, 671 mSolverCounterSat, 62 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 10.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 91 SdHoareTripleChecker+Valid, 632 SdHoareTripleChecker+Invalid, 734 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 62 IncrementalHoareTripleChecker+Valid, 671 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 10.5s IncrementalHoareTripleChecker+Time [2024-09-20 13:09:21,311 INFO L435 NwaCegarLoop]: SdHoareTripleChecker [91 Valid, 632 Invalid, 734 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [62 Valid, 671 Invalid, 1 Unknown, 0 Unchecked, 10.5s Time] [2024-09-20 13:09:21,311 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 163 states. [2024-09-20 13:09:21,369 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 163 to 146. [2024-09-20 13:09:21,369 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 146 states, 85 states have (on average 1.1529411764705881) internal successors, (98), 93 states have internal predecessors, (98), 40 states have call successors, (40), 18 states have call predecessors, (40), 20 states have return successors, (42), 34 states have call predecessors, (42), 37 states have call successors, (42) [2024-09-20 13:09:21,371 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 146 states to 146 states and 180 transitions. [2024-09-20 13:09:21,371 INFO L78 Accepts]: Start accepts. Automaton has 146 states and 180 transitions. Word has length 46 [2024-09-20 13:09:21,372 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-09-20 13:09:21,372 INFO L474 AbstractCegarLoop]: Abstraction has 146 states and 180 transitions. [2024-09-20 13:09:21,372 INFO L475 AbstractCegarLoop]: INTERPOLANT automaton has has 33 states, 28 states have (on average 1.4642857142857142) internal successors, (41), 25 states have internal predecessors, (41), 11 states have call successors, (17), 6 states have call predecessors, (17), 4 states have return successors, (13), 9 states have call predecessors, (13), 8 states have call successors, (13) [2024-09-20 13:09:21,373 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-20 13:09:21,373 INFO L276 IsEmpty]: Start isEmpty. Operand 146 states and 180 transitions. [2024-09-20 13:09:21,374 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 56 [2024-09-20 13:09:21,374 INFO L208 NwaCegarLoop]: Found error trace [2024-09-20 13:09:21,375 INFO L216 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-09-20 13:09:21,380 INFO L540 MonitoredProcess]: [MP /storage/repos/certificate-witnesses-artifact/automizer/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (6)] Forceful destruction successful, exit code 0 [2024-09-20 13:09:21,575 WARN L456 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 /storage/repos/certificate-witnesses-artifact/automizer/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-09-20 13:09:21,576 INFO L399 AbstractCegarLoop]: === Iteration 6 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-09-20 13:09:21,576 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-20 13:09:21,576 INFO L85 PathProgramCache]: Analyzing trace with hash 986908330, now seen corresponding path program 1 times [2024-09-20 13:09:21,576 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-09-20 13:09:21,576 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [753733123] [2024-09-20 13:09:21,577 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-09-20 13:09:21,577 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-09-20 13:09:21,577 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/certificate-witnesses-artifact/automizer/mathsat [2024-09-20 13:09:21,578 INFO L229 MonitoredProcess]: Starting monitored process 7 with /storage/repos/certificate-witnesses-artifact/automizer/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-09-20 13:09:21,579 INFO L327 MonitoredProcess]: [MP /storage/repos/certificate-witnesses-artifact/automizer/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (7)] Waiting until timeout for monitored process [2024-09-20 13:09:21,640 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-20 13:09:21,642 INFO L262 TraceCheckSpWp]: Trace formula consists of 135 conjuncts, 24 conjuncts are in the unsatisfiable core [2024-09-20 13:09:21,645 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2024-09-20 13:09:22,095 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-09-20 13:09:22,095 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 42 treesize of output 22 [2024-09-20 13:09:22,259 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 6 proven. 4 refuted. 0 times theorem prover too weak. 14 trivial. 0 not checked. [2024-09-20 13:09:22,259 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2024-09-20 13:09:23,295 INFO L349 Elim1Store]: treesize reduction 5, result has 94.6 percent of original size [2024-09-20 13:09:23,295 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 40 treesize of output 95 [2024-09-20 13:09:24,356 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-09-20 13:09:24,356 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [753733123] [2024-09-20 13:09:24,356 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [753733123] provided 0 perfect and 1 imperfect interpolant sequences [2024-09-20 13:09:24,356 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [46666733] [2024-09-20 13:09:24,357 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-09-20 13:09:24,357 INFO L173 SolverBuilder]: Constructing external solver with command: cvc4 --incremental --print-success --lang smt [2024-09-20 13:09:24,357 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/certificate-witnesses-artifact/automizer/cvc4 [2024-09-20 13:09:24,358 INFO L229 MonitoredProcess]: Starting monitored process 8 with /storage/repos/certificate-witnesses-artifact/automizer/cvc4 --incremental --print-success --lang smt (exit command is (exit), workingDir is null) [2024-09-20 13:09:24,359 INFO L327 MonitoredProcess]: [MP /storage/repos/certificate-witnesses-artifact/automizer/cvc4 --incremental --print-success --lang smt (8)] Waiting until timeout for monitored process [2024-09-20 13:09:24,448 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-20 13:09:24,450 INFO L262 TraceCheckSpWp]: Trace formula consists of 135 conjuncts, 9 conjuncts are in the unsatisfiable core [2024-09-20 13:09:24,452 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2024-09-20 13:09:24,463 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 7 treesize of output 6 [2024-09-20 13:09:28,723 WARN L876 $PredicateComparison]: unable to prove that (exists ((v_main_~a~0.base_BEFORE_CALL_2 (_ BitVec 32))) (= ((as const (Array (_ BitVec 32) (_ BitVec 32))) (_ bv0 32)) (select |c_#memory_int#1| v_main_~a~0.base_BEFORE_CALL_2))) is different from true [2024-09-20 13:11:07,053 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 14 proven. 1 refuted. 0 times theorem prover too weak. 4 trivial. 5 not checked. [2024-09-20 13:11:07,053 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2024-09-20 13:11:37,667 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleCvc4 [46666733] provided 0 perfect and 1 imperfect interpolant sequences [2024-09-20 13:11:37,667 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-09-20 13:11:37,667 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 13] total 25 [2024-09-20 13:11:37,668 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [413063963] [2024-09-20 13:11:37,668 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-09-20 13:11:37,668 INFO L551 AbstractCegarLoop]: INTERPOLANT automaton has 25 states [2024-09-20 13:11:37,668 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-09-20 13:11:37,669 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 25 interpolants. [2024-09-20 13:11:37,669 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=86, Invalid=821, Unknown=27, NotChecked=58, Total=992 [2024-09-20 13:11:37,669 INFO L87 Difference]: Start difference. First operand 146 states and 180 transitions. Second operand has 25 states, 20 states have (on average 2.65) internal successors, (53), 21 states have internal predecessors, (53), 9 states have call successors, (17), 6 states have call predecessors, (17), 9 states have return successors, (15), 9 states have call predecessors, (15), 7 states have call successors, (15) [2024-09-20 13:12:15,279 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-09-20 13:12:19,305 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-09-20 13:12:23,317 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-09-20 13:12:27,328 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-09-20 13:12:31,361 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-09-20 13:12:35,379 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.02s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-09-20 13:12:39,407 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-09-20 13:12:43,422 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [0]