./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/nla-digbench-scaling/prodbin-ll_valuebound2.c --full-output --procedureinliner.inline.calls.to.implemented.procedures NEVER --traceabstraction.positions.where.we.compute.the.hoare.annotation All --traceabstraction.encode.modifies.clause.in.ensures.clause.of.contracts true --witnessprinter.yaml.format.version 2.1 --witnessprinter.generate.graphml.witnesses false --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version fb1cb0b9 Calling Ultimate with: /root/.sdkman/candidates/java/11.0.12-open/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/nla-digbench-scaling/prodbin-ll_valuebound2.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 d2bc2a3f53718ecf47344b6d9b2d76a5698712f748ff03cd831a90a334f72c9d --procedureinliner.inline.calls.to.implemented.procedures NEVER --traceabstraction.positions.where.we.compute.the.hoare.annotation All --traceabstraction.encode.modifies.clause.in.ensures.clause.of.contracts true --witnessprinter.yaml.format.version 2.1 --witnessprinter.generate.graphml.witnesses false --- Real Ultimate output --- This is Ultimate 0.2.4-tmp.dk.referee-eval-fb1cb0b-m [2024-09-25 11:18:58,336 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-09-25 11:18:58,403 INFO L114 SettingsManager]: Loading settings from /storage/repos/certificate-witnesses-artifact/automizer/config/svcomp-Reach-32bit-Automizer_Default.epf [2024-09-25 11:18:58,408 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-09-25 11:18:58,408 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-09-25 11:18:58,430 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-09-25 11:18:58,432 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-09-25 11:18:58,432 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-09-25 11:18:58,432 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-09-25 11:18:58,432 INFO L153 SettingsManager]: * Use memory slicer=true [2024-09-25 11:18:58,433 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-09-25 11:18:58,433 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-09-25 11:18:58,433 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-09-25 11:18:58,433 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-09-25 11:18:58,433 INFO L153 SettingsManager]: * Use SBE=true [2024-09-25 11:18:58,434 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-09-25 11:18:58,434 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-09-25 11:18:58,437 INFO L153 SettingsManager]: * sizeof long=4 [2024-09-25 11:18:58,437 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-09-25 11:18:58,437 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-09-25 11:18:58,438 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-09-25 11:18:58,438 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-09-25 11:18:58,438 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-09-25 11:18:58,438 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-09-25 11:18:58,439 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-09-25 11:18:58,439 INFO L153 SettingsManager]: * sizeof long double=12 [2024-09-25 11:18:58,440 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-09-25 11:18:58,440 INFO L153 SettingsManager]: * Use constant arrays=true [2024-09-25 11:18:58,440 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-09-25 11:18:58,441 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-09-25 11:18:58,441 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-09-25 11:18:58,441 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-09-25 11:18:58,442 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-09-25 11:18:58,443 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-09-25 11:18:58,443 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-09-25 11:18:58,443 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-09-25 11:18:58,443 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-09-25 11:18:58,443 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-09-25 11:18:58,444 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-09-25 11:18:58,444 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-09-25 11:18:58,444 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-09-25 11:18:58,445 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-09-25 11:18:58,445 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 -> d2bc2a3f53718ecf47344b6d9b2d76a5698712f748ff03cd831a90a334f72c9d 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.plugins.generator.traceabstraction: Encode 'modifies' clause in 'ensures' clause of contracts -> true 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-25 11:18:58,682 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-09-25 11:18:58,700 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-09-25 11:18:58,701 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-09-25 11:18:58,702 INFO L270 PluginConnector]: Initializing CDTParser... [2024-09-25 11:18:58,703 INFO L274 PluginConnector]: CDTParser initialized [2024-09-25 11:18:58,704 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/certificate-witnesses-artifact/automizer/../sv-benchmarks/c/nla-digbench-scaling/prodbin-ll_valuebound2.c [2024-09-25 11:18:59,892 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-09-25 11:19:00,063 INFO L384 CDTParser]: Found 1 translation units. [2024-09-25 11:19:00,064 INFO L180 CDTParser]: Scanning /storage/repos/certificate-witnesses-artifact/sv-benchmarks/c/nla-digbench-scaling/prodbin-ll_valuebound2.c [2024-09-25 11:19:00,069 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/certificate-witnesses-artifact/automizer/data/069e57fec/4b0425ac92454d909ea8b8af3b6bf132/FLAG66f7cf109 [2024-09-25 11:19:00,456 INFO L435 CDTParser]: Successfully deleted /storage/repos/certificate-witnesses-artifact/automizer/data/069e57fec/4b0425ac92454d909ea8b8af3b6bf132 [2024-09-25 11:19:00,458 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-09-25 11:19:00,459 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-09-25 11:19:00,459 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-09-25 11:19:00,460 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-09-25 11:19:00,463 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-09-25 11:19:00,464 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 25.09 11:19:00" (1/1) ... [2024-09-25 11:19:00,465 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@feddb08 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.09 11:19:00, skipping insertion in model container [2024-09-25 11:19:00,465 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 25.09 11:19:00" (1/1) ... [2024-09-25 11:19:00,478 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-09-25 11:19:00,592 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/nla-digbench-scaling/prodbin-ll_valuebound2.c[537,550] [2024-09-25 11:19:00,607 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-09-25 11:19:00,616 INFO L200 MainTranslator]: Completed pre-run [2024-09-25 11:19:00,624 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/nla-digbench-scaling/prodbin-ll_valuebound2.c[537,550] [2024-09-25 11:19:00,627 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-09-25 11:19:00,642 INFO L204 MainTranslator]: Completed translation [2024-09-25 11:19:00,642 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.09 11:19:00 WrapperNode [2024-09-25 11:19:00,642 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-09-25 11:19:00,643 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-09-25 11:19:00,644 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-09-25 11:19:00,644 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-09-25 11:19:00,649 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.09 11:19:00" (1/1) ... [2024-09-25 11:19:00,654 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.09 11:19:00" (1/1) ... [2024-09-25 11:19:00,659 INFO L138 Inliner]: procedures = 14, calls = 12, calls flagged for inlining = 0, calls inlined = 0, statements flattened = 0 [2024-09-25 11:19:00,659 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-09-25 11:19:00,660 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-09-25 11:19:00,660 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-09-25 11:19:00,660 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-09-25 11:19:00,667 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.09 11:19:00" (1/1) ... [2024-09-25 11:19:00,668 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.09 11:19:00" (1/1) ... [2024-09-25 11:19:00,672 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.09 11:19:00" (1/1) ... [2024-09-25 11:19:00,685 INFO L175 MemorySlicer]: Split 2 memory accesses to 1 slices as follows [2]. 100 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2]. The 0 writes are split as follows [0]. [2024-09-25 11:19:00,685 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.09 11:19:00" (1/1) ... [2024-09-25 11:19:00,685 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.09 11:19:00" (1/1) ... [2024-09-25 11:19:00,687 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.09 11:19:00" (1/1) ... [2024-09-25 11:19:00,689 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.09 11:19:00" (1/1) ... [2024-09-25 11:19:00,690 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.09 11:19:00" (1/1) ... [2024-09-25 11:19:00,691 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.09 11:19:00" (1/1) ... [2024-09-25 11:19:00,692 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-09-25 11:19:00,694 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-09-25 11:19:00,694 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-09-25 11:19:00,694 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-09-25 11:19:00,703 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.09 11:19:00" (1/1) ... [2024-09-25 11:19:00,713 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-09-25 11:19:00,741 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/certificate-witnesses-artifact/automizer/z3 [2024-09-25 11:19:00,761 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-25 11:19:00,768 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-25 11:19:00,801 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-09-25 11:19:00,802 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2024-09-25 11:19:00,802 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2024-09-25 11:19:00,802 INFO L130 BoogieDeclarations]: Found specification of procedure main [2024-09-25 11:19:00,802 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2024-09-25 11:19:00,802 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-09-25 11:19:00,802 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2024-09-25 11:19:00,804 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2024-09-25 11:19:00,804 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-09-25 11:19:00,804 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-09-25 11:19:00,804 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2024-09-25 11:19:00,804 INFO L138 BoogieDeclarations]: Found implementation of procedure __VERIFIER_assert [2024-09-25 11:19:00,854 INFO L241 CfgBuilder]: Building ICFG [2024-09-25 11:19:00,856 INFO L267 CfgBuilder]: Building CFG for each procedure with an implementation [2024-09-25 11:19:00,982 INFO L? ?]: Removed 5 outVars from TransFormulas that were not future-live. [2024-09-25 11:19:00,983 INFO L290 CfgBuilder]: Performing block encoding [2024-09-25 11:19:01,002 INFO L312 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-09-25 11:19:01,004 INFO L317 CfgBuilder]: Removed 1 assume(true) statements. [2024-09-25 11:19:01,004 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 25.09 11:19:01 BoogieIcfgContainer [2024-09-25 11:19:01,004 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-09-25 11:19:01,006 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-09-25 11:19:01,006 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-09-25 11:19:01,010 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-09-25 11:19:01,010 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 25.09 11:19:00" (1/3) ... [2024-09-25 11:19:01,010 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5786a75c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 25.09 11:19:01, skipping insertion in model container [2024-09-25 11:19:01,011 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.09 11:19:00" (2/3) ... [2024-09-25 11:19:01,011 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5786a75c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 25.09 11:19:01, skipping insertion in model container [2024-09-25 11:19:01,011 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 25.09 11:19:01" (3/3) ... [2024-09-25 11:19:01,012 INFO L112 eAbstractionObserver]: Analyzing ICFG prodbin-ll_valuebound2.c [2024-09-25 11:19:01,025 INFO L209 ceAbstractionStarter]: Automizer settings: Hoare:All NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-09-25 11:19:01,025 INFO L149 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-09-25 11:19:01,064 INFO L335 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-09-25 11:19:01,069 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;@7b231e03, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-09-25 11:19:01,070 INFO L337 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-09-25 11:19:01,073 INFO L276 IsEmpty]: Start isEmpty. Operand has 30 states, 17 states have (on average 1.411764705882353) internal successors, (24), 18 states have internal predecessors, (24), 7 states have call successors, (7), 4 states have call predecessors, (7), 4 states have return successors, (7), 7 states have call predecessors, (7), 7 states have call successors, (7) [2024-09-25 11:19:01,077 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2024-09-25 11:19:01,077 INFO L208 NwaCegarLoop]: Found error trace [2024-09-25 11:19:01,078 INFO L216 NwaCegarLoop]: trace histogram [3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-09-25 11:19:01,078 INFO L399 AbstractCegarLoop]: === Iteration 1 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-09-25 11:19:01,082 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-25 11:19:01,082 INFO L85 PathProgramCache]: Analyzing trace with hash -2062108722, now seen corresponding path program 1 times [2024-09-25 11:19:01,088 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-09-25 11:19:01,089 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2060284227] [2024-09-25 11:19:01,089 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-09-25 11:19:01,089 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-09-25 11:19:01,162 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-25 11:19:01,192 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2024-09-25 11:19:01,195 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-25 11:19:01,201 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-09-25 11:19:01,202 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-25 11:19:01,209 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-09-25 11:19:01,210 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-25 11:19:01,214 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2024-09-25 11:19:01,215 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-25 11:19:01,218 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2024-09-25 11:19:01,218 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-09-25 11:19:01,218 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2060284227] [2024-09-25 11:19:01,219 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2060284227] provided 1 perfect and 0 imperfect interpolant sequences [2024-09-25 11:19:01,219 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-09-25 11:19:01,219 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-09-25 11:19:01,220 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2060377202] [2024-09-25 11:19:01,221 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-09-25 11:19:01,223 INFO L551 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-09-25 11:19:01,223 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-09-25 11:19:01,242 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-09-25 11:19:01,242 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-09-25 11:19:01,244 INFO L87 Difference]: Start difference. First operand has 30 states, 17 states have (on average 1.411764705882353) internal successors, (24), 18 states have internal predecessors, (24), 7 states have call successors, (7), 4 states have call predecessors, (7), 4 states have return successors, (7), 7 states have call predecessors, (7), 7 states have call successors, (7) Second operand has 2 states, 2 states have (on average 5.5) internal successors, (11), 2 states have internal predecessors, (11), 2 states have call successors, (6), 2 states have call predecessors, (6), 2 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) [2024-09-25 11:19:01,266 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-09-25 11:19:01,266 INFO L93 Difference]: Finished difference Result 54 states and 74 transitions. [2024-09-25 11:19:01,268 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-09-25 11:19:01,269 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 5.5) internal successors, (11), 2 states have internal predecessors, (11), 2 states have call successors, (6), 2 states have call predecessors, (6), 2 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) Word has length 27 [2024-09-25 11:19:01,270 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-09-25 11:19:01,274 INFO L225 Difference]: With dead ends: 54 [2024-09-25 11:19:01,274 INFO L226 Difference]: Without dead ends: 26 [2024-09-25 11:19:01,276 INFO L433 NwaCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 13 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-25 11:19:01,278 INFO L434 NwaCegarLoop]: 32 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 2 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 32 SdHoareTripleChecker+Invalid, 2 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 2 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-09-25 11:19:01,279 INFO L435 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 32 Invalid, 2 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 2 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-09-25 11:19:01,296 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 26 states. [2024-09-25 11:19:01,312 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 26 to 26. [2024-09-25 11:19:01,313 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 26 states, 15 states have (on average 1.2) internal successors, (18), 16 states have internal predecessors, (18), 7 states have call successors, (7), 4 states have call predecessors, (7), 3 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) [2024-09-25 11:19:01,313 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 26 states to 26 states and 30 transitions. [2024-09-25 11:19:01,316 INFO L78 Accepts]: Start accepts. Automaton has 26 states and 30 transitions. Word has length 27 [2024-09-25 11:19:01,317 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-09-25 11:19:01,317 INFO L474 AbstractCegarLoop]: Abstraction has 26 states and 30 transitions. [2024-09-25 11:19:01,317 INFO L475 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 5.5) internal successors, (11), 2 states have internal predecessors, (11), 2 states have call successors, (6), 2 states have call predecessors, (6), 2 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) [2024-09-25 11:19:01,317 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-25 11:19:01,318 INFO L276 IsEmpty]: Start isEmpty. Operand 26 states and 30 transitions. [2024-09-25 11:19:01,319 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2024-09-25 11:19:01,320 INFO L208 NwaCegarLoop]: Found error trace [2024-09-25 11:19:01,320 INFO L216 NwaCegarLoop]: trace histogram [3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-09-25 11:19:01,320 WARN L456 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-09-25 11:19:01,320 INFO L399 AbstractCegarLoop]: === Iteration 2 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-09-25 11:19:01,321 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-25 11:19:01,321 INFO L85 PathProgramCache]: Analyzing trace with hash 1085938704, now seen corresponding path program 1 times [2024-09-25 11:19:01,321 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-09-25 11:19:01,321 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [142674137] [2024-09-25 11:19:01,321 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-09-25 11:19:01,321 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-09-25 11:19:01,346 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unknown [2024-09-25 11:19:01,352 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [2041590817] [2024-09-25 11:19:01,352 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-09-25 11:19:01,352 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-09-25 11:19:01,352 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/certificate-witnesses-artifact/automizer/z3 [2024-09-25 11:19:01,360 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-25 11:19:01,363 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-25 11:19:01,412 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-25 11:19:01,417 INFO L262 TraceCheckSpWp]: Trace formula consists of 75 conjuncts, 19 conjuncts are in the unsatisfiable core [2024-09-25 11:19:01,422 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2024-09-25 11:19:01,639 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 3 proven. 3 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2024-09-25 11:19:01,639 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2024-09-25 11:19:01,722 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2024-09-25 11:19:01,722 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-09-25 11:19:01,722 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [142674137] [2024-09-25 11:19:01,723 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2024-09-25 11:19:01,723 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2041590817] [2024-09-25 11:19:01,723 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2041590817] provided 1 perfect and 1 imperfect interpolant sequences [2024-09-25 11:19:01,723 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-09-25 11:19:01,723 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [9] total 10 [2024-09-25 11:19:01,724 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [757600146] [2024-09-25 11:19:01,724 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-09-25 11:19:01,724 INFO L551 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-09-25 11:19:01,725 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-09-25 11:19:01,725 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-09-25 11:19:01,727 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=69, Unknown=0, NotChecked=0, Total=90 [2024-09-25 11:19:01,727 INFO L87 Difference]: Start difference. First operand 26 states and 30 transitions. Second operand has 5 states, 5 states have (on average 2.2) internal successors, (11), 4 states have internal predecessors, (11), 2 states have call successors, (6), 2 states have call predecessors, (6), 1 states have return successors, (4), 1 states have call predecessors, (4), 1 states have call successors, (4) [2024-09-25 11:19:01,813 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-09-25 11:19:01,814 INFO L93 Difference]: Finished difference Result 37 states and 43 transitions. [2024-09-25 11:19:01,822 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-09-25 11:19:01,822 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 2.2) internal successors, (11), 4 states have internal predecessors, (11), 2 states have call successors, (6), 2 states have call predecessors, (6), 1 states have return successors, (4), 1 states have call predecessors, (4), 1 states have call successors, (4) Word has length 27 [2024-09-25 11:19:01,823 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-09-25 11:19:01,823 INFO L225 Difference]: With dead ends: 37 [2024-09-25 11:19:01,823 INFO L226 Difference]: Without dead ends: 35 [2024-09-25 11:19:01,824 INFO L433 NwaCegarLoop]: 0 DeclaredPredicates, 54 GetRequests, 43 SyntacticMatches, 2 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 12 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=25, Invalid=85, Unknown=0, NotChecked=0, Total=110 [2024-09-25 11:19:01,824 INFO L434 NwaCegarLoop]: 21 mSDtfsCounter, 5 mSDsluCounter, 59 mSDsCounter, 0 mSdLazyCounter, 39 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 6 SdHoareTripleChecker+Valid, 80 SdHoareTripleChecker+Invalid, 40 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 39 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-09-25 11:19:01,825 INFO L435 NwaCegarLoop]: SdHoareTripleChecker [6 Valid, 80 Invalid, 40 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 39 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-09-25 11:19:01,825 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 35 states. [2024-09-25 11:19:01,835 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 35 to 32. [2024-09-25 11:19:01,835 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 32 states, 19 states have (on average 1.1578947368421053) internal successors, (22), 21 states have internal predecessors, (22), 8 states have call successors, (8), 5 states have call predecessors, (8), 4 states have return successors, (6), 5 states have call predecessors, (6), 6 states have call successors, (6) [2024-09-25 11:19:01,836 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 32 states to 32 states and 36 transitions. [2024-09-25 11:19:01,837 INFO L78 Accepts]: Start accepts. Automaton has 32 states and 36 transitions. Word has length 27 [2024-09-25 11:19:01,838 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-09-25 11:19:01,839 INFO L474 AbstractCegarLoop]: Abstraction has 32 states and 36 transitions. [2024-09-25 11:19:01,839 INFO L475 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 2.2) internal successors, (11), 4 states have internal predecessors, (11), 2 states have call successors, (6), 2 states have call predecessors, (6), 1 states have return successors, (4), 1 states have call predecessors, (4), 1 states have call successors, (4) [2024-09-25 11:19:01,840 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-25 11:19:01,840 INFO L276 IsEmpty]: Start isEmpty. Operand 32 states and 36 transitions. [2024-09-25 11:19:01,841 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 34 [2024-09-25 11:19:01,842 INFO L208 NwaCegarLoop]: Found error trace [2024-09-25 11:19:01,842 INFO L216 NwaCegarLoop]: trace histogram [3, 3, 3, 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-25 11:19:01,855 INFO L552 MonitoredProcess]: [MP /storage/repos/certificate-witnesses-artifact/automizer/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2024-09-25 11:19:02,043 WARN L456 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1,2 /storage/repos/certificate-witnesses-artifact/automizer/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-09-25 11:19:02,043 INFO L399 AbstractCegarLoop]: === Iteration 3 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-09-25 11:19:02,044 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-25 11:19:02,044 INFO L85 PathProgramCache]: Analyzing trace with hash 1368497365, now seen corresponding path program 1 times [2024-09-25 11:19:02,044 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-09-25 11:19:02,044 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2137408562] [2024-09-25 11:19:02,044 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-09-25 11:19:02,045 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-09-25 11:19:02,071 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-25 11:19:02,175 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2024-09-25 11:19:02,177 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-25 11:19:02,180 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-09-25 11:19:02,183 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-25 11:19:02,185 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-09-25 11:19:02,188 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-25 11:19:02,190 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2024-09-25 11:19:02,193 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-25 11:19:02,218 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2024-09-25 11:19:02,220 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-25 11:19:02,222 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 8 proven. 0 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2024-09-25 11:19:02,223 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-09-25 11:19:02,223 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2137408562] [2024-09-25 11:19:02,223 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2137408562] provided 1 perfect and 0 imperfect interpolant sequences [2024-09-25 11:19:02,223 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-09-25 11:19:02,223 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-09-25 11:19:02,223 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1700806468] [2024-09-25 11:19:02,224 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-09-25 11:19:02,224 INFO L551 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-09-25 11:19:02,224 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-09-25 11:19:02,224 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-09-25 11:19:02,225 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2024-09-25 11:19:02,225 INFO L87 Difference]: Start difference. First operand 32 states and 36 transitions. Second operand has 6 states, 6 states have (on average 3.0) internal successors, (18), 5 states have internal predecessors, (18), 3 states have call successors, (7), 2 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-25 11:19:02,275 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-09-25 11:19:02,276 INFO L93 Difference]: Finished difference Result 42 states and 47 transitions. [2024-09-25 11:19:02,276 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-09-25 11:19:02,276 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 3.0) internal successors, (18), 5 states have internal predecessors, (18), 3 states have call successors, (7), 2 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 33 [2024-09-25 11:19:02,277 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-09-25 11:19:02,277 INFO L225 Difference]: With dead ends: 42 [2024-09-25 11:19:02,277 INFO L226 Difference]: Without dead ends: 35 [2024-09-25 11:19:02,277 INFO L433 NwaCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 11 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2024-09-25 11:19:02,278 INFO L434 NwaCegarLoop]: 21 mSDtfsCounter, 13 mSDsluCounter, 66 mSDsCounter, 0 mSdLazyCounter, 54 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 14 SdHoareTripleChecker+Valid, 87 SdHoareTripleChecker+Invalid, 55 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 54 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-09-25 11:19:02,278 INFO L435 NwaCegarLoop]: SdHoareTripleChecker [14 Valid, 87 Invalid, 55 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 54 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-09-25 11:19:02,279 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 35 states. [2024-09-25 11:19:02,287 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 35 to 33. [2024-09-25 11:19:02,290 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 33 states, 20 states have (on average 1.15) internal successors, (23), 21 states have internal predecessors, (23), 8 states have call successors, (8), 5 states have call predecessors, (8), 4 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2024-09-25 11:19:02,291 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 33 states to 33 states and 37 transitions. [2024-09-25 11:19:02,291 INFO L78 Accepts]: Start accepts. Automaton has 33 states and 37 transitions. Word has length 33 [2024-09-25 11:19:02,291 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-09-25 11:19:02,291 INFO L474 AbstractCegarLoop]: Abstraction has 33 states and 37 transitions. [2024-09-25 11:19:02,291 INFO L475 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 3.0) internal successors, (18), 5 states have internal predecessors, (18), 3 states have call successors, (7), 2 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-25 11:19:02,292 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-25 11:19:02,293 INFO L276 IsEmpty]: Start isEmpty. Operand 33 states and 37 transitions. [2024-09-25 11:19:02,294 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2024-09-25 11:19:02,294 INFO L208 NwaCegarLoop]: Found error trace [2024-09-25 11:19:02,294 INFO L216 NwaCegarLoop]: trace histogram [3, 3, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-09-25 11:19:02,294 WARN L456 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-09-25 11:19:02,294 INFO L399 AbstractCegarLoop]: === Iteration 4 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-09-25 11:19:02,295 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-25 11:19:02,295 INFO L85 PathProgramCache]: Analyzing trace with hash -65395240, now seen corresponding path program 1 times [2024-09-25 11:19:02,295 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-09-25 11:19:02,295 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1113875460] [2024-09-25 11:19:02,295 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-09-25 11:19:02,295 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-09-25 11:19:02,323 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unknown [2024-09-25 11:19:02,326 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1954173000] [2024-09-25 11:19:02,328 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-09-25 11:19:02,328 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-09-25 11:19:02,328 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/certificate-witnesses-artifact/automizer/z3 [2024-09-25 11:19:02,329 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-25 11:19:02,331 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-25 11:19:02,368 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-25 11:19:02,369 INFO L262 TraceCheckSpWp]: Trace formula consists of 96 conjuncts, 19 conjuncts are in the unsatisfiable core [2024-09-25 11:19:02,370 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2024-09-25 11:19:02,594 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-25 11:19:02,594 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2024-09-25 11:19:06,381 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2024-09-25 11:19:06,381 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-09-25 11:19:06,381 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1113875460] [2024-09-25 11:19:06,381 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2024-09-25 11:19:06,381 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1954173000] [2024-09-25 11:19:06,382 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1954173000] provided 1 perfect and 1 imperfect interpolant sequences [2024-09-25 11:19:06,382 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-09-25 11:19:06,382 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [8] total 11 [2024-09-25 11:19:06,382 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [661328049] [2024-09-25 11:19:06,382 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-09-25 11:19:06,382 INFO L551 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-09-25 11:19:06,383 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-09-25 11:19:06,383 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-09-25 11:19:06,383 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=80, Unknown=0, NotChecked=0, Total=110 [2024-09-25 11:19:06,383 INFO L87 Difference]: Start difference. First operand 33 states and 37 transitions. Second operand has 7 states, 7 states have (on average 2.5714285714285716) internal successors, (18), 6 states have internal predecessors, (18), 3 states have call successors, (7), 2 states have call predecessors, (7), 1 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2024-09-25 11:19:06,542 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-09-25 11:19:06,542 INFO L93 Difference]: Finished difference Result 45 states and 51 transitions. [2024-09-25 11:19:06,542 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-09-25 11:19:06,543 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 2.5714285714285716) internal successors, (18), 6 states have internal predecessors, (18), 3 states have call successors, (7), 2 states have call predecessors, (7), 1 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) Word has length 36 [2024-09-25 11:19:06,543 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-09-25 11:19:06,543 INFO L225 Difference]: With dead ends: 45 [2024-09-25 11:19:06,544 INFO L226 Difference]: Without dead ends: 43 [2024-09-25 11:19:06,544 INFO L433 NwaCegarLoop]: 0 DeclaredPredicates, 73 GetRequests, 60 SyntacticMatches, 2 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 15 ImplicationChecksByTransitivity, 3.5s TimeCoverageRelationStatistics Valid=40, Invalid=116, Unknown=0, NotChecked=0, Total=156 [2024-09-25 11:19:06,545 INFO L434 NwaCegarLoop]: 21 mSDtfsCounter, 5 mSDsluCounter, 96 mSDsCounter, 0 mSdLazyCounter, 59 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 6 SdHoareTripleChecker+Valid, 117 SdHoareTripleChecker+Invalid, 63 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 59 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-09-25 11:19:06,545 INFO L435 NwaCegarLoop]: SdHoareTripleChecker [6 Valid, 117 Invalid, 63 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 59 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-09-25 11:19:06,546 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 43 states. [2024-09-25 11:19:06,551 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 43 to 42. [2024-09-25 11:19:06,551 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 42 states, 27 states have (on average 1.1851851851851851) internal successors, (32), 28 states have internal predecessors, (32), 9 states have call successors, (9), 6 states have call predecessors, (9), 5 states have return successors, (7), 7 states have call predecessors, (7), 7 states have call successors, (7) [2024-09-25 11:19:06,551 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 42 states to 42 states and 48 transitions. [2024-09-25 11:19:06,552 INFO L78 Accepts]: Start accepts. Automaton has 42 states and 48 transitions. Word has length 36 [2024-09-25 11:19:06,552 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-09-25 11:19:06,552 INFO L474 AbstractCegarLoop]: Abstraction has 42 states and 48 transitions. [2024-09-25 11:19:06,552 INFO L475 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 2.5714285714285716) internal successors, (18), 6 states have internal predecessors, (18), 3 states have call successors, (7), 2 states have call predecessors, (7), 1 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2024-09-25 11:19:06,552 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-25 11:19:06,553 INFO L276 IsEmpty]: Start isEmpty. Operand 42 states and 48 transitions. [2024-09-25 11:19:06,553 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2024-09-25 11:19:06,553 INFO L208 NwaCegarLoop]: Found error trace [2024-09-25 11:19:06,553 INFO L216 NwaCegarLoop]: trace histogram [3, 3, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-09-25 11:19:06,565 INFO L540 MonitoredProcess]: [MP /storage/repos/certificate-witnesses-artifact/automizer/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2024-09-25 11:19:06,757 WARN L456 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3,3 /storage/repos/certificate-witnesses-artifact/automizer/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-09-25 11:19:06,758 INFO L399 AbstractCegarLoop]: === Iteration 5 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-09-25 11:19:06,759 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-25 11:19:06,759 INFO L85 PathProgramCache]: Analyzing trace with hash 1709612122, now seen corresponding path program 1 times [2024-09-25 11:19:06,759 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-09-25 11:19:06,759 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1578048204] [2024-09-25 11:19:06,759 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-09-25 11:19:06,759 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-09-25 11:19:06,778 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unknown [2024-09-25 11:19:06,779 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1399407115] [2024-09-25 11:19:06,779 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-09-25 11:19:06,779 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-09-25 11:19:06,779 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/certificate-witnesses-artifact/automizer/z3 [2024-09-25 11:19:06,781 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-25 11:19:06,782 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-25 11:19:06,815 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-25 11:19:06,816 INFO L262 TraceCheckSpWp]: Trace formula consists of 91 conjuncts, 24 conjuncts are in the unsatisfiable core [2024-09-25 11:19:06,817 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2024-09-25 11:19:06,994 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 7 proven. 3 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2024-09-25 11:19:06,994 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2024-09-25 11:19:07,401 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 7 proven. 3 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2024-09-25 11:19:07,401 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-09-25 11:19:07,401 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1578048204] [2024-09-25 11:19:07,401 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2024-09-25 11:19:07,402 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1399407115] [2024-09-25 11:19:07,402 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1399407115] provided 0 perfect and 2 imperfect interpolant sequences [2024-09-25 11:19:07,402 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-09-25 11:19:07,402 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 13] total 19 [2024-09-25 11:19:07,402 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1039540020] [2024-09-25 11:19:07,402 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-09-25 11:19:07,402 INFO L551 AbstractCegarLoop]: INTERPOLANT automaton has 19 states [2024-09-25 11:19:07,403 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-09-25 11:19:07,403 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2024-09-25 11:19:07,403 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=62, Invalid=280, Unknown=0, NotChecked=0, Total=342 [2024-09-25 11:19:07,404 INFO L87 Difference]: Start difference. First operand 42 states and 48 transitions. Second operand has 19 states, 19 states have (on average 1.631578947368421) internal successors, (31), 16 states have internal predecessors, (31), 5 states have call successors, (9), 2 states have call predecessors, (9), 3 states have return successors, (7), 5 states have call predecessors, (7), 3 states have call successors, (7) [2024-09-25 11:19:07,789 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-09-25 11:19:07,789 INFO L93 Difference]: Finished difference Result 67 states and 80 transitions. [2024-09-25 11:19:07,789 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2024-09-25 11:19:07,790 INFO L78 Accepts]: Start accepts. Automaton has has 19 states, 19 states have (on average 1.631578947368421) internal successors, (31), 16 states have internal predecessors, (31), 5 states have call successors, (9), 2 states have call predecessors, (9), 3 states have return successors, (7), 5 states have call predecessors, (7), 3 states have call successors, (7) Word has length 36 [2024-09-25 11:19:07,790 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-09-25 11:19:07,792 INFO L225 Difference]: With dead ends: 67 [2024-09-25 11:19:07,792 INFO L226 Difference]: Without dead ends: 60 [2024-09-25 11:19:07,792 INFO L433 NwaCegarLoop]: 0 DeclaredPredicates, 77 GetRequests, 52 SyntacticMatches, 2 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 93 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=122, Invalid=478, Unknown=0, NotChecked=0, Total=600 [2024-09-25 11:19:07,793 INFO L434 NwaCegarLoop]: 17 mSDtfsCounter, 18 mSDsluCounter, 129 mSDsCounter, 0 mSdLazyCounter, 226 mSolverCounterSat, 16 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 20 SdHoareTripleChecker+Valid, 146 SdHoareTripleChecker+Invalid, 242 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 16 IncrementalHoareTripleChecker+Valid, 226 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-09-25 11:19:07,793 INFO L435 NwaCegarLoop]: SdHoareTripleChecker [20 Valid, 146 Invalid, 242 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [16 Valid, 226 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-09-25 11:19:07,794 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 60 states. [2024-09-25 11:19:07,804 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 60 to 60. [2024-09-25 11:19:07,804 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 60 states, 41 states have (on average 1.2195121951219512) internal successors, (50), 43 states have internal predecessors, (50), 12 states have call successors, (12), 7 states have call predecessors, (12), 6 states have return successors, (10), 9 states have call predecessors, (10), 10 states have call successors, (10) [2024-09-25 11:19:07,805 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 60 states to 60 states and 72 transitions. [2024-09-25 11:19:07,805 INFO L78 Accepts]: Start accepts. Automaton has 60 states and 72 transitions. Word has length 36 [2024-09-25 11:19:07,805 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-09-25 11:19:07,805 INFO L474 AbstractCegarLoop]: Abstraction has 60 states and 72 transitions. [2024-09-25 11:19:07,806 INFO L475 AbstractCegarLoop]: INTERPOLANT automaton has has 19 states, 19 states have (on average 1.631578947368421) internal successors, (31), 16 states have internal predecessors, (31), 5 states have call successors, (9), 2 states have call predecessors, (9), 3 states have return successors, (7), 5 states have call predecessors, (7), 3 states have call successors, (7) [2024-09-25 11:19:07,806 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-25 11:19:07,806 INFO L276 IsEmpty]: Start isEmpty. Operand 60 states and 72 transitions. [2024-09-25 11:19:07,807 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 43 [2024-09-25 11:19:07,807 INFO L208 NwaCegarLoop]: Found error trace [2024-09-25 11:19:07,807 INFO L216 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-09-25 11:19:07,820 INFO L540 MonitoredProcess]: [MP /storage/repos/certificate-witnesses-artifact/automizer/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Forceful destruction successful, exit code 0 [2024-09-25 11:19:08,011 WARN L456 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4,4 /storage/repos/certificate-witnesses-artifact/automizer/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-09-25 11:19:08,012 INFO L399 AbstractCegarLoop]: === Iteration 6 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-09-25 11:19:08,012 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-25 11:19:08,012 INFO L85 PathProgramCache]: Analyzing trace with hash 1894068381, now seen corresponding path program 1 times [2024-09-25 11:19:08,012 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-09-25 11:19:08,012 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [602260889] [2024-09-25 11:19:08,012 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-09-25 11:19:08,012 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-09-25 11:19:08,030 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unknown [2024-09-25 11:19:08,032 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [571182328] [2024-09-25 11:19:08,032 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-09-25 11:19:08,033 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-09-25 11:19:08,033 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/certificate-witnesses-artifact/automizer/z3 [2024-09-25 11:19:08,034 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/certificate-witnesses-artifact/automizer/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-09-25 11:19:08,036 INFO L327 MonitoredProcess]: [MP /storage/repos/certificate-witnesses-artifact/automizer/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2024-09-25 11:19:08,070 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-25 11:19:08,071 INFO L262 TraceCheckSpWp]: Trace formula consists of 107 conjuncts, 10 conjuncts are in the unsatisfiable core [2024-09-25 11:19:08,072 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2024-09-25 11:19:08,114 INFO L134 CoverageAnalysis]: Checked inductivity of 23 backedges. 7 proven. 1 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2024-09-25 11:19:08,114 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2024-09-25 11:19:08,192 INFO L134 CoverageAnalysis]: Checked inductivity of 23 backedges. 7 proven. 1 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2024-09-25 11:19:08,192 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-09-25 11:19:08,192 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [602260889] [2024-09-25 11:19:08,192 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2024-09-25 11:19:08,192 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [571182328] [2024-09-25 11:19:08,192 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [571182328] provided 0 perfect and 2 imperfect interpolant sequences [2024-09-25 11:19:08,192 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-09-25 11:19:08,192 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8] total 10 [2024-09-25 11:19:08,193 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [247691794] [2024-09-25 11:19:08,193 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-09-25 11:19:08,193 INFO L551 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-09-25 11:19:08,193 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-09-25 11:19:08,193 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-09-25 11:19:08,193 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=66, Unknown=0, NotChecked=0, Total=90 [2024-09-25 11:19:08,194 INFO L87 Difference]: Start difference. First operand 60 states and 72 transitions. Second operand has 10 states, 9 states have (on average 2.6666666666666665) internal successors, (24), 7 states have internal predecessors, (24), 2 states have call successors, (7), 2 states have call predecessors, (7), 2 states have return successors, (7), 3 states have call predecessors, (7), 1 states have call successors, (7) [2024-09-25 11:19:08,269 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-09-25 11:19:08,269 INFO L93 Difference]: Finished difference Result 67 states and 78 transitions. [2024-09-25 11:19:08,269 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-09-25 11:19:08,270 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 9 states have (on average 2.6666666666666665) internal successors, (24), 7 states have internal predecessors, (24), 2 states have call successors, (7), 2 states have call predecessors, (7), 2 states have return successors, (7), 3 states have call predecessors, (7), 1 states have call successors, (7) Word has length 42 [2024-09-25 11:19:08,270 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-09-25 11:19:08,270 INFO L225 Difference]: With dead ends: 67 [2024-09-25 11:19:08,270 INFO L226 Difference]: Without dead ends: 60 [2024-09-25 11:19:08,271 INFO L433 NwaCegarLoop]: 0 DeclaredPredicates, 84 GetRequests, 73 SyntacticMatches, 2 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 14 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=31, Invalid=79, Unknown=0, NotChecked=0, Total=110 [2024-09-25 11:19:08,271 INFO L434 NwaCegarLoop]: 23 mSDtfsCounter, 6 mSDsluCounter, 119 mSDsCounter, 0 mSdLazyCounter, 79 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 6 SdHoareTripleChecker+Valid, 142 SdHoareTripleChecker+Invalid, 80 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 79 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-09-25 11:19:08,271 INFO L435 NwaCegarLoop]: SdHoareTripleChecker [6 Valid, 142 Invalid, 80 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 79 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-09-25 11:19:08,272 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 60 states. [2024-09-25 11:19:08,283 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 60 to 59. [2024-09-25 11:19:08,283 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 59 states, 41 states have (on average 1.146341463414634) internal successors, (47), 42 states have internal predecessors, (47), 11 states have call successors, (11), 7 states have call predecessors, (11), 6 states have return successors, (10), 9 states have call predecessors, (10), 10 states have call successors, (10) [2024-09-25 11:19:08,284 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 59 states to 59 states and 68 transitions. [2024-09-25 11:19:08,284 INFO L78 Accepts]: Start accepts. Automaton has 59 states and 68 transitions. Word has length 42 [2024-09-25 11:19:08,284 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-09-25 11:19:08,284 INFO L474 AbstractCegarLoop]: Abstraction has 59 states and 68 transitions. [2024-09-25 11:19:08,285 INFO L475 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 9 states have (on average 2.6666666666666665) internal successors, (24), 7 states have internal predecessors, (24), 2 states have call successors, (7), 2 states have call predecessors, (7), 2 states have return successors, (7), 3 states have call predecessors, (7), 1 states have call successors, (7) [2024-09-25 11:19:08,285 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-25 11:19:08,285 INFO L276 IsEmpty]: Start isEmpty. Operand 59 states and 68 transitions. [2024-09-25 11:19:08,286 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 46 [2024-09-25 11:19:08,286 INFO L208 NwaCegarLoop]: Found error trace [2024-09-25 11:19:08,286 INFO L216 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-09-25 11:19:08,298 INFO L552 MonitoredProcess]: [MP /storage/repos/certificate-witnesses-artifact/automizer/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Ended with exit code 0 [2024-09-25 11:19:08,486 WARN L456 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5,5 /storage/repos/certificate-witnesses-artifact/automizer/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-09-25 11:19:08,487 INFO L399 AbstractCegarLoop]: === Iteration 7 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-09-25 11:19:08,487 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-25 11:19:08,487 INFO L85 PathProgramCache]: Analyzing trace with hash -455011438, now seen corresponding path program 1 times [2024-09-25 11:19:08,487 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-09-25 11:19:08,487 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [768064006] [2024-09-25 11:19:08,487 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-09-25 11:19:08,487 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-09-25 11:19:08,506 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-25 11:19:08,796 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2024-09-25 11:19:08,797 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-25 11:19:08,802 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-09-25 11:19:08,802 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-25 11:19:08,803 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-09-25 11:19:08,804 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-25 11:19:08,821 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2024-09-25 11:19:08,823 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-25 11:19:08,829 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2024-09-25 11:19:08,830 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-25 11:19:08,832 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-09-25 11:19:08,833 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-25 11:19:08,835 INFO L134 CoverageAnalysis]: Checked inductivity of 29 backedges. 16 proven. 3 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2024-09-25 11:19:08,835 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-09-25 11:19:08,835 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [768064006] [2024-09-25 11:19:08,835 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [768064006] provided 0 perfect and 1 imperfect interpolant sequences [2024-09-25 11:19:08,835 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2120688073] [2024-09-25 11:19:08,835 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-09-25 11:19:08,835 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-09-25 11:19:08,835 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/certificate-witnesses-artifact/automizer/z3 [2024-09-25 11:19:08,837 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/certificate-witnesses-artifact/automizer/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-09-25 11:19:08,843 INFO L327 MonitoredProcess]: [MP /storage/repos/certificate-witnesses-artifact/automizer/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2024-09-25 11:19:08,876 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-25 11:19:08,877 INFO L262 TraceCheckSpWp]: Trace formula consists of 112 conjuncts, 13 conjuncts are in the unsatisfiable core [2024-09-25 11:19:08,878 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2024-09-25 11:19:08,932 INFO L134 CoverageAnalysis]: Checked inductivity of 29 backedges. 16 proven. 3 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2024-09-25 11:19:08,933 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2024-09-25 11:19:09,031 INFO L134 CoverageAnalysis]: Checked inductivity of 29 backedges. 16 proven. 3 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2024-09-25 11:19:09,031 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2120688073] provided 0 perfect and 2 imperfect interpolant sequences [2024-09-25 11:19:09,031 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-09-25 11:19:09,031 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8, 8] total 12 [2024-09-25 11:19:09,031 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1337008260] [2024-09-25 11:19:09,031 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-09-25 11:19:09,032 INFO L551 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2024-09-25 11:19:09,032 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-09-25 11:19:09,032 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2024-09-25 11:19:09,033 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=32, Invalid=100, Unknown=0, NotChecked=0, Total=132 [2024-09-25 11:19:09,033 INFO L87 Difference]: Start difference. First operand 59 states and 68 transitions. Second operand has 12 states, 12 states have (on average 2.6666666666666665) internal successors, (32), 10 states have internal predecessors, (32), 7 states have call successors, (10), 2 states have call predecessors, (10), 2 states have return successors, (9), 6 states have call predecessors, (9), 6 states have call successors, (9) [2024-09-25 11:19:09,121 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-09-25 11:19:09,121 INFO L93 Difference]: Finished difference Result 89 states and 100 transitions. [2024-09-25 11:19:09,122 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-09-25 11:19:09,122 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 12 states have (on average 2.6666666666666665) internal successors, (32), 10 states have internal predecessors, (32), 7 states have call successors, (10), 2 states have call predecessors, (10), 2 states have return successors, (9), 6 states have call predecessors, (9), 6 states have call successors, (9) Word has length 45 [2024-09-25 11:19:09,122 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-09-25 11:19:09,123 INFO L225 Difference]: With dead ends: 89 [2024-09-25 11:19:09,123 INFO L226 Difference]: Without dead ends: 50 [2024-09-25 11:19:09,123 INFO L433 NwaCegarLoop]: 0 DeclaredPredicates, 112 GetRequests, 95 SyntacticMatches, 4 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 33 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=55, Invalid=155, Unknown=0, NotChecked=0, Total=210 [2024-09-25 11:19:09,124 INFO L434 NwaCegarLoop]: 21 mSDtfsCounter, 9 mSDsluCounter, 115 mSDsCounter, 0 mSdLazyCounter, 90 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 9 SdHoareTripleChecker+Valid, 136 SdHoareTripleChecker+Invalid, 92 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 90 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-09-25 11:19:09,124 INFO L435 NwaCegarLoop]: SdHoareTripleChecker [9 Valid, 136 Invalid, 92 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 90 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-09-25 11:19:09,124 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 50 states. [2024-09-25 11:19:09,135 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 50 to 50. [2024-09-25 11:19:09,135 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 50 states, 34 states have (on average 1.0294117647058822) internal successors, (35), 35 states have internal predecessors, (35), 10 states have call successors, (10), 6 states have call predecessors, (10), 5 states have return successors, (9), 8 states have call predecessors, (9), 9 states have call successors, (9) [2024-09-25 11:19:09,136 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 50 states to 50 states and 54 transitions. [2024-09-25 11:19:09,136 INFO L78 Accepts]: Start accepts. Automaton has 50 states and 54 transitions. Word has length 45 [2024-09-25 11:19:09,136 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-09-25 11:19:09,136 INFO L474 AbstractCegarLoop]: Abstraction has 50 states and 54 transitions. [2024-09-25 11:19:09,137 INFO L475 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 2.6666666666666665) internal successors, (32), 10 states have internal predecessors, (32), 7 states have call successors, (10), 2 states have call predecessors, (10), 2 states have return successors, (9), 6 states have call predecessors, (9), 6 states have call successors, (9) [2024-09-25 11:19:09,137 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-25 11:19:09,137 INFO L276 IsEmpty]: Start isEmpty. Operand 50 states and 54 transitions. [2024-09-25 11:19:09,137 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 64 [2024-09-25 11:19:09,137 INFO L208 NwaCegarLoop]: Found error trace [2024-09-25 11:19:09,138 INFO L216 NwaCegarLoop]: trace histogram [5, 5, 5, 4, 4, 4, 4, 4, 4, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-09-25 11:19:09,151 INFO L540 MonitoredProcess]: [MP /storage/repos/certificate-witnesses-artifact/automizer/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Forceful destruction successful, exit code 0 [2024-09-25 11:19:09,338 WARN L456 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 /storage/repos/certificate-witnesses-artifact/automizer/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable6 [2024-09-25 11:19:09,338 INFO L399 AbstractCegarLoop]: === Iteration 8 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-09-25 11:19:09,339 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-25 11:19:09,339 INFO L85 PathProgramCache]: Analyzing trace with hash 499200656, now seen corresponding path program 2 times [2024-09-25 11:19:09,339 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-09-25 11:19:09,339 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1818870839] [2024-09-25 11:19:09,339 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-09-25 11:19:09,339 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-09-25 11:19:09,361 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-25 11:19:09,622 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2024-09-25 11:19:09,623 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-25 11:19:09,624 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-09-25 11:19:09,625 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-25 11:19:09,626 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-09-25 11:19:09,627 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-25 11:19:09,650 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2024-09-25 11:19:09,651 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-25 11:19:09,658 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2024-09-25 11:19:09,659 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-25 11:19:09,661 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-09-25 11:19:09,662 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-25 11:19:09,664 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2024-09-25 11:19:09,664 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-25 11:19:09,666 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2024-09-25 11:19:09,666 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-25 11:19:09,668 INFO L134 CoverageAnalysis]: Checked inductivity of 82 backedges. 36 proven. 11 refuted. 0 times theorem prover too weak. 35 trivial. 0 not checked. [2024-09-25 11:19:09,668 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-09-25 11:19:09,668 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1818870839] [2024-09-25 11:19:09,668 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1818870839] provided 0 perfect and 1 imperfect interpolant sequences [2024-09-25 11:19:09,668 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1223137513] [2024-09-25 11:19:09,668 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2024-09-25 11:19:09,668 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-09-25 11:19:09,668 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/certificate-witnesses-artifact/automizer/z3 [2024-09-25 11:19:09,670 INFO L229 MonitoredProcess]: Starting monitored process 7 with /storage/repos/certificate-witnesses-artifact/automizer/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-09-25 11:19:09,671 INFO L327 MonitoredProcess]: [MP /storage/repos/certificate-witnesses-artifact/automizer/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Waiting until timeout for monitored process [2024-09-25 11:19:09,709 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2024-09-25 11:19:09,709 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2024-09-25 11:19:09,710 INFO L262 TraceCheckSpWp]: Trace formula consists of 139 conjuncts, 14 conjuncts are in the unsatisfiable core [2024-09-25 11:19:09,711 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2024-09-25 11:19:09,786 INFO L134 CoverageAnalysis]: Checked inductivity of 82 backedges. 50 proven. 3 refuted. 0 times theorem prover too weak. 29 trivial. 0 not checked. [2024-09-25 11:19:09,786 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2024-09-25 11:19:10,019 INFO L134 CoverageAnalysis]: Checked inductivity of 82 backedges. 38 proven. 3 refuted. 0 times theorem prover too weak. 41 trivial. 0 not checked. [2024-09-25 11:19:10,019 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1223137513] provided 0 perfect and 2 imperfect interpolant sequences [2024-09-25 11:19:10,019 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-09-25 11:19:10,019 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 9, 9] total 20 [2024-09-25 11:19:10,020 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1439089607] [2024-09-25 11:19:10,020 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-09-25 11:19:10,020 INFO L551 AbstractCegarLoop]: INTERPOLANT automaton has 20 states [2024-09-25 11:19:10,020 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-09-25 11:19:10,021 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2024-09-25 11:19:10,021 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=76, Invalid=304, Unknown=0, NotChecked=0, Total=380 [2024-09-25 11:19:10,021 INFO L87 Difference]: Start difference. First operand 50 states and 54 transitions. Second operand has 20 states, 19 states have (on average 2.6842105263157894) internal successors, (51), 16 states have internal predecessors, (51), 12 states have call successors, (16), 2 states have call predecessors, (16), 3 states have return successors, (17), 13 states have call predecessors, (17), 12 states have call successors, (17) [2024-09-25 11:19:10,121 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-09-25 11:19:10,121 INFO L93 Difference]: Finished difference Result 54 states and 57 transitions. [2024-09-25 11:19:10,121 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-09-25 11:19:10,122 INFO L78 Accepts]: Start accepts. Automaton has has 20 states, 19 states have (on average 2.6842105263157894) internal successors, (51), 16 states have internal predecessors, (51), 12 states have call successors, (16), 2 states have call predecessors, (16), 3 states have return successors, (17), 13 states have call predecessors, (17), 12 states have call successors, (17) Word has length 63 [2024-09-25 11:19:10,122 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-09-25 11:19:10,122 INFO L225 Difference]: With dead ends: 54 [2024-09-25 11:19:10,122 INFO L226 Difference]: Without dead ends: 0 [2024-09-25 11:19:10,123 INFO L433 NwaCegarLoop]: 0 DeclaredPredicates, 157 GetRequests, 132 SyntacticMatches, 4 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 126 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=116, Invalid=390, Unknown=0, NotChecked=0, Total=506 [2024-09-25 11:19:10,123 INFO L434 NwaCegarLoop]: 19 mSDtfsCounter, 10 mSDsluCounter, 119 mSDsCounter, 0 mSdLazyCounter, 95 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 10 SdHoareTripleChecker+Valid, 138 SdHoareTripleChecker+Invalid, 97 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 95 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-09-25 11:19:10,123 INFO L435 NwaCegarLoop]: SdHoareTripleChecker [10 Valid, 138 Invalid, 97 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 95 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-09-25 11:19:10,124 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2024-09-25 11:19:10,124 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2024-09-25 11:19:10,124 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-25 11:19:10,124 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2024-09-25 11:19:10,124 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 63 [2024-09-25 11:19:10,124 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-09-25 11:19:10,124 INFO L474 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2024-09-25 11:19:10,125 INFO L475 AbstractCegarLoop]: INTERPOLANT automaton has has 20 states, 19 states have (on average 2.6842105263157894) internal successors, (51), 16 states have internal predecessors, (51), 12 states have call successors, (16), 2 states have call predecessors, (16), 3 states have return successors, (17), 13 states have call predecessors, (17), 12 states have call successors, (17) [2024-09-25 11:19:10,125 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-25 11:19:10,125 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2024-09-25 11:19:10,125 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2024-09-25 11:19:10,127 INFO L785 garLoopResultBuilder]: Registering result SAFE for location __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2024-09-25 11:19:10,139 INFO L552 MonitoredProcess]: [MP /storage/repos/certificate-witnesses-artifact/automizer/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Ended with exit code 0 [2024-09-25 11:19:10,331 WARN L456 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7,7 /storage/repos/certificate-witnesses-artifact/automizer/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-09-25 11:19:10,334 INFO L408 BasicCegarLoop]: Path program histogram: [2, 1, 1, 1, 1, 1, 1] [2024-09-25 11:19:10,336 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2024-09-25 11:19:10,778 INFO L165 ceAbstractionStarter]: Computing trace abstraction results [2024-09-25 11:19:10,794 WARN L953 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: #length [2024-09-25 11:19:10,795 WARN L953 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: #length [2024-09-25 11:19:10,795 WARN L953 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: #StackHeapBarrier [2024-09-25 11:19:10,795 WARN L953 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: #StackHeapBarrier [2024-09-25 11:19:10,795 WARN L953 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: #memory_int#0 [2024-09-25 11:19:10,795 WARN L953 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: #memory_int#0 [2024-09-25 11:19:10,795 WARN L953 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: #valid [2024-09-25 11:19:10,795 WARN L953 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: #valid [2024-09-25 11:19:10,796 WARN L953 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: #length [2024-09-25 11:19:10,796 WARN L953 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: #length [2024-09-25 11:19:10,796 WARN L953 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: #StackHeapBarrier [2024-09-25 11:19:10,796 WARN L953 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: #StackHeapBarrier [2024-09-25 11:19:10,796 WARN L953 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: #memory_int#0 [2024-09-25 11:19:10,796 WARN L953 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: #memory_int#0 [2024-09-25 11:19:10,796 WARN L953 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: #valid [2024-09-25 11:19:10,796 WARN L953 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: #valid [2024-09-25 11:19:10,797 WARN L953 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: #length [2024-09-25 11:19:10,797 WARN L953 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: #length [2024-09-25 11:19:10,797 WARN L953 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: #StackHeapBarrier [2024-09-25 11:19:10,797 WARN L953 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: #StackHeapBarrier [2024-09-25 11:19:10,797 WARN L953 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: #memory_int#0 [2024-09-25 11:19:10,797 WARN L953 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: #memory_int#0 [2024-09-25 11:19:10,797 WARN L953 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: #valid [2024-09-25 11:19:10,798 WARN L953 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: #valid [2024-09-25 11:19:10,798 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 25.09 11:19:10 BoogieIcfgContainer [2024-09-25 11:19:10,798 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2024-09-25 11:19:10,798 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2024-09-25 11:19:10,798 INFO L270 PluginConnector]: Initializing Witness Printer... [2024-09-25 11:19:10,798 INFO L274 PluginConnector]: Witness Printer initialized [2024-09-25 11:19:10,799 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 25.09 11:19:01" (3/4) ... [2024-09-25 11:19:10,800 INFO L139 WitnessPrinter]: Generating witness for correct program [2024-09-25 11:19:10,840 INFO L149 WitnessManager]: Wrote witness to /storage/repos/certificate-witnesses-artifact/automizer/witness.yml [2024-09-25 11:19:10,840 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2024-09-25 11:19:10,840 INFO L158 Benchmark]: Toolchain (without parser) took 10381.90ms. Allocated memory was 67.1MB in the beginning and 107.0MB in the end (delta: 39.8MB). Free memory was 44.5MB in the beginning and 74.0MB in the end (delta: -29.4MB). Peak memory consumption was 11.7MB. Max. memory is 16.1GB. [2024-09-25 11:19:10,841 INFO L158 Benchmark]: CDTParser took 0.14ms. Allocated memory is still 67.1MB. Free memory was 43.6MB in the beginning and 43.5MB in the end (delta: 83.9kB). There was no memory consumed. Max. memory is 16.1GB. [2024-09-25 11:19:10,841 INFO L158 Benchmark]: CACSL2BoogieTranslator took 183.07ms. Allocated memory is still 67.1MB. Free memory was 44.4MB in the beginning and 32.9MB in the end (delta: 11.5MB). Peak memory consumption was 10.5MB. Max. memory is 16.1GB. [2024-09-25 11:19:10,841 INFO L158 Benchmark]: Boogie Procedure Inliner took 16.12ms. Allocated memory is still 67.1MB. Free memory was 32.9MB in the beginning and 31.8MB in the end (delta: 1.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2024-09-25 11:19:10,841 INFO L158 Benchmark]: Boogie Preprocessor took 32.95ms. Allocated memory is still 67.1MB. Free memory was 31.8MB in the beginning and 30.2MB in the end (delta: 1.6MB). There was no memory consumed. Max. memory is 16.1GB. [2024-09-25 11:19:10,842 INFO L158 Benchmark]: RCFGBuilder took 310.67ms. Allocated memory was 67.1MB in the beginning and 88.1MB in the end (delta: 21.0MB). Free memory was 30.1MB in the beginning and 56.8MB in the end (delta: -26.7MB). Peak memory consumption was 5.0MB. Max. memory is 16.1GB. [2024-09-25 11:19:10,842 INFO L158 Benchmark]: TraceAbstraction took 9791.65ms. Allocated memory was 88.1MB in the beginning and 107.0MB in the end (delta: 18.9MB). Free memory was 56.1MB in the beginning and 77.1MB in the end (delta: -21.1MB). Peak memory consumption was 51.5MB. Max. memory is 16.1GB. [2024-09-25 11:19:10,842 INFO L158 Benchmark]: Witness Printer took 41.78ms. Allocated memory is still 107.0MB. Free memory was 77.1MB in the beginning and 74.0MB in the end (delta: 3.1MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. [2024-09-25 11:19:10,844 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.14ms. Allocated memory is still 67.1MB. Free memory was 43.6MB in the beginning and 43.5MB in the end (delta: 83.9kB). There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 183.07ms. Allocated memory is still 67.1MB. Free memory was 44.4MB in the beginning and 32.9MB in the end (delta: 11.5MB). Peak memory consumption was 10.5MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 16.12ms. Allocated memory is still 67.1MB. Free memory was 32.9MB in the beginning and 31.8MB in the end (delta: 1.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * Boogie Preprocessor took 32.95ms. Allocated memory is still 67.1MB. Free memory was 31.8MB in the beginning and 30.2MB in the end (delta: 1.6MB). There was no memory consumed. Max. memory is 16.1GB. * RCFGBuilder took 310.67ms. Allocated memory was 67.1MB in the beginning and 88.1MB in the end (delta: 21.0MB). Free memory was 30.1MB in the beginning and 56.8MB in the end (delta: -26.7MB). Peak memory consumption was 5.0MB. Max. memory is 16.1GB. * TraceAbstraction took 9791.65ms. Allocated memory was 88.1MB in the beginning and 107.0MB in the end (delta: 18.9MB). Free memory was 56.1MB in the beginning and 77.1MB in the end (delta: -21.1MB). Peak memory consumption was 51.5MB. Max. memory is 16.1GB. * Witness Printer took 41.78ms. Allocated memory is still 107.0MB. Free memory was 77.1MB in the beginning and 74.0MB in the end (delta: 3.1MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Unknown variable: #length - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Unknown variable: #length - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Unknown variable: #StackHeapBarrier - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Unknown variable: #StackHeapBarrier - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Unknown variable: #memory_int#0 - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Unknown variable: #memory_int#0 - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Unknown variable: #valid - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Unknown variable: #valid - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Unknown variable: #length - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Unknown variable: #length - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Unknown variable: #StackHeapBarrier - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Unknown variable: #StackHeapBarrier - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Unknown variable: #memory_int#0 - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Unknown variable: #memory_int#0 - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Unknown variable: #valid - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Unknown variable: #valid - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Unknown variable: #length - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Unknown variable: #length - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Unknown variable: #StackHeapBarrier - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Unknown variable: #StackHeapBarrier - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Unknown variable: #memory_int#0 - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Unknown variable: #memory_int#0 - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Unknown variable: #valid - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Unknown variable: #valid * 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: 15]: 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 5 procedures, 30 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 9.3s, OverallIterations: 8, TraceHistogramMax: 5, PathProgramHistogramMax: 2, EmptinessCheckTime: 0.0s, AutomataDifference: 1.0s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 71 SdHoareTripleChecker+Valid, 0.6s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 66 mSDsluCounter, 878 SdHoareTripleChecker+Invalid, 0.5s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 703 mSDsCounter, 27 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 644 IncrementalHoareTripleChecker+Invalid, 671 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 27 mSolverCounterUnsat, 175 mSDtfsCounter, 644 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 586 GetRequests, 479 SyntacticMatches, 16 SemanticMatches, 91 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 293 ImplicationChecksByTransitivity, 4.4s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=60occurred in iteration=5, InterpolantAutomatonStates: 63, 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, 8 MinimizatonAttempts, 7 StatesRemovedByMinimization, 4 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.2s SatisfiabilityAnalysisTime, 6.3s InterpolantComputationTime, 558 NumberOfCodeBlocks, 558 NumberOfCodeBlocksAsserted, 15 NumberOfCheckSat, 650 ConstructedInterpolants, 2 QuantifiedInterpolants, 2119 SizeOfPredicates, 11 NumberOfNonLiveVariables, 620 ConjunctsInSsa, 99 ConjunctsInUnsatCore, 16 InterpolantComputations, 4 PerfectInterpolantSequences, 454/493 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 - InvariantResult [Line: 34]: Loop Invariant Derived loop invariant: ((((((z == ((long long) b * a)) && (b <= 2)) && (1 <= b)) && (y == 0)) || (((((z == 0) && (y <= 2)) && (b == y)) && (1 <= y)) && (a == x))) || (((((z == 0) && (y == 1)) && (((long long) a * 2) == x)) && ((b / 2) == 1)) && ((b % 2) != 1))) - ProcedureContractResult [Line: 9]: Procedure Contract for assume_abort_if_not Derived contract for procedure assume_abort_if_not. Ensures: (cond != 0) - ProcedureContractResult [Line: 12]: Procedure Contract for __VERIFIER_assert Derived contract for procedure __VERIFIER_assert. Requires: (1 <= cond) Ensures: (1 <= cond) RESULT: Ultimate proved your program to be correct! [2024-09-25 11:19:10,862 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 Writing output log to file Ultimate.log Result: TRUE