./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/nla-digbench-scaling/hard2_valuebound1.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 --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 04d6fb36 Calling Ultimate with: /root/.sdkman/candidates/java/current/bin/java -Dosgi.configuration.area=/storage/repos/certificate-witnesses-artifact/automizer/data/config -Xmx15G -Xms4m -jar /storage/repos/certificate-witnesses-artifact/automizer/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/certificate-witnesses-artifact/automizer/data -tc /storage/repos/certificate-witnesses-artifact/automizer/config/AutomizerReach.xml -i ../sv-benchmarks/c/nla-digbench-scaling/hard2_valuebound1.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 45ff7b74faf4250f77b788e07275d725ea3dbcc73af0b2b0d64dcf5aa7f7b78a --procedureinliner.inline.calls.to.implemented.procedures NEVER --traceabstraction.positions.where.we.compute.the.hoare.annotation All --witnessprinter.yaml.format.version 2.1 --- Real Ultimate output --- This is Ultimate 0.2.4-tmp.dk.referee-eval-04d6fb3-m [2024-09-15 19:29:26,603 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-09-15 19:29:26,666 INFO L114 SettingsManager]: Loading settings from /storage/repos/certificate-witnesses-artifact/automizer/config/svcomp-Reach-32bit-Automizer_Default.epf [2024-09-15 19:29:26,670 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-09-15 19:29:26,671 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-09-15 19:29:26,695 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-09-15 19:29:26,696 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-09-15 19:29:26,696 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-09-15 19:29:26,697 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-09-15 19:29:26,698 INFO L153 SettingsManager]: * Use memory slicer=true [2024-09-15 19:29:26,699 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-09-15 19:29:26,699 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-09-15 19:29:26,699 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-09-15 19:29:26,702 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-09-15 19:29:26,702 INFO L153 SettingsManager]: * Use SBE=true [2024-09-15 19:29:26,702 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-09-15 19:29:26,702 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-09-15 19:29:26,702 INFO L153 SettingsManager]: * sizeof long=4 [2024-09-15 19:29:26,703 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-09-15 19:29:26,703 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-09-15 19:29:26,703 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-09-15 19:29:26,703 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-09-15 19:29:26,704 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-09-15 19:29:26,704 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-09-15 19:29:26,704 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-09-15 19:29:26,704 INFO L153 SettingsManager]: * sizeof long double=12 [2024-09-15 19:29:26,704 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-09-15 19:29:26,705 INFO L153 SettingsManager]: * Use constant arrays=true [2024-09-15 19:29:26,705 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-09-15 19:29:26,705 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-09-15 19:29:26,705 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-09-15 19:29:26,706 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-09-15 19:29:26,706 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-09-15 19:29:26,706 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-09-15 19:29:26,706 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-09-15 19:29:26,706 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-09-15 19:29:26,713 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-09-15 19:29:26,714 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-09-15 19:29:26,714 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-09-15 19:29:26,714 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-09-15 19:29:26,715 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-09-15 19:29:26,715 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-09-15 19:29:26,715 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 -> 45ff7b74faf4250f77b788e07275d725ea3dbcc73af0b2b0d64dcf5aa7f7b78a Applying setting for plugin de.uni_freiburg.informatik.ultimate.boogie.procedureinliner: Inline calls to implemented procedures -> NEVER Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: Positions where we compute the Hoare Annotation -> All Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: YAML Format version -> 2.1 [2024-09-15 19:29:26,955 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-09-15 19:29:26,974 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-09-15 19:29:26,976 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-09-15 19:29:26,977 INFO L270 PluginConnector]: Initializing CDTParser... [2024-09-15 19:29:26,979 INFO L274 PluginConnector]: CDTParser initialized [2024-09-15 19:29:26,980 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/certificate-witnesses-artifact/automizer/../sv-benchmarks/c/nla-digbench-scaling/hard2_valuebound1.c [2024-09-15 19:29:28,200 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-09-15 19:29:28,392 INFO L384 CDTParser]: Found 1 translation units. [2024-09-15 19:29:28,392 INFO L180 CDTParser]: Scanning /storage/repos/certificate-witnesses-artifact/sv-benchmarks/c/nla-digbench-scaling/hard2_valuebound1.c [2024-09-15 19:29:28,399 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/certificate-witnesses-artifact/automizer/data/f94f4a237/a3fd244345894081ba7f97ed38f947eb/FLAGe2dad84b7 [2024-09-15 19:29:28,762 INFO L435 CDTParser]: Successfully deleted /storage/repos/certificate-witnesses-artifact/automizer/data/f94f4a237/a3fd244345894081ba7f97ed38f947eb [2024-09-15 19:29:28,763 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-09-15 19:29:28,765 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-09-15 19:29:28,766 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-09-15 19:29:28,766 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-09-15 19:29:28,773 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-09-15 19:29:28,773 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 15.09 07:29:28" (1/1) ... [2024-09-15 19:29:28,774 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@45cb190c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.09 07:29:28, skipping insertion in model container [2024-09-15 19:29:28,774 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 15.09 07:29:28" (1/1) ... [2024-09-15 19:29:28,788 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-09-15 19:29:28,895 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/hard2_valuebound1.c[526,539] [2024-09-15 19:29:28,905 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-09-15 19:29:28,911 INFO L200 MainTranslator]: Completed pre-run [2024-09-15 19:29:28,920 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/hard2_valuebound1.c[526,539] [2024-09-15 19:29:28,924 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-09-15 19:29:28,936 INFO L204 MainTranslator]: Completed translation [2024-09-15 19:29:28,937 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.09 07:29:28 WrapperNode [2024-09-15 19:29:28,937 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-09-15 19:29:28,937 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-09-15 19:29:28,938 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-09-15 19:29:28,938 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-09-15 19:29:28,943 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.09 07:29:28" (1/1) ... [2024-09-15 19:29:28,948 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.09 07:29:28" (1/1) ... [2024-09-15 19:29:28,960 INFO L138 Inliner]: procedures = 14, calls = 23, calls flagged for inlining = 0, calls inlined = 0, statements flattened = 0 [2024-09-15 19:29:28,960 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-09-15 19:29:28,960 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-09-15 19:29:28,960 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-09-15 19:29:28,961 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-09-15 19:29:28,968 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.09 07:29:28" (1/1) ... [2024-09-15 19:29:28,969 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.09 07:29:28" (1/1) ... [2024-09-15 19:29:28,970 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.09 07:29:28" (1/1) ... [2024-09-15 19:29:28,982 INFO L175 MemorySlicer]: Split 10 memory accesses to 2 slices as follows [2, 8]. 80 percent of accesses are in the largest equivalence class. The 10 initializations are split as follows [2, 8]. The 0 writes are split as follows [0, 0]. [2024-09-15 19:29:28,983 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.09 07:29:28" (1/1) ... [2024-09-15 19:29:28,984 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.09 07:29:28" (1/1) ... [2024-09-15 19:29:28,986 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.09 07:29:28" (1/1) ... [2024-09-15 19:29:28,990 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.09 07:29:28" (1/1) ... [2024-09-15 19:29:28,991 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.09 07:29:28" (1/1) ... [2024-09-15 19:29:28,995 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.09 07:29:28" (1/1) ... [2024-09-15 19:29:28,997 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-09-15 19:29:28,997 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-09-15 19:29:28,997 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-09-15 19:29:28,997 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-09-15 19:29:28,998 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.09 07:29:28" (1/1) ... [2024-09-15 19:29:29,004 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-09-15 19:29:29,018 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/certificate-witnesses-artifact/automizer/z3 [2024-09-15 19:29:29,042 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-15 19:29:29,046 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-15 19:29:29,094 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-09-15 19:29:29,094 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2024-09-15 19:29:29,094 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2024-09-15 19:29:29,094 INFO L130 BoogieDeclarations]: Found specification of procedure main [2024-09-15 19:29:29,095 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2024-09-15 19:29:29,095 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-09-15 19:29:29,095 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#1 [2024-09-15 19:29:29,096 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2024-09-15 19:29:29,096 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2024-09-15 19:29:29,096 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-09-15 19:29:29,096 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-09-15 19:29:29,097 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2024-09-15 19:29:29,097 INFO L138 BoogieDeclarations]: Found implementation of procedure __VERIFIER_assert [2024-09-15 19:29:29,152 INFO L242 CfgBuilder]: Building ICFG [2024-09-15 19:29:29,154 INFO L268 CfgBuilder]: Building CFG for each procedure with an implementation [2024-09-15 19:29:29,297 INFO L? ?]: Removed 5 outVars from TransFormulas that were not future-live. [2024-09-15 19:29:29,297 INFO L291 CfgBuilder]: Performing block encoding [2024-09-15 19:29:29,322 INFO L313 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-09-15 19:29:29,322 INFO L318 CfgBuilder]: Removed 2 assume(true) statements. [2024-09-15 19:29:29,323 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 15.09 07:29:29 BoogieIcfgContainer [2024-09-15 19:29:29,323 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-09-15 19:29:29,325 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-09-15 19:29:29,325 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-09-15 19:29:29,328 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-09-15 19:29:29,328 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 15.09 07:29:28" (1/3) ... [2024-09-15 19:29:29,329 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@139efda1 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 15.09 07:29:29, skipping insertion in model container [2024-09-15 19:29:29,329 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.09 07:29:28" (2/3) ... [2024-09-15 19:29:29,330 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@139efda1 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 15.09 07:29:29, skipping insertion in model container [2024-09-15 19:29:29,330 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 15.09 07:29:29" (3/3) ... [2024-09-15 19:29:29,331 INFO L112 eAbstractionObserver]: Analyzing ICFG hard2_valuebound1.c [2024-09-15 19:29:29,345 INFO L209 ceAbstractionStarter]: Automizer settings: Hoare:All NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-09-15 19:29:29,345 INFO L149 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-09-15 19:29:29,388 INFO L335 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-09-15 19:29:29,393 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;@1cafde7f, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-09-15 19:29:29,393 INFO L337 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-09-15 19:29:29,396 INFO L276 IsEmpty]: Start isEmpty. Operand has 33 states, 17 states have (on average 1.588235294117647) internal successors, (27), 18 states have internal predecessors, (27), 10 states have call successors, (10), 4 states have call predecessors, (10), 4 states have return successors, (10), 10 states have call predecessors, (10), 10 states have call successors, (10) [2024-09-15 19:29:29,401 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2024-09-15 19:29:29,401 INFO L208 NwaCegarLoop]: Found error trace [2024-09-15 19:29:29,402 INFO L216 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-09-15 19:29:29,402 INFO L399 AbstractCegarLoop]: === Iteration 1 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-09-15 19:29:29,406 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-15 19:29:29,406 INFO L85 PathProgramCache]: Analyzing trace with hash -909137831, now seen corresponding path program 1 times [2024-09-15 19:29:29,412 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-09-15 19:29:29,413 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [144408466] [2024-09-15 19:29:29,413 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-09-15 19:29:29,413 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-09-15 19:29:29,479 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-15 19:29:29,519 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2024-09-15 19:29:29,521 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-15 19:29:29,539 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-09-15 19:29:29,541 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-15 19:29:29,547 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-15 19:29:29,547 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-09-15 19:29:29,548 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [144408466] [2024-09-15 19:29:29,548 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [144408466] provided 1 perfect and 0 imperfect interpolant sequences [2024-09-15 19:29:29,548 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-09-15 19:29:29,548 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-09-15 19:29:29,549 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2008391717] [2024-09-15 19:29:29,550 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-09-15 19:29:29,553 INFO L551 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-09-15 19:29:29,553 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-09-15 19:29:29,568 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-09-15 19:29:29,568 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-09-15 19:29:29,570 INFO L87 Difference]: Start difference. First operand has 33 states, 17 states have (on average 1.588235294117647) internal successors, (27), 18 states have internal predecessors, (27), 10 states have call successors, (10), 4 states have call predecessors, (10), 4 states have return successors, (10), 10 states have call predecessors, (10), 10 states have call successors, (10) Second operand has 2 states, 2 states have (on average 5.0) internal successors, (10), 2 states have internal predecessors, (10), 2 states have call successors, (4), 2 states have call predecessors, (4), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) [2024-09-15 19:29:29,598 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-09-15 19:29:29,599 INFO L93 Difference]: Finished difference Result 58 states and 92 transitions. [2024-09-15 19:29:29,600 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-09-15 19:29:29,601 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 5.0) internal successors, (10), 2 states have internal predecessors, (10), 2 states have call successors, (4), 2 states have call predecessors, (4), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) Word has length 16 [2024-09-15 19:29:29,601 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-09-15 19:29:29,605 INFO L225 Difference]: With dead ends: 58 [2024-09-15 19:29:29,606 INFO L226 Difference]: Without dead ends: 29 [2024-09-15 19:29:29,608 INFO L433 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 7 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-09-15 19:29:29,610 INFO L434 NwaCegarLoop]: 39 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 2 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 39 SdHoareTripleChecker+Invalid, 2 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 2 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-09-15 19:29:29,611 INFO L435 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 39 Invalid, 2 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 2 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-09-15 19:29:29,621 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 29 states. [2024-09-15 19:29:29,632 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 29 to 29. [2024-09-15 19:29:29,633 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 29 states, 15 states have (on average 1.2666666666666666) internal successors, (19), 16 states have internal predecessors, (19), 10 states have call successors, (10), 4 states have call predecessors, (10), 3 states have return successors, (8), 8 states have call predecessors, (8), 8 states have call successors, (8) [2024-09-15 19:29:29,634 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 29 states to 29 states and 37 transitions. [2024-09-15 19:29:29,635 INFO L78 Accepts]: Start accepts. Automaton has 29 states and 37 transitions. Word has length 16 [2024-09-15 19:29:29,635 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-09-15 19:29:29,635 INFO L474 AbstractCegarLoop]: Abstraction has 29 states and 37 transitions. [2024-09-15 19:29:29,636 INFO L475 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 5.0) internal successors, (10), 2 states have internal predecessors, (10), 2 states have call successors, (4), 2 states have call predecessors, (4), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) [2024-09-15 19:29:29,636 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-15 19:29:29,636 INFO L276 IsEmpty]: Start isEmpty. Operand 29 states and 37 transitions. [2024-09-15 19:29:29,636 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2024-09-15 19:29:29,637 INFO L208 NwaCegarLoop]: Found error trace [2024-09-15 19:29:29,637 INFO L216 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-09-15 19:29:29,637 WARN L456 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-09-15 19:29:29,637 INFO L399 AbstractCegarLoop]: === Iteration 2 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-09-15 19:29:29,638 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-15 19:29:29,638 INFO L85 PathProgramCache]: Analyzing trace with hash -229079461, now seen corresponding path program 1 times [2024-09-15 19:29:29,638 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-09-15 19:29:29,638 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1240624009] [2024-09-15 19:29:29,638 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-09-15 19:29:29,638 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-09-15 19:29:29,658 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-15 19:29:29,768 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2024-09-15 19:29:29,770 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-15 19:29:29,777 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-09-15 19:29:29,778 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-15 19:29:29,785 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-15 19:29:29,785 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-09-15 19:29:29,785 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1240624009] [2024-09-15 19:29:29,785 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1240624009] provided 1 perfect and 0 imperfect interpolant sequences [2024-09-15 19:29:29,785 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-09-15 19:29:29,786 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-09-15 19:29:29,786 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1082091369] [2024-09-15 19:29:29,786 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-09-15 19:29:29,787 INFO L551 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-09-15 19:29:29,787 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-09-15 19:29:29,787 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-09-15 19:29:29,788 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-09-15 19:29:29,788 INFO L87 Difference]: Start difference. First operand 29 states and 37 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), 1 states have call predecessors, (2), 1 states have call successors, (2) [2024-09-15 19:29:29,853 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-09-15 19:29:29,853 INFO L93 Difference]: Finished difference Result 42 states and 54 transitions. [2024-09-15 19:29:29,853 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-09-15 19:29:29,853 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), 1 states have call predecessors, (2), 1 states have call successors, (2) Word has length 16 [2024-09-15 19:29:29,853 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-09-15 19:29:29,854 INFO L225 Difference]: With dead ends: 42 [2024-09-15 19:29:29,854 INFO L226 Difference]: Without dead ends: 40 [2024-09-15 19:29:29,854 INFO L433 NwaCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 6 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-15 19:29:29,856 INFO L434 NwaCegarLoop]: 32 mSDtfsCounter, 9 mSDsluCounter, 82 mSDsCounter, 0 mSdLazyCounter, 26 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 15 SdHoareTripleChecker+Valid, 114 SdHoareTripleChecker+Invalid, 26 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 26 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-09-15 19:29:29,856 INFO L435 NwaCegarLoop]: SdHoareTripleChecker [15 Valid, 114 Invalid, 26 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 26 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-09-15 19:29:29,857 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 40 states. [2024-09-15 19:29:29,863 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 40 to 33. [2024-09-15 19:29:29,863 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 33 states, 18 states have (on average 1.2222222222222223) internal successors, (22), 19 states have internal predecessors, (22), 10 states have call successors, (10), 5 states have call predecessors, (10), 4 states have return successors, (8), 8 states have call predecessors, (8), 8 states have call successors, (8) [2024-09-15 19:29:29,864 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 33 states to 33 states and 40 transitions. [2024-09-15 19:29:29,864 INFO L78 Accepts]: Start accepts. Automaton has 33 states and 40 transitions. Word has length 16 [2024-09-15 19:29:29,864 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-09-15 19:29:29,864 INFO L474 AbstractCegarLoop]: Abstraction has 33 states and 40 transitions. [2024-09-15 19:29:29,864 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), 1 states have call predecessors, (2), 1 states have call successors, (2) [2024-09-15 19:29:29,864 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-15 19:29:29,865 INFO L276 IsEmpty]: Start isEmpty. Operand 33 states and 40 transitions. [2024-09-15 19:29:29,865 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2024-09-15 19:29:29,865 INFO L208 NwaCegarLoop]: Found error trace [2024-09-15 19:29:29,865 INFO L216 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-09-15 19:29:29,865 WARN L456 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-09-15 19:29:29,865 INFO L399 AbstractCegarLoop]: === Iteration 3 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-09-15 19:29:29,865 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-15 19:29:29,866 INFO L85 PathProgramCache]: Analyzing trace with hash 520476838, now seen corresponding path program 1 times [2024-09-15 19:29:29,866 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-09-15 19:29:29,866 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [493744529] [2024-09-15 19:29:29,866 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-09-15 19:29:29,866 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-09-15 19:29:29,874 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-15 19:29:29,942 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2024-09-15 19:29:29,944 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-15 19:29:29,947 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-09-15 19:29:29,950 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-15 19:29:29,952 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2024-09-15 19:29:29,963 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-15 19:29:29,971 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-15 19:29:29,971 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-09-15 19:29:29,971 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [493744529] [2024-09-15 19:29:29,971 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [493744529] provided 1 perfect and 0 imperfect interpolant sequences [2024-09-15 19:29:29,971 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-09-15 19:29:29,971 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-09-15 19:29:29,972 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [652115587] [2024-09-15 19:29:29,972 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-09-15 19:29:29,972 INFO L551 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-09-15 19:29:29,972 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-09-15 19:29:29,972 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-09-15 19:29:29,973 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-09-15 19:29:29,973 INFO L87 Difference]: Start difference. First operand 33 states and 40 transitions. Second operand has 5 states, 5 states have (on average 2.6) internal successors, (13), 4 states have internal predecessors, (13), 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-15 19:29:30,024 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-09-15 19:29:30,025 INFO L93 Difference]: Finished difference Result 46 states and 57 transitions. [2024-09-15 19:29:30,025 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-09-15 19:29:30,026 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 2.6) internal successors, (13), 4 states have internal predecessors, (13), 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-15 19:29:30,026 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-09-15 19:29:30,026 INFO L225 Difference]: With dead ends: 46 [2024-09-15 19:29:30,026 INFO L226 Difference]: Without dead ends: 44 [2024-09-15 19:29:30,027 INFO L433 NwaCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 8 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-15 19:29:30,027 INFO L434 NwaCegarLoop]: 32 mSDtfsCounter, 9 mSDsluCounter, 79 mSDsCounter, 0 mSdLazyCounter, 37 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 14 SdHoareTripleChecker+Valid, 111 SdHoareTripleChecker+Invalid, 37 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 37 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-09-15 19:29:30,028 INFO L435 NwaCegarLoop]: SdHoareTripleChecker [14 Valid, 111 Invalid, 37 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 37 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-09-15 19:29:30,028 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 44 states. [2024-09-15 19:29:30,038 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 44 to 37. [2024-09-15 19:29:30,038 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 37 states, 21 states have (on average 1.1904761904761905) internal successors, (25), 22 states have internal predecessors, (25), 10 states have call successors, (10), 6 states have call predecessors, (10), 5 states have return successors, (8), 8 states have call predecessors, (8), 8 states have call successors, (8) [2024-09-15 19:29:30,039 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 37 states to 37 states and 43 transitions. [2024-09-15 19:29:30,039 INFO L78 Accepts]: Start accepts. Automaton has 37 states and 43 transitions. Word has length 21 [2024-09-15 19:29:30,039 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-09-15 19:29:30,039 INFO L474 AbstractCegarLoop]: Abstraction has 37 states and 43 transitions. [2024-09-15 19:29:30,040 INFO L475 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 2.6) internal successors, (13), 4 states have internal predecessors, (13), 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-15 19:29:30,040 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-15 19:29:30,040 INFO L276 IsEmpty]: Start isEmpty. Operand 37 states and 43 transitions. [2024-09-15 19:29:30,040 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2024-09-15 19:29:30,040 INFO L208 NwaCegarLoop]: Found error trace [2024-09-15 19:29:30,041 INFO L216 NwaCegarLoop]: trace histogram [3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-09-15 19:29:30,041 WARN L456 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-09-15 19:29:30,041 INFO L399 AbstractCegarLoop]: === Iteration 4 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-09-15 19:29:30,045 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-15 19:29:30,045 INFO L85 PathProgramCache]: Analyzing trace with hash 1140086011, now seen corresponding path program 1 times [2024-09-15 19:29:30,045 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-09-15 19:29:30,045 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2079969707] [2024-09-15 19:29:30,046 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-09-15 19:29:30,046 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-09-15 19:29:30,065 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unknown [2024-09-15 19:29:30,067 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1480614126] [2024-09-15 19:29:30,067 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-09-15 19:29:30,067 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-09-15 19:29:30,067 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/certificate-witnesses-artifact/automizer/z3 [2024-09-15 19:29:30,074 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-15 19:29:30,075 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-15 19:29:30,126 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-15 19:29:30,129 INFO L262 TraceCheckSpWp]: Trace formula consists of 93 conjuncts, 9 conjuncts are in the unsatisfiable core [2024-09-15 19:29:30,133 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2024-09-15 19:29:30,230 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-15 19:29:30,230 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-09-15 19:29:30,230 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-09-15 19:29:30,230 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2079969707] [2024-09-15 19:29:30,231 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2024-09-15 19:29:30,231 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1480614126] [2024-09-15 19:29:30,231 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1480614126] provided 1 perfect and 0 imperfect interpolant sequences [2024-09-15 19:29:30,231 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-09-15 19:29:30,231 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-09-15 19:29:30,231 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1604458757] [2024-09-15 19:29:30,232 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-09-15 19:29:30,232 INFO L551 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-09-15 19:29:30,232 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-09-15 19:29:30,234 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-09-15 19:29:30,235 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-09-15 19:29:30,235 INFO L87 Difference]: Start difference. First operand 37 states and 43 transitions. Second operand has 5 states, 5 states have (on average 2.6) internal successors, (13), 4 states have internal predecessors, (13), 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-15 19:29:30,297 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-09-15 19:29:30,297 INFO L93 Difference]: Finished difference Result 63 states and 80 transitions. [2024-09-15 19:29:30,298 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-09-15 19:29:30,298 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 2.6) internal successors, (13), 4 states have internal predecessors, (13), 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 26 [2024-09-15 19:29:30,298 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-09-15 19:29:30,299 INFO L225 Difference]: With dead ends: 63 [2024-09-15 19:29:30,299 INFO L226 Difference]: Without dead ends: 50 [2024-09-15 19:29:30,300 INFO L433 NwaCegarLoop]: 0 DeclaredPredicates, 26 GetRequests, 22 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-15 19:29:30,302 INFO L434 NwaCegarLoop]: 32 mSDtfsCounter, 5 mSDsluCounter, 81 mSDsCounter, 0 mSdLazyCounter, 42 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 8 SdHoareTripleChecker+Valid, 113 SdHoareTripleChecker+Invalid, 44 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 42 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-09-15 19:29:30,302 INFO L435 NwaCegarLoop]: SdHoareTripleChecker [8 Valid, 113 Invalid, 44 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 42 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-09-15 19:29:30,303 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 50 states. [2024-09-15 19:29:30,312 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 50 to 50. [2024-09-15 19:29:30,313 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 50 states, 28 states have (on average 1.1785714285714286) internal successors, (33), 29 states have internal predecessors, (33), 15 states have call successors, (15), 7 states have call predecessors, (15), 6 states have return successors, (13), 13 states have call predecessors, (13), 13 states have call successors, (13) [2024-09-15 19:29:30,314 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 50 states to 50 states and 61 transitions. [2024-09-15 19:29:30,316 INFO L78 Accepts]: Start accepts. Automaton has 50 states and 61 transitions. Word has length 26 [2024-09-15 19:29:30,316 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-09-15 19:29:30,316 INFO L474 AbstractCegarLoop]: Abstraction has 50 states and 61 transitions. [2024-09-15 19:29:30,317 INFO L475 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 2.6) internal successors, (13), 4 states have internal predecessors, (13), 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-15 19:29:30,317 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-15 19:29:30,317 INFO L276 IsEmpty]: Start isEmpty. Operand 50 states and 61 transitions. [2024-09-15 19:29:30,318 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 34 [2024-09-15 19:29:30,318 INFO L208 NwaCegarLoop]: Found error trace [2024-09-15 19:29:30,319 INFO L216 NwaCegarLoop]: trace histogram [4, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-09-15 19:29:30,332 INFO L552 MonitoredProcess]: [MP /storage/repos/certificate-witnesses-artifact/automizer/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2024-09-15 19:29:30,519 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-15 19:29:30,520 INFO L399 AbstractCegarLoop]: === Iteration 5 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-09-15 19:29:30,520 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-15 19:29:30,521 INFO L85 PathProgramCache]: Analyzing trace with hash -975701997, now seen corresponding path program 1 times [2024-09-15 19:29:30,521 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-09-15 19:29:30,521 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1856244229] [2024-09-15 19:29:30,521 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-09-15 19:29:30,522 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-09-15 19:29:30,543 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unknown [2024-09-15 19:29:30,547 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1585310421] [2024-09-15 19:29:30,547 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-09-15 19:29:30,547 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-09-15 19:29:30,547 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/certificate-witnesses-artifact/automizer/z3 [2024-09-15 19:29:30,548 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-15 19:29:30,553 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-15 19:29:30,608 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-15 19:29:30,609 INFO L262 TraceCheckSpWp]: Trace formula consists of 104 conjuncts, 7 conjuncts are in the unsatisfiable core [2024-09-15 19:29:30,611 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2024-09-15 19:29:30,677 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2024-09-15 19:29:30,677 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-09-15 19:29:30,677 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-09-15 19:29:30,677 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1856244229] [2024-09-15 19:29:30,677 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2024-09-15 19:29:30,678 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1585310421] [2024-09-15 19:29:30,678 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1585310421] provided 1 perfect and 0 imperfect interpolant sequences [2024-09-15 19:29:30,678 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-09-15 19:29:30,678 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-09-15 19:29:30,678 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [722248831] [2024-09-15 19:29:30,678 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-09-15 19:29:30,678 INFO L551 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-09-15 19:29:30,678 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-09-15 19:29:30,679 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-09-15 19:29:30,679 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-09-15 19:29:30,680 INFO L87 Difference]: Start difference. First operand 50 states and 61 transitions. Second operand has 5 states, 5 states have (on average 3.0) internal successors, (15), 4 states have internal predecessors, (15), 2 states have call successors, (7), 2 states have call predecessors, (7), 1 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2024-09-15 19:29:30,732 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-09-15 19:29:30,733 INFO L93 Difference]: Finished difference Result 63 states and 78 transitions. [2024-09-15 19:29:30,735 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-09-15 19:29:30,735 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 3.0) internal successors, (15), 4 states have internal predecessors, (15), 2 states have call successors, (7), 2 states have call predecessors, (7), 1 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) Word has length 33 [2024-09-15 19:29:30,735 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-09-15 19:29:30,736 INFO L225 Difference]: With dead ends: 63 [2024-09-15 19:29:30,736 INFO L226 Difference]: Without dead ends: 61 [2024-09-15 19:29:30,736 INFO L433 NwaCegarLoop]: 0 DeclaredPredicates, 33 GetRequests, 29 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-15 19:29:30,737 INFO L434 NwaCegarLoop]: 26 mSDtfsCounter, 7 mSDsluCounter, 69 mSDsCounter, 0 mSdLazyCounter, 44 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 10 SdHoareTripleChecker+Valid, 95 SdHoareTripleChecker+Invalid, 47 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 44 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-09-15 19:29:30,737 INFO L435 NwaCegarLoop]: SdHoareTripleChecker [10 Valid, 95 Invalid, 47 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 44 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-09-15 19:29:30,737 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 61 states. [2024-09-15 19:29:30,745 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 61 to 60. [2024-09-15 19:29:30,746 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 60 states, 34 states have (on average 1.2058823529411764) internal successors, (41), 36 states have internal predecessors, (41), 18 states have call successors, (18), 8 states have call predecessors, (18), 7 states have return successors, (16), 15 states have call predecessors, (16), 16 states have call successors, (16) [2024-09-15 19:29:30,747 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 60 states to 60 states and 75 transitions. [2024-09-15 19:29:30,748 INFO L78 Accepts]: Start accepts. Automaton has 60 states and 75 transitions. Word has length 33 [2024-09-15 19:29:30,748 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-09-15 19:29:30,748 INFO L474 AbstractCegarLoop]: Abstraction has 60 states and 75 transitions. [2024-09-15 19:29:30,748 INFO L475 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 3.0) internal successors, (15), 4 states have internal predecessors, (15), 2 states have call successors, (7), 2 states have call predecessors, (7), 1 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2024-09-15 19:29:30,748 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-15 19:29:30,748 INFO L276 IsEmpty]: Start isEmpty. Operand 60 states and 75 transitions. [2024-09-15 19:29:30,749 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 44 [2024-09-15 19:29:30,749 INFO L208 NwaCegarLoop]: Found error trace [2024-09-15 19:29:30,749 INFO L216 NwaCegarLoop]: trace histogram [6, 5, 5, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-09-15 19:29:30,762 INFO L540 MonitoredProcess]: [MP /storage/repos/certificate-witnesses-artifact/automizer/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2024-09-15 19:29:30,949 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-15 19:29:30,950 INFO L399 AbstractCegarLoop]: === Iteration 6 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-09-15 19:29:30,950 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-15 19:29:30,950 INFO L85 PathProgramCache]: Analyzing trace with hash -928833564, now seen corresponding path program 1 times [2024-09-15 19:29:30,950 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-09-15 19:29:30,950 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [433921010] [2024-09-15 19:29:30,951 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-09-15 19:29:30,951 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-09-15 19:29:30,961 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unknown [2024-09-15 19:29:30,965 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1857684724] [2024-09-15 19:29:30,965 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-09-15 19:29:30,965 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-09-15 19:29:30,965 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/certificate-witnesses-artifact/automizer/z3 [2024-09-15 19:29:30,966 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-15 19:29:30,970 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-15 19:29:31,014 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-15 19:29:31,015 INFO L262 TraceCheckSpWp]: Trace formula consists of 126 conjuncts, 13 conjuncts are in the unsatisfiable core [2024-09-15 19:29:31,017 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2024-09-15 19:29:31,127 INFO L134 CoverageAnalysis]: Checked inductivity of 54 backedges. 10 proven. 4 refuted. 0 times theorem prover too weak. 40 trivial. 0 not checked. [2024-09-15 19:29:31,127 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2024-09-15 19:29:31,221 INFO L134 CoverageAnalysis]: Checked inductivity of 54 backedges. 10 proven. 0 refuted. 0 times theorem prover too weak. 44 trivial. 0 not checked. [2024-09-15 19:29:31,222 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-09-15 19:29:31,222 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [433921010] [2024-09-15 19:29:31,222 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2024-09-15 19:29:31,222 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1857684724] [2024-09-15 19:29:31,222 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1857684724] provided 1 perfect and 1 imperfect interpolant sequences [2024-09-15 19:29:31,222 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-09-15 19:29:31,222 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [6] total 7 [2024-09-15 19:29:31,223 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1114350274] [2024-09-15 19:29:31,223 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-09-15 19:29:31,223 INFO L551 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-09-15 19:29:31,223 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-09-15 19:29:31,223 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-09-15 19:29:31,224 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2024-09-15 19:29:31,224 INFO L87 Difference]: Start difference. First operand 60 states and 75 transitions. Second operand has 5 states, 5 states have (on average 2.8) internal successors, (14), 4 states have internal predecessors, (14), 2 states have call successors, (7), 2 states have call predecessors, (7), 1 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2024-09-15 19:29:31,285 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-09-15 19:29:31,285 INFO L93 Difference]: Finished difference Result 70 states and 87 transitions. [2024-09-15 19:29:31,285 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-09-15 19:29:31,286 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 2.8) internal successors, (14), 4 states have internal predecessors, (14), 2 states have call successors, (7), 2 states have call predecessors, (7), 1 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) Word has length 43 [2024-09-15 19:29:31,286 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-09-15 19:29:31,291 INFO L225 Difference]: With dead ends: 70 [2024-09-15 19:29:31,291 INFO L226 Difference]: Without dead ends: 68 [2024-09-15 19:29:31,291 INFO L433 NwaCegarLoop]: 0 DeclaredPredicates, 86 GetRequests, 78 SyntacticMatches, 2 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2024-09-15 19:29:31,292 INFO L434 NwaCegarLoop]: 31 mSDtfsCounter, 5 mSDsluCounter, 75 mSDsCounter, 0 mSdLazyCounter, 42 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 7 SdHoareTripleChecker+Valid, 106 SdHoareTripleChecker+Invalid, 43 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 42 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-09-15 19:29:31,292 INFO L435 NwaCegarLoop]: SdHoareTripleChecker [7 Valid, 106 Invalid, 43 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 42 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-09-15 19:29:31,293 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 68 states. [2024-09-15 19:29:31,302 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 68 to 67. [2024-09-15 19:29:31,302 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 67 states, 38 states have (on average 1.1842105263157894) internal successors, (45), 41 states have internal predecessors, (45), 20 states have call successors, (20), 9 states have call predecessors, (20), 8 states have return successors, (18), 16 states have call predecessors, (18), 18 states have call successors, (18) [2024-09-15 19:29:31,303 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 67 states to 67 states and 83 transitions. [2024-09-15 19:29:31,303 INFO L78 Accepts]: Start accepts. Automaton has 67 states and 83 transitions. Word has length 43 [2024-09-15 19:29:31,303 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-09-15 19:29:31,304 INFO L474 AbstractCegarLoop]: Abstraction has 67 states and 83 transitions. [2024-09-15 19:29:31,304 INFO L475 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 2.8) internal successors, (14), 4 states have internal predecessors, (14), 2 states have call successors, (7), 2 states have call predecessors, (7), 1 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2024-09-15 19:29:31,305 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-15 19:29:31,305 INFO L276 IsEmpty]: Start isEmpty. Operand 67 states and 83 transitions. [2024-09-15 19:29:31,306 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 50 [2024-09-15 19:29:31,306 INFO L208 NwaCegarLoop]: Found error trace [2024-09-15 19:29:31,306 INFO L216 NwaCegarLoop]: trace histogram [7, 6, 6, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-09-15 19:29:31,321 INFO L540 MonitoredProcess]: [MP /storage/repos/certificate-witnesses-artifact/automizer/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Forceful destruction successful, exit code 0 [2024-09-15 19:29:31,506 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-15 19:29:31,507 INFO L399 AbstractCegarLoop]: === Iteration 7 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-09-15 19:29:31,507 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-15 19:29:31,507 INFO L85 PathProgramCache]: Analyzing trace with hash -238148106, now seen corresponding path program 1 times [2024-09-15 19:29:31,507 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-09-15 19:29:31,507 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [138613655] [2024-09-15 19:29:31,507 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-09-15 19:29:31,507 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-09-15 19:29:31,525 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-15 19:29:31,607 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2024-09-15 19:29:31,608 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-15 19:29:31,610 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-09-15 19:29:31,614 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-15 19:29:31,615 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2024-09-15 19:29:31,616 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-15 19:29:31,619 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-09-15 19:29:31,624 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-15 19:29:31,628 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 22 [2024-09-15 19:29:31,629 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-15 19:29:31,631 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-09-15 19:29:31,632 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-15 19:29:31,641 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 34 [2024-09-15 19:29:31,642 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-15 19:29:31,649 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2024-09-15 19:29:31,650 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-15 19:29:31,652 INFO L134 CoverageAnalysis]: Checked inductivity of 72 backedges. 12 proven. 0 refuted. 0 times theorem prover too weak. 60 trivial. 0 not checked. [2024-09-15 19:29:31,652 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-09-15 19:29:31,652 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [138613655] [2024-09-15 19:29:31,653 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [138613655] provided 1 perfect and 0 imperfect interpolant sequences [2024-09-15 19:29:31,653 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-09-15 19:29:31,653 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-09-15 19:29:31,653 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1030623578] [2024-09-15 19:29:31,653 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-09-15 19:29:31,653 INFO L551 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-09-15 19:29:31,653 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-09-15 19:29:31,653 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-09-15 19:29:31,654 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-09-15 19:29:31,654 INFO L87 Difference]: Start difference. First operand 67 states and 83 transitions. Second operand has 5 states, 5 states have (on average 3.2) internal successors, (16), 4 states have internal predecessors, (16), 2 states have call successors, (10), 2 states have call predecessors, (10), 1 states have return successors, (8), 2 states have call predecessors, (8), 2 states have call successors, (8) [2024-09-15 19:29:31,699 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-09-15 19:29:31,699 INFO L93 Difference]: Finished difference Result 75 states and 91 transitions. [2024-09-15 19:29:31,702 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-09-15 19:29:31,702 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 3.2) internal successors, (16), 4 states have internal predecessors, (16), 2 states have call successors, (10), 2 states have call predecessors, (10), 1 states have return successors, (8), 2 states have call predecessors, (8), 2 states have call successors, (8) Word has length 49 [2024-09-15 19:29:31,702 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-09-15 19:29:31,703 INFO L225 Difference]: With dead ends: 75 [2024-09-15 19:29:31,703 INFO L226 Difference]: Without dead ends: 63 [2024-09-15 19:29:31,703 INFO L433 NwaCegarLoop]: 0 DeclaredPredicates, 22 GetRequests, 18 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-15 19:29:31,704 INFO L434 NwaCegarLoop]: 35 mSDtfsCounter, 3 mSDsluCounter, 88 mSDsCounter, 0 mSdLazyCounter, 32 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3 SdHoareTripleChecker+Valid, 123 SdHoareTripleChecker+Invalid, 32 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 32 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-09-15 19:29:31,704 INFO L435 NwaCegarLoop]: SdHoareTripleChecker [3 Valid, 123 Invalid, 32 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 32 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-09-15 19:29:31,704 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 63 states. [2024-09-15 19:29:31,718 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 63 to 63. [2024-09-15 19:29:31,719 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 63 states, 36 states have (on average 1.1666666666666667) internal successors, (42), 39 states have internal predecessors, (42), 18 states have call successors, (18), 9 states have call predecessors, (18), 8 states have return successors, (16), 14 states have call predecessors, (16), 16 states have call successors, (16) [2024-09-15 19:29:31,722 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 63 states to 63 states and 76 transitions. [2024-09-15 19:29:31,722 INFO L78 Accepts]: Start accepts. Automaton has 63 states and 76 transitions. Word has length 49 [2024-09-15 19:29:31,722 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-09-15 19:29:31,723 INFO L474 AbstractCegarLoop]: Abstraction has 63 states and 76 transitions. [2024-09-15 19:29:31,723 INFO L475 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 3.2) internal successors, (16), 4 states have internal predecessors, (16), 2 states have call successors, (10), 2 states have call predecessors, (10), 1 states have return successors, (8), 2 states have call predecessors, (8), 2 states have call successors, (8) [2024-09-15 19:29:31,723 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-15 19:29:31,723 INFO L276 IsEmpty]: Start isEmpty. Operand 63 states and 76 transitions. [2024-09-15 19:29:31,724 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 64 [2024-09-15 19:29:31,724 INFO L208 NwaCegarLoop]: Found error trace [2024-09-15 19:29:31,724 INFO L216 NwaCegarLoop]: trace histogram [9, 8, 8, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-09-15 19:29:31,724 WARN L456 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2024-09-15 19:29:31,724 INFO L399 AbstractCegarLoop]: === Iteration 8 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-09-15 19:29:31,724 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-15 19:29:31,725 INFO L85 PathProgramCache]: Analyzing trace with hash -1374799408, now seen corresponding path program 1 times [2024-09-15 19:29:31,725 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-09-15 19:29:31,725 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [94873361] [2024-09-15 19:29:31,725 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-09-15 19:29:31,725 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-09-15 19:29:31,752 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unknown [2024-09-15 19:29:31,755 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1046556873] [2024-09-15 19:29:31,755 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-09-15 19:29:31,755 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-09-15 19:29:31,755 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/certificate-witnesses-artifact/automizer/z3 [2024-09-15 19:29:31,757 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-15 19:29:31,758 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-15 19:29:31,800 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-15 19:29:31,801 INFO L262 TraceCheckSpWp]: Trace formula consists of 166 conjuncts, 33 conjuncts are in the unsatisfiable core [2024-09-15 19:29:31,803 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2024-09-15 19:29:32,047 INFO L134 CoverageAnalysis]: Checked inductivity of 135 backedges. 15 proven. 29 refuted. 0 times theorem prover too weak. 91 trivial. 0 not checked. [2024-09-15 19:29:32,048 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2024-09-15 19:29:33,119 INFO L134 CoverageAnalysis]: Checked inductivity of 135 backedges. 15 proven. 29 refuted. 0 times theorem prover too weak. 91 trivial. 0 not checked. [2024-09-15 19:29:33,119 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-09-15 19:29:33,119 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [94873361] [2024-09-15 19:29:33,119 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2024-09-15 19:29:33,119 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1046556873] [2024-09-15 19:29:33,119 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1046556873] provided 0 perfect and 2 imperfect interpolant sequences [2024-09-15 19:29:33,119 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-09-15 19:29:33,119 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9] total 15 [2024-09-15 19:29:33,119 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1759824882] [2024-09-15 19:29:33,120 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-09-15 19:29:33,120 INFO L551 AbstractCegarLoop]: INTERPOLANT automaton has 15 states [2024-09-15 19:29:33,120 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-09-15 19:29:33,120 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2024-09-15 19:29:33,120 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=43, Invalid=167, Unknown=0, NotChecked=0, Total=210 [2024-09-15 19:29:33,121 INFO L87 Difference]: Start difference. First operand 63 states and 76 transitions. Second operand has 15 states, 15 states have (on average 2.4) internal successors, (36), 14 states have internal predecessors, (36), 8 states have call successors, (21), 3 states have call predecessors, (21), 2 states have return successors, (18), 5 states have call predecessors, (18), 6 states have call successors, (18) [2024-09-15 19:29:33,595 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-09-15 19:29:33,595 INFO L93 Difference]: Finished difference Result 138 states and 183 transitions. [2024-09-15 19:29:33,595 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2024-09-15 19:29:33,596 INFO L78 Accepts]: Start accepts. Automaton has has 15 states, 15 states have (on average 2.4) internal successors, (36), 14 states have internal predecessors, (36), 8 states have call successors, (21), 3 states have call predecessors, (21), 2 states have return successors, (18), 5 states have call predecessors, (18), 6 states have call successors, (18) Word has length 63 [2024-09-15 19:29:33,596 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-09-15 19:29:33,597 INFO L225 Difference]: With dead ends: 138 [2024-09-15 19:29:33,598 INFO L226 Difference]: Without dead ends: 115 [2024-09-15 19:29:33,599 INFO L433 NwaCegarLoop]: 0 DeclaredPredicates, 129 GetRequests, 112 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 28 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=76, Invalid=266, Unknown=0, NotChecked=0, Total=342 [2024-09-15 19:29:33,599 INFO L434 NwaCegarLoop]: 31 mSDtfsCounter, 33 mSDsluCounter, 194 mSDsCounter, 0 mSdLazyCounter, 256 mSolverCounterSat, 62 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 38 SdHoareTripleChecker+Valid, 225 SdHoareTripleChecker+Invalid, 318 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 62 IncrementalHoareTripleChecker+Valid, 256 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2024-09-15 19:29:33,599 INFO L435 NwaCegarLoop]: SdHoareTripleChecker [38 Valid, 225 Invalid, 318 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [62 Valid, 256 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2024-09-15 19:29:33,600 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 115 states. [2024-09-15 19:29:33,633 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 115 to 113. [2024-09-15 19:29:33,633 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 113 states, 66 states have (on average 1.2121212121212122) internal successors, (80), 71 states have internal predecessors, (80), 34 states have call successors, (34), 13 states have call predecessors, (34), 12 states have return successors, (32), 28 states have call predecessors, (32), 32 states have call successors, (32) [2024-09-15 19:29:33,634 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 113 states to 113 states and 146 transitions. [2024-09-15 19:29:33,634 INFO L78 Accepts]: Start accepts. Automaton has 113 states and 146 transitions. Word has length 63 [2024-09-15 19:29:33,634 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-09-15 19:29:33,635 INFO L474 AbstractCegarLoop]: Abstraction has 113 states and 146 transitions. [2024-09-15 19:29:33,635 INFO L475 AbstractCegarLoop]: INTERPOLANT automaton has has 15 states, 15 states have (on average 2.4) internal successors, (36), 14 states have internal predecessors, (36), 8 states have call successors, (21), 3 states have call predecessors, (21), 2 states have return successors, (18), 5 states have call predecessors, (18), 6 states have call successors, (18) [2024-09-15 19:29:33,635 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-15 19:29:33,635 INFO L276 IsEmpty]: Start isEmpty. Operand 113 states and 146 transitions. [2024-09-15 19:29:33,636 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 75 [2024-09-15 19:29:33,636 INFO L208 NwaCegarLoop]: Found error trace [2024-09-15 19:29:33,636 INFO L216 NwaCegarLoop]: trace histogram [11, 10, 10, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-09-15 19:29:33,648 INFO L552 MonitoredProcess]: [MP /storage/repos/certificate-witnesses-artifact/automizer/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Ended with exit code 0 [2024-09-15 19:29:33,840 WARN L456 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7,5 /storage/repos/certificate-witnesses-artifact/automizer/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-09-15 19:29:33,841 INFO L399 AbstractCegarLoop]: === Iteration 9 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-09-15 19:29:33,841 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-15 19:29:33,841 INFO L85 PathProgramCache]: Analyzing trace with hash -2048390162, now seen corresponding path program 1 times [2024-09-15 19:29:33,841 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-09-15 19:29:33,841 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1646917184] [2024-09-15 19:29:33,841 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-09-15 19:29:33,841 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-09-15 19:29:33,864 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unknown [2024-09-15 19:29:33,866 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [101136226] [2024-09-15 19:29:33,866 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-09-15 19:29:33,866 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-09-15 19:29:33,866 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/certificate-witnesses-artifact/automizer/z3 [2024-09-15 19:29:33,867 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-15 19:29:33,868 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-15 19:29:33,908 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-15 19:29:33,909 INFO L262 TraceCheckSpWp]: Trace formula consists of 186 conjuncts, 35 conjuncts are in the unsatisfiable core [2024-09-15 19:29:33,911 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2024-09-15 19:29:34,084 INFO L134 CoverageAnalysis]: Checked inductivity of 209 backedges. 19 proven. 37 refuted. 0 times theorem prover too weak. 153 trivial. 0 not checked. [2024-09-15 19:29:34,084 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2024-09-15 19:29:34,514 INFO L134 CoverageAnalysis]: Checked inductivity of 209 backedges. 19 proven. 37 refuted. 0 times theorem prover too weak. 153 trivial. 0 not checked. [2024-09-15 19:29:34,514 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-09-15 19:29:34,514 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1646917184] [2024-09-15 19:29:34,514 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2024-09-15 19:29:34,515 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [101136226] [2024-09-15 19:29:34,515 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [101136226] provided 0 perfect and 2 imperfect interpolant sequences [2024-09-15 19:29:34,515 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-09-15 19:29:34,515 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 9] total 16 [2024-09-15 19:29:34,515 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2044773284] [2024-09-15 19:29:34,515 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-09-15 19:29:34,516 INFO L551 AbstractCegarLoop]: INTERPOLANT automaton has 16 states [2024-09-15 19:29:34,516 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-09-15 19:29:34,518 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2024-09-15 19:29:34,518 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=53, Invalid=187, Unknown=0, NotChecked=0, Total=240 [2024-09-15 19:29:34,518 INFO L87 Difference]: Start difference. First operand 113 states and 146 transitions. Second operand has 16 states, 14 states have (on average 2.7142857142857144) internal successors, (38), 15 states have internal predecessors, (38), 9 states have call successors, (25), 3 states have call predecessors, (25), 2 states have return successors, (22), 6 states have call predecessors, (22), 7 states have call successors, (22) [2024-09-15 19:29:35,046 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-09-15 19:29:35,047 INFO L93 Difference]: Finished difference Result 168 states and 221 transitions. [2024-09-15 19:29:35,047 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2024-09-15 19:29:35,047 INFO L78 Accepts]: Start accepts. Automaton has has 16 states, 14 states have (on average 2.7142857142857144) internal successors, (38), 15 states have internal predecessors, (38), 9 states have call successors, (25), 3 states have call predecessors, (25), 2 states have return successors, (22), 6 states have call predecessors, (22), 7 states have call successors, (22) Word has length 74 [2024-09-15 19:29:35,047 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-09-15 19:29:35,048 INFO L225 Difference]: With dead ends: 168 [2024-09-15 19:29:35,049 INFO L226 Difference]: Without dead ends: 136 [2024-09-15 19:29:35,049 INFO L433 NwaCegarLoop]: 0 DeclaredPredicates, 150 GetRequests, 133 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 28 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=79, Invalid=263, Unknown=0, NotChecked=0, Total=342 [2024-09-15 19:29:35,049 INFO L434 NwaCegarLoop]: 35 mSDtfsCounter, 15 mSDsluCounter, 160 mSDsCounter, 0 mSdLazyCounter, 236 mSolverCounterSat, 31 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 21 SdHoareTripleChecker+Valid, 195 SdHoareTripleChecker+Invalid, 267 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 31 IncrementalHoareTripleChecker+Valid, 236 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2024-09-15 19:29:35,050 INFO L435 NwaCegarLoop]: SdHoareTripleChecker [21 Valid, 195 Invalid, 267 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [31 Valid, 236 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2024-09-15 19:29:35,051 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 136 states. [2024-09-15 19:29:35,089 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 136 to 110. [2024-09-15 19:29:35,090 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 110 states, 65 states have (on average 1.1692307692307693) internal successors, (76), 70 states have internal predecessors, (76), 31 states have call successors, (31), 14 states have call predecessors, (31), 13 states have return successors, (29), 25 states have call predecessors, (29), 29 states have call successors, (29) [2024-09-15 19:29:35,091 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 110 states to 110 states and 136 transitions. [2024-09-15 19:29:35,092 INFO L78 Accepts]: Start accepts. Automaton has 110 states and 136 transitions. Word has length 74 [2024-09-15 19:29:35,092 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-09-15 19:29:35,093 INFO L474 AbstractCegarLoop]: Abstraction has 110 states and 136 transitions. [2024-09-15 19:29:35,093 INFO L475 AbstractCegarLoop]: INTERPOLANT automaton has has 16 states, 14 states have (on average 2.7142857142857144) internal successors, (38), 15 states have internal predecessors, (38), 9 states have call successors, (25), 3 states have call predecessors, (25), 2 states have return successors, (22), 6 states have call predecessors, (22), 7 states have call successors, (22) [2024-09-15 19:29:35,094 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-15 19:29:35,094 INFO L276 IsEmpty]: Start isEmpty. Operand 110 states and 136 transitions. [2024-09-15 19:29:35,095 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 80 [2024-09-15 19:29:35,096 INFO L208 NwaCegarLoop]: Found error trace [2024-09-15 19:29:35,097 INFO L216 NwaCegarLoop]: trace histogram [12, 11, 11, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-09-15 19:29:35,110 INFO L552 MonitoredProcess]: [MP /storage/repos/certificate-witnesses-artifact/automizer/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Ended with exit code 0 [2024-09-15 19:29:35,299 WARN L456 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8,6 /storage/repos/certificate-witnesses-artifact/automizer/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-09-15 19:29:35,300 INFO L399 AbstractCegarLoop]: === Iteration 10 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-09-15 19:29:35,300 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-15 19:29:35,300 INFO L85 PathProgramCache]: Analyzing trace with hash 1556827571, now seen corresponding path program 1 times [2024-09-15 19:29:35,300 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-09-15 19:29:35,300 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [717387472] [2024-09-15 19:29:35,300 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-09-15 19:29:35,300 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-09-15 19:29:35,311 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-15 19:29:35,523 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2024-09-15 19:29:35,524 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-15 19:29:35,526 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-09-15 19:29:35,526 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-15 19:29:35,527 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2024-09-15 19:29:35,528 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-15 19:29:35,531 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-09-15 19:29:35,532 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-15 19:29:35,534 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 22 [2024-09-15 19:29:35,535 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-15 19:29:35,536 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-09-15 19:29:35,538 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-15 19:29:35,540 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 34 [2024-09-15 19:29:35,541 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-15 19:29:35,544 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 39 [2024-09-15 19:29:35,545 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-15 19:29:35,547 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 46 [2024-09-15 19:29:35,548 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-15 19:29:35,552 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2024-09-15 19:29:35,557 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-15 19:29:35,559 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2024-09-15 19:29:35,560 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-15 19:29:35,575 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 64 [2024-09-15 19:29:35,577 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-15 19:29:35,579 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 70 [2024-09-15 19:29:35,580 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-15 19:29:35,582 INFO L134 CoverageAnalysis]: Checked inductivity of 251 backedges. 22 proven. 9 refuted. 0 times theorem prover too weak. 220 trivial. 0 not checked. [2024-09-15 19:29:35,583 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-09-15 19:29:35,583 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [717387472] [2024-09-15 19:29:35,583 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [717387472] provided 0 perfect and 1 imperfect interpolant sequences [2024-09-15 19:29:35,583 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1552441765] [2024-09-15 19:29:35,584 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-09-15 19:29:35,584 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-09-15 19:29:35,584 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/certificate-witnesses-artifact/automizer/z3 [2024-09-15 19:29:35,585 INFO L229 MonitoredProcess]: Starting monitored process 7 with /storage/repos/certificate-witnesses-artifact/automizer/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-09-15 19:29:35,587 INFO L327 MonitoredProcess]: [MP /storage/repos/certificate-witnesses-artifact/automizer/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Waiting until timeout for monitored process [2024-09-15 19:29:35,629 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-15 19:29:35,630 INFO L262 TraceCheckSpWp]: Trace formula consists of 195 conjuncts, 19 conjuncts are in the unsatisfiable core [2024-09-15 19:29:35,632 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2024-09-15 19:29:35,744 INFO L134 CoverageAnalysis]: Checked inductivity of 251 backedges. 22 proven. 9 refuted. 0 times theorem prover too weak. 220 trivial. 0 not checked. [2024-09-15 19:29:35,745 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2024-09-15 19:29:36,023 INFO L134 CoverageAnalysis]: Checked inductivity of 251 backedges. 22 proven. 9 refuted. 0 times theorem prover too weak. 220 trivial. 0 not checked. [2024-09-15 19:29:36,023 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1552441765] provided 0 perfect and 2 imperfect interpolant sequences [2024-09-15 19:29:36,024 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-09-15 19:29:36,024 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7, 7] total 13 [2024-09-15 19:29:36,024 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [192828096] [2024-09-15 19:29:36,024 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-09-15 19:29:36,024 INFO L551 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2024-09-15 19:29:36,025 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-09-15 19:29:36,025 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2024-09-15 19:29:36,025 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=36, Invalid=120, Unknown=0, NotChecked=0, Total=156 [2024-09-15 19:29:36,025 INFO L87 Difference]: Start difference. First operand 110 states and 136 transitions. Second operand has 13 states, 13 states have (on average 3.3076923076923075) internal successors, (43), 11 states have internal predecessors, (43), 8 states have call successors, (38), 3 states have call predecessors, (38), 1 states have return successors, (34), 8 states have call predecessors, (34), 8 states have call successors, (34) [2024-09-15 19:29:36,169 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-09-15 19:29:36,169 INFO L93 Difference]: Finished difference Result 129 states and 155 transitions. [2024-09-15 19:29:36,169 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-09-15 19:29:36,170 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 13 states have (on average 3.3076923076923075) internal successors, (43), 11 states have internal predecessors, (43), 8 states have call successors, (38), 3 states have call predecessors, (38), 1 states have return successors, (34), 8 states have call predecessors, (34), 8 states have call successors, (34) Word has length 79 [2024-09-15 19:29:36,170 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-09-15 19:29:36,171 INFO L225 Difference]: With dead ends: 129 [2024-09-15 19:29:36,172 INFO L226 Difference]: Without dead ends: 100 [2024-09-15 19:29:36,173 INFO L433 NwaCegarLoop]: 0 DeclaredPredicates, 192 GetRequests, 177 SyntacticMatches, 2 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 40 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=48, Invalid=162, Unknown=0, NotChecked=0, Total=210 [2024-09-15 19:29:36,173 INFO L434 NwaCegarLoop]: 39 mSDtfsCounter, 7 mSDsluCounter, 186 mSDsCounter, 0 mSdLazyCounter, 149 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 7 SdHoareTripleChecker+Valid, 225 SdHoareTripleChecker+Invalid, 155 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 149 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-09-15 19:29:36,174 INFO L435 NwaCegarLoop]: SdHoareTripleChecker [7 Valid, 225 Invalid, 155 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 149 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-09-15 19:29:36,174 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 100 states. [2024-09-15 19:29:36,196 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 100 to 100. [2024-09-15 19:29:36,196 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 100 states, 60 states have (on average 1.1166666666666667) internal successors, (67), 63 states have internal predecessors, (67), 26 states have call successors, (26), 14 states have call predecessors, (26), 13 states have return successors, (24), 22 states have call predecessors, (24), 24 states have call successors, (24) [2024-09-15 19:29:36,197 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 100 states to 100 states and 117 transitions. [2024-09-15 19:29:36,197 INFO L78 Accepts]: Start accepts. Automaton has 100 states and 117 transitions. Word has length 79 [2024-09-15 19:29:36,198 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-09-15 19:29:36,198 INFO L474 AbstractCegarLoop]: Abstraction has 100 states and 117 transitions. [2024-09-15 19:29:36,198 INFO L475 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 13 states have (on average 3.3076923076923075) internal successors, (43), 11 states have internal predecessors, (43), 8 states have call successors, (38), 3 states have call predecessors, (38), 1 states have return successors, (34), 8 states have call predecessors, (34), 8 states have call successors, (34) [2024-09-15 19:29:36,198 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-15 19:29:36,198 INFO L276 IsEmpty]: Start isEmpty. Operand 100 states and 117 transitions. [2024-09-15 19:29:36,199 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 94 [2024-09-15 19:29:36,199 INFO L208 NwaCegarLoop]: Found error trace [2024-09-15 19:29:36,199 INFO L216 NwaCegarLoop]: trace histogram [14, 13, 13, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-09-15 19:29:36,211 INFO L552 MonitoredProcess]: [MP /storage/repos/certificate-witnesses-artifact/automizer/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Ended with exit code 0 [2024-09-15 19:29:36,403 WARN L456 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 7 /storage/repos/certificate-witnesses-artifact/automizer/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable9 [2024-09-15 19:29:36,404 INFO L399 AbstractCegarLoop]: === Iteration 11 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-09-15 19:29:36,404 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-15 19:29:36,404 INFO L85 PathProgramCache]: Analyzing trace with hash -802122381, now seen corresponding path program 2 times [2024-09-15 19:29:36,404 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-09-15 19:29:36,404 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1799610581] [2024-09-15 19:29:36,404 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-09-15 19:29:36,404 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-09-15 19:29:36,420 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-15 19:29:36,553 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2024-09-15 19:29:36,554 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-15 19:29:36,555 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-09-15 19:29:36,556 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-15 19:29:36,569 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2024-09-15 19:29:36,570 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-15 19:29:36,573 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-09-15 19:29:36,574 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-15 19:29:36,576 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 22 [2024-09-15 19:29:36,576 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-15 19:29:36,579 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-09-15 19:29:36,579 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-15 19:29:36,581 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 34 [2024-09-15 19:29:36,582 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-15 19:29:36,584 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 39 [2024-09-15 19:29:36,585 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-15 19:29:36,587 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 46 [2024-09-15 19:29:36,587 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-15 19:29:36,588 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2024-09-15 19:29:36,588 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-15 19:29:36,589 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2024-09-15 19:29:36,589 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-15 19:29:36,590 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 63 [2024-09-15 19:29:36,591 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-15 19:29:36,592 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2024-09-15 19:29:36,593 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-15 19:29:36,594 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 76 [2024-09-15 19:29:36,595 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-15 19:29:36,596 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 81 [2024-09-15 19:29:36,596 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-15 19:29:36,597 INFO L134 CoverageAnalysis]: Checked inductivity of 362 backedges. 36 proven. 5 refuted. 0 times theorem prover too weak. 321 trivial. 0 not checked. [2024-09-15 19:29:36,597 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-09-15 19:29:36,598 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1799610581] [2024-09-15 19:29:36,598 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1799610581] provided 0 perfect and 1 imperfect interpolant sequences [2024-09-15 19:29:36,598 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [58217190] [2024-09-15 19:29:36,598 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2024-09-15 19:29:36,598 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-09-15 19:29:36,598 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/certificate-witnesses-artifact/automizer/z3 [2024-09-15 19:29:36,600 INFO L229 MonitoredProcess]: Starting monitored process 8 with /storage/repos/certificate-witnesses-artifact/automizer/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-09-15 19:29:36,601 INFO L327 MonitoredProcess]: [MP /storage/repos/certificate-witnesses-artifact/automizer/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Waiting until timeout for monitored process [2024-09-15 19:29:36,648 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2024-09-15 19:29:36,648 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2024-09-15 19:29:36,649 INFO L262 TraceCheckSpWp]: Trace formula consists of 228 conjuncts, 10 conjuncts are in the unsatisfiable core [2024-09-15 19:29:36,651 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2024-09-15 19:29:36,701 INFO L134 CoverageAnalysis]: Checked inductivity of 362 backedges. 195 proven. 0 refuted. 0 times theorem prover too weak. 167 trivial. 0 not checked. [2024-09-15 19:29:36,701 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-09-15 19:29:36,703 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [58217190] provided 1 perfect and 0 imperfect interpolant sequences [2024-09-15 19:29:36,703 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-09-15 19:29:36,703 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [7] total 9 [2024-09-15 19:29:36,703 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2130911467] [2024-09-15 19:29:36,703 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-09-15 19:29:36,703 INFO L551 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-09-15 19:29:36,703 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-09-15 19:29:36,704 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-09-15 19:29:36,704 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=53, Unknown=0, NotChecked=0, Total=72 [2024-09-15 19:29:36,704 INFO L87 Difference]: Start difference. First operand 100 states and 117 transitions. Second operand has 7 states, 7 states have (on average 3.2857142857142856) internal successors, (23), 6 states have internal predecessors, (23), 4 states have call successors, (14), 2 states have call predecessors, (14), 3 states have return successors, (13), 5 states have call predecessors, (13), 4 states have call successors, (13) [2024-09-15 19:29:36,749 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-09-15 19:29:36,749 INFO L93 Difference]: Finished difference Result 100 states and 117 transitions. [2024-09-15 19:29:36,749 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-09-15 19:29:36,749 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 3.2857142857142856) internal successors, (23), 6 states have internal predecessors, (23), 4 states have call successors, (14), 2 states have call predecessors, (14), 3 states have return successors, (13), 5 states have call predecessors, (13), 4 states have call successors, (13) Word has length 93 [2024-09-15 19:29:36,749 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-09-15 19:29:36,750 INFO L225 Difference]: With dead ends: 100 [2024-09-15 19:29:36,750 INFO L226 Difference]: Without dead ends: 0 [2024-09-15 19:29:36,751 INFO L433 NwaCegarLoop]: 0 DeclaredPredicates, 130 GetRequests, 121 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=31, Invalid=79, Unknown=0, NotChecked=0, Total=110 [2024-09-15 19:29:36,752 INFO L434 NwaCegarLoop]: 24 mSDtfsCounter, 3 mSDsluCounter, 89 mSDsCounter, 0 mSdLazyCounter, 32 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3 SdHoareTripleChecker+Valid, 113 SdHoareTripleChecker+Invalid, 35 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 32 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-09-15 19:29:36,752 INFO L435 NwaCegarLoop]: SdHoareTripleChecker [3 Valid, 113 Invalid, 35 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 32 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-09-15 19:29:36,752 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2024-09-15 19:29:36,752 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2024-09-15 19:29:36,753 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-15 19:29:36,753 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2024-09-15 19:29:36,753 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 93 [2024-09-15 19:29:36,753 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-09-15 19:29:36,753 INFO L474 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2024-09-15 19:29:36,753 INFO L475 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 3.2857142857142856) internal successors, (23), 6 states have internal predecessors, (23), 4 states have call successors, (14), 2 states have call predecessors, (14), 3 states have return successors, (13), 5 states have call predecessors, (13), 4 states have call successors, (13) [2024-09-15 19:29:36,754 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-15 19:29:36,754 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2024-09-15 19:29:36,754 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2024-09-15 19:29:36,756 INFO L785 garLoopResultBuilder]: Registering result SAFE for location __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2024-09-15 19:29:36,770 INFO L552 MonitoredProcess]: [MP /storage/repos/certificate-witnesses-artifact/automizer/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Ended with exit code 0 [2024-09-15 19:29:36,960 WARN L456 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10,8 /storage/repos/certificate-witnesses-artifact/automizer/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-09-15 19:29:36,963 INFO L408 BasicCegarLoop]: Path program histogram: [2, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-09-15 19:29:36,965 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2024-09-15 19:29:37,461 INFO L165 ceAbstractionStarter]: Computing trace abstraction results [2024-09-15 19:29:37,473 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 15.09 07:29:37 BoogieIcfgContainer [2024-09-15 19:29:37,473 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2024-09-15 19:29:37,474 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2024-09-15 19:29:37,474 INFO L270 PluginConnector]: Initializing Witness Printer... [2024-09-15 19:29:37,474 INFO L274 PluginConnector]: Witness Printer initialized [2024-09-15 19:29:37,474 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 15.09 07:29:29" (3/4) ... [2024-09-15 19:29:37,475 INFO L139 WitnessPrinter]: Generating witness for correct program [2024-09-15 19:29:37,478 INFO L361 RCFGBacktranslator]: Ignoring RootEdge to procedure ULTIMATE.init [2024-09-15 19:29:37,478 INFO L361 RCFGBacktranslator]: Ignoring RootEdge to procedure assume_abort_if_not [2024-09-15 19:29:37,478 INFO L361 RCFGBacktranslator]: Ignoring RootEdge to procedure main [2024-09-15 19:29:37,478 INFO L361 RCFGBacktranslator]: Ignoring RootEdge to procedure __VERIFIER_assert [2024-09-15 19:29:37,482 INFO L896 BoogieBacktranslator]: Reduced CFG by removing 20 nodes and edges [2024-09-15 19:29:37,483 INFO L896 BoogieBacktranslator]: Reduced CFG by removing 8 nodes and edges [2024-09-15 19:29:37,483 INFO L896 BoogieBacktranslator]: Reduced CFG by removing 4 nodes and edges [2024-09-15 19:29:37,483 INFO L896 BoogieBacktranslator]: Reduced CFG by removing 1 nodes and edges [2024-09-15 19:29:37,483 INFO L896 BoogieBacktranslator]: Reduced CFG by removing 1 nodes and edges [2024-09-15 19:29:37,550 INFO L149 WitnessManager]: Wrote witness to /storage/repos/certificate-witnesses-artifact/automizer/witness.graphml [2024-09-15 19:29:37,550 INFO L149 WitnessManager]: Wrote witness to /storage/repos/certificate-witnesses-artifact/automizer/witness.yml [2024-09-15 19:29:37,551 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2024-09-15 19:29:37,551 INFO L158 Benchmark]: Toolchain (without parser) took 8787.28ms. Allocated memory was 65.0MB in the beginning and 192.9MB in the end (delta: 127.9MB). Free memory was 43.3MB in the beginning and 138.5MB in the end (delta: -95.2MB). Peak memory consumption was 35.2MB. Max. memory is 16.1GB. [2024-09-15 19:29:37,552 INFO L158 Benchmark]: CDTParser took 0.12ms. Allocated memory is still 65.0MB. Free memory was 39.7MB in the beginning and 39.6MB in the end (delta: 73.4kB). There was no memory consumed. Max. memory is 16.1GB. [2024-09-15 19:29:37,552 INFO L158 Benchmark]: CACSL2BoogieTranslator took 171.18ms. Allocated memory is still 65.0MB. Free memory was 43.0MB in the beginning and 31.5MB in the end (delta: 11.5MB). Peak memory consumption was 12.6MB. Max. memory is 16.1GB. [2024-09-15 19:29:37,552 INFO L158 Benchmark]: Boogie Procedure Inliner took 22.70ms. Allocated memory is still 65.0MB. Free memory was 31.5MB in the beginning and 30.4MB in the end (delta: 1.0MB). There was no memory consumed. Max. memory is 16.1GB. [2024-09-15 19:29:37,552 INFO L158 Benchmark]: Boogie Preprocessor took 36.28ms. Allocated memory is still 65.0MB. Free memory was 30.4MB in the beginning and 28.6MB in the end (delta: 1.9MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2024-09-15 19:29:37,552 INFO L158 Benchmark]: RCFGBuilder took 325.86ms. Allocated memory was 65.0MB in the beginning and 90.2MB in the end (delta: 25.2MB). Free memory was 28.6MB in the beginning and 58.7MB in the end (delta: -30.1MB). Peak memory consumption was 2.8MB. Max. memory is 16.1GB. [2024-09-15 19:29:37,553 INFO L158 Benchmark]: TraceAbstraction took 8148.83ms. Allocated memory was 90.2MB in the beginning and 192.9MB in the end (delta: 102.8MB). Free memory was 57.9MB in the beginning and 143.7MB in the end (delta: -85.8MB). Peak memory consumption was 104.4MB. Max. memory is 16.1GB. [2024-09-15 19:29:37,553 INFO L158 Benchmark]: Witness Printer took 77.36ms. Allocated memory is still 192.9MB. Free memory was 143.7MB in the beginning and 138.5MB in the end (delta: 5.2MB). Peak memory consumption was 6.3MB. Max. memory is 16.1GB. [2024-09-15 19:29:37,554 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.12ms. Allocated memory is still 65.0MB. Free memory was 39.7MB in the beginning and 39.6MB in the end (delta: 73.4kB). There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 171.18ms. Allocated memory is still 65.0MB. Free memory was 43.0MB in the beginning and 31.5MB in the end (delta: 11.5MB). Peak memory consumption was 12.6MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 22.70ms. Allocated memory is still 65.0MB. Free memory was 31.5MB in the beginning and 30.4MB in the end (delta: 1.0MB). There was no memory consumed. Max. memory is 16.1GB. * Boogie Preprocessor took 36.28ms. Allocated memory is still 65.0MB. Free memory was 30.4MB in the beginning and 28.6MB in the end (delta: 1.9MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * RCFGBuilder took 325.86ms. Allocated memory was 65.0MB in the beginning and 90.2MB in the end (delta: 25.2MB). Free memory was 28.6MB in the beginning and 58.7MB in the end (delta: -30.1MB). Peak memory consumption was 2.8MB. Max. memory is 16.1GB. * TraceAbstraction took 8148.83ms. Allocated memory was 90.2MB in the beginning and 192.9MB in the end (delta: 102.8MB). Free memory was 57.9MB in the beginning and 143.7MB in the end (delta: -85.8MB). Peak memory consumption was 104.4MB. Max. memory is 16.1GB. * Witness Printer took 77.36ms. Allocated memory is still 192.9MB. Free memory was 143.7MB in the beginning and 138.5MB in the end (delta: 5.2MB). Peak memory consumption was 6.3MB. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: ErrorAutomatonStatistics NumberErrorTraces: 0, NumberStatementsAllTraces: 0, NumberRelevantStatements: 0, 0.0s ErrorAutomatonConstructionTimeTotal, 0.0s FaulLocalizationTime, NumberStatementsFirstTrace: -1, TraceLengthAvg: 0, 0.0s ErrorAutomatonConstructionTimeAvg, 0.0s ErrorAutomatonDifferenceTimeAvg, 0.0s ErrorAutomatonDifferenceTimeTotal, NumberOfNoEnhancement: 0, NumberOfFiniteEnhancement: 0, NumberOfInfiniteEnhancement: 0 - PositiveResult [Line: 17]: a call to reach_error is unreachable For all program executions holds that a call to reach_error is unreachable at this location - StatisticsResult: Ultimate Automizer benchmark data CFG has 5 procedures, 33 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 7.6s, OverallIterations: 11, TraceHistogramMax: 14, PathProgramHistogramMax: 2, EmptinessCheckTime: 0.0s, AutomataDifference: 1.6s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 126 SdHoareTripleChecker+Valid, 1.0s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 96 mSDsluCounter, 1459 SdHoareTripleChecker+Invalid, 0.8s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 1103 mSDsCounter, 108 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 898 IncrementalHoareTripleChecker+Invalid, 1006 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 108 mSolverCounterUnsat, 356 mSDtfsCounter, 898 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 797 GetRequests, 711 SyntacticMatches, 4 SemanticMatches, 82 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 105 ImplicationChecksByTransitivity, 0.8s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=113occurred in iteration=8, InterpolantAutomatonStates: 77, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.2s AutomataMinimizationTime, 11 MinimizatonAttempts, 44 StatesRemovedByMinimization, 6 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 0.3s SatisfiabilityAnalysisTime, 3.6s InterpolantComputationTime, 924 NumberOfCodeBlocks, 924 NumberOfCodeBlocksAsserted, 19 NumberOfCheckSat, 927 ConstructedInterpolants, 0 QuantifiedInterpolants, 4647 SizeOfPredicates, 11 NumberOfNonLiveVariables, 1098 ConjunctsInSsa, 126 ConjunctsInUnsatCore, 17 InterpolantComputations, 8 PerfectInterpolantSequences, 2205/2373 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: 44]: Loop Invariant Derived loop invariant: (((((((A == r) && (p == 2)) && (d == 2)) && (q == 0)) && (B == 1)) || (((((A == ((long long) r + 1)) && (d == 1)) && (B == 1)) && (q == 1)) && (p == 1))) || (((((A == r) && (d == 1)) && (q == 0)) && (B == 1)) && (p == 1))) - InvariantResult [Line: 34]: Loop Invariant Derived loop invariant: ((((((((0 <= A) && (A == r)) && (p == 2)) && (A <= 1)) && (d == 2)) && (q == 0)) && (B == 1)) || (((((((0 <= A) && (A == r)) && (A <= 1)) && (d == 1)) && (q == 0)) && (B == 1)) && (p == 1))) - ProcedureContractResult [Line: 11]: Procedure Contract for assume_abort_if_not Derived contract for procedure assume_abort_if_not. Ensures: (\old(cond) != 0) - ProcedureContractResult [Line: 14]: Procedure Contract for __VERIFIER_assert Derived contract for procedure __VERIFIER_assert. Requires: (\old(cond) != 0) Ensures: (\old(cond) != 0) RESULT: Ultimate proved your program to be correct! [2024-09-15 19:29:37,572 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