./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/nla-digbench-scaling/divbin2_valuebound5.i --full-output --procedureinliner.inline.calls.to.implemented.procedures NEVER --traceabstraction.positions.where.we.compute.the.hoare.annotation All --witnessprinter.yaml.format.version 2.1 --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 5189fb62 Calling Ultimate with: /root/.sdkman/candidates/java/current/bin/java -Dosgi.configuration.area=/storage/repos/certificate-witnesses-artifact/automizer/data/config -Xmx15G -Xms4m -jar /storage/repos/certificate-witnesses-artifact/automizer/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/certificate-witnesses-artifact/automizer/data -tc /storage/repos/certificate-witnesses-artifact/automizer/config/AutomizerReach.xml -i ../sv-benchmarks/c/nla-digbench-scaling/divbin2_valuebound5.i -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 f7372e141bce7d93eac34ddc01970d0d3ee3e3dd05571cb5550acbf38c8c76e9 --procedureinliner.inline.calls.to.implemented.procedures NEVER --traceabstraction.positions.where.we.compute.the.hoare.annotation All --witnessprinter.yaml.format.version 2.1 --- Real Ultimate output --- This is Ultimate 0.2.4-dev-5189fb6-m [2024-09-13 00:03:14,235 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-09-13 00:03:14,324 INFO L114 SettingsManager]: Loading settings from /storage/repos/certificate-witnesses-artifact/automizer/config/svcomp-Reach-32bit-Automizer_Default.epf [2024-09-13 00:03:14,330 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-09-13 00:03:14,331 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-09-13 00:03:14,365 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-09-13 00:03:14,365 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-09-13 00:03:14,366 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-09-13 00:03:14,366 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-09-13 00:03:14,367 INFO L153 SettingsManager]: * Use memory slicer=true [2024-09-13 00:03:14,367 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-09-13 00:03:14,368 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-09-13 00:03:14,369 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-09-13 00:03:14,370 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-09-13 00:03:14,372 INFO L153 SettingsManager]: * Use SBE=true [2024-09-13 00:03:14,372 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-09-13 00:03:14,373 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-09-13 00:03:14,373 INFO L153 SettingsManager]: * sizeof long=4 [2024-09-13 00:03:14,373 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-09-13 00:03:14,373 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-09-13 00:03:14,374 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-09-13 00:03:14,378 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-09-13 00:03:14,378 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-09-13 00:03:14,378 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-09-13 00:03:14,379 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-09-13 00:03:14,379 INFO L153 SettingsManager]: * sizeof long double=12 [2024-09-13 00:03:14,379 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-09-13 00:03:14,379 INFO L153 SettingsManager]: * Use constant arrays=true [2024-09-13 00:03:14,380 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-09-13 00:03:14,380 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-09-13 00:03:14,380 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-09-13 00:03:14,380 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-09-13 00:03:14,380 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-09-13 00:03:14,381 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-09-13 00:03:14,381 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-09-13 00:03:14,381 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-09-13 00:03:14,382 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-09-13 00:03:14,382 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-09-13 00:03:14,382 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-09-13 00:03:14,382 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-09-13 00:03:14,382 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-09-13 00:03:14,383 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-09-13 00:03:14,383 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 -> f7372e141bce7d93eac34ddc01970d0d3ee3e3dd05571cb5550acbf38c8c76e9 Applying setting for plugin de.uni_freiburg.informatik.ultimate.boogie.procedureinliner: Inline calls to implemented procedures -> NEVER Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: Positions where we compute the Hoare Annotation -> All Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: YAML Format version -> 2.1 [2024-09-13 00:03:14,649 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-09-13 00:03:14,677 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-09-13 00:03:14,680 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-09-13 00:03:14,682 INFO L270 PluginConnector]: Initializing CDTParser... [2024-09-13 00:03:14,682 INFO L274 PluginConnector]: CDTParser initialized [2024-09-13 00:03:14,684 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/certificate-witnesses-artifact/automizer/../sv-benchmarks/c/nla-digbench-scaling/divbin2_valuebound5.i [2024-09-13 00:03:16,118 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-09-13 00:03:16,309 INFO L384 CDTParser]: Found 1 translation units. [2024-09-13 00:03:16,310 INFO L180 CDTParser]: Scanning /storage/repos/certificate-witnesses-artifact/sv-benchmarks/c/nla-digbench-scaling/divbin2_valuebound5.i [2024-09-13 00:03:16,320 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/certificate-witnesses-artifact/automizer/data/b2542f329/53cf4aef33bc489e8ba3e3fb6f30ea90/FLAG3e7faf28e [2024-09-13 00:03:16,335 INFO L435 CDTParser]: Successfully deleted /storage/repos/certificate-witnesses-artifact/automizer/data/b2542f329/53cf4aef33bc489e8ba3e3fb6f30ea90 [2024-09-13 00:03:16,338 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-09-13 00:03:16,340 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-09-13 00:03:16,342 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-09-13 00:03:16,342 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-09-13 00:03:16,349 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-09-13 00:03:16,350 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 13.09 12:03:16" (1/1) ... [2024-09-13 00:03:16,351 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@20cb1966 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.09 12:03:16, skipping insertion in model container [2024-09-13 00:03:16,351 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 13.09 12:03:16" (1/1) ... [2024-09-13 00:03:16,372 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-09-13 00:03:16,515 WARN L247 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/certificate-witnesses-artifact/sv-benchmarks/c/nla-digbench-scaling/divbin2_valuebound5.i[951,964] [2024-09-13 00:03:16,528 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-09-13 00:03:16,538 INFO L200 MainTranslator]: Completed pre-run [2024-09-13 00:03:16,550 WARN L247 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/certificate-witnesses-artifact/sv-benchmarks/c/nla-digbench-scaling/divbin2_valuebound5.i[951,964] [2024-09-13 00:03:16,555 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-09-13 00:03:16,573 INFO L204 MainTranslator]: Completed translation [2024-09-13 00:03:16,574 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.09 12:03:16 WrapperNode [2024-09-13 00:03:16,574 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-09-13 00:03:16,575 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-09-13 00:03:16,575 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-09-13 00:03:16,575 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-09-13 00:03:16,586 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.09 12:03:16" (1/1) ... [2024-09-13 00:03:16,596 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.09 12:03:16" (1/1) ... [2024-09-13 00:03:16,603 INFO L138 Inliner]: procedures = 16, calls = 9, calls flagged for inlining = 0, calls inlined = 0, statements flattened = 0 [2024-09-13 00:03:16,604 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-09-13 00:03:16,605 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-09-13 00:03:16,605 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-09-13 00:03:16,605 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-09-13 00:03:16,613 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.09 12:03:16" (1/1) ... [2024-09-13 00:03:16,613 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.09 12:03:16" (1/1) ... [2024-09-13 00:03:16,614 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.09 12:03:16" (1/1) ... [2024-09-13 00:03:16,625 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-13 00:03:16,625 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.09 12:03:16" (1/1) ... [2024-09-13 00:03:16,625 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.09 12:03:16" (1/1) ... [2024-09-13 00:03:16,628 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.09 12:03:16" (1/1) ... [2024-09-13 00:03:16,632 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.09 12:03:16" (1/1) ... [2024-09-13 00:03:16,633 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.09 12:03:16" (1/1) ... [2024-09-13 00:03:16,634 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.09 12:03:16" (1/1) ... [2024-09-13 00:03:16,640 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-09-13 00:03:16,641 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-09-13 00:03:16,641 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-09-13 00:03:16,642 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-09-13 00:03:16,642 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.09 12:03:16" (1/1) ... [2024-09-13 00:03:16,648 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-09-13 00:03:16,659 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/certificate-witnesses-artifact/automizer/z3 [2024-09-13 00:03:16,681 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/certificate-witnesses-artifact/automizer/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2024-09-13 00:03:16,684 INFO L327 MonitoredProcess]: [MP /storage/repos/certificate-witnesses-artifact/automizer/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2024-09-13 00:03:16,732 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-09-13 00:03:16,732 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2024-09-13 00:03:16,732 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2024-09-13 00:03:16,732 INFO L130 BoogieDeclarations]: Found specification of procedure main [2024-09-13 00:03:16,732 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2024-09-13 00:03:16,733 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-09-13 00:03:16,733 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2024-09-13 00:03:16,734 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2024-09-13 00:03:16,735 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-09-13 00:03:16,735 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-09-13 00:03:16,735 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2024-09-13 00:03:16,735 INFO L138 BoogieDeclarations]: Found implementation of procedure __VERIFIER_assert [2024-09-13 00:03:16,799 INFO L242 CfgBuilder]: Building ICFG [2024-09-13 00:03:16,801 INFO L268 CfgBuilder]: Building CFG for each procedure with an implementation [2024-09-13 00:03:16,975 INFO L? ?]: Removed 5 outVars from TransFormulas that were not future-live. [2024-09-13 00:03:16,976 INFO L291 CfgBuilder]: Performing block encoding [2024-09-13 00:03:16,998 INFO L313 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-09-13 00:03:16,999 INFO L318 CfgBuilder]: Removed 2 assume(true) statements. [2024-09-13 00:03:16,999 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 13.09 12:03:16 BoogieIcfgContainer [2024-09-13 00:03:16,999 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-09-13 00:03:17,001 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-09-13 00:03:17,001 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-09-13 00:03:17,006 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-09-13 00:03:17,007 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 13.09 12:03:16" (1/3) ... [2024-09-13 00:03:17,008 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2d5ef96c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 13.09 12:03:17, skipping insertion in model container [2024-09-13 00:03:17,008 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.09 12:03:16" (2/3) ... [2024-09-13 00:03:17,009 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2d5ef96c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 13.09 12:03:17, skipping insertion in model container [2024-09-13 00:03:17,009 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 13.09 12:03:16" (3/3) ... [2024-09-13 00:03:17,011 INFO L112 eAbstractionObserver]: Analyzing ICFG divbin2_valuebound5.i [2024-09-13 00:03:17,027 INFO L209 ceAbstractionStarter]: Automizer settings: Hoare:All NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-09-13 00:03:17,027 INFO L149 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-09-13 00:03:17,094 INFO L335 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-09-13 00:03:17,102 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;@288d8bce, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-09-13 00:03:17,103 INFO L337 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-09-13 00:03:17,108 INFO L276 IsEmpty]: Start isEmpty. Operand has 28 states, 17 states have (on average 1.588235294117647) internal successors, (27), 18 states have internal predecessors, (27), 5 states have call successors, (5), 4 states have call predecessors, (5), 4 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) [2024-09-13 00:03:17,116 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2024-09-13 00:03:17,116 INFO L208 NwaCegarLoop]: Found error trace [2024-09-13 00:03:17,117 INFO L216 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-09-13 00:03:17,118 INFO L399 AbstractCegarLoop]: === Iteration 1 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-09-13 00:03:17,122 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-13 00:03:17,123 INFO L85 PathProgramCache]: Analyzing trace with hash 1191872707, now seen corresponding path program 1 times [2024-09-13 00:03:17,132 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-09-13 00:03:17,133 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1136929419] [2024-09-13 00:03:17,133 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-09-13 00:03:17,134 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-09-13 00:03:17,240 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-13 00:03:17,274 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2024-09-13 00:03:17,278 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-13 00:03:17,284 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-09-13 00:03:17,287 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-13 00:03:17,292 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-09-13 00:03:17,293 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-09-13 00:03:17,293 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1136929419] [2024-09-13 00:03:17,294 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1136929419] provided 1 perfect and 0 imperfect interpolant sequences [2024-09-13 00:03:17,294 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-09-13 00:03:17,295 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-09-13 00:03:17,296 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [94349737] [2024-09-13 00:03:17,297 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-09-13 00:03:17,301 INFO L551 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-09-13 00:03:17,302 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-09-13 00:03:17,322 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-09-13 00:03:17,323 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-09-13 00:03:17,325 INFO L87 Difference]: Start difference. First operand has 28 states, 17 states have (on average 1.588235294117647) internal successors, (27), 18 states have internal predecessors, (27), 5 states have call successors, (5), 4 states have call predecessors, (5), 4 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) 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, (4), 2 states have call predecessors, (4), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) [2024-09-13 00:03:17,364 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-09-13 00:03:17,364 INFO L93 Difference]: Finished difference Result 48 states and 67 transitions. [2024-09-13 00:03:17,367 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-09-13 00:03:17,369 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, (4), 2 states have call predecessors, (4), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) Word has length 17 [2024-09-13 00:03:17,369 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-09-13 00:03:17,374 INFO L225 Difference]: With dead ends: 48 [2024-09-13 00:03:17,374 INFO L226 Difference]: Without dead ends: 24 [2024-09-13 00:03:17,377 INFO L433 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 7 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-09-13 00:03:17,380 INFO L434 NwaCegarLoop]: 29 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, 29 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-13 00:03:17,381 INFO L435 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 29 Invalid, 2 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 2 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-09-13 00:03:17,395 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 24 states. [2024-09-13 00:03:17,408 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 24 to 24. [2024-09-13 00:03:17,410 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 24 states, 15 states have (on average 1.2666666666666666) internal successors, (19), 16 states have internal predecessors, (19), 5 states have call successors, (5), 4 states have call predecessors, (5), 3 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2024-09-13 00:03:17,411 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 24 states to 24 states and 27 transitions. [2024-09-13 00:03:17,412 INFO L78 Accepts]: Start accepts. Automaton has 24 states and 27 transitions. Word has length 17 [2024-09-13 00:03:17,413 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-09-13 00:03:17,413 INFO L474 AbstractCegarLoop]: Abstraction has 24 states and 27 transitions. [2024-09-13 00:03:17,413 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, (4), 2 states have call predecessors, (4), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) [2024-09-13 00:03:17,414 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-13 00:03:17,414 INFO L276 IsEmpty]: Start isEmpty. Operand 24 states and 27 transitions. [2024-09-13 00:03:17,415 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2024-09-13 00:03:17,415 INFO L208 NwaCegarLoop]: Found error trace [2024-09-13 00:03:17,415 INFO L216 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-09-13 00:03:17,415 WARN L456 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-09-13 00:03:17,416 INFO L399 AbstractCegarLoop]: === Iteration 2 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-09-13 00:03:17,416 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-13 00:03:17,416 INFO L85 PathProgramCache]: Analyzing trace with hash 419909300, now seen corresponding path program 1 times [2024-09-13 00:03:17,417 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-09-13 00:03:17,417 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [154958478] [2024-09-13 00:03:17,417 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-09-13 00:03:17,417 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-09-13 00:03:17,468 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unknown [2024-09-13 00:03:17,472 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [280333474] [2024-09-13 00:03:17,474 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-09-13 00:03:17,475 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-09-13 00:03:17,475 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/certificate-witnesses-artifact/automizer/z3 [2024-09-13 00:03:17,477 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/certificate-witnesses-artifact/automizer/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-09-13 00:03:17,478 INFO L327 MonitoredProcess]: [MP /storage/repos/certificate-witnesses-artifact/automizer/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2024-09-13 00:03:17,535 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-13 00:03:17,537 INFO L262 TraceCheckSpWp]: Trace formula consists of 54 conjuncts, 7 conjuncts are in the unsatisfiable core [2024-09-13 00:03:17,542 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2024-09-13 00:03:17,650 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-09-13 00:03:17,650 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-09-13 00:03:17,651 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-09-13 00:03:17,651 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [154958478] [2024-09-13 00:03:17,651 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2024-09-13 00:03:17,652 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [280333474] [2024-09-13 00:03:17,652 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [280333474] provided 1 perfect and 0 imperfect interpolant sequences [2024-09-13 00:03:17,652 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-09-13 00:03:17,652 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-09-13 00:03:17,653 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1093947403] [2024-09-13 00:03:17,654 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-09-13 00:03:17,654 INFO L551 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-09-13 00:03:17,654 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-09-13 00:03:17,656 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-09-13 00:03:17,657 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-09-13 00:03:17,657 INFO L87 Difference]: Start difference. First operand 24 states and 27 transitions. Second operand has 5 states, 5 states have (on average 2.4) internal successors, (12), 4 states have internal predecessors, (12), 2 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2024-09-13 00:03:17,749 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-09-13 00:03:17,749 INFO L93 Difference]: Finished difference Result 35 states and 40 transitions. [2024-09-13 00:03:17,750 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-09-13 00:03:17,750 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 2.4) internal successors, (12), 4 states have internal predecessors, (12), 2 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) Word has length 18 [2024-09-13 00:03:17,751 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-09-13 00:03:17,752 INFO L225 Difference]: With dead ends: 35 [2024-09-13 00:03:17,753 INFO L226 Difference]: Without dead ends: 32 [2024-09-13 00:03:17,753 INFO L433 NwaCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 14 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2024-09-13 00:03:17,755 INFO L434 NwaCegarLoop]: 18 mSDtfsCounter, 6 mSDsluCounter, 50 mSDsCounter, 0 mSdLazyCounter, 36 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 7 SdHoareTripleChecker+Valid, 68 SdHoareTripleChecker+Invalid, 38 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 36 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-09-13 00:03:17,756 INFO L435 NwaCegarLoop]: SdHoareTripleChecker [7 Valid, 68 Invalid, 38 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 36 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-09-13 00:03:17,758 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 32 states. [2024-09-13 00:03:17,770 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 32 to 32. [2024-09-13 00:03:17,770 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 32 states, 21 states have (on average 1.2380952380952381) internal successors, (26), 22 states have internal predecessors, (26), 6 states have call successors, (6), 5 states have call predecessors, (6), 4 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2024-09-13 00:03:17,771 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 32 states to 32 states and 36 transitions. [2024-09-13 00:03:17,774 INFO L78 Accepts]: Start accepts. Automaton has 32 states and 36 transitions. Word has length 18 [2024-09-13 00:03:17,774 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-09-13 00:03:17,774 INFO L474 AbstractCegarLoop]: Abstraction has 32 states and 36 transitions. [2024-09-13 00:03:17,775 INFO L475 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 2.4) internal successors, (12), 4 states have internal predecessors, (12), 2 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2024-09-13 00:03:17,775 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-13 00:03:17,775 INFO L276 IsEmpty]: Start isEmpty. Operand 32 states and 36 transitions. [2024-09-13 00:03:17,776 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2024-09-13 00:03:17,776 INFO L208 NwaCegarLoop]: Found error trace [2024-09-13 00:03:17,776 INFO L216 NwaCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-09-13 00:03:17,796 INFO L552 MonitoredProcess]: [MP /storage/repos/certificate-witnesses-artifact/automizer/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2024-09-13 00:03:17,977 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-13 00:03:17,977 INFO L399 AbstractCegarLoop]: === Iteration 3 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-09-13 00:03:17,978 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-13 00:03:17,978 INFO L85 PathProgramCache]: Analyzing trace with hash -53840867, now seen corresponding path program 1 times [2024-09-13 00:03:17,979 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-09-13 00:03:17,979 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1810798122] [2024-09-13 00:03:17,979 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-09-13 00:03:17,980 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-09-13 00:03:18,057 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-13 00:03:18,509 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2024-09-13 00:03:18,514 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-13 00:03:18,517 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-09-13 00:03:18,521 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-13 00:03:18,525 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2024-09-13 00:03:18,527 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-13 00:03:18,542 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-09-13 00:03:18,542 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-09-13 00:03:18,542 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1810798122] [2024-09-13 00:03:18,542 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1810798122] provided 1 perfect and 0 imperfect interpolant sequences [2024-09-13 00:03:18,542 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-09-13 00:03:18,543 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-09-13 00:03:18,543 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2145102231] [2024-09-13 00:03:18,543 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-09-13 00:03:18,545 INFO L551 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-09-13 00:03:18,545 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-09-13 00:03:18,545 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-09-13 00:03:18,546 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-09-13 00:03:18,546 INFO L87 Difference]: Start difference. First operand 32 states and 36 transitions. Second operand has 3 states, 3 states have (on average 6.0) internal successors, (18), 3 states have internal predecessors, (18), 3 states have call successors, (5), 2 states have call predecessors, (5), 1 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2024-09-13 00:03:18,580 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-09-13 00:03:18,581 INFO L93 Difference]: Finished difference Result 56 states and 65 transitions. [2024-09-13 00:03:18,582 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-09-13 00:03:18,582 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 6.0) internal successors, (18), 3 states have internal predecessors, (18), 3 states have call successors, (5), 2 states have call predecessors, (5), 1 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) Word has length 26 [2024-09-13 00:03:18,582 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-09-13 00:03:18,583 INFO L225 Difference]: With dead ends: 56 [2024-09-13 00:03:18,583 INFO L226 Difference]: Without dead ends: 34 [2024-09-13 00:03:18,584 INFO L433 NwaCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 10 SyntacticMatches, 1 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-09-13 00:03:18,586 INFO L434 NwaCegarLoop]: 24 mSDtfsCounter, 0 mSDsluCounter, 18 mSDsCounter, 0 mSdLazyCounter, 11 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 42 SdHoareTripleChecker+Invalid, 11 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 11 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-09-13 00:03:18,588 INFO L435 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 42 Invalid, 11 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 11 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-09-13 00:03:18,589 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 34 states. [2024-09-13 00:03:18,598 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 34 to 34. [2024-09-13 00:03:18,601 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 34 states, 23 states have (on average 1.2173913043478262) internal successors, (28), 24 states have internal predecessors, (28), 6 states have call successors, (6), 5 states have call predecessors, (6), 4 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2024-09-13 00:03:18,602 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 34 states to 34 states and 38 transitions. [2024-09-13 00:03:18,602 INFO L78 Accepts]: Start accepts. Automaton has 34 states and 38 transitions. Word has length 26 [2024-09-13 00:03:18,603 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-09-13 00:03:18,603 INFO L474 AbstractCegarLoop]: Abstraction has 34 states and 38 transitions. [2024-09-13 00:03:18,603 INFO L475 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 6.0) internal successors, (18), 3 states have internal predecessors, (18), 3 states have call successors, (5), 2 states have call predecessors, (5), 1 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2024-09-13 00:03:18,603 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-13 00:03:18,603 INFO L276 IsEmpty]: Start isEmpty. Operand 34 states and 38 transitions. [2024-09-13 00:03:18,604 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2024-09-13 00:03:18,604 INFO L208 NwaCegarLoop]: Found error trace [2024-09-13 00:03:18,605 INFO L216 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-09-13 00:03:18,606 WARN L456 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-09-13 00:03:18,606 INFO L399 AbstractCegarLoop]: === Iteration 4 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-09-13 00:03:18,606 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-13 00:03:18,606 INFO L85 PathProgramCache]: Analyzing trace with hash -792506632, now seen corresponding path program 1 times [2024-09-13 00:03:18,607 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-09-13 00:03:18,607 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1536260566] [2024-09-13 00:03:18,607 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-09-13 00:03:18,607 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-09-13 00:03:18,649 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unknown [2024-09-13 00:03:18,654 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [652929415] [2024-09-13 00:03:18,655 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-09-13 00:03:18,655 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-09-13 00:03:18,655 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/certificate-witnesses-artifact/automizer/z3 [2024-09-13 00:03:18,661 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/certificate-witnesses-artifact/automizer/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-09-13 00:03:18,663 INFO L327 MonitoredProcess]: [MP /storage/repos/certificate-witnesses-artifact/automizer/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2024-09-13 00:03:18,761 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-13 00:03:18,763 INFO L262 TraceCheckSpWp]: Trace formula consists of 78 conjuncts, 29 conjuncts are in the unsatisfiable core [2024-09-13 00:03:18,766 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2024-09-13 00:03:19,224 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 1 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-09-13 00:03:19,225 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2024-09-13 00:03:28,440 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-09-13 00:03:28,441 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1536260566] [2024-09-13 00:03:28,441 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2024-09-13 00:03:28,441 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [652929415] [2024-09-13 00:03:28,441 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [652929415] provided 0 perfect and 1 imperfect interpolant sequences [2024-09-13 00:03:28,441 INFO L185 FreeRefinementEngine]: Found 0 perfect and 1 imperfect interpolant sequences. [2024-09-13 00:03:28,441 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13] total 13 [2024-09-13 00:03:28,442 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1371997833] [2024-09-13 00:03:28,442 INFO L85 oduleStraightlineAll]: Using 1 imperfect interpolants to construct interpolant automaton [2024-09-13 00:03:28,442 INFO L551 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2024-09-13 00:03:28,442 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-09-13 00:03:28,443 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2024-09-13 00:03:28,443 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=52, Invalid=218, Unknown=2, NotChecked=0, Total=272 [2024-09-13 00:03:28,444 INFO L87 Difference]: Start difference. First operand 34 states and 38 transitions. Second operand has 13 states, 13 states have (on average 1.5384615384615385) internal successors, (20), 11 states have internal predecessors, (20), 3 states have call successors, (5), 2 states have call predecessors, (5), 3 states have return successors, (3), 3 states have call predecessors, (3), 2 states have call successors, (3) [2024-09-13 00:03:28,635 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-09-13 00:03:28,635 INFO L93 Difference]: Finished difference Result 44 states and 49 transitions. [2024-09-13 00:03:28,635 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2024-09-13 00:03:28,636 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 13 states have (on average 1.5384615384615385) internal successors, (20), 11 states have internal predecessors, (20), 3 states have call successors, (5), 2 states have call predecessors, (5), 3 states have return successors, (3), 3 states have call predecessors, (3), 2 states have call successors, (3) Word has length 28 [2024-09-13 00:03:28,636 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-09-13 00:03:28,637 INFO L225 Difference]: With dead ends: 44 [2024-09-13 00:03:28,637 INFO L226 Difference]: Without dead ends: 41 [2024-09-13 00:03:28,638 INFO L433 NwaCegarLoop]: 0 DeclaredPredicates, 36 GetRequests, 18 SyntacticMatches, 2 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 56 ImplicationChecksByTransitivity, 9.2s TimeCoverageRelationStatistics Valid=58, Invalid=246, Unknown=2, NotChecked=0, Total=306 [2024-09-13 00:03:28,639 INFO L434 NwaCegarLoop]: 16 mSDtfsCounter, 14 mSDsluCounter, 114 mSDsCounter, 0 mSdLazyCounter, 177 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 17 SdHoareTripleChecker+Valid, 130 SdHoareTripleChecker+Invalid, 181 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 177 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-09-13 00:03:28,640 INFO L435 NwaCegarLoop]: SdHoareTripleChecker [17 Valid, 130 Invalid, 181 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 177 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-09-13 00:03:28,641 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 41 states. [2024-09-13 00:03:28,651 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 41 to 41. [2024-09-13 00:03:28,652 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 41 states, 28 states have (on average 1.1785714285714286) internal successors, (33), 29 states have internal predecessors, (33), 7 states have call successors, (7), 6 states have call predecessors, (7), 5 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) [2024-09-13 00:03:28,653 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 41 states to 41 states and 45 transitions. [2024-09-13 00:03:28,653 INFO L78 Accepts]: Start accepts. Automaton has 41 states and 45 transitions. Word has length 28 [2024-09-13 00:03:28,653 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-09-13 00:03:28,653 INFO L474 AbstractCegarLoop]: Abstraction has 41 states and 45 transitions. [2024-09-13 00:03:28,653 INFO L475 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 13 states have (on average 1.5384615384615385) internal successors, (20), 11 states have internal predecessors, (20), 3 states have call successors, (5), 2 states have call predecessors, (5), 3 states have return successors, (3), 3 states have call predecessors, (3), 2 states have call successors, (3) [2024-09-13 00:03:28,654 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-13 00:03:28,654 INFO L276 IsEmpty]: Start isEmpty. Operand 41 states and 45 transitions. [2024-09-13 00:03:28,657 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2024-09-13 00:03:28,658 INFO L208 NwaCegarLoop]: Found error trace [2024-09-13 00:03:28,658 INFO L216 NwaCegarLoop]: trace histogram [3, 3, 3, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-09-13 00:03:28,666 INFO L552 MonitoredProcess]: [MP /storage/repos/certificate-witnesses-artifact/automizer/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Ended with exit code 0 [2024-09-13 00:03:28,858 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-13 00:03:28,859 INFO L399 AbstractCegarLoop]: === Iteration 5 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-09-13 00:03:28,860 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-13 00:03:28,860 INFO L85 PathProgramCache]: Analyzing trace with hash -1699483551, now seen corresponding path program 2 times [2024-09-13 00:03:28,860 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-09-13 00:03:28,860 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [621323075] [2024-09-13 00:03:28,860 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-09-13 00:03:28,861 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-09-13 00:03:28,888 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-13 00:03:29,268 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2024-09-13 00:03:29,269 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-13 00:03:29,271 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-09-13 00:03:29,272 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-13 00:03:29,275 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2024-09-13 00:03:29,277 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-13 00:03:29,284 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2024-09-13 00:03:29,286 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-13 00:03:29,292 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 9 proven. 5 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2024-09-13 00:03:29,293 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-09-13 00:03:29,293 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [621323075] [2024-09-13 00:03:29,293 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [621323075] provided 0 perfect and 1 imperfect interpolant sequences [2024-09-13 00:03:29,293 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1615487193] [2024-09-13 00:03:29,293 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2024-09-13 00:03:29,294 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-09-13 00:03:29,294 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/certificate-witnesses-artifact/automizer/z3 [2024-09-13 00:03:29,295 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/certificate-witnesses-artifact/automizer/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-09-13 00:03:29,297 INFO L327 MonitoredProcess]: [MP /storage/repos/certificate-witnesses-artifact/automizer/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2024-09-13 00:03:29,366 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2024-09-13 00:03:29,366 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2024-09-13 00:03:29,367 INFO L262 TraceCheckSpWp]: Trace formula consists of 98 conjuncts, 12 conjuncts are in the unsatisfiable core [2024-09-13 00:03:29,373 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2024-09-13 00:03:29,488 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 9 proven. 5 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2024-09-13 00:03:29,488 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2024-09-13 00:03:29,747 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 9 proven. 5 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2024-09-13 00:03:29,748 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1615487193] provided 0 perfect and 2 imperfect interpolant sequences [2024-09-13 00:03:29,748 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-09-13 00:03:29,748 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 6, 7] total 15 [2024-09-13 00:03:29,748 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2076744453] [2024-09-13 00:03:29,748 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-09-13 00:03:29,749 INFO L551 AbstractCegarLoop]: INTERPOLANT automaton has 15 states [2024-09-13 00:03:29,749 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-09-13 00:03:29,750 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2024-09-13 00:03:29,750 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=63, Invalid=147, Unknown=0, NotChecked=0, Total=210 [2024-09-13 00:03:29,751 INFO L87 Difference]: Start difference. First operand 41 states and 45 transitions. Second operand has 15 states, 15 states have (on average 2.7333333333333334) internal successors, (41), 15 states have internal predecessors, (41), 8 states have call successors, (10), 2 states have call predecessors, (10), 1 states have return successors, (8), 7 states have call predecessors, (8), 7 states have call successors, (8) [2024-09-13 00:03:29,855 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-09-13 00:03:29,856 INFO L93 Difference]: Finished difference Result 79 states and 92 transitions. [2024-09-13 00:03:29,856 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-09-13 00:03:29,857 INFO L78 Accepts]: Start accepts. Automaton has has 15 states, 15 states have (on average 2.7333333333333334) internal successors, (41), 15 states have internal predecessors, (41), 8 states have call successors, (10), 2 states have call predecessors, (10), 1 states have return successors, (8), 7 states have call predecessors, (8), 7 states have call successors, (8) Word has length 36 [2024-09-13 00:03:29,857 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-09-13 00:03:29,858 INFO L225 Difference]: With dead ends: 79 [2024-09-13 00:03:29,860 INFO L226 Difference]: Without dead ends: 46 [2024-09-13 00:03:29,861 INFO L433 NwaCegarLoop]: 0 DeclaredPredicates, 86 GetRequests, 73 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 55 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=63, Invalid=147, Unknown=0, NotChecked=0, Total=210 [2024-09-13 00:03:29,861 INFO L434 NwaCegarLoop]: 25 mSDtfsCounter, 1 mSDsluCounter, 98 mSDsCounter, 0 mSdLazyCounter, 63 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2 SdHoareTripleChecker+Valid, 123 SdHoareTripleChecker+Invalid, 66 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 63 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-09-13 00:03:29,862 INFO L435 NwaCegarLoop]: SdHoareTripleChecker [2 Valid, 123 Invalid, 66 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 63 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-09-13 00:03:29,862 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 46 states. [2024-09-13 00:03:29,875 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 46 to 43. [2024-09-13 00:03:29,876 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 43 states, 30 states have (on average 1.1666666666666667) internal successors, (35), 31 states have internal predecessors, (35), 7 states have call successors, (7), 6 states have call predecessors, (7), 5 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) [2024-09-13 00:03:29,877 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 43 states to 43 states and 47 transitions. [2024-09-13 00:03:29,879 INFO L78 Accepts]: Start accepts. Automaton has 43 states and 47 transitions. Word has length 36 [2024-09-13 00:03:29,879 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-09-13 00:03:29,879 INFO L474 AbstractCegarLoop]: Abstraction has 43 states and 47 transitions. [2024-09-13 00:03:29,879 INFO L475 AbstractCegarLoop]: INTERPOLANT automaton has has 15 states, 15 states have (on average 2.7333333333333334) internal successors, (41), 15 states have internal predecessors, (41), 8 states have call successors, (10), 2 states have call predecessors, (10), 1 states have return successors, (8), 7 states have call predecessors, (8), 7 states have call successors, (8) [2024-09-13 00:03:29,880 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-13 00:03:29,880 INFO L276 IsEmpty]: Start isEmpty. Operand 43 states and 47 transitions. [2024-09-13 00:03:29,882 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2024-09-13 00:03:29,882 INFO L208 NwaCegarLoop]: Found error trace [2024-09-13 00:03:29,883 INFO L216 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-09-13 00:03:29,901 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-13 00:03:30,083 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-13 00:03:30,084 INFO L399 AbstractCegarLoop]: === Iteration 6 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-09-13 00:03:30,085 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-13 00:03:30,085 INFO L85 PathProgramCache]: Analyzing trace with hash -125225604, now seen corresponding path program 3 times [2024-09-13 00:03:30,085 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-09-13 00:03:30,085 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1355161941] [2024-09-13 00:03:30,085 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-09-13 00:03:30,086 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-09-13 00:03:30,167 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unknown [2024-09-13 00:03:30,172 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [323284985] [2024-09-13 00:03:30,176 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2024-09-13 00:03:30,176 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-09-13 00:03:30,177 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/certificate-witnesses-artifact/automizer/z3 [2024-09-13 00:03:30,178 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/certificate-witnesses-artifact/automizer/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-09-13 00:03:30,180 INFO L327 MonitoredProcess]: [MP /storage/repos/certificate-witnesses-artifact/automizer/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2024-09-13 00:03:30,345 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) [2024-09-13 00:03:30,346 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2024-09-13 00:03:30,347 INFO L262 TraceCheckSpWp]: Trace formula consists of 102 conjuncts, 46 conjuncts are in the unsatisfiable core [2024-09-13 00:03:30,350 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2024-09-13 00:03:30,914 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 3 proven. 18 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2024-09-13 00:03:30,914 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2024-09-13 00:03:45,466 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 7 proven. 14 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2024-09-13 00:03:45,467 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-09-13 00:03:45,467 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1355161941] [2024-09-13 00:03:45,467 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2024-09-13 00:03:45,467 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [323284985] [2024-09-13 00:03:45,467 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [323284985] provided 0 perfect and 2 imperfect interpolant sequences [2024-09-13 00:03:45,467 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-09-13 00:03:45,467 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [18, 12] total 27 [2024-09-13 00:03:45,468 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1716755020] [2024-09-13 00:03:45,468 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-09-13 00:03:45,468 INFO L551 AbstractCegarLoop]: INTERPOLANT automaton has 27 states [2024-09-13 00:03:45,468 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-09-13 00:03:45,469 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 27 interpolants. [2024-09-13 00:03:45,473 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=113, Invalid=588, Unknown=1, NotChecked=0, Total=702 [2024-09-13 00:03:45,473 INFO L87 Difference]: Start difference. First operand 43 states and 47 transitions. Second operand has 27 states, 27 states have (on average 1.8148148148148149) internal successors, (49), 23 states have internal predecessors, (49), 7 states have call successors, (9), 3 states have call predecessors, (9), 3 states have return successors, (7), 6 states have call predecessors, (7), 5 states have call successors, (7) [2024-09-13 00:04:38,207 WARN L293 SmtUtils]: Spent 49.37s on a formula simplification that was a NOOP. DAG size: 66 (called from [L 391] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2024-09-13 00:04:42,689 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers [] [2024-09-13 00:04:47,368 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers [] [2024-09-13 00:04:56,124 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers [] [2024-09-13 00:05:06,051 WARN L293 SmtUtils]: Spent 9.54s on a formula simplification that was a NOOP. DAG size: 63 (called from [L 391] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2024-09-13 00:06:01,402 WARN L293 SmtUtils]: Spent 53.89s on a formula simplification that was a NOOP. DAG size: 62 (called from [L 391] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2024-09-13 00:06:05,538 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers [] [2024-09-13 00:06:09,983 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers [] [2024-09-13 00:06:18,699 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers [] [2024-09-13 00:06:24,853 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.89s for a HTC check with result INVALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers [] [2024-09-13 00:06:29,745 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers [] [2024-09-13 00:06:33,753 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers [] [2024-09-13 00:06:51,357 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.55s for a HTC check with result INVALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers [] [2024-09-13 00:07:03,801 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers [] [2024-09-13 00:07:18,478 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers [] [2024-09-13 00:07:24,187 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers [] [2024-09-13 00:08:02,593 WARN L293 SmtUtils]: Spent 33.36s on a formula simplification that was a NOOP. DAG size: 55 (called from [L 391] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2024-09-13 00:08:05,361 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.62s for a HTC check with result INVALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers [] [2024-09-13 00:08:09,413 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers [] [2024-09-13 00:08:13,445 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.03s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers [] [2024-09-13 00:08:15,464 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.02s for a HTC check with result INVALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers [] [2024-09-13 00:08:19,480 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers [] [2024-09-13 00:08:22,086 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.50s for a HTC check with result INVALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers [] [2024-09-13 00:08:26,147 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers [] [2024-09-13 00:08:30,237 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.01s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers [] [2024-09-13 00:08:34,254 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.01s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers [] [2024-09-13 00:08:38,274 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.02s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers [] [2024-09-13 00:08:42,381 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers [] [2024-09-13 00:08:43,895 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.51s for a HTC check with result INVALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers [] [2024-09-13 00:08:45,875 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.27s for a HTC check with result INVALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers [] [2024-09-13 00:08:45,889 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-09-13 00:08:45,889 INFO L93 Difference]: Finished difference Result 134 states and 165 transitions. [2024-09-13 00:08:45,890 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 29 states. [2024-09-13 00:08:45,890 INFO L78 Accepts]: Start accepts. Automaton has has 27 states, 27 states have (on average 1.8148148148148149) internal successors, (49), 23 states have internal predecessors, (49), 7 states have call successors, (9), 3 states have call predecessors, (9), 3 states have return successors, (7), 6 states have call predecessors, (7), 5 states have call successors, (7) Word has length 38 [2024-09-13 00:08:45,890 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-09-13 00:08:45,893 INFO L225 Difference]: With dead ends: 134 [2024-09-13 00:08:45,893 INFO L226 Difference]: Without dead ends: 92 [2024-09-13 00:08:45,894 INFO L433 NwaCegarLoop]: 0 DeclaredPredicates, 96 GetRequests, 55 SyntacticMatches, 0 SemanticMatches, 41 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 350 ImplicationChecksByTransitivity, 209.7s TimeCoverageRelationStatistics Valid=340, Invalid=1456, Unknown=10, NotChecked=0, Total=1806 [2024-09-13 00:08:45,895 INFO L434 NwaCegarLoop]: 26 mSDtfsCounter, 76 mSDsluCounter, 341 mSDsCounter, 0 mSdLazyCounter, 449 mSolverCounterSat, 58 mSolverCounterUnsat, 19 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 100.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 78 SdHoareTripleChecker+Valid, 367 SdHoareTripleChecker+Invalid, 526 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 58 IncrementalHoareTripleChecker+Valid, 449 IncrementalHoareTripleChecker+Invalid, 19 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 100.3s IncrementalHoareTripleChecker+Time [2024-09-13 00:08:45,895 INFO L435 NwaCegarLoop]: SdHoareTripleChecker [78 Valid, 367 Invalid, 526 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [58 Valid, 449 Invalid, 19 Unknown, 0 Unchecked, 100.3s Time] [2024-09-13 00:08:45,896 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 92 states. [2024-09-13 00:08:45,930 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 92 to 83. [2024-09-13 00:08:45,931 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 83 states, 60 states have (on average 1.15) internal successors, (69), 64 states have internal predecessors, (69), 14 states have call successors, (14), 9 states have call predecessors, (14), 8 states have return successors, (13), 9 states have call predecessors, (13), 13 states have call successors, (13) [2024-09-13 00:08:45,932 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 83 states to 83 states and 96 transitions. [2024-09-13 00:08:45,932 INFO L78 Accepts]: Start accepts. Automaton has 83 states and 96 transitions. Word has length 38 [2024-09-13 00:08:45,933 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-09-13 00:08:45,933 INFO L474 AbstractCegarLoop]: Abstraction has 83 states and 96 transitions. [2024-09-13 00:08:45,933 INFO L475 AbstractCegarLoop]: INTERPOLANT automaton has has 27 states, 27 states have (on average 1.8148148148148149) internal successors, (49), 23 states have internal predecessors, (49), 7 states have call successors, (9), 3 states have call predecessors, (9), 3 states have return successors, (7), 6 states have call predecessors, (7), 5 states have call successors, (7) [2024-09-13 00:08:45,933 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-13 00:08:45,934 INFO L276 IsEmpty]: Start isEmpty. Operand 83 states and 96 transitions. [2024-09-13 00:08:45,936 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 49 [2024-09-13 00:08:45,936 INFO L208 NwaCegarLoop]: Found error trace [2024-09-13 00:08:45,937 INFO L216 NwaCegarLoop]: trace histogram [4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-09-13 00:08:45,943 INFO L540 MonitoredProcess]: [MP /storage/repos/certificate-witnesses-artifact/automizer/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Forceful destruction successful, exit code 0 [2024-09-13 00:08:46,137 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-13 00:08:46,138 INFO L399 AbstractCegarLoop]: === Iteration 7 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-09-13 00:08:46,138 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-13 00:08:46,139 INFO L85 PathProgramCache]: Analyzing trace with hash 1281290816, now seen corresponding path program 4 times [2024-09-13 00:08:46,139 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-09-13 00:08:46,139 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [119029430] [2024-09-13 00:08:46,139 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-09-13 00:08:46,139 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-09-13 00:08:46,187 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-13 00:08:47,166 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2024-09-13 00:08:47,168 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-13 00:08:47,171 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-09-13 00:08:47,173 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-13 00:08:47,225 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2024-09-13 00:08:47,229 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-13 00:08:47,237 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28 [2024-09-13 00:08:47,240 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-13 00:08:47,247 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 36 [2024-09-13 00:08:47,248 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-13 00:08:47,251 INFO L134 CoverageAnalysis]: Checked inductivity of 48 backedges. 18 proven. 16 refuted. 0 times theorem prover too weak. 14 trivial. 0 not checked. [2024-09-13 00:08:47,251 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-09-13 00:08:47,252 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [119029430] [2024-09-13 00:08:47,252 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [119029430] provided 0 perfect and 1 imperfect interpolant sequences [2024-09-13 00:08:47,252 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [954946292] [2024-09-13 00:08:47,252 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2024-09-13 00:08:47,253 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-09-13 00:08:47,253 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/certificate-witnesses-artifact/automizer/z3 [2024-09-13 00:08:47,254 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/certificate-witnesses-artifact/automizer/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-09-13 00:08:47,255 INFO L327 MonitoredProcess]: [MP /storage/repos/certificate-witnesses-artifact/automizer/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2024-09-13 00:08:47,462 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2024-09-13 00:08:47,463 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2024-09-13 00:08:47,465 INFO L262 TraceCheckSpWp]: Trace formula consists of 126 conjuncts, 42 conjuncts are in the unsatisfiable core [2024-09-13 00:08:47,467 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2024-09-13 00:08:48,150 INFO L134 CoverageAnalysis]: Checked inductivity of 48 backedges. 24 proven. 16 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2024-09-13 00:08:48,150 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2024-09-13 00:08:50,584 INFO L134 CoverageAnalysis]: Checked inductivity of 48 backedges. 18 proven. 18 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2024-09-13 00:08:50,584 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [954946292] provided 0 perfect and 2 imperfect interpolant sequences [2024-09-13 00:08:50,584 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-09-13 00:08:50,584 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 12, 16] total 33 [2024-09-13 00:08:50,584 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1628622986] [2024-09-13 00:08:50,585 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-09-13 00:08:50,585 INFO L551 AbstractCegarLoop]: INTERPOLANT automaton has 33 states [2024-09-13 00:08:50,585 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-09-13 00:08:50,586 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 33 interpolants. [2024-09-13 00:08:50,586 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=193, Invalid=863, Unknown=0, NotChecked=0, Total=1056 [2024-09-13 00:08:50,587 INFO L87 Difference]: Start difference. First operand 83 states and 96 transitions. Second operand has 33 states, 33 states have (on average 2.0303030303030303) internal successors, (67), 30 states have internal predecessors, (67), 9 states have call successors, (13), 3 states have call predecessors, (13), 3 states have return successors, (12), 11 states have call predecessors, (12), 9 states have call successors, (12) [2024-09-13 00:08:51,163 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-09-13 00:08:51,164 INFO L93 Difference]: Finished difference Result 112 states and 128 transitions. [2024-09-13 00:08:51,165 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2024-09-13 00:08:51,165 INFO L78 Accepts]: Start accepts. Automaton has has 33 states, 33 states have (on average 2.0303030303030303) internal successors, (67), 30 states have internal predecessors, (67), 9 states have call successors, (13), 3 states have call predecessors, (13), 3 states have return successors, (12), 11 states have call predecessors, (12), 9 states have call successors, (12) Word has length 48 [2024-09-13 00:08:51,165 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-09-13 00:08:51,166 INFO L225 Difference]: With dead ends: 112 [2024-09-13 00:08:51,167 INFO L226 Difference]: Without dead ends: 51 [2024-09-13 00:08:51,168 INFO L433 NwaCegarLoop]: 0 DeclaredPredicates, 122 GetRequests, 85 SyntacticMatches, 2 SemanticMatches, 35 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 324 ImplicationChecksByTransitivity, 2.4s TimeCoverageRelationStatistics Valid=250, Invalid=1082, Unknown=0, NotChecked=0, Total=1332 [2024-09-13 00:08:51,169 INFO L434 NwaCegarLoop]: 37 mSDtfsCounter, 46 mSDsluCounter, 451 mSDsCounter, 0 mSdLazyCounter, 355 mSolverCounterSat, 38 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 47 SdHoareTripleChecker+Valid, 488 SdHoareTripleChecker+Invalid, 393 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 38 IncrementalHoareTripleChecker+Valid, 355 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2024-09-13 00:08:51,169 INFO L435 NwaCegarLoop]: SdHoareTripleChecker [47 Valid, 488 Invalid, 393 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [38 Valid, 355 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2024-09-13 00:08:51,171 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 51 states. [2024-09-13 00:08:51,195 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 51 to 49. [2024-09-13 00:08:51,195 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 49 states, 36 states have (on average 1.0277777777777777) internal successors, (37), 36 states have internal predecessors, (37), 7 states have call successors, (7), 7 states have call predecessors, (7), 5 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) [2024-09-13 00:08:51,196 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 49 states to 49 states and 49 transitions. [2024-09-13 00:08:51,196 INFO L78 Accepts]: Start accepts. Automaton has 49 states and 49 transitions. Word has length 48 [2024-09-13 00:08:51,197 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-09-13 00:08:51,197 INFO L474 AbstractCegarLoop]: Abstraction has 49 states and 49 transitions. [2024-09-13 00:08:51,197 INFO L475 AbstractCegarLoop]: INTERPOLANT automaton has has 33 states, 33 states have (on average 2.0303030303030303) internal successors, (67), 30 states have internal predecessors, (67), 9 states have call successors, (13), 3 states have call predecessors, (13), 3 states have return successors, (12), 11 states have call predecessors, (12), 9 states have call successors, (12) [2024-09-13 00:08:51,200 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-13 00:08:51,201 INFO L276 IsEmpty]: Start isEmpty. Operand 49 states and 49 transitions. [2024-09-13 00:08:51,201 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 49 [2024-09-13 00:08:51,201 INFO L208 NwaCegarLoop]: Found error trace [2024-09-13 00:08:51,201 INFO L216 NwaCegarLoop]: trace histogram [4, 4, 4, 4, 3, 3, 3, 3, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-09-13 00:08:51,221 INFO L552 MonitoredProcess]: [MP /storage/repos/certificate-witnesses-artifact/automizer/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Ended with exit code 0 [2024-09-13 00:08:51,402 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-13 00:08:51,402 INFO L399 AbstractCegarLoop]: === Iteration 8 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-09-13 00:08:51,403 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-13 00:08:51,403 INFO L85 PathProgramCache]: Analyzing trace with hash 270173566, now seen corresponding path program 1 times [2024-09-13 00:08:51,403 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-09-13 00:08:51,403 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [190964755] [2024-09-13 00:08:51,403 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-09-13 00:08:51,403 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-09-13 00:08:51,472 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unknown [2024-09-13 00:08:51,474 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [665352163] [2024-09-13 00:08:51,474 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-09-13 00:08:51,474 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-09-13 00:08:51,475 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/certificate-witnesses-artifact/automizer/z3 [2024-09-13 00:08:51,476 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-13 00:08:51,477 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-13 00:08:51,701 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-13 00:08:51,703 INFO L262 TraceCheckSpWp]: Trace formula consists of 122 conjuncts, 59 conjuncts are in the unsatisfiable core [2024-09-13 00:08:51,705 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2024-09-13 00:08:52,432 INFO L134 CoverageAnalysis]: Checked inductivity of 48 backedges. 4 proven. 38 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2024-09-13 00:08:52,432 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2024-09-13 00:10:16,752 WARN L293 SmtUtils]: Spent 9.59s on a formula simplification that was a NOOP. DAG size: 46 (called from [L 391] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2024-09-13 00:11:15,297 WARN L293 SmtUtils]: Spent 15.82s on a formula simplification that was a NOOP. DAG size: 46 (called from [L 391] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2024-09-13 00:11:26,621 INFO L134 CoverageAnalysis]: Checked inductivity of 48 backedges. 10 proven. 32 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2024-09-13 00:11:26,622 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-09-13 00:11:26,622 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [190964755] [2024-09-13 00:11:26,622 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2024-09-13 00:11:26,622 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [665352163] [2024-09-13 00:11:26,622 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [665352163] provided 0 perfect and 2 imperfect interpolant sequences [2024-09-13 00:11:26,622 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-09-13 00:11:26,622 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [18, 17] total 30 [2024-09-13 00:11:26,622 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [556613882] [2024-09-13 00:11:26,622 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-09-13 00:11:26,623 INFO L551 AbstractCegarLoop]: INTERPOLANT automaton has 30 states [2024-09-13 00:11:26,623 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-09-13 00:11:26,624 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 30 interpolants. [2024-09-13 00:11:26,624 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=170, Invalid=695, Unknown=5, NotChecked=0, Total=870 [2024-09-13 00:11:26,624 INFO L87 Difference]: Start difference. First operand 49 states and 49 transitions. Second operand has 30 states, 30 states have (on average 1.9) internal successors, (57), 26 states have internal predecessors, (57), 9 states have call successors, (11), 2 states have call predecessors, (11), 3 states have return successors, (9), 8 states have call predecessors, (9), 7 states have call successors, (9) [2024-09-13 00:11:27,872 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.08s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=true, quantifiers [] [2024-09-13 00:11:34,994 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-09-13 00:11:34,994 INFO L93 Difference]: Finished difference Result 51 states and 51 transitions. [2024-09-13 00:11:34,994 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2024-09-13 00:11:34,995 INFO L78 Accepts]: Start accepts. Automaton has has 30 states, 30 states have (on average 1.9) internal successors, (57), 26 states have internal predecessors, (57), 9 states have call successors, (11), 2 states have call predecessors, (11), 3 states have return successors, (9), 8 states have call predecessors, (9), 7 states have call successors, (9) Word has length 48 [2024-09-13 00:11:34,995 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-09-13 00:11:34,995 INFO L225 Difference]: With dead ends: 51 [2024-09-13 00:11:34,995 INFO L226 Difference]: Without dead ends: 0 [2024-09-13 00:11:34,996 INFO L433 NwaCegarLoop]: 0 DeclaredPredicates, 98 GetRequests, 65 SyntacticMatches, 2 SemanticMatches, 31 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 232 ImplicationChecksByTransitivity, 78.9s TimeCoverageRelationStatistics Valid=207, Invalid=844, Unknown=5, NotChecked=0, Total=1056 [2024-09-13 00:11:34,996 INFO L434 NwaCegarLoop]: 22 mSDtfsCounter, 21 mSDsluCounter, 290 mSDsCounter, 0 mSdLazyCounter, 294 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 7.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 21 SdHoareTripleChecker+Valid, 312 SdHoareTripleChecker+Invalid, 296 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 294 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 7.5s IncrementalHoareTripleChecker+Time [2024-09-13 00:11:34,997 INFO L435 NwaCegarLoop]: SdHoareTripleChecker [21 Valid, 312 Invalid, 296 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 294 Invalid, 0 Unknown, 0 Unchecked, 7.5s Time] [2024-09-13 00:11:34,997 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2024-09-13 00:11:34,997 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2024-09-13 00:11:34,997 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 0 states, 0 states have (on average 0.0) internal successors, (0), 0 states have internal predecessors, (0), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-09-13 00:11:34,997 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2024-09-13 00:11:34,997 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 48 [2024-09-13 00:11:34,997 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-09-13 00:11:34,997 INFO L474 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2024-09-13 00:11:34,998 INFO L475 AbstractCegarLoop]: INTERPOLANT automaton has has 30 states, 30 states have (on average 1.9) internal successors, (57), 26 states have internal predecessors, (57), 9 states have call successors, (11), 2 states have call predecessors, (11), 3 states have return successors, (9), 8 states have call predecessors, (9), 7 states have call successors, (9) [2024-09-13 00:11:34,998 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-13 00:11:34,998 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2024-09-13 00:11:34,998 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2024-09-13 00:11:35,000 INFO L785 garLoopResultBuilder]: Registering result SAFE for location __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2024-09-13 00:11:35,009 INFO L552 MonitoredProcess]: [MP /storage/repos/certificate-witnesses-artifact/automizer/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Ended with exit code 0 [2024-09-13 00:11:35,201 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-13 00:11:35,204 INFO L408 BasicCegarLoop]: Path program histogram: [4, 1, 1, 1, 1] [2024-09-13 00:11:35,206 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2024-09-13 00:11:37,811 INFO L165 ceAbstractionStarter]: Computing trace abstraction results [2024-09-13 00:11:37,836 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 13.09 12:11:37 BoogieIcfgContainer [2024-09-13 00:11:37,839 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2024-09-13 00:11:37,840 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2024-09-13 00:11:37,840 INFO L270 PluginConnector]: Initializing Witness Printer... [2024-09-13 00:11:37,840 INFO L274 PluginConnector]: Witness Printer initialized [2024-09-13 00:11:37,840 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 13.09 12:03:16" (3/4) ... [2024-09-13 00:11:37,842 INFO L139 WitnessPrinter]: Generating witness for correct program [2024-09-13 00:11:37,845 INFO L361 RCFGBacktranslator]: Ignoring RootEdge to procedure ULTIMATE.init [2024-09-13 00:11:37,845 INFO L361 RCFGBacktranslator]: Ignoring RootEdge to procedure assume_abort_if_not [2024-09-13 00:11:37,846 INFO L361 RCFGBacktranslator]: Ignoring RootEdge to procedure main [2024-09-13 00:11:37,846 INFO L361 RCFGBacktranslator]: Ignoring RootEdge to procedure __VERIFIER_assert [2024-09-13 00:11:37,848 INFO L896 BoogieBacktranslator]: Reduced CFG by removing 13 nodes and edges [2024-09-13 00:11:37,849 INFO L896 BoogieBacktranslator]: Reduced CFG by removing 6 nodes and edges [2024-09-13 00:11:37,849 INFO L896 BoogieBacktranslator]: Reduced CFG by removing 3 nodes and edges [2024-09-13 00:11:37,849 INFO L896 BoogieBacktranslator]: Reduced CFG by removing 1 nodes and edges [2024-09-13 00:11:37,927 INFO L149 WitnessManager]: Wrote witness to /storage/repos/certificate-witnesses-artifact/automizer/witness.graphml [2024-09-13 00:11:37,928 INFO L149 WitnessManager]: Wrote witness to /storage/repos/certificate-witnesses-artifact/automizer/witness.yml [2024-09-13 00:11:37,928 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2024-09-13 00:11:37,928 INFO L158 Benchmark]: Toolchain (without parser) took 501588.16ms. Allocated memory was 157.3MB in the beginning and 192.9MB in the end (delta: 35.7MB). Free memory was 109.9MB in the beginning and 82.2MB in the end (delta: 27.8MB). Peak memory consumption was 66.4MB. Max. memory is 16.1GB. [2024-09-13 00:11:37,929 INFO L158 Benchmark]: CDTParser took 0.21ms. Allocated memory is still 157.3MB. Free memory is still 119.5MB. There was no memory consumed. Max. memory is 16.1GB. [2024-09-13 00:11:37,929 INFO L158 Benchmark]: CACSL2BoogieTranslator took 232.70ms. Allocated memory is still 157.3MB. Free memory was 109.3MB in the beginning and 97.9MB in the end (delta: 11.4MB). Peak memory consumption was 10.5MB. Max. memory is 16.1GB. [2024-09-13 00:11:37,930 INFO L158 Benchmark]: Boogie Procedure Inliner took 28.90ms. Allocated memory is still 157.3MB. Free memory was 97.9MB in the beginning and 96.8MB in the end (delta: 1.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2024-09-13 00:11:37,930 INFO L158 Benchmark]: Boogie Preprocessor took 35.83ms. Allocated memory is still 157.3MB. Free memory was 96.8MB in the beginning and 95.3MB in the end (delta: 1.5MB). There was no memory consumed. Max. memory is 16.1GB. [2024-09-13 00:11:37,930 INFO L158 Benchmark]: RCFGBuilder took 358.00ms. Allocated memory is still 157.3MB. Free memory was 95.3MB in the beginning and 82.7MB in the end (delta: 12.6MB). Peak memory consumption was 12.6MB. Max. memory is 16.1GB. [2024-09-13 00:11:37,931 INFO L158 Benchmark]: TraceAbstraction took 500837.88ms. Allocated memory was 157.3MB in the beginning and 192.9MB in the end (delta: 35.7MB). Free memory was 82.1MB in the beginning and 87.4MB in the end (delta: -5.3MB). Peak memory consumption was 72.8MB. Max. memory is 16.1GB. [2024-09-13 00:11:37,931 INFO L158 Benchmark]: Witness Printer took 88.40ms. Allocated memory is still 192.9MB. Free memory was 87.4MB in the beginning and 82.2MB in the end (delta: 5.3MB). Peak memory consumption was 6.3MB. Max. memory is 16.1GB. [2024-09-13 00:11:37,932 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.21ms. Allocated memory is still 157.3MB. Free memory is still 119.5MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 232.70ms. Allocated memory is still 157.3MB. Free memory was 109.3MB in the beginning and 97.9MB in the end (delta: 11.4MB). Peak memory consumption was 10.5MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 28.90ms. Allocated memory is still 157.3MB. Free memory was 97.9MB in the beginning and 96.8MB in the end (delta: 1.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * Boogie Preprocessor took 35.83ms. Allocated memory is still 157.3MB. Free memory was 96.8MB in the beginning and 95.3MB in the end (delta: 1.5MB). There was no memory consumed. Max. memory is 16.1GB. * RCFGBuilder took 358.00ms. Allocated memory is still 157.3MB. Free memory was 95.3MB in the beginning and 82.7MB in the end (delta: 12.6MB). Peak memory consumption was 12.6MB. Max. memory is 16.1GB. * TraceAbstraction took 500837.88ms. Allocated memory was 157.3MB in the beginning and 192.9MB in the end (delta: 35.7MB). Free memory was 82.1MB in the beginning and 87.4MB in the end (delta: -5.3MB). Peak memory consumption was 72.8MB. Max. memory is 16.1GB. * Witness Printer took 88.40ms. Allocated memory is still 192.9MB. Free memory was 87.4MB in the beginning and 82.2MB in the end (delta: 5.3MB). Peak memory consumption was 6.3MB. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: ErrorAutomatonStatistics NumberErrorTraces: 0, NumberStatementsAllTraces: 0, NumberRelevantStatements: 0, 0.0s ErrorAutomatonConstructionTimeTotal, 0.0s FaulLocalizationTime, NumberStatementsFirstTrace: -1, TraceLengthAvg: 0, 0.0s ErrorAutomatonConstructionTimeAvg, 0.0s ErrorAutomatonDifferenceTimeAvg, 0.0s ErrorAutomatonDifferenceTimeTotal, NumberOfNoEnhancement: 0, NumberOfFiniteEnhancement: 0, NumberOfInfiniteEnhancement: 0 - PositiveResult [Line: 21]: 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, 28 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 498.1s, OverallIterations: 8, TraceHistogramMax: 4, PathProgramHistogramMax: 4, EmptinessCheckTime: 0.0s, AutomataDifference: 309.9s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 19 mSolverCounterUnknown, 172 SdHoareTripleChecker+Valid, 108.6s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 164 mSDsluCounter, 1559 SdHoareTripleChecker+Invalid, 108.1s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 1362 mSDsCounter, 107 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 1387 IncrementalHoareTripleChecker+Invalid, 1513 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 107 mSolverCounterUnsat, 197 mSDtfsCounter, 1387 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 19 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 475 GetRequests, 327 SyntacticMatches, 7 SemanticMatches, 141 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1017 ImplicationChecksByTransitivity, 300.5s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=83occurred in iteration=6, InterpolantAutomatonStates: 91, 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, 14 StatesRemovedByMinimization, 3 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 1.0s SatisfiabilityAnalysisTime, 185.3s InterpolantComputationTime, 475 NumberOfCodeBlocks, 475 NumberOfCodeBlocksAsserted, 18 NumberOfCheckSat, 499 ConstructedInterpolants, 0 QuantifiedInterpolants, 6079 SizeOfPredicates, 15 NumberOfNonLiveVariables, 580 ConjunctsInSsa, 195 ConjunctsInUnsatCore, 14 InterpolantComputations, 3 PerfectInterpolantSequences, 176/348 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: (((((((((b == 2) && (A == r)) && (1 <= (r % 4294967296))) && ((A % 4294967296) <= 5)) && (q == 0)) && (B == 1)) || (((((b == 1) && (A == r)) && ((A % 4294967296) <= 5)) && (q == 0)) && (B == 1))) || ((((((b == 4) && (A == r)) && (1 <= (r % 4294967296))) && ((A % 4294967296) <= 5)) && (q == 0)) && (B == 1))) || ((((((A == r) && (4 <= (r % 4294967296))) && (b == 8)) && ((A % 4294967296) <= 5)) && (q == 0)) && (B == 1))) - InvariantResult [Line: 38]: Loop Invariant Derived loop invariant: (((((((((((((((b == 1) && (A == r)) && (q == 0)) && (B == 1)) || ((((((b == 2) && (A == ((long long) r + 2))) && ((((long long) r + 2) % 4294967296) <= 3)) && (B == 1)) && (2 <= (((long long) r + 2) % 4294967296))) && (q == 1))) || (((((b == 2) && (A == r)) && ((r % 4294967296) == 1)) && (q == 0)) && (B == 1))) || (((((((B % 4294967296) == 1) && (b == 1)) && (q == 2)) && ((((long long) r + 2) % 4294967296) == (A % 4294967296))) && ((((long long) r + 2) % 4294967296) <= 3)) && (2 <= (((long long) r + 2) % 4294967296)))) || (((((((B % 4294967296) == 1) && (b == 1)) && (q == 3)) && (2 <= (((long long) r + 3) % 4294967296))) && ((((long long) r + 3) % 4294967296) <= 3)) && ((A % 4294967296) == (((long long) r + 3) % 4294967296)))) || ((((((((B % 4294967296) == 1) && (b == 1)) && (((long long) r + 4) == A)) && (((A / 4294967296) * 4294967296) <= r)) && ((A % 4294967296) <= 5)) && (r <= (5 + ((A / 4294967296) * 4294967296)))) && (q == 4))) || ((((((b == 4) && (A == r)) && (1 <= (r % 4294967296))) && (q == 0)) && (B == 1)) && (r <= (3 + ((r / 4294967296) * 4294967296))))) || ((((((((B % 4294967296) == 1) && (b == 1)) && (5 == q)) && (((A / 4294967296) * 4294967296) <= r)) && ((A % 4294967296) <= 5)) && (r <= (5 + ((A / 4294967296) * 4294967296)))) && (A == (5 + r)))) || ((((((q == 2) && (b == 2)) && (((long long) r + 4) == A)) && (4 <= (A % 4294967296))) && ((A % 4294967296) <= 5)) && (B == 1))) || ((((((A == r) && (4 <= (r % 4294967296))) && (b == 8)) && ((A % 4294967296) <= 5)) && (q == 0)) && (B == 1))) || ((((((((B % 4294967296) == 1) && (b == 1)) && (((A / 4294967296) * 4294967296) <= r)) && ((A % 4294967296) == (((long long) r + 1) % 4294967296))) && ((A % 4294967296) <= 5)) && (r <= (5 + ((A / 4294967296) * 4294967296)))) && (q == 1))) || ((((((b == 4) && (((long long) r + 4) == A)) && (4 <= (A % 4294967296))) && ((A % 4294967296) <= 5)) && (B == 1)) && (q == 1))) - ProcedureContractResult [Line: 15]: Procedure Contract for assume_abort_if_not Derived contract for procedure assume_abort_if_not. Ensures: (\old(cond) != 0) - ProcedureContractResult [Line: 18]: Procedure Contract for __VERIFIER_assert Derived contract for procedure __VERIFIER_assert. Requires: (1 <= \old(cond)) Ensures: (1 <= \old(cond)) RESULT: Ultimate proved your program to be correct! [2024-09-13 00:11:38,143 WARN L435 MonitoredProcess]: [MP /storage/repos/certificate-witnesses-artifact/automizer/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Forcibly destroying the process [2024-09-13 00:11:38,181 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 137 Received shutdown request... --- End real Ultimate output --- Execution finished normally Writing output log to file Ultimate.log Result: TRUE