./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/nla-digbench-scaling/sqrt1-ll_unwindbound50.c --full-output --procedureinliner.inline.calls.to.implemented.procedures NEVER --traceabstraction.positions.where.we.compute.the.hoare.annotation All --witnessprinter.yaml.format.version 2.1 --witnessprinter.generate.graphml.witnesses false --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 6908dde5 Calling Ultimate with: /root/.sdkman/candidates/java/11.0.12-open/bin/java -Dosgi.configuration.area=/storage/repos/certificate-witnesses-artifact/automizer/data/config -Xmx15G -Xms4m -jar /storage/repos/certificate-witnesses-artifact/automizer/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/certificate-witnesses-artifact/automizer/data -tc /storage/repos/certificate-witnesses-artifact/automizer/config/AutomizerReach.xml -i ../sv-benchmarks/c/nla-digbench-scaling/sqrt1-ll_unwindbound50.c -s /storage/repos/certificate-witnesses-artifact/automizer/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/certificate-witnesses-artifact/automizer --witnessprinter.witness.filename witness --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! call(reach_error())) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash 6c37a77a9f4db0db15bb3c5a5baacfcd5e1536d243d9987efda949cfc27e3fb7 --procedureinliner.inline.calls.to.implemented.procedures NEVER --traceabstraction.positions.where.we.compute.the.hoare.annotation All --witnessprinter.yaml.format.version 2.1 --witnessprinter.generate.graphml.witnesses false --- Real Ultimate output --- This is Ultimate 0.2.4-tmp.dk.referee-eval-6908dde-m [2024-09-25 00:03:54,371 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-09-25 00:03:54,441 INFO L114 SettingsManager]: Loading settings from /storage/repos/certificate-witnesses-artifact/automizer/config/svcomp-Reach-32bit-Automizer_Default.epf [2024-09-25 00:03:54,446 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-09-25 00:03:54,446 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-09-25 00:03:54,483 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-09-25 00:03:54,484 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-09-25 00:03:54,485 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-09-25 00:03:54,486 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-09-25 00:03:54,487 INFO L153 SettingsManager]: * Use memory slicer=true [2024-09-25 00:03:54,488 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-09-25 00:03:54,488 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-09-25 00:03:54,489 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-09-25 00:03:54,489 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-09-25 00:03:54,491 INFO L153 SettingsManager]: * Use SBE=true [2024-09-25 00:03:54,492 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-09-25 00:03:54,492 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-09-25 00:03:54,493 INFO L153 SettingsManager]: * sizeof long=4 [2024-09-25 00:03:54,493 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-09-25 00:03:54,493 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-09-25 00:03:54,493 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-09-25 00:03:54,494 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-09-25 00:03:54,494 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-09-25 00:03:54,495 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-09-25 00:03:54,495 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-09-25 00:03:54,495 INFO L153 SettingsManager]: * sizeof long double=12 [2024-09-25 00:03:54,495 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-09-25 00:03:54,496 INFO L153 SettingsManager]: * Use constant arrays=true [2024-09-25 00:03:54,496 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-09-25 00:03:54,497 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-09-25 00:03:54,497 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-09-25 00:03:54,497 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-09-25 00:03:54,497 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-09-25 00:03:54,498 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-09-25 00:03:54,498 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-09-25 00:03:54,498 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-09-25 00:03:54,499 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-09-25 00:03:54,499 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-09-25 00:03:54,499 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-09-25 00:03:54,499 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-09-25 00:03:54,500 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-09-25 00:03:54,500 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-09-25 00:03:54,500 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 -> 6c37a77a9f4db0db15bb3c5a5baacfcd5e1536d243d9987efda949cfc27e3fb7 Applying setting for plugin de.uni_freiburg.informatik.ultimate.boogie.procedureinliner: Inline calls to implemented procedures -> NEVER Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: Positions where we compute the Hoare Annotation -> All Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: YAML Format version -> 2.1 Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Generate GraphML witnesses -> false [2024-09-25 00:03:54,746 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-09-25 00:03:54,771 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-09-25 00:03:54,775 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-09-25 00:03:54,776 INFO L270 PluginConnector]: Initializing CDTParser... [2024-09-25 00:03:54,776 INFO L274 PluginConnector]: CDTParser initialized [2024-09-25 00:03:54,778 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/certificate-witnesses-artifact/automizer/../sv-benchmarks/c/nla-digbench-scaling/sqrt1-ll_unwindbound50.c [2024-09-25 00:03:56,240 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-09-25 00:03:56,439 INFO L384 CDTParser]: Found 1 translation units. [2024-09-25 00:03:56,439 INFO L180 CDTParser]: Scanning /storage/repos/certificate-witnesses-artifact/sv-benchmarks/c/nla-digbench-scaling/sqrt1-ll_unwindbound50.c [2024-09-25 00:03:56,446 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/certificate-witnesses-artifact/automizer/data/d73d230b5/3b3e3e1017464e529feb37d3a2d33dca/FLAGc2460712c [2024-09-25 00:03:56,461 INFO L435 CDTParser]: Successfully deleted /storage/repos/certificate-witnesses-artifact/automizer/data/d73d230b5/3b3e3e1017464e529feb37d3a2d33dca [2024-09-25 00:03:56,464 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-09-25 00:03:56,465 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-09-25 00:03:56,466 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-09-25 00:03:56,466 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-09-25 00:03:56,473 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-09-25 00:03:56,473 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 25.09 12:03:56" (1/1) ... [2024-09-25 00:03:56,476 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@7f932ae and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.09 12:03:56, skipping insertion in model container [2024-09-25 00:03:56,476 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 25.09 12:03:56" (1/1) ... [2024-09-25 00:03:56,495 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-09-25 00:03:56,657 WARN L248 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/certificate-witnesses-artifact/sv-benchmarks/c/nla-digbench-scaling/sqrt1-ll_unwindbound50.c[520,533] [2024-09-25 00:03:56,680 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-09-25 00:03:56,714 INFO L200 MainTranslator]: Completed pre-run [2024-09-25 00:03:56,726 WARN L248 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/certificate-witnesses-artifact/sv-benchmarks/c/nla-digbench-scaling/sqrt1-ll_unwindbound50.c[520,533] [2024-09-25 00:03:56,731 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-09-25 00:03:56,744 INFO L204 MainTranslator]: Completed translation [2024-09-25 00:03:56,744 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.09 12:03:56 WrapperNode [2024-09-25 00:03:56,745 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-09-25 00:03:56,746 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-09-25 00:03:56,746 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-09-25 00:03:56,746 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-09-25 00:03:56,761 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.09 12:03:56" (1/1) ... [2024-09-25 00:03:56,766 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.09 12:03:56" (1/1) ... [2024-09-25 00:03:56,772 INFO L138 Inliner]: procedures = 14, calls = 13, calls flagged for inlining = 0, calls inlined = 0, statements flattened = 0 [2024-09-25 00:03:56,772 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-09-25 00:03:56,773 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-09-25 00:03:56,773 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-09-25 00:03:56,773 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-09-25 00:03:56,781 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.09 12:03:56" (1/1) ... [2024-09-25 00:03:56,781 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.09 12:03:56" (1/1) ... [2024-09-25 00:03:56,782 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.09 12:03:56" (1/1) ... [2024-09-25 00:03:56,794 INFO L175 MemorySlicer]: Split 2 memory accesses to 1 slices as follows [2]. 100 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2]. The 0 writes are split as follows [0]. [2024-09-25 00:03:56,795 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.09 12:03:56" (1/1) ... [2024-09-25 00:03:56,795 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.09 12:03:56" (1/1) ... [2024-09-25 00:03:56,797 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.09 12:03:56" (1/1) ... [2024-09-25 00:03:56,803 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.09 12:03:56" (1/1) ... [2024-09-25 00:03:56,804 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.09 12:03:56" (1/1) ... [2024-09-25 00:03:56,805 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.09 12:03:56" (1/1) ... [2024-09-25 00:03:56,806 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-09-25 00:03:56,811 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-09-25 00:03:56,811 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-09-25 00:03:56,811 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-09-25 00:03:56,812 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.09 12:03:56" (1/1) ... [2024-09-25 00:03:56,817 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-09-25 00:03:56,831 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/certificate-witnesses-artifact/automizer/z3 [2024-09-25 00:03:56,844 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/certificate-witnesses-artifact/automizer/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2024-09-25 00:03:56,847 INFO L327 MonitoredProcess]: [MP /storage/repos/certificate-witnesses-artifact/automizer/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2024-09-25 00:03:56,884 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-09-25 00:03:56,885 INFO L130 BoogieDeclarations]: Found specification of procedure main [2024-09-25 00:03:56,885 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2024-09-25 00:03:56,885 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-09-25 00:03:56,885 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2024-09-25 00:03:56,885 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2024-09-25 00:03:56,886 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-09-25 00:03:56,886 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-09-25 00:03:56,886 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2024-09-25 00:03:56,886 INFO L138 BoogieDeclarations]: Found implementation of procedure __VERIFIER_assert [2024-09-25 00:03:56,937 INFO L241 CfgBuilder]: Building ICFG [2024-09-25 00:03:56,939 INFO L267 CfgBuilder]: Building CFG for each procedure with an implementation [2024-09-25 00:03:57,062 INFO L? ?]: Removed 4 outVars from TransFormulas that were not future-live. [2024-09-25 00:03:57,062 INFO L290 CfgBuilder]: Performing block encoding [2024-09-25 00:03:57,080 INFO L312 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-09-25 00:03:57,080 INFO L317 CfgBuilder]: Removed 1 assume(true) statements. [2024-09-25 00:03:57,081 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 25.09 12:03:57 BoogieIcfgContainer [2024-09-25 00:03:57,081 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-09-25 00:03:57,084 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-09-25 00:03:57,084 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-09-25 00:03:57,087 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-09-25 00:03:57,088 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 25.09 12:03:56" (1/3) ... [2024-09-25 00:03:57,089 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1772200c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 25.09 12:03:57, skipping insertion in model container [2024-09-25 00:03:57,090 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.09 12:03:56" (2/3) ... [2024-09-25 00:03:57,090 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1772200c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 25.09 12:03:57, skipping insertion in model container [2024-09-25 00:03:57,090 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 25.09 12:03:57" (3/3) ... [2024-09-25 00:03:57,091 INFO L112 eAbstractionObserver]: Analyzing ICFG sqrt1-ll_unwindbound50.c [2024-09-25 00:03:57,109 INFO L209 ceAbstractionStarter]: Automizer settings: Hoare:All NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-09-25 00:03:57,109 INFO L149 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-09-25 00:03:57,159 INFO L335 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-09-25 00:03:57,165 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;@1f74e6b8, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-09-25 00:03:57,165 INFO L337 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-09-25 00:03:57,169 INFO L276 IsEmpty]: Start isEmpty. Operand has 24 states, 11 states have (on average 1.4545454545454546) internal successors, (16), 12 states have internal predecessors, (16), 8 states have call successors, (8), 3 states have call predecessors, (8), 3 states have return successors, (8), 8 states have call predecessors, (8), 8 states have call successors, (8) [2024-09-25 00:03:57,175 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2024-09-25 00:03:57,175 INFO L208 NwaCegarLoop]: Found error trace [2024-09-25 00:03:57,176 INFO L216 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-09-25 00:03:57,176 INFO L399 AbstractCegarLoop]: === Iteration 1 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-09-25 00:03:57,181 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-25 00:03:57,182 INFO L85 PathProgramCache]: Analyzing trace with hash -97680429, now seen corresponding path program 1 times [2024-09-25 00:03:57,191 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-09-25 00:03:57,191 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2062476941] [2024-09-25 00:03:57,192 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-09-25 00:03:57,192 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-09-25 00:03:57,296 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-25 00:03:57,358 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2024-09-25 00:03:57,367 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-25 00:03:57,378 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-25 00:03:57,379 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-09-25 00:03:57,379 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2062476941] [2024-09-25 00:03:57,380 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2062476941] provided 1 perfect and 0 imperfect interpolant sequences [2024-09-25 00:03:57,380 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-09-25 00:03:57,380 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-09-25 00:03:57,382 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [294874159] [2024-09-25 00:03:57,383 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-09-25 00:03:57,388 INFO L551 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-09-25 00:03:57,388 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-09-25 00:03:57,411 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-09-25 00:03:57,412 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-09-25 00:03:57,414 INFO L87 Difference]: Start difference. First operand has 24 states, 11 states have (on average 1.4545454545454546) internal successors, (16), 12 states have internal predecessors, (16), 8 states have call successors, (8), 3 states have call predecessors, (8), 3 states have return successors, (8), 8 states have call predecessors, (8), 8 states have call successors, (8) Second operand has 3 states, 3 states have (on average 2.0) internal successors, (6), 2 states have internal predecessors, (6), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-09-25 00:03:57,532 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-09-25 00:03:57,534 INFO L93 Difference]: Finished difference Result 44 states and 67 transitions. [2024-09-25 00:03:57,535 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-09-25 00:03:57,537 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 2.0) internal successors, (6), 2 states have internal predecessors, (6), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 10 [2024-09-25 00:03:57,537 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-09-25 00:03:57,544 INFO L225 Difference]: With dead ends: 44 [2024-09-25 00:03:57,544 INFO L226 Difference]: Without dead ends: 21 [2024-09-25 00:03:57,547 INFO L433 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-09-25 00:03:57,551 INFO L434 NwaCegarLoop]: 22 mSDtfsCounter, 6 mSDsluCounter, 7 mSDsCounter, 0 mSdLazyCounter, 17 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 6 SdHoareTripleChecker+Valid, 29 SdHoareTripleChecker+Invalid, 24 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 17 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-09-25 00:03:57,552 INFO L435 NwaCegarLoop]: SdHoareTripleChecker [6 Valid, 29 Invalid, 24 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 17 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-09-25 00:03:57,566 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 21 states. [2024-09-25 00:03:57,582 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 21 to 20. [2024-09-25 00:03:57,584 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 20 states, 9 states have (on average 1.3333333333333333) internal successors, (12), 10 states have internal predecessors, (12), 8 states have call successors, (8), 3 states have call predecessors, (8), 2 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2024-09-25 00:03:57,585 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20 states to 20 states and 26 transitions. [2024-09-25 00:03:57,587 INFO L78 Accepts]: Start accepts. Automaton has 20 states and 26 transitions. Word has length 10 [2024-09-25 00:03:57,588 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-09-25 00:03:57,588 INFO L474 AbstractCegarLoop]: Abstraction has 20 states and 26 transitions. [2024-09-25 00:03:57,588 INFO L475 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 2.0) internal successors, (6), 2 states have internal predecessors, (6), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-09-25 00:03:57,589 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-25 00:03:57,589 INFO L276 IsEmpty]: Start isEmpty. Operand 20 states and 26 transitions. [2024-09-25 00:03:57,590 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2024-09-25 00:03:57,590 INFO L208 NwaCegarLoop]: Found error trace [2024-09-25 00:03:57,590 INFO L216 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-09-25 00:03:57,591 WARN L456 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-09-25 00:03:57,591 INFO L399 AbstractCegarLoop]: === Iteration 2 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-09-25 00:03:57,592 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-25 00:03:57,592 INFO L85 PathProgramCache]: Analyzing trace with hash 801118595, now seen corresponding path program 1 times [2024-09-25 00:03:57,592 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-09-25 00:03:57,592 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1227325387] [2024-09-25 00:03:57,592 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-09-25 00:03:57,593 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-09-25 00:03:57,610 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-25 00:03:57,756 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2024-09-25 00:03:57,764 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-25 00:03:57,777 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-25 00:03:57,777 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-09-25 00:03:57,777 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1227325387] [2024-09-25 00:03:57,778 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1227325387] provided 1 perfect and 0 imperfect interpolant sequences [2024-09-25 00:03:57,778 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-09-25 00:03:57,778 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-09-25 00:03:57,778 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [72479631] [2024-09-25 00:03:57,778 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-09-25 00:03:57,779 INFO L551 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-09-25 00:03:57,780 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-09-25 00:03:57,781 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-09-25 00:03:57,781 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-09-25 00:03:57,781 INFO L87 Difference]: Start difference. First operand 20 states and 26 transitions. Second operand has 5 states, 4 states have (on average 1.75) internal successors, (7), 3 states have internal predecessors, (7), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-09-25 00:03:57,887 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-09-25 00:03:57,888 INFO L93 Difference]: Finished difference Result 31 states and 39 transitions. [2024-09-25 00:03:57,888 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-09-25 00:03:57,888 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 1.75) internal successors, (7), 3 states have internal predecessors, (7), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 11 [2024-09-25 00:03:57,889 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-09-25 00:03:57,889 INFO L225 Difference]: With dead ends: 31 [2024-09-25 00:03:57,889 INFO L226 Difference]: Without dead ends: 22 [2024-09-25 00:03:57,890 INFO L433 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 3 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-25 00:03:57,891 INFO L434 NwaCegarLoop]: 18 mSDtfsCounter, 6 mSDsluCounter, 25 mSDsCounter, 0 mSdLazyCounter, 43 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 6 SdHoareTripleChecker+Valid, 43 SdHoareTripleChecker+Invalid, 50 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 43 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-09-25 00:03:57,893 INFO L435 NwaCegarLoop]: SdHoareTripleChecker [6 Valid, 43 Invalid, 50 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 43 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-09-25 00:03:57,894 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 22 states. [2024-09-25 00:03:57,900 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 22 to 22. [2024-09-25 00:03:57,901 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 22 states, 11 states have (on average 1.2727272727272727) internal successors, (14), 12 states have internal predecessors, (14), 8 states have call successors, (8), 3 states have call predecessors, (8), 2 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2024-09-25 00:03:57,901 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 22 states to 22 states and 28 transitions. [2024-09-25 00:03:57,902 INFO L78 Accepts]: Start accepts. Automaton has 22 states and 28 transitions. Word has length 11 [2024-09-25 00:03:57,902 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-09-25 00:03:57,902 INFO L474 AbstractCegarLoop]: Abstraction has 22 states and 28 transitions. [2024-09-25 00:03:57,905 INFO L475 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 1.75) internal successors, (7), 3 states have internal predecessors, (7), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-09-25 00:03:57,906 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-25 00:03:57,907 INFO L276 IsEmpty]: Start isEmpty. Operand 22 states and 28 transitions. [2024-09-25 00:03:57,907 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2024-09-25 00:03:57,908 INFO L208 NwaCegarLoop]: Found error trace [2024-09-25 00:03:57,908 INFO L216 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-09-25 00:03:57,908 WARN L456 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-09-25 00:03:57,909 INFO L399 AbstractCegarLoop]: === Iteration 3 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-09-25 00:03:57,909 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-25 00:03:57,910 INFO L85 PathProgramCache]: Analyzing trace with hash 802786891, now seen corresponding path program 1 times [2024-09-25 00:03:57,910 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-09-25 00:03:57,910 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [624625916] [2024-09-25 00:03:57,910 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-09-25 00:03:57,910 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-09-25 00:03:57,929 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-25 00:03:58,128 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2024-09-25 00:03:58,130 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-25 00:03:58,135 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-25 00:03:58,136 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-09-25 00:03:58,136 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [624625916] [2024-09-25 00:03:58,136 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [624625916] provided 1 perfect and 0 imperfect interpolant sequences [2024-09-25 00:03:58,136 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-09-25 00:03:58,136 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-09-25 00:03:58,136 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1736475724] [2024-09-25 00:03:58,137 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-09-25 00:03:58,137 INFO L551 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-09-25 00:03:58,139 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-09-25 00:03:58,139 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-09-25 00:03:58,140 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2024-09-25 00:03:58,140 INFO L87 Difference]: Start difference. First operand 22 states and 28 transitions. Second operand has 6 states, 6 states have (on average 1.1666666666666667) internal successors, (7), 4 states have internal predecessors, (7), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-09-25 00:03:58,282 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-09-25 00:03:58,282 INFO L93 Difference]: Finished difference Result 35 states and 46 transitions. [2024-09-25 00:03:58,282 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-09-25 00:03:58,283 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 1.1666666666666667) internal successors, (7), 4 states have internal predecessors, (7), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 11 [2024-09-25 00:03:58,283 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-09-25 00:03:58,284 INFO L225 Difference]: With dead ends: 35 [2024-09-25 00:03:58,284 INFO L226 Difference]: Without dead ends: 33 [2024-09-25 00:03:58,284 INFO L433 NwaCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=23, Invalid=49, Unknown=0, NotChecked=0, Total=72 [2024-09-25 00:03:58,285 INFO L434 NwaCegarLoop]: 16 mSDtfsCounter, 13 mSDsluCounter, 37 mSDsCounter, 0 mSdLazyCounter, 62 mSolverCounterSat, 14 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 18 SdHoareTripleChecker+Valid, 53 SdHoareTripleChecker+Invalid, 76 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 14 IncrementalHoareTripleChecker+Valid, 62 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-09-25 00:03:58,286 INFO L435 NwaCegarLoop]: SdHoareTripleChecker [18 Valid, 53 Invalid, 76 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [14 Valid, 62 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-09-25 00:03:58,290 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 33 states. [2024-09-25 00:03:58,298 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 33 to 31. [2024-09-25 00:03:58,299 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 31 states, 15 states have (on average 1.2666666666666666) internal successors, (19), 17 states have internal predecessors, (19), 12 states have call successors, (12), 4 states have call predecessors, (12), 3 states have return successors, (10), 9 states have call predecessors, (10), 10 states have call successors, (10) [2024-09-25 00:03:58,300 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 31 states to 31 states and 41 transitions. [2024-09-25 00:03:58,300 INFO L78 Accepts]: Start accepts. Automaton has 31 states and 41 transitions. Word has length 11 [2024-09-25 00:03:58,301 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-09-25 00:03:58,301 INFO L474 AbstractCegarLoop]: Abstraction has 31 states and 41 transitions. [2024-09-25 00:03:58,301 INFO L475 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 1.1666666666666667) internal successors, (7), 4 states have internal predecessors, (7), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-09-25 00:03:58,301 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-25 00:03:58,302 INFO L276 IsEmpty]: Start isEmpty. Operand 31 states and 41 transitions. [2024-09-25 00:03:58,302 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2024-09-25 00:03:58,302 INFO L208 NwaCegarLoop]: Found error trace [2024-09-25 00:03:58,302 INFO L216 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-09-25 00:03:58,303 WARN L456 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-09-25 00:03:58,303 INFO L399 AbstractCegarLoop]: === Iteration 4 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-09-25 00:03:58,303 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-25 00:03:58,303 INFO L85 PathProgramCache]: Analyzing trace with hash -1280493866, now seen corresponding path program 1 times [2024-09-25 00:03:58,304 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-09-25 00:03:58,304 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1784277853] [2024-09-25 00:03:58,304 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-09-25 00:03:58,304 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-09-25 00:03:58,321 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unknown [2024-09-25 00:03:58,326 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1333117632] [2024-09-25 00:03:58,326 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-09-25 00:03:58,327 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-09-25 00:03:58,327 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/certificate-witnesses-artifact/automizer/z3 [2024-09-25 00:03:58,331 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/certificate-witnesses-artifact/automizer/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-09-25 00:03:58,332 INFO L327 MonitoredProcess]: [MP /storage/repos/certificate-witnesses-artifact/automizer/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2024-09-25 00:03:58,382 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-25 00:03:58,385 INFO L262 TraceCheckSpWp]: Trace formula consists of 65 conjuncts, 7 conjuncts are in the unsatisfiable core [2024-09-25 00:03:58,390 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2024-09-25 00:03:58,466 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-09-25 00:03:58,467 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-09-25 00:03:58,467 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-09-25 00:03:58,468 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1784277853] [2024-09-25 00:03:58,468 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2024-09-25 00:03:58,469 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1333117632] [2024-09-25 00:03:58,469 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1333117632] provided 1 perfect and 0 imperfect interpolant sequences [2024-09-25 00:03:58,469 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-09-25 00:03:58,470 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-09-25 00:03:58,470 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [39879910] [2024-09-25 00:03:58,472 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-09-25 00:03:58,473 INFO L551 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-09-25 00:03:58,473 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-09-25 00:03:58,474 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-09-25 00:03:58,474 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-09-25 00:03:58,474 INFO L87 Difference]: Start difference. First operand 31 states and 41 transitions. Second operand has 5 states, 5 states have (on average 2.0) internal successors, (10), 4 states have internal predecessors, (10), 2 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2024-09-25 00:03:58,523 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-09-25 00:03:58,523 INFO L93 Difference]: Finished difference Result 39 states and 49 transitions. [2024-09-25 00:03:58,524 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-09-25 00:03:58,524 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 2.0) internal successors, (10), 4 states have internal predecessors, (10), 2 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Word has length 16 [2024-09-25 00:03:58,524 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-09-25 00:03:58,525 INFO L225 Difference]: With dead ends: 39 [2024-09-25 00:03:58,525 INFO L226 Difference]: Without dead ends: 37 [2024-09-25 00:03:58,526 INFO L433 NwaCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 12 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-25 00:03:58,527 INFO L434 NwaCegarLoop]: 22 mSDtfsCounter, 4 mSDsluCounter, 56 mSDsCounter, 0 mSdLazyCounter, 33 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 8 SdHoareTripleChecker+Valid, 78 SdHoareTripleChecker+Invalid, 34 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 33 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-09-25 00:03:58,527 INFO L435 NwaCegarLoop]: SdHoareTripleChecker [8 Valid, 78 Invalid, 34 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 33 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-09-25 00:03:58,528 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 37 states. [2024-09-25 00:03:58,539 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 37 to 36. [2024-09-25 00:03:58,540 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 36 states, 18 states have (on average 1.2222222222222223) internal successors, (22), 20 states have internal predecessors, (22), 13 states have call successors, (13), 5 states have call predecessors, (13), 4 states have return successors, (11), 10 states have call predecessors, (11), 11 states have call successors, (11) [2024-09-25 00:03:58,541 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 36 states to 36 states and 46 transitions. [2024-09-25 00:03:58,542 INFO L78 Accepts]: Start accepts. Automaton has 36 states and 46 transitions. Word has length 16 [2024-09-25 00:03:58,542 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-09-25 00:03:58,542 INFO L474 AbstractCegarLoop]: Abstraction has 36 states and 46 transitions. [2024-09-25 00:03:58,542 INFO L475 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 2.0) internal successors, (10), 4 states have internal predecessors, (10), 2 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2024-09-25 00:03:58,543 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-25 00:03:58,543 INFO L276 IsEmpty]: Start isEmpty. Operand 36 states and 46 transitions. [2024-09-25 00:03:58,544 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2024-09-25 00:03:58,544 INFO L208 NwaCegarLoop]: Found error trace [2024-09-25 00:03:58,544 INFO L216 NwaCegarLoop]: trace histogram [3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-09-25 00:03:58,563 INFO L540 MonitoredProcess]: [MP /storage/repos/certificate-witnesses-artifact/automizer/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2024-09-25 00:03:58,744 WARN L456 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3,2 /storage/repos/certificate-witnesses-artifact/automizer/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-09-25 00:03:58,745 INFO L399 AbstractCegarLoop]: === Iteration 5 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-09-25 00:03:58,745 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-25 00:03:58,746 INFO L85 PathProgramCache]: Analyzing trace with hash 925975787, now seen corresponding path program 1 times [2024-09-25 00:03:58,746 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-09-25 00:03:58,746 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1701284327] [2024-09-25 00:03:58,746 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-09-25 00:03:58,746 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-09-25 00:03:58,761 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unknown [2024-09-25 00:03:58,765 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1321756541] [2024-09-25 00:03:58,766 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-09-25 00:03:58,766 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-09-25 00:03:58,767 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/certificate-witnesses-artifact/automizer/z3 [2024-09-25 00:03:58,768 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/certificate-witnesses-artifact/automizer/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-09-25 00:03:58,771 INFO L327 MonitoredProcess]: [MP /storage/repos/certificate-witnesses-artifact/automizer/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2024-09-25 00:03:58,812 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-25 00:03:58,813 INFO L262 TraceCheckSpWp]: Trace formula consists of 74 conjuncts, 7 conjuncts are in the unsatisfiable core [2024-09-25 00:03:58,815 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2024-09-25 00:03:58,868 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2024-09-25 00:03:58,869 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-09-25 00:03:58,869 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-09-25 00:03:58,869 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1701284327] [2024-09-25 00:03:58,869 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2024-09-25 00:03:58,870 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1321756541] [2024-09-25 00:03:58,870 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1321756541] provided 1 perfect and 0 imperfect interpolant sequences [2024-09-25 00:03:58,870 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-09-25 00:03:58,870 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-09-25 00:03:58,870 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [108743377] [2024-09-25 00:03:58,871 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-09-25 00:03:58,871 INFO L551 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-09-25 00:03:58,871 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-09-25 00:03:58,872 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-09-25 00:03:58,872 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-09-25 00:03:58,872 INFO L87 Difference]: Start difference. First operand 36 states and 46 transitions. Second operand has 5 states, 5 states have (on average 2.0) internal successors, (10), 4 states have internal predecessors, (10), 2 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-25 00:03:58,915 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-09-25 00:03:58,915 INFO L93 Difference]: Finished difference Result 43 states and 52 transitions. [2024-09-25 00:03:58,916 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-09-25 00:03:58,916 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 2.0) internal successors, (10), 4 states have internal predecessors, (10), 2 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 21 [2024-09-25 00:03:58,916 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-09-25 00:03:58,917 INFO L225 Difference]: With dead ends: 43 [2024-09-25 00:03:58,917 INFO L226 Difference]: Without dead ends: 38 [2024-09-25 00:03:58,918 INFO L433 NwaCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 17 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-25 00:03:58,919 INFO L434 NwaCegarLoop]: 27 mSDtfsCounter, 4 mSDsluCounter, 66 mSDsCounter, 0 mSdLazyCounter, 31 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 7 SdHoareTripleChecker+Valid, 93 SdHoareTripleChecker+Invalid, 32 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 31 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-09-25 00:03:58,919 INFO L435 NwaCegarLoop]: SdHoareTripleChecker [7 Valid, 93 Invalid, 32 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 31 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-09-25 00:03:58,920 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 38 states. [2024-09-25 00:03:58,926 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 38 to 38. [2024-09-25 00:03:58,926 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 38 states, 21 states have (on average 1.1428571428571428) internal successors, (24), 22 states have internal predecessors, (24), 11 states have call successors, (11), 6 states have call predecessors, (11), 5 states have return successors, (9), 9 states have call predecessors, (9), 9 states have call successors, (9) [2024-09-25 00:03:58,927 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 38 states to 38 states and 44 transitions. [2024-09-25 00:03:58,928 INFO L78 Accepts]: Start accepts. Automaton has 38 states and 44 transitions. Word has length 21 [2024-09-25 00:03:58,928 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-09-25 00:03:58,928 INFO L474 AbstractCegarLoop]: Abstraction has 38 states and 44 transitions. [2024-09-25 00:03:58,928 INFO L475 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 2.0) internal successors, (10), 4 states have internal predecessors, (10), 2 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-25 00:03:58,928 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-25 00:03:58,929 INFO L276 IsEmpty]: Start isEmpty. Operand 38 states and 44 transitions. [2024-09-25 00:03:58,929 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2024-09-25 00:03:58,929 INFO L208 NwaCegarLoop]: Found error trace [2024-09-25 00:03:58,930 INFO L216 NwaCegarLoop]: trace histogram [4, 3, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-09-25 00:03:58,949 INFO L552 MonitoredProcess]: [MP /storage/repos/certificate-witnesses-artifact/automizer/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Ended with exit code 0 [2024-09-25 00:03:59,134 WARN L456 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4,3 /storage/repos/certificate-witnesses-artifact/automizer/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-09-25 00:03:59,135 INFO L399 AbstractCegarLoop]: === Iteration 6 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-09-25 00:03:59,136 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-25 00:03:59,136 INFO L85 PathProgramCache]: Analyzing trace with hash 1435580062, now seen corresponding path program 1 times [2024-09-25 00:03:59,136 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-09-25 00:03:59,136 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1803177142] [2024-09-25 00:03:59,136 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-09-25 00:03:59,136 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-09-25 00:03:59,151 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-25 00:03:59,241 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2024-09-25 00:03:59,244 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-25 00:03:59,252 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2024-09-25 00:03:59,253 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-25 00:03:59,260 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2024-09-25 00:03:59,265 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-25 00:03:59,270 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-09-25 00:03:59,273 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-25 00:03:59,276 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 6 proven. 2 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2024-09-25 00:03:59,280 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-09-25 00:03:59,280 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1803177142] [2024-09-25 00:03:59,281 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1803177142] provided 0 perfect and 1 imperfect interpolant sequences [2024-09-25 00:03:59,281 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [832609394] [2024-09-25 00:03:59,281 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-09-25 00:03:59,281 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-09-25 00:03:59,281 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/certificate-witnesses-artifact/automizer/z3 [2024-09-25 00:03:59,287 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/certificate-witnesses-artifact/automizer/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-09-25 00:03:59,290 INFO L327 MonitoredProcess]: [MP /storage/repos/certificate-witnesses-artifact/automizer/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2024-09-25 00:03:59,337 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-25 00:03:59,338 INFO L262 TraceCheckSpWp]: Trace formula consists of 95 conjuncts, 7 conjuncts are in the unsatisfiable core [2024-09-25 00:03:59,340 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2024-09-25 00:03:59,397 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 6 proven. 2 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2024-09-25 00:03:59,398 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2024-09-25 00:03:59,480 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 6 proven. 2 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2024-09-25 00:03:59,480 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [832609394] provided 0 perfect and 2 imperfect interpolant sequences [2024-09-25 00:03:59,481 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-09-25 00:03:59,481 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 5, 5] total 11 [2024-09-25 00:03:59,481 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1770394753] [2024-09-25 00:03:59,481 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-09-25 00:03:59,482 INFO L551 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2024-09-25 00:03:59,482 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-09-25 00:03:59,483 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2024-09-25 00:03:59,483 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=35, Invalid=75, Unknown=0, NotChecked=0, Total=110 [2024-09-25 00:03:59,483 INFO L87 Difference]: Start difference. First operand 38 states and 44 transitions. Second operand has 11 states, 11 states have (on average 2.4545454545454546) internal successors, (27), 10 states have internal predecessors, (27), 7 states have call successors, (15), 7 states have call predecessors, (15), 5 states have return successors, (12), 5 states have call predecessors, (12), 3 states have call successors, (12) [2024-09-25 00:03:59,677 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-09-25 00:03:59,677 INFO L93 Difference]: Finished difference Result 79 states and 99 transitions. [2024-09-25 00:03:59,677 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2024-09-25 00:03:59,678 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 11 states have (on average 2.4545454545454546) internal successors, (27), 10 states have internal predecessors, (27), 7 states have call successors, (15), 7 states have call predecessors, (15), 5 states have return successors, (12), 5 states have call predecessors, (12), 3 states have call successors, (12) Word has length 29 [2024-09-25 00:03:59,678 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-09-25 00:03:59,679 INFO L225 Difference]: With dead ends: 79 [2024-09-25 00:03:59,679 INFO L226 Difference]: Without dead ends: 70 [2024-09-25 00:03:59,680 INFO L433 NwaCegarLoop]: 0 DeclaredPredicates, 79 GetRequests, 64 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 33 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=77, Invalid=195, Unknown=0, NotChecked=0, Total=272 [2024-09-25 00:03:59,681 INFO L434 NwaCegarLoop]: 13 mSDtfsCounter, 45 mSDsluCounter, 36 mSDsCounter, 0 mSdLazyCounter, 124 mSolverCounterSat, 23 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 52 SdHoareTripleChecker+Valid, 49 SdHoareTripleChecker+Invalid, 147 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 23 IncrementalHoareTripleChecker+Valid, 124 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-09-25 00:03:59,683 INFO L435 NwaCegarLoop]: SdHoareTripleChecker [52 Valid, 49 Invalid, 147 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [23 Valid, 124 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-09-25 00:03:59,684 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 70 states. [2024-09-25 00:03:59,706 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 70 to 66. [2024-09-25 00:03:59,709 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 66 states, 35 states have (on average 1.2) internal successors, (42), 38 states have internal predecessors, (42), 23 states have call successors, (23), 8 states have call predecessors, (23), 7 states have return successors, (19), 19 states have call predecessors, (19), 19 states have call successors, (19) [2024-09-25 00:03:59,711 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 66 states to 66 states and 84 transitions. [2024-09-25 00:03:59,715 INFO L78 Accepts]: Start accepts. Automaton has 66 states and 84 transitions. Word has length 29 [2024-09-25 00:03:59,715 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-09-25 00:03:59,715 INFO L474 AbstractCegarLoop]: Abstraction has 66 states and 84 transitions. [2024-09-25 00:03:59,715 INFO L475 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 2.4545454545454546) internal successors, (27), 10 states have internal predecessors, (27), 7 states have call successors, (15), 7 states have call predecessors, (15), 5 states have return successors, (12), 5 states have call predecessors, (12), 3 states have call successors, (12) [2024-09-25 00:03:59,716 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-25 00:03:59,716 INFO L276 IsEmpty]: Start isEmpty. Operand 66 states and 84 transitions. [2024-09-25 00:03:59,716 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2024-09-25 00:03:59,717 INFO L208 NwaCegarLoop]: Found error trace [2024-09-25 00:03:59,717 INFO L216 NwaCegarLoop]: trace histogram [4, 3, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-09-25 00:03:59,736 INFO L552 MonitoredProcess]: [MP /storage/repos/certificate-witnesses-artifact/automizer/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Ended with exit code 0 [2024-09-25 00:03:59,917 WARN L456 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 /storage/repos/certificate-witnesses-artifact/automizer/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable5 [2024-09-25 00:03:59,918 INFO L399 AbstractCegarLoop]: === Iteration 7 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-09-25 00:03:59,918 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-25 00:03:59,918 INFO L85 PathProgramCache]: Analyzing trace with hash 1437248358, now seen corresponding path program 1 times [2024-09-25 00:03:59,919 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-09-25 00:03:59,919 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [841096002] [2024-09-25 00:03:59,919 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-09-25 00:03:59,919 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-09-25 00:03:59,929 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-25 00:04:00,028 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2024-09-25 00:04:00,030 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-25 00:04:00,032 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2024-09-25 00:04:00,033 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-25 00:04:00,036 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2024-09-25 00:04:00,037 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-25 00:04:00,040 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-09-25 00:04:00,041 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-25 00:04:00,049 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 6 proven. 3 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2024-09-25 00:04:00,050 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-09-25 00:04:00,050 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [841096002] [2024-09-25 00:04:00,051 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [841096002] provided 0 perfect and 1 imperfect interpolant sequences [2024-09-25 00:04:00,051 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [509767046] [2024-09-25 00:04:00,051 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-09-25 00:04:00,051 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-09-25 00:04:00,051 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/certificate-witnesses-artifact/automizer/z3 [2024-09-25 00:04:00,053 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/certificate-witnesses-artifact/automizer/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-09-25 00:04:00,054 INFO L327 MonitoredProcess]: [MP /storage/repos/certificate-witnesses-artifact/automizer/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2024-09-25 00:04:00,093 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-25 00:04:00,097 INFO L262 TraceCheckSpWp]: Trace formula consists of 95 conjuncts, 11 conjuncts are in the unsatisfiable core [2024-09-25 00:04:00,099 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2024-09-25 00:04:00,180 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 6 proven. 3 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2024-09-25 00:04:00,180 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2024-09-25 00:04:00,237 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2024-09-25 00:04:00,237 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [509767046] provided 1 perfect and 1 imperfect interpolant sequences [2024-09-25 00:04:00,237 INFO L185 FreeRefinementEngine]: Found 1 perfect and 2 imperfect interpolant sequences. [2024-09-25 00:04:00,237 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [7, 6] total 10 [2024-09-25 00:04:00,237 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [877783959] [2024-09-25 00:04:00,237 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-09-25 00:04:00,238 INFO L551 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-09-25 00:04:00,238 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-09-25 00:04:00,238 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-09-25 00:04:00,239 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=69, Unknown=0, NotChecked=0, Total=90 [2024-09-25 00:04:00,239 INFO L87 Difference]: Start difference. First operand 66 states and 84 transitions. Second operand has 5 states, 5 states have (on average 2.2) internal successors, (11), 4 states have internal predecessors, (11), 2 states have call successors, (6), 2 states have call predecessors, (6), 1 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) [2024-09-25 00:04:00,344 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-09-25 00:04:00,345 INFO L93 Difference]: Finished difference Result 80 states and 97 transitions. [2024-09-25 00:04:00,345 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-09-25 00:04:00,346 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 2.2) internal successors, (11), 4 states have internal predecessors, (11), 2 states have call successors, (6), 2 states have call predecessors, (6), 1 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) Word has length 29 [2024-09-25 00:04:00,346 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-09-25 00:04:00,347 INFO L225 Difference]: With dead ends: 80 [2024-09-25 00:04:00,347 INFO L226 Difference]: Without dead ends: 78 [2024-09-25 00:04:00,347 INFO L433 NwaCegarLoop]: 0 DeclaredPredicates, 72 GetRequests, 61 SyntacticMatches, 2 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 16 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=27, Invalid=83, Unknown=0, NotChecked=0, Total=110 [2024-09-25 00:04:00,348 INFO L434 NwaCegarLoop]: 20 mSDtfsCounter, 5 mSDsluCounter, 46 mSDsCounter, 0 mSdLazyCounter, 25 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 7 SdHoareTripleChecker+Valid, 66 SdHoareTripleChecker+Invalid, 26 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 25 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-09-25 00:04:00,348 INFO L435 NwaCegarLoop]: SdHoareTripleChecker [7 Valid, 66 Invalid, 26 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 25 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-09-25 00:04:00,349 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 78 states. [2024-09-25 00:04:00,363 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 78 to 78. [2024-09-25 00:04:00,364 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 78 states, 44 states have (on average 1.1590909090909092) internal successors, (51), 47 states have internal predecessors, (51), 23 states have call successors, (23), 11 states have call predecessors, (23), 10 states have return successors, (19), 19 states have call predecessors, (19), 19 states have call successors, (19) [2024-09-25 00:04:00,365 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 78 states to 78 states and 93 transitions. [2024-09-25 00:04:00,365 INFO L78 Accepts]: Start accepts. Automaton has 78 states and 93 transitions. Word has length 29 [2024-09-25 00:04:00,366 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-09-25 00:04:00,366 INFO L474 AbstractCegarLoop]: Abstraction has 78 states and 93 transitions. [2024-09-25 00:04:00,366 INFO L475 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 2.2) internal successors, (11), 4 states have internal predecessors, (11), 2 states have call successors, (6), 2 states have call predecessors, (6), 1 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) [2024-09-25 00:04:00,366 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-25 00:04:00,366 INFO L276 IsEmpty]: Start isEmpty. Operand 78 states and 93 transitions. [2024-09-25 00:04:00,367 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2024-09-25 00:04:00,367 INFO L208 NwaCegarLoop]: Found error trace [2024-09-25 00:04:00,367 INFO L216 NwaCegarLoop]: trace histogram [5, 4, 4, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-09-25 00:04:00,386 INFO L552 MonitoredProcess]: [MP /storage/repos/certificate-witnesses-artifact/automizer/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Ended with exit code 0 [2024-09-25 00:04:00,568 WARN L456 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6,5 /storage/repos/certificate-witnesses-artifact/automizer/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-09-25 00:04:00,568 INFO L399 AbstractCegarLoop]: === Iteration 8 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-09-25 00:04:00,569 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-25 00:04:00,569 INFO L85 PathProgramCache]: Analyzing trace with hash 857281179, now seen corresponding path program 2 times [2024-09-25 00:04:00,569 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-09-25 00:04:00,569 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2072640685] [2024-09-25 00:04:00,569 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-09-25 00:04:00,569 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-09-25 00:04:00,589 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unknown [2024-09-25 00:04:00,590 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1581545196] [2024-09-25 00:04:00,590 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2024-09-25 00:04:00,591 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-09-25 00:04:00,591 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/certificate-witnesses-artifact/automizer/z3 [2024-09-25 00:04:00,594 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/certificate-witnesses-artifact/automizer/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-09-25 00:04:00,596 INFO L327 MonitoredProcess]: [MP /storage/repos/certificate-witnesses-artifact/automizer/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2024-09-25 00:04:00,646 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2024-09-25 00:04:00,646 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2024-09-25 00:04:00,647 INFO L262 TraceCheckSpWp]: Trace formula consists of 104 conjuncts, 23 conjuncts are in the unsatisfiable core [2024-09-25 00:04:00,649 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2024-09-25 00:04:00,764 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 7 proven. 14 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2024-09-25 00:04:00,764 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2024-09-25 00:04:00,920 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 10 proven. 11 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2024-09-25 00:04:00,920 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-09-25 00:04:00,920 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2072640685] [2024-09-25 00:04:00,921 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2024-09-25 00:04:00,921 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1581545196] [2024-09-25 00:04:00,921 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1581545196] provided 0 perfect and 2 imperfect interpolant sequences [2024-09-25 00:04:00,922 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-09-25 00:04:00,922 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8] total 13 [2024-09-25 00:04:00,922 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1770576316] [2024-09-25 00:04:00,922 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-09-25 00:04:00,922 INFO L551 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2024-09-25 00:04:00,923 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-09-25 00:04:00,923 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2024-09-25 00:04:00,923 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=35, Invalid=121, Unknown=0, NotChecked=0, Total=156 [2024-09-25 00:04:00,923 INFO L87 Difference]: Start difference. First operand 78 states and 93 transitions. Second operand has 13 states, 13 states have (on average 2.0) internal successors, (26), 11 states have internal predecessors, (26), 6 states have call successors, (12), 3 states have call predecessors, (12), 2 states have return successors, (9), 5 states have call predecessors, (9), 6 states have call successors, (9) [2024-09-25 00:04:01,117 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-09-25 00:04:01,117 INFO L93 Difference]: Finished difference Result 78 states and 93 transitions. [2024-09-25 00:04:01,117 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-09-25 00:04:01,117 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 13 states have (on average 2.0) internal successors, (26), 11 states have internal predecessors, (26), 6 states have call successors, (12), 3 states have call predecessors, (12), 2 states have return successors, (9), 5 states have call predecessors, (9), 6 states have call successors, (9) Word has length 34 [2024-09-25 00:04:01,118 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-09-25 00:04:01,118 INFO L225 Difference]: With dead ends: 78 [2024-09-25 00:04:01,118 INFO L226 Difference]: Without dead ends: 0 [2024-09-25 00:04:01,120 INFO L433 NwaCegarLoop]: 0 DeclaredPredicates, 70 GetRequests, 56 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 20 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=56, Invalid=184, Unknown=0, NotChecked=0, Total=240 [2024-09-25 00:04:01,121 INFO L434 NwaCegarLoop]: 19 mSDtfsCounter, 15 mSDsluCounter, 124 mSDsCounter, 0 mSdLazyCounter, 114 mSolverCounterSat, 45 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 15 SdHoareTripleChecker+Valid, 143 SdHoareTripleChecker+Invalid, 159 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 45 IncrementalHoareTripleChecker+Valid, 114 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-09-25 00:04:01,121 INFO L435 NwaCegarLoop]: SdHoareTripleChecker [15 Valid, 143 Invalid, 159 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [45 Valid, 114 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-09-25 00:04:01,121 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2024-09-25 00:04:01,122 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2024-09-25 00:04:01,122 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 0 states, 0 states have (on average 0.0) internal successors, (0), 0 states have internal predecessors, (0), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-09-25 00:04:01,122 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2024-09-25 00:04:01,122 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 34 [2024-09-25 00:04:01,122 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-09-25 00:04:01,122 INFO L474 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2024-09-25 00:04:01,122 INFO L475 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 13 states have (on average 2.0) internal successors, (26), 11 states have internal predecessors, (26), 6 states have call successors, (12), 3 states have call predecessors, (12), 2 states have return successors, (9), 5 states have call predecessors, (9), 6 states have call successors, (9) [2024-09-25 00:04:01,123 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-25 00:04:01,123 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2024-09-25 00:04:01,123 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2024-09-25 00:04:01,126 INFO L785 garLoopResultBuilder]: Registering result SAFE for location __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2024-09-25 00:04:01,143 INFO L540 MonitoredProcess]: [MP /storage/repos/certificate-witnesses-artifact/automizer/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Forceful destruction successful, exit code 0 [2024-09-25 00:04:01,330 WARN L456 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 /storage/repos/certificate-witnesses-artifact/automizer/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable7 [2024-09-25 00:04:01,336 INFO L408 BasicCegarLoop]: Path program histogram: [2, 1, 1, 1, 1, 1, 1] [2024-09-25 00:04:01,338 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2024-09-25 00:04:01,970 INFO L165 ceAbstractionStarter]: Computing trace abstraction results [2024-09-25 00:04:01,989 WARN L155 FloydHoareUtils]: Requires clause for main contained old-variable. Original clause: (and (= ~counter~0 0) (= |old(~counter~0)| 0)) Eliminated clause: (= ~counter~0 0) [2024-09-25 00:04:01,994 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 25.09 12:04:01 BoogieIcfgContainer [2024-09-25 00:04:01,994 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2024-09-25 00:04:01,995 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2024-09-25 00:04:01,995 INFO L270 PluginConnector]: Initializing Witness Printer... [2024-09-25 00:04:01,995 INFO L274 PluginConnector]: Witness Printer initialized [2024-09-25 00:04:01,996 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 25.09 12:03:57" (3/4) ... [2024-09-25 00:04:01,997 INFO L139 WitnessPrinter]: Generating witness for correct program [2024-09-25 00:04:02,051 INFO L149 WitnessManager]: Wrote witness to /storage/repos/certificate-witnesses-artifact/automizer/witness.yml [2024-09-25 00:04:02,052 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2024-09-25 00:04:02,052 INFO L158 Benchmark]: Toolchain (without parser) took 5587.50ms. Allocated memory was 127.9MB in the beginning and 178.3MB in the end (delta: 50.3MB). Free memory was 58.2MB in the beginning and 81.2MB in the end (delta: -23.0MB). Peak memory consumption was 28.1MB. Max. memory is 16.1GB. [2024-09-25 00:04:02,053 INFO L158 Benchmark]: CDTParser took 0.21ms. Allocated memory is still 127.9MB. Free memory is still 81.0MB. There was no memory consumed. Max. memory is 16.1GB. [2024-09-25 00:04:02,053 INFO L158 Benchmark]: CACSL2BoogieTranslator took 279.03ms. Allocated memory is still 127.9MB. Free memory was 58.1MB in the beginning and 99.1MB in the end (delta: -41.0MB). Peak memory consumption was 16.6MB. Max. memory is 16.1GB. [2024-09-25 00:04:02,053 INFO L158 Benchmark]: Boogie Procedure Inliner took 26.35ms. Allocated memory was 127.9MB in the beginning and 178.3MB in the end (delta: 50.3MB). Free memory was 99.0MB in the beginning and 151.8MB in the end (delta: -52.8MB). Peak memory consumption was 2.6MB. Max. memory is 16.1GB. [2024-09-25 00:04:02,054 INFO L158 Benchmark]: Boogie Preprocessor took 37.44ms. Allocated memory is still 178.3MB. Free memory was 151.8MB in the beginning and 149.8MB in the end (delta: 2.0MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2024-09-25 00:04:02,054 INFO L158 Benchmark]: RCFGBuilder took 270.25ms. Allocated memory is still 178.3MB. Free memory was 149.8MB in the beginning and 137.2MB in the end (delta: 12.6MB). Peak memory consumption was 12.6MB. Max. memory is 16.1GB. [2024-09-25 00:04:02,054 INFO L158 Benchmark]: TraceAbstraction took 4910.74ms. Allocated memory is still 178.3MB. Free memory was 136.2MB in the beginning and 84.3MB in the end (delta: 51.8MB). Peak memory consumption was 52.9MB. Max. memory is 16.1GB. [2024-09-25 00:04:02,054 INFO L158 Benchmark]: Witness Printer took 56.87ms. Allocated memory is still 178.3MB. Free memory was 84.3MB in the beginning and 81.2MB in the end (delta: 3.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2024-09-25 00:04:02,056 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 127.9MB. Free memory is still 81.0MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 279.03ms. Allocated memory is still 127.9MB. Free memory was 58.1MB in the beginning and 99.1MB in the end (delta: -41.0MB). Peak memory consumption was 16.6MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 26.35ms. Allocated memory was 127.9MB in the beginning and 178.3MB in the end (delta: 50.3MB). Free memory was 99.0MB in the beginning and 151.8MB in the end (delta: -52.8MB). Peak memory consumption was 2.6MB. Max. memory is 16.1GB. * Boogie Preprocessor took 37.44ms. Allocated memory is still 178.3MB. Free memory was 151.8MB in the beginning and 149.8MB in the end (delta: 2.0MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * RCFGBuilder took 270.25ms. Allocated memory is still 178.3MB. Free memory was 149.8MB in the beginning and 137.2MB in the end (delta: 12.6MB). Peak memory consumption was 12.6MB. Max. memory is 16.1GB. * TraceAbstraction took 4910.74ms. Allocated memory is still 178.3MB. Free memory was 136.2MB in the beginning and 84.3MB in the end (delta: 51.8MB). Peak memory consumption was 52.9MB. Max. memory is 16.1GB. * Witness Printer took 56.87ms. Allocated memory is still 178.3MB. Free memory was 84.3MB in the beginning and 81.2MB in the end (delta: 3.1MB). Peak memory consumption was 2.1MB. 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: 14]: 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 4 procedures, 24 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 4.2s, OverallIterations: 8, TraceHistogramMax: 5, PathProgramHistogramMax: 2, EmptinessCheckTime: 0.0s, AutomataDifference: 1.0s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 119 SdHoareTripleChecker+Valid, 0.7s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 98 mSDsluCounter, 554 SdHoareTripleChecker+Invalid, 0.5s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 397 mSDsCounter, 99 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 449 IncrementalHoareTripleChecker+Invalid, 548 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 99 mSolverCounterUnsat, 157 mSDtfsCounter, 449 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 279 GetRequests, 219 SyntacticMatches, 2 SemanticMatches, 58 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 71 ImplicationChecksByTransitivity, 0.4s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=78occurred in iteration=7, InterpolantAutomatonStates: 53, 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, 8 StatesRemovedByMinimization, 4 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.2s SatisfiabilityAnalysisTime, 1.4s InterpolantComputationTime, 290 NumberOfCodeBlocks, 290 NumberOfCodeBlocksAsserted, 14 NumberOfCheckSat, 298 ConstructedInterpolants, 0 QuantifiedInterpolants, 912 SizeOfPredicates, 7 NumberOfNonLiveVariables, 433 ConjunctsInSsa, 55 ConjunctsInUnsatCore, 13 InterpolantComputations, 6 PerfectInterpolantSequences, 168/205 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: 30]: Loop Invariant Derived loop invariant: (((((((__int128) a * 2) + ((__int128) a * a)) + 1) == s) && (\old(counter) == 0)) && (t == (((__int128) a * 2) + 1))) - ProcedureContractResult [Line: 21]: Procedure Contract for main Derived contract for procedure main. Requires: (counter == 0) Ensures: (\old(counter) == 0) - ProcedureContractResult [Line: 11]: Procedure Contract for __VERIFIER_assert Derived contract for procedure __VERIFIER_assert. Requires: (cond != 0) Ensures: (cond != 0) RESULT: Ultimate proved your program to be correct! [2024-09-25 00:04:02,079 INFO L540 MonitoredProcess]: [MP /storage/repos/certificate-witnesses-artifact/automizer/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Forceful destruction successful, exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Writing output log to file Ultimate.log Result: TRUE