./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/loop-crafted/simple_array_index_value_4.i --full-output --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 a9b967e5 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/loop-crafted/simple_array_index_value_4.i -s /storage/repos/certificate-witnesses-artifact/automizer/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/certificate-witnesses-artifact/automizer --witnessprinter.witness.filename witness --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! call(reach_error())) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash 6604dbb2462dfab53c0d37d83d08add09bc53abffb53773fd7099f9e7acddff3 --traceabstraction.positions.where.we.compute.the.hoare.annotation All --witnessprinter.yaml.format.version 2.1 --- Real Ultimate output --- This is Ultimate 0.2.4-dev-a9b967e-m [2024-09-11 19:21:48,448 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-09-11 19:21:48,520 INFO L114 SettingsManager]: Loading settings from /storage/repos/certificate-witnesses-artifact/automizer/config/svcomp-Reach-32bit-Automizer_Default.epf [2024-09-11 19:21:48,526 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-09-11 19:21:48,526 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-09-11 19:21:48,551 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-09-11 19:21:48,552 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-09-11 19:21:48,552 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-09-11 19:21:48,553 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-09-11 19:21:48,553 INFO L153 SettingsManager]: * Use memory slicer=true [2024-09-11 19:21:48,554 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-09-11 19:21:48,554 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-09-11 19:21:48,555 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-09-11 19:21:48,558 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-09-11 19:21:48,559 INFO L153 SettingsManager]: * Use SBE=true [2024-09-11 19:21:48,559 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-09-11 19:21:48,559 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-09-11 19:21:48,560 INFO L153 SettingsManager]: * sizeof long=4 [2024-09-11 19:21:48,560 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-09-11 19:21:48,560 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-09-11 19:21:48,560 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-09-11 19:21:48,561 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-09-11 19:21:48,561 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-09-11 19:21:48,561 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-09-11 19:21:48,562 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-09-11 19:21:48,562 INFO L153 SettingsManager]: * sizeof long double=12 [2024-09-11 19:21:48,562 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-09-11 19:21:48,562 INFO L153 SettingsManager]: * Use constant arrays=true [2024-09-11 19:21:48,563 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-09-11 19:21:48,563 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-09-11 19:21:48,563 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-09-11 19:21:48,564 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-09-11 19:21:48,564 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-09-11 19:21:48,564 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-09-11 19:21:48,564 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-09-11 19:21:48,565 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-09-11 19:21:48,565 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-09-11 19:21:48,565 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-09-11 19:21:48,565 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-09-11 19:21:48,566 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-09-11 19:21:48,566 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-09-11 19:21:48,566 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-09-11 19:21:48,566 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 -> 6604dbb2462dfab53c0d37d83d08add09bc53abffb53773fd7099f9e7acddff3 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-11 19:21:48,858 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-09-11 19:21:48,884 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-09-11 19:21:48,887 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-09-11 19:21:48,888 INFO L270 PluginConnector]: Initializing CDTParser... [2024-09-11 19:21:48,889 INFO L274 PluginConnector]: CDTParser initialized [2024-09-11 19:21:48,890 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/certificate-witnesses-artifact/automizer/../sv-benchmarks/c/loop-crafted/simple_array_index_value_4.i [2024-09-11 19:21:50,369 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-09-11 19:21:50,574 INFO L384 CDTParser]: Found 1 translation units. [2024-09-11 19:21:50,574 INFO L180 CDTParser]: Scanning /storage/repos/certificate-witnesses-artifact/sv-benchmarks/c/loop-crafted/simple_array_index_value_4.i [2024-09-11 19:21:50,586 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/certificate-witnesses-artifact/automizer/data/6fef9521b/2b9838c0073646f1ba8fe6f37e6b02a3/FLAG37238f454 [2024-09-11 19:21:50,604 INFO L435 CDTParser]: Successfully deleted /storage/repos/certificate-witnesses-artifact/automizer/data/6fef9521b/2b9838c0073646f1ba8fe6f37e6b02a3 [2024-09-11 19:21:50,607 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-09-11 19:21:50,609 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-09-11 19:21:50,612 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-09-11 19:21:50,613 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-09-11 19:21:50,619 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-09-11 19:21:50,620 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 11.09 07:21:50" (1/1) ... [2024-09-11 19:21:50,621 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@3061ed7c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.09 07:21:50, skipping insertion in model container [2024-09-11 19:21:50,621 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 11.09 07:21:50" (1/1) ... [2024-09-11 19:21:50,646 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-09-11 19:21:50,830 WARN L247 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/certificate-witnesses-artifact/sv-benchmarks/c/loop-crafted/simple_array_index_value_4.i[919,932] [2024-09-11 19:21:50,853 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-09-11 19:21:50,862 INFO L200 MainTranslator]: Completed pre-run [2024-09-11 19:21:50,878 WARN L247 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/certificate-witnesses-artifact/sv-benchmarks/c/loop-crafted/simple_array_index_value_4.i[919,932] [2024-09-11 19:21:50,885 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-09-11 19:21:50,903 INFO L204 MainTranslator]: Completed translation [2024-09-11 19:21:50,904 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.09 07:21:50 WrapperNode [2024-09-11 19:21:50,904 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-09-11 19:21:50,906 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-09-11 19:21:50,907 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-09-11 19:21:50,907 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-09-11 19:21:50,914 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.09 07:21:50" (1/1) ... [2024-09-11 19:21:50,925 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.09 07:21:50" (1/1) ... [2024-09-11 19:21:50,954 INFO L138 Inliner]: procedures = 17, calls = 18, calls flagged for inlining = 2, calls inlined = 2, statements flattened = 67 [2024-09-11 19:21:50,958 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-09-11 19:21:50,958 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-09-11 19:21:50,959 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-09-11 19:21:50,959 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-09-11 19:21:50,968 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.09 07:21:50" (1/1) ... [2024-09-11 19:21:50,969 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.09 07:21:50" (1/1) ... [2024-09-11 19:21:50,971 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.09 07:21:50" (1/1) ... [2024-09-11 19:21:50,990 INFO L175 MemorySlicer]: Split 7 memory accesses to 2 slices as follows [2, 5]. 71 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2, 0]. The 1 writes are split as follows [0, 1]. [2024-09-11 19:21:50,991 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.09 07:21:50" (1/1) ... [2024-09-11 19:21:50,991 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.09 07:21:50" (1/1) ... [2024-09-11 19:21:50,998 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.09 07:21:50" (1/1) ... [2024-09-11 19:21:51,005 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.09 07:21:50" (1/1) ... [2024-09-11 19:21:51,010 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.09 07:21:50" (1/1) ... [2024-09-11 19:21:51,011 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.09 07:21:50" (1/1) ... [2024-09-11 19:21:51,015 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-09-11 19:21:51,020 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-09-11 19:21:51,020 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-09-11 19:21:51,020 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-09-11 19:21:51,021 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.09 07:21:50" (1/1) ... [2024-09-11 19:21:51,030 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-09-11 19:21:51,043 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/certificate-witnesses-artifact/automizer/z3 [2024-09-11 19:21:51,060 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-11 19:21:51,064 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-11 19:21:51,113 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-09-11 19:21:51,113 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2024-09-11 19:21:51,113 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2024-09-11 19:21:51,113 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-09-11 19:21:51,113 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#1 [2024-09-11 19:21:51,114 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2024-09-11 19:21:51,114 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#0 [2024-09-11 19:21:51,114 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#1 [2024-09-11 19:21:51,114 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-09-11 19:21:51,116 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-09-11 19:21:51,116 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#0 [2024-09-11 19:21:51,116 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#1 [2024-09-11 19:21:51,116 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2024-09-11 19:21:51,116 INFO L138 BoogieDeclarations]: Found implementation of procedure __VERIFIER_assert [2024-09-11 19:21:51,117 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2024-09-11 19:21:51,187 INFO L242 CfgBuilder]: Building ICFG [2024-09-11 19:21:51,190 INFO L268 CfgBuilder]: Building CFG for each procedure with an implementation [2024-09-11 19:21:51,407 INFO L? ?]: Removed 10 outVars from TransFormulas that were not future-live. [2024-09-11 19:21:51,407 INFO L291 CfgBuilder]: Performing block encoding [2024-09-11 19:21:51,431 INFO L313 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-09-11 19:21:51,432 INFO L318 CfgBuilder]: Removed 3 assume(true) statements. [2024-09-11 19:21:51,432 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 11.09 07:21:51 BoogieIcfgContainer [2024-09-11 19:21:51,433 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-09-11 19:21:51,435 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-09-11 19:21:51,436 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-09-11 19:21:51,438 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-09-11 19:21:51,439 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 11.09 07:21:50" (1/3) ... [2024-09-11 19:21:51,439 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4e7be8ff and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 11.09 07:21:51, skipping insertion in model container [2024-09-11 19:21:51,439 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.09 07:21:50" (2/3) ... [2024-09-11 19:21:51,440 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4e7be8ff and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 11.09 07:21:51, skipping insertion in model container [2024-09-11 19:21:51,440 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 11.09 07:21:51" (3/3) ... [2024-09-11 19:21:51,441 INFO L112 eAbstractionObserver]: Analyzing ICFG simple_array_index_value_4.i [2024-09-11 19:21:51,454 INFO L209 ceAbstractionStarter]: Automizer settings: Hoare:All NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-09-11 19:21:51,455 INFO L149 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-09-11 19:21:51,508 INFO L335 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-09-11 19:21:51,514 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;@6651c41e, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-09-11 19:21:51,515 INFO L337 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-09-11 19:21:51,518 INFO L276 IsEmpty]: Start isEmpty. Operand has 27 states, 18 states have (on average 1.5555555555555556) internal successors, (28), 20 states have internal predecessors, (28), 5 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) [2024-09-11 19:21:51,526 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2024-09-11 19:21:51,526 INFO L208 NwaCegarLoop]: Found error trace [2024-09-11 19:21:51,527 INFO L216 NwaCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-09-11 19:21:51,528 INFO L399 AbstractCegarLoop]: === Iteration 1 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-09-11 19:21:51,533 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-11 19:21:51,534 INFO L85 PathProgramCache]: Analyzing trace with hash -2035542436, now seen corresponding path program 1 times [2024-09-11 19:21:51,544 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-09-11 19:21:51,544 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1069581802] [2024-09-11 19:21:51,544 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-09-11 19:21:51,545 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-09-11 19:21:51,665 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-11 19:21:51,886 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2024-09-11 19:21:51,889 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-11 19:21:51,898 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2024-09-11 19:21:51,900 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-11 19:21:51,906 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2024-09-11 19:21:51,908 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-09-11 19:21:51,909 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1069581802] [2024-09-11 19:21:51,910 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1069581802] provided 1 perfect and 0 imperfect interpolant sequences [2024-09-11 19:21:51,910 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-09-11 19:21:51,910 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-09-11 19:21:51,912 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [220105213] [2024-09-11 19:21:51,912 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-09-11 19:21:51,916 INFO L551 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-09-11 19:21:51,917 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-09-11 19:21:51,939 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-09-11 19:21:51,940 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-09-11 19:21:51,942 INFO L87 Difference]: Start difference. First operand has 27 states, 18 states have (on average 1.5555555555555556) internal successors, (28), 20 states have internal predecessors, (28), 5 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) Second operand has 3 states, 3 states have (on average 3.6666666666666665) internal successors, (11), 3 states have internal predecessors, (11), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2024-09-11 19:21:51,985 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-09-11 19:21:51,985 INFO L93 Difference]: Finished difference Result 53 states and 80 transitions. [2024-09-11 19:21:51,986 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-09-11 19:21:51,987 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 3.6666666666666665) internal successors, (11), 3 states have internal predecessors, (11), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) Word has length 19 [2024-09-11 19:21:51,988 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-09-11 19:21:51,993 INFO L225 Difference]: With dead ends: 53 [2024-09-11 19:21:51,993 INFO L226 Difference]: Without dead ends: 26 [2024-09-11 19:21:51,996 INFO L433 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-09-11 19:21:51,998 INFO L434 NwaCegarLoop]: 30 mSDtfsCounter, 0 mSDsluCounter, 28 mSDsCounter, 0 mSdLazyCounter, 7 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 58 SdHoareTripleChecker+Invalid, 7 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 7 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-09-11 19:21:52,000 INFO L435 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 58 Invalid, 7 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 7 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-09-11 19:21:52,013 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 26 states. [2024-09-11 19:21:52,026 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 26 to 26. [2024-09-11 19:21:52,027 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 26 states, 18 states have (on average 1.1666666666666667) internal successors, (21), 19 states have internal predecessors, (21), 5 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) [2024-09-11 19:21:52,029 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 26 states to 26 states and 31 transitions. [2024-09-11 19:21:52,030 INFO L78 Accepts]: Start accepts. Automaton has 26 states and 31 transitions. Word has length 19 [2024-09-11 19:21:52,031 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-09-11 19:21:52,031 INFO L474 AbstractCegarLoop]: Abstraction has 26 states and 31 transitions. [2024-09-11 19:21:52,031 INFO L475 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 3.6666666666666665) internal successors, (11), 3 states have internal predecessors, (11), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2024-09-11 19:21:52,032 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-11 19:21:52,032 INFO L276 IsEmpty]: Start isEmpty. Operand 26 states and 31 transitions. [2024-09-11 19:21:52,035 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2024-09-11 19:21:52,035 INFO L208 NwaCegarLoop]: Found error trace [2024-09-11 19:21:52,035 INFO L216 NwaCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-09-11 19:21:52,035 WARN L456 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-09-11 19:21:52,035 INFO L399 AbstractCegarLoop]: === Iteration 2 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-09-11 19:21:52,036 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-11 19:21:52,036 INFO L85 PathProgramCache]: Analyzing trace with hash 1289629987, now seen corresponding path program 1 times [2024-09-11 19:21:52,036 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-09-11 19:21:52,036 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [856784523] [2024-09-11 19:21:52,037 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-09-11 19:21:52,037 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-09-11 19:21:52,065 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-11 19:21:52,222 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2024-09-11 19:21:52,224 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-11 19:21:52,230 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-09-11 19:21:52,234 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-11 19:21:52,240 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2024-09-11 19:21:52,241 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-09-11 19:21:52,241 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [856784523] [2024-09-11 19:21:52,241 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [856784523] provided 0 perfect and 1 imperfect interpolant sequences [2024-09-11 19:21:52,241 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [35821269] [2024-09-11 19:21:52,242 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-09-11 19:21:52,242 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-09-11 19:21:52,242 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/certificate-witnesses-artifact/automizer/z3 [2024-09-11 19:21:52,246 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-11 19:21:52,247 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-11 19:21:52,309 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-11 19:21:52,311 INFO L262 TraceCheckSpWp]: Trace formula consists of 71 conjuncts, 12 conjuncts are in the unsatisfiable core [2024-09-11 19:21:52,319 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2024-09-11 19:21:52,544 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2024-09-11 19:21:52,544 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-09-11 19:21:52,545 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [35821269] provided 1 perfect and 0 imperfect interpolant sequences [2024-09-11 19:21:52,545 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-09-11 19:21:52,545 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [4] total 10 [2024-09-11 19:21:52,546 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1180704277] [2024-09-11 19:21:52,546 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-09-11 19:21:52,547 INFO L551 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-09-11 19:21:52,547 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-09-11 19:21:52,548 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-09-11 19:21:52,548 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=71, Unknown=0, NotChecked=0, Total=90 [2024-09-11 19:21:52,549 INFO L87 Difference]: Start difference. First operand 26 states and 31 transitions. Second operand has 8 states, 7 states have (on average 2.142857142857143) internal successors, (15), 6 states have internal predecessors, (15), 2 states have call successors, (3), 2 states have call predecessors, (3), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) [2024-09-11 19:21:52,695 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-09-11 19:21:52,696 INFO L93 Difference]: Finished difference Result 35 states and 40 transitions. [2024-09-11 19:21:52,698 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-09-11 19:21:52,699 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 7 states have (on average 2.142857142857143) internal successors, (15), 6 states have internal predecessors, (15), 2 states have call successors, (3), 2 states have call predecessors, (3), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) Word has length 20 [2024-09-11 19:21:52,699 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-09-11 19:21:52,700 INFO L225 Difference]: With dead ends: 35 [2024-09-11 19:21:52,700 INFO L226 Difference]: Without dead ends: 33 [2024-09-11 19:21:52,701 INFO L433 NwaCegarLoop]: 0 DeclaredPredicates, 27 GetRequests, 18 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=23, Invalid=87, Unknown=0, NotChecked=0, Total=110 [2024-09-11 19:21:52,704 INFO L434 NwaCegarLoop]: 15 mSDtfsCounter, 8 mSDsluCounter, 63 mSDsCounter, 0 mSdLazyCounter, 96 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 11 SdHoareTripleChecker+Valid, 78 SdHoareTripleChecker+Invalid, 99 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 96 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-09-11 19:21:52,705 INFO L435 NwaCegarLoop]: SdHoareTripleChecker [11 Valid, 78 Invalid, 99 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 96 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-09-11 19:21:52,706 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 33 states. [2024-09-11 19:21:52,713 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 33 to 30. [2024-09-11 19:21:52,714 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 30 states, 21 states have (on average 1.1428571428571428) internal successors, (24), 22 states have internal predecessors, (24), 5 states have call successors, (5), 3 states have call predecessors, (5), 3 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) [2024-09-11 19:21:52,716 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 30 states to 30 states and 34 transitions. [2024-09-11 19:21:52,716 INFO L78 Accepts]: Start accepts. Automaton has 30 states and 34 transitions. Word has length 20 [2024-09-11 19:21:52,717 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-09-11 19:21:52,717 INFO L474 AbstractCegarLoop]: Abstraction has 30 states and 34 transitions. [2024-09-11 19:21:52,717 INFO L475 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 7 states have (on average 2.142857142857143) internal successors, (15), 6 states have internal predecessors, (15), 2 states have call successors, (3), 2 states have call predecessors, (3), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) [2024-09-11 19:21:52,720 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-11 19:21:52,721 INFO L276 IsEmpty]: Start isEmpty. Operand 30 states and 34 transitions. [2024-09-11 19:21:52,721 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2024-09-11 19:21:52,721 INFO L208 NwaCegarLoop]: Found error trace [2024-09-11 19:21:52,721 INFO L216 NwaCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-09-11 19:21:52,741 INFO L552 MonitoredProcess]: [MP /storage/repos/certificate-witnesses-artifact/automizer/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2024-09-11 19:21:52,926 WARN L456 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1,2 /storage/repos/certificate-witnesses-artifact/automizer/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-09-11 19:21:52,927 INFO L399 AbstractCegarLoop]: === Iteration 3 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-09-11 19:21:52,927 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-11 19:21:52,927 INFO L85 PathProgramCache]: Analyzing trace with hash -698402714, now seen corresponding path program 1 times [2024-09-11 19:21:52,928 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-09-11 19:21:52,928 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1519199633] [2024-09-11 19:21:52,928 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-09-11 19:21:52,928 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-09-11 19:21:52,960 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-11 19:21:53,105 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2024-09-11 19:21:53,106 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-11 19:21:53,112 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-09-11 19:21:53,114 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-11 19:21:53,120 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2024-09-11 19:21:53,121 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-09-11 19:21:53,121 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1519199633] [2024-09-11 19:21:53,122 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1519199633] provided 0 perfect and 1 imperfect interpolant sequences [2024-09-11 19:21:53,122 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2002618992] [2024-09-11 19:21:53,123 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-09-11 19:21:53,123 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-09-11 19:21:53,124 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/certificate-witnesses-artifact/automizer/z3 [2024-09-11 19:21:53,126 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-11 19:21:53,128 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-11 19:21:53,184 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-11 19:21:53,186 INFO L262 TraceCheckSpWp]: Trace formula consists of 77 conjuncts, 6 conjuncts are in the unsatisfiable core [2024-09-11 19:21:53,187 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2024-09-11 19:21:53,227 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2024-09-11 19:21:53,227 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2024-09-11 19:21:53,306 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2024-09-11 19:21:53,307 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2002618992] provided 1 perfect and 1 imperfect interpolant sequences [2024-09-11 19:21:53,307 INFO L185 FreeRefinementEngine]: Found 1 perfect and 2 imperfect interpolant sequences. [2024-09-11 19:21:53,307 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [4, 4] total 8 [2024-09-11 19:21:53,307 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2106893373] [2024-09-11 19:21:53,307 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-09-11 19:21:53,308 INFO L551 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-09-11 19:21:53,308 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-09-11 19:21:53,308 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-09-11 19:21:53,308 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2024-09-11 19:21:53,309 INFO L87 Difference]: Start difference. First operand 30 states and 34 transitions. Second operand has 4 states, 4 states have (on average 3.5) internal successors, (14), 4 states have internal predecessors, (14), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2024-09-11 19:21:53,335 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-09-11 19:21:53,337 INFO L93 Difference]: Finished difference Result 45 states and 52 transitions. [2024-09-11 19:21:53,337 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-09-11 19:21:53,337 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 3.5) internal successors, (14), 4 states have internal predecessors, (14), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) Word has length 22 [2024-09-11 19:21:53,338 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-09-11 19:21:53,339 INFO L225 Difference]: With dead ends: 45 [2024-09-11 19:21:53,339 INFO L226 Difference]: Without dead ends: 35 [2024-09-11 19:21:53,340 INFO L433 NwaCegarLoop]: 0 DeclaredPredicates, 49 GetRequests, 43 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2024-09-11 19:21:53,342 INFO L434 NwaCegarLoop]: 28 mSDtfsCounter, 4 mSDsluCounter, 21 mSDsCounter, 0 mSdLazyCounter, 4 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 6 SdHoareTripleChecker+Valid, 49 SdHoareTripleChecker+Invalid, 7 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 4 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-09-11 19:21:53,343 INFO L435 NwaCegarLoop]: SdHoareTripleChecker [6 Valid, 49 Invalid, 7 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 4 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-09-11 19:21:53,343 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 35 states. [2024-09-11 19:21:53,352 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 35 to 31. [2024-09-11 19:21:53,355 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 31 states, 22 states have (on average 1.1363636363636365) internal successors, (25), 22 states have internal predecessors, (25), 5 states have call successors, (5), 3 states have call predecessors, (5), 3 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) [2024-09-11 19:21:53,355 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 31 states to 31 states and 35 transitions. [2024-09-11 19:21:53,356 INFO L78 Accepts]: Start accepts. Automaton has 31 states and 35 transitions. Word has length 22 [2024-09-11 19:21:53,356 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-09-11 19:21:53,356 INFO L474 AbstractCegarLoop]: Abstraction has 31 states and 35 transitions. [2024-09-11 19:21:53,356 INFO L475 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 3.5) internal successors, (14), 4 states have internal predecessors, (14), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2024-09-11 19:21:53,356 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-11 19:21:53,357 INFO L276 IsEmpty]: Start isEmpty. Operand 31 states and 35 transitions. [2024-09-11 19:21:53,357 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 36 [2024-09-11 19:21:53,357 INFO L208 NwaCegarLoop]: Found error trace [2024-09-11 19:21:53,357 INFO L216 NwaCegarLoop]: trace histogram [3, 3, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-09-11 19:21:53,376 INFO L552 MonitoredProcess]: [MP /storage/repos/certificate-witnesses-artifact/automizer/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Ended with exit code 0 [2024-09-11 19:21:53,558 WARN L456 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2,3 /storage/repos/certificate-witnesses-artifact/automizer/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-09-11 19:21:53,559 INFO L399 AbstractCegarLoop]: === Iteration 4 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-09-11 19:21:53,559 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-11 19:21:53,559 INFO L85 PathProgramCache]: Analyzing trace with hash 2004618898, now seen corresponding path program 1 times [2024-09-11 19:21:53,559 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-09-11 19:21:53,559 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [258839694] [2024-09-11 19:21:53,559 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-09-11 19:21:53,560 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-09-11 19:21:53,584 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-11 19:21:53,701 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2024-09-11 19:21:53,703 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-11 19:21:53,706 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-09-11 19:21:53,711 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-11 19:21:53,713 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2024-09-11 19:21:53,714 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-11 19:21:53,716 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 22 [2024-09-11 19:21:53,718 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-11 19:21:53,720 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 2 proven. 1 refuted. 0 times theorem prover too weak. 13 trivial. 0 not checked. [2024-09-11 19:21:53,720 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-09-11 19:21:53,720 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [258839694] [2024-09-11 19:21:53,721 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [258839694] provided 0 perfect and 1 imperfect interpolant sequences [2024-09-11 19:21:53,721 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [593290847] [2024-09-11 19:21:53,722 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-09-11 19:21:53,722 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-09-11 19:21:53,722 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/certificate-witnesses-artifact/automizer/z3 [2024-09-11 19:21:53,725 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-11 19:21:53,726 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-11 19:21:53,789 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-11 19:21:53,791 INFO L262 TraceCheckSpWp]: Trace formula consists of 106 conjuncts, 5 conjuncts are in the unsatisfiable core [2024-09-11 19:21:53,792 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2024-09-11 19:21:53,804 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2024-09-11 19:21:53,804 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2024-09-11 19:21:53,840 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 2 proven. 1 refuted. 0 times theorem prover too weak. 13 trivial. 0 not checked. [2024-09-11 19:21:53,840 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [593290847] provided 0 perfect and 2 imperfect interpolant sequences [2024-09-11 19:21:53,841 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-09-11 19:21:53,841 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 3, 4] total 7 [2024-09-11 19:21:53,841 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [443400428] [2024-09-11 19:21:53,841 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-09-11 19:21:53,841 INFO L551 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-09-11 19:21:53,842 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-09-11 19:21:53,842 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-09-11 19:21:53,842 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=23, Unknown=0, NotChecked=0, Total=42 [2024-09-11 19:21:53,842 INFO L87 Difference]: Start difference. First operand 31 states and 35 transitions. Second operand has 7 states, 7 states have (on average 4.285714285714286) internal successors, (30), 7 states have internal predecessors, (30), 1 states have call successors, (9), 2 states have call predecessors, (9), 2 states have return successors, (8), 1 states have call predecessors, (8), 1 states have call successors, (8) [2024-09-11 19:21:53,875 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-09-11 19:21:53,875 INFO L93 Difference]: Finished difference Result 62 states and 72 transitions. [2024-09-11 19:21:53,876 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-09-11 19:21:53,876 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 4.285714285714286) internal successors, (30), 7 states have internal predecessors, (30), 1 states have call successors, (9), 2 states have call predecessors, (9), 2 states have return successors, (8), 1 states have call predecessors, (8), 1 states have call successors, (8) Word has length 35 [2024-09-11 19:21:53,876 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-09-11 19:21:53,877 INFO L225 Difference]: With dead ends: 62 [2024-09-11 19:21:53,877 INFO L226 Difference]: Without dead ends: 34 [2024-09-11 19:21:53,877 INFO L433 NwaCegarLoop]: 0 DeclaredPredicates, 80 GetRequests, 74 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=26, Invalid=30, Unknown=0, NotChecked=0, Total=56 [2024-09-11 19:21:53,878 INFO L434 NwaCegarLoop]: 28 mSDtfsCounter, 0 mSDsluCounter, 52 mSDsCounter, 0 mSdLazyCounter, 13 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 80 SdHoareTripleChecker+Invalid, 14 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 13 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-09-11 19:21:53,878 INFO L435 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 80 Invalid, 14 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 13 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-09-11 19:21:53,879 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 34 states. [2024-09-11 19:21:53,884 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 34 to 34. [2024-09-11 19:21:53,885 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 34 states, 25 states have (on average 1.12) internal successors, (28), 25 states have internal predecessors, (28), 5 states have call successors, (5), 3 states have call predecessors, (5), 3 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) [2024-09-11 19:21:53,886 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 34 states to 34 states and 38 transitions. [2024-09-11 19:21:53,886 INFO L78 Accepts]: Start accepts. Automaton has 34 states and 38 transitions. Word has length 35 [2024-09-11 19:21:53,886 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-09-11 19:21:53,886 INFO L474 AbstractCegarLoop]: Abstraction has 34 states and 38 transitions. [2024-09-11 19:21:53,887 INFO L475 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 4.285714285714286) internal successors, (30), 7 states have internal predecessors, (30), 1 states have call successors, (9), 2 states have call predecessors, (9), 2 states have return successors, (8), 1 states have call predecessors, (8), 1 states have call successors, (8) [2024-09-11 19:21:53,887 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-11 19:21:53,887 INFO L276 IsEmpty]: Start isEmpty. Operand 34 states and 38 transitions. [2024-09-11 19:21:53,888 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2024-09-11 19:21:53,890 INFO L208 NwaCegarLoop]: Found error trace [2024-09-11 19:21:53,890 INFO L216 NwaCegarLoop]: trace histogram [4, 3, 3, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-09-11 19:21:53,904 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-11 19:21:54,090 WARN L456 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3,4 /storage/repos/certificate-witnesses-artifact/automizer/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-09-11 19:21:54,091 INFO L399 AbstractCegarLoop]: === Iteration 5 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-09-11 19:21:54,091 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-11 19:21:54,091 INFO L85 PathProgramCache]: Analyzing trace with hash -607961479, now seen corresponding path program 2 times [2024-09-11 19:21:54,092 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-09-11 19:21:54,092 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1303309717] [2024-09-11 19:21:54,092 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-09-11 19:21:54,092 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-09-11 19:21:54,112 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-11 19:21:54,272 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2024-09-11 19:21:54,274 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-11 19:21:54,277 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2024-09-11 19:21:54,281 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-11 19:21:54,284 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 19 [2024-09-11 19:21:54,287 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-11 19:21:54,291 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 25 [2024-09-11 19:21:54,293 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-11 19:21:54,296 INFO L134 CoverageAnalysis]: Checked inductivity of 25 backedges. 2 proven. 10 refuted. 0 times theorem prover too weak. 13 trivial. 0 not checked. [2024-09-11 19:21:54,296 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-09-11 19:21:54,296 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1303309717] [2024-09-11 19:21:54,297 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1303309717] provided 0 perfect and 1 imperfect interpolant sequences [2024-09-11 19:21:54,297 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1030034415] [2024-09-11 19:21:54,297 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2024-09-11 19:21:54,298 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-09-11 19:21:54,299 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/certificate-witnesses-artifact/automizer/z3 [2024-09-11 19:21:54,300 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-11 19:21:54,302 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-11 19:21:54,389 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2024-09-11 19:21:54,389 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2024-09-11 19:21:54,391 INFO L262 TraceCheckSpWp]: Trace formula consists of 127 conjuncts, 11 conjuncts are in the unsatisfiable core [2024-09-11 19:21:54,393 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2024-09-11 19:21:54,422 INFO L134 CoverageAnalysis]: Checked inductivity of 25 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2024-09-11 19:21:54,422 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2024-09-11 19:21:54,534 INFO L134 CoverageAnalysis]: Checked inductivity of 25 backedges. 2 proven. 10 refuted. 0 times theorem prover too weak. 13 trivial. 0 not checked. [2024-09-11 19:21:54,535 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1030034415] provided 0 perfect and 2 imperfect interpolant sequences [2024-09-11 19:21:54,535 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-09-11 19:21:54,535 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 6, 7] total 13 [2024-09-11 19:21:54,535 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1103824688] [2024-09-11 19:21:54,535 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-09-11 19:21:54,537 INFO L551 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2024-09-11 19:21:54,537 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-09-11 19:21:54,538 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2024-09-11 19:21:54,538 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=58, Invalid=98, Unknown=0, NotChecked=0, Total=156 [2024-09-11 19:21:54,539 INFO L87 Difference]: Start difference. First operand 34 states and 38 transitions. Second operand has 13 states, 13 states have (on average 2.769230769230769) internal successors, (36), 13 states have internal predecessors, (36), 1 states have call successors, (9), 2 states have call predecessors, (9), 2 states have return successors, (8), 1 states have call predecessors, (8), 1 states have call successors, (8) [2024-09-11 19:21:54,732 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-09-11 19:21:54,733 INFO L93 Difference]: Finished difference Result 68 states and 81 transitions. [2024-09-11 19:21:54,734 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2024-09-11 19:21:54,734 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 13 states have (on average 2.769230769230769) internal successors, (36), 13 states have internal predecessors, (36), 1 states have call successors, (9), 2 states have call predecessors, (9), 2 states have return successors, (8), 1 states have call predecessors, (8), 1 states have call successors, (8) Word has length 38 [2024-09-11 19:21:54,734 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-09-11 19:21:54,735 INFO L225 Difference]: With dead ends: 68 [2024-09-11 19:21:54,737 INFO L226 Difference]: Without dead ends: 40 [2024-09-11 19:21:54,737 INFO L433 NwaCegarLoop]: 0 DeclaredPredicates, 92 GetRequests, 77 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 25 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=110, Invalid=162, Unknown=0, NotChecked=0, Total=272 [2024-09-11 19:21:54,738 INFO L434 NwaCegarLoop]: 28 mSDtfsCounter, 0 mSDsluCounter, 156 mSDsCounter, 0 mSdLazyCounter, 45 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 184 SdHoareTripleChecker+Invalid, 46 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 45 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-09-11 19:21:54,739 INFO L435 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 184 Invalid, 46 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 45 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-09-11 19:21:54,740 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 40 states. [2024-09-11 19:21:54,749 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 40 to 40. [2024-09-11 19:21:54,750 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 40 states, 31 states have (on average 1.096774193548387) internal successors, (34), 31 states have internal predecessors, (34), 5 states have call successors, (5), 3 states have call predecessors, (5), 3 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) [2024-09-11 19:21:54,752 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 40 states to 40 states and 44 transitions. [2024-09-11 19:21:54,753 INFO L78 Accepts]: Start accepts. Automaton has 40 states and 44 transitions. Word has length 38 [2024-09-11 19:21:54,754 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-09-11 19:21:54,754 INFO L474 AbstractCegarLoop]: Abstraction has 40 states and 44 transitions. [2024-09-11 19:21:54,754 INFO L475 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 13 states have (on average 2.769230769230769) internal successors, (36), 13 states have internal predecessors, (36), 1 states have call successors, (9), 2 states have call predecessors, (9), 2 states have return successors, (8), 1 states have call predecessors, (8), 1 states have call successors, (8) [2024-09-11 19:21:54,754 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-11 19:21:54,755 INFO L276 IsEmpty]: Start isEmpty. Operand 40 states and 44 transitions. [2024-09-11 19:21:54,755 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 45 [2024-09-11 19:21:54,756 INFO L208 NwaCegarLoop]: Found error trace [2024-09-11 19:21:54,756 INFO L216 NwaCegarLoop]: trace histogram [10, 3, 3, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-09-11 19:21:54,774 INFO L540 MonitoredProcess]: [MP /storage/repos/certificate-witnesses-artifact/automizer/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Forceful destruction successful, exit code 0 [2024-09-11 19:21:54,957 WARN L456 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4,5 /storage/repos/certificate-witnesses-artifact/automizer/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-09-11 19:21:54,957 INFO L399 AbstractCegarLoop]: === Iteration 6 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-09-11 19:21:54,957 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-11 19:21:54,958 INFO L85 PathProgramCache]: Analyzing trace with hash 663361497, now seen corresponding path program 3 times [2024-09-11 19:21:54,958 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-09-11 19:21:54,958 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [615548743] [2024-09-11 19:21:54,958 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-09-11 19:21:54,958 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-09-11 19:21:54,990 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-11 19:21:55,276 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2024-09-11 19:21:55,277 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-11 19:21:55,279 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 19 [2024-09-11 19:21:55,281 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-11 19:21:55,296 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 25 [2024-09-11 19:21:55,297 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-11 19:21:55,300 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 31 [2024-09-11 19:21:55,302 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-11 19:21:55,305 INFO L134 CoverageAnalysis]: Checked inductivity of 70 backedges. 2 proven. 55 refuted. 0 times theorem prover too weak. 13 trivial. 0 not checked. [2024-09-11 19:21:55,305 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-09-11 19:21:55,305 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [615548743] [2024-09-11 19:21:55,305 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [615548743] provided 0 perfect and 1 imperfect interpolant sequences [2024-09-11 19:21:55,305 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [160520564] [2024-09-11 19:21:55,305 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2024-09-11 19:21:55,306 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-09-11 19:21:55,306 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/certificate-witnesses-artifact/automizer/z3 [2024-09-11 19:21:55,309 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-11 19:21:55,310 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-11 19:21:55,616 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2024-09-11 19:21:55,616 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2024-09-11 19:21:55,618 INFO L262 TraceCheckSpWp]: Trace formula consists of 103 conjuncts, 31 conjuncts are in the unsatisfiable core [2024-09-11 19:21:55,621 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2024-09-11 19:21:56,304 INFO L349 Elim1Store]: treesize reduction 112, result has 5.9 percent of original size [2024-09-11 19:21:56,305 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 6 select indices, 6 select index equivalence classes, 0 disjoint index pairs (out of 15 index pairs), introduced 6 new quantified variables, introduced 15 case distinctions, treesize of input 107 treesize of output 52 [2024-09-11 19:21:56,495 INFO L134 CoverageAnalysis]: Checked inductivity of 70 backedges. 18 proven. 1 refuted. 0 times theorem prover too weak. 51 trivial. 0 not checked. [2024-09-11 19:21:56,495 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2024-09-11 19:21:58,991 INFO L349 Elim1Store]: treesize reduction 135, result has 20.1 percent of original size [2024-09-11 19:21:58,991 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 8 select indices, 8 select index equivalence classes, 0 disjoint index pairs (out of 28 index pairs), introduced 8 new quantified variables, introduced 28 case distinctions, treesize of input 233 treesize of output 149 [2024-09-11 19:21:59,370 INFO L134 CoverageAnalysis]: Checked inductivity of 70 backedges. 8 proven. 1 refuted. 0 times theorem prover too weak. 61 trivial. 0 not checked. [2024-09-11 19:21:59,370 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [160520564] provided 0 perfect and 2 imperfect interpolant sequences [2024-09-11 19:21:59,371 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-09-11 19:21:59,371 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 15, 14] total 34 [2024-09-11 19:21:59,371 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [419121030] [2024-09-11 19:21:59,371 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-09-11 19:21:59,372 INFO L551 AbstractCegarLoop]: INTERPOLANT automaton has 34 states [2024-09-11 19:21:59,372 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-09-11 19:21:59,373 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 34 interpolants. [2024-09-11 19:21:59,373 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=115, Invalid=1007, Unknown=0, NotChecked=0, Total=1122 [2024-09-11 19:21:59,374 INFO L87 Difference]: Start difference. First operand 40 states and 44 transitions. Second operand has 34 states, 29 states have (on average 2.103448275862069) internal successors, (61), 29 states have internal predecessors, (61), 7 states have call successors, (12), 3 states have call predecessors, (12), 4 states have return successors, (10), 6 states have call predecessors, (10), 6 states have call successors, (10) [2024-09-11 19:22:00,730 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-09-11 19:22:00,731 INFO L93 Difference]: Finished difference Result 76 states and 86 transitions. [2024-09-11 19:22:00,731 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 30 states. [2024-09-11 19:22:00,732 INFO L78 Accepts]: Start accepts. Automaton has has 34 states, 29 states have (on average 2.103448275862069) internal successors, (61), 29 states have internal predecessors, (61), 7 states have call successors, (12), 3 states have call predecessors, (12), 4 states have return successors, (10), 6 states have call predecessors, (10), 6 states have call successors, (10) Word has length 44 [2024-09-11 19:22:00,732 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-09-11 19:22:00,733 INFO L225 Difference]: With dead ends: 76 [2024-09-11 19:22:00,734 INFO L226 Difference]: Without dead ends: 0 [2024-09-11 19:22:00,756 INFO L433 NwaCegarLoop]: 0 DeclaredPredicates, 113 GetRequests, 71 SyntacticMatches, 3 SemanticMatches, 39 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 172 ImplicationChecksByTransitivity, 1.9s TimeCoverageRelationStatistics Valid=185, Invalid=1455, Unknown=0, NotChecked=0, Total=1640 [2024-09-11 19:22:00,758 INFO L434 NwaCegarLoop]: 16 mSDtfsCounter, 8 mSDsluCounter, 133 mSDsCounter, 0 mSdLazyCounter, 458 mSolverCounterSat, 14 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 9 SdHoareTripleChecker+Valid, 149 SdHoareTripleChecker+Invalid, 472 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 14 IncrementalHoareTripleChecker+Valid, 458 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.9s IncrementalHoareTripleChecker+Time [2024-09-11 19:22:00,759 INFO L435 NwaCegarLoop]: SdHoareTripleChecker [9 Valid, 149 Invalid, 472 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [14 Valid, 458 Invalid, 0 Unknown, 0 Unchecked, 0.9s Time] [2024-09-11 19:22:00,759 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2024-09-11 19:22:00,759 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2024-09-11 19:22:00,759 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-11 19:22:00,759 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2024-09-11 19:22:00,760 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 44 [2024-09-11 19:22:00,760 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-09-11 19:22:00,760 INFO L474 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2024-09-11 19:22:00,762 INFO L475 AbstractCegarLoop]: INTERPOLANT automaton has has 34 states, 29 states have (on average 2.103448275862069) internal successors, (61), 29 states have internal predecessors, (61), 7 states have call successors, (12), 3 states have call predecessors, (12), 4 states have return successors, (10), 6 states have call predecessors, (10), 6 states have call successors, (10) [2024-09-11 19:22:00,763 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-11 19:22:00,763 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2024-09-11 19:22:00,763 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2024-09-11 19:22:00,766 INFO L785 garLoopResultBuilder]: Registering result SAFE for location __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2024-09-11 19:22:00,784 INFO L540 MonitoredProcess]: [MP /storage/repos/certificate-witnesses-artifact/automizer/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Forceful destruction successful, exit code 0 [2024-09-11 19:22:00,971 WARN L456 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 /storage/repos/certificate-witnesses-artifact/automizer/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable5 [2024-09-11 19:22:00,974 INFO L408 BasicCegarLoop]: Path program histogram: [3, 1, 1, 1] [2024-09-11 19:22:00,976 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2024-09-11 19:22:01,345 INFO L165 ceAbstractionStarter]: Computing trace abstraction results [2024-09-11 19:22:01,360 WARN L945 BoogieBacktranslator]: Unfinished Backtranslation: Cannot backtranslate array access to array IdentifierExpression[#memory_int#1,GLOBAL] [2024-09-11 19:22:01,361 WARN L945 BoogieBacktranslator]: Unfinished Backtranslation: Cannot backtranslate array access to array ArrayAccessExpression[IdentifierExpression[#memory_int#1,GLOBAL],[IdentifierExpression[~#array~0!base,]]] [2024-09-11 19:22:01,362 WARN L945 BoogieBacktranslator]: Unfinished Backtranslation: Cannot backtranslate array access to array IdentifierExpression[#memory_int#1,GLOBAL] [2024-09-11 19:22:01,363 WARN L945 BoogieBacktranslator]: Unfinished Backtranslation: Cannot backtranslate array access to array ArrayAccessExpression[IdentifierExpression[#memory_int#1,GLOBAL],[IdentifierExpression[~#array~0!base,]]] [2024-09-11 19:22:01,365 WARN L945 BoogieBacktranslator]: Unfinished Backtranslation: Cannot backtranslate array access to array IdentifierExpression[#memory_int#1,GLOBAL] [2024-09-11 19:22:01,367 WARN L945 BoogieBacktranslator]: Unfinished Backtranslation: Cannot backtranslate array access to array ArrayAccessExpression[IdentifierExpression[#memory_int#1,GLOBAL],[IdentifierExpression[~#array~0!base,]]] [2024-09-11 19:22:01,367 WARN L945 BoogieBacktranslator]: Unfinished Backtranslation: Cannot backtranslate array access to array IdentifierExpression[#memory_int#1,GLOBAL] [2024-09-11 19:22:01,367 WARN L945 BoogieBacktranslator]: Unfinished Backtranslation: Cannot backtranslate array access to array ArrayAccessExpression[IdentifierExpression[#memory_int#1,GLOBAL],[IdentifierExpression[~#array~0!base,]]] [2024-09-11 19:22:01,368 WARN L945 BoogieBacktranslator]: Unfinished Backtranslation: Cannot backtranslate array access to array IdentifierExpression[#memory_int#1,GLOBAL] [2024-09-11 19:22:01,368 WARN L945 BoogieBacktranslator]: Unfinished Backtranslation: Cannot backtranslate array access to array ArrayAccessExpression[IdentifierExpression[#memory_int#1,GLOBAL],[IdentifierExpression[~#array~0!base,]]] [2024-09-11 19:22:01,368 WARN L945 BoogieBacktranslator]: Unfinished Backtranslation: Cannot backtranslate array access to array IdentifierExpression[#memory_int#1,GLOBAL] [2024-09-11 19:22:01,368 WARN L945 BoogieBacktranslator]: Unfinished Backtranslation: Cannot backtranslate array access to array ArrayAccessExpression[IdentifierExpression[#memory_int#1,GLOBAL],[IdentifierExpression[~#array~0!base,]]] [2024-09-11 19:22:01,374 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 11.09 07:22:01 BoogieIcfgContainer [2024-09-11 19:22:01,375 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2024-09-11 19:22:01,375 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2024-09-11 19:22:01,375 INFO L270 PluginConnector]: Initializing Witness Printer... [2024-09-11 19:22:01,376 INFO L274 PluginConnector]: Witness Printer initialized [2024-09-11 19:22:01,376 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 11.09 07:21:51" (3/4) ... [2024-09-11 19:22:01,378 INFO L139 WitnessPrinter]: Generating witness for correct program [2024-09-11 19:22:01,382 INFO L361 RCFGBacktranslator]: Ignoring RootEdge to procedure assume_abort_if_not [2024-09-11 19:22:01,383 INFO L361 RCFGBacktranslator]: Ignoring RootEdge to procedure __VERIFIER_assert [2024-09-11 19:22:01,386 INFO L896 BoogieBacktranslator]: Reduced CFG by removing 15 nodes and edges [2024-09-11 19:22:01,386 INFO L896 BoogieBacktranslator]: Reduced CFG by removing 5 nodes and edges [2024-09-11 19:22:01,387 INFO L896 BoogieBacktranslator]: Reduced CFG by removing 3 nodes and edges [2024-09-11 19:22:01,387 INFO L896 BoogieBacktranslator]: Reduced CFG by removing 2 nodes and edges [2024-09-11 19:22:01,496 INFO L149 WitnessManager]: Wrote witness to /storage/repos/certificate-witnesses-artifact/automizer/witness.graphml [2024-09-11 19:22:01,497 INFO L149 WitnessManager]: Wrote witness to /storage/repos/certificate-witnesses-artifact/automizer/witness.yml [2024-09-11 19:22:01,497 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2024-09-11 19:22:01,498 INFO L158 Benchmark]: Toolchain (without parser) took 10888.67ms. Allocated memory was 176.2MB in the beginning and 255.9MB in the end (delta: 79.7MB). Free memory was 123.7MB in the beginning and 185.5MB in the end (delta: -61.8MB). Peak memory consumption was 20.2MB. Max. memory is 16.1GB. [2024-09-11 19:22:01,498 INFO L158 Benchmark]: CDTParser took 0.23ms. Allocated memory is still 113.2MB. Free memory was 88.9MB in the beginning and 88.9MB in the end (delta: 26.6kB). There was no memory consumed. Max. memory is 16.1GB. [2024-09-11 19:22:01,498 INFO L158 Benchmark]: CACSL2BoogieTranslator took 292.98ms. Allocated memory is still 176.2MB. Free memory was 123.7MB in the beginning and 111.9MB in the end (delta: 11.7MB). Peak memory consumption was 12.6MB. Max. memory is 16.1GB. [2024-09-11 19:22:01,499 INFO L158 Benchmark]: Boogie Procedure Inliner took 51.71ms. Allocated memory is still 176.2MB. Free memory was 111.9MB in the beginning and 110.3MB in the end (delta: 1.6MB). There was no memory consumed. Max. memory is 16.1GB. [2024-09-11 19:22:01,499 INFO L158 Benchmark]: Boogie Preprocessor took 60.60ms. Allocated memory is still 176.2MB. Free memory was 110.3MB in the beginning and 108.2MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2024-09-11 19:22:01,499 INFO L158 Benchmark]: RCFGBuilder took 413.03ms. Allocated memory is still 176.2MB. Free memory was 108.2MB in the beginning and 145.3MB in the end (delta: -37.1MB). Peak memory consumption was 15.7MB. Max. memory is 16.1GB. [2024-09-11 19:22:01,500 INFO L158 Benchmark]: TraceAbstraction took 9939.22ms. Allocated memory was 176.2MB in the beginning and 255.9MB in the end (delta: 79.7MB). Free memory was 144.1MB in the beginning and 190.7MB in the end (delta: -46.7MB). Peak memory consumption was 33.9MB. Max. memory is 16.1GB. [2024-09-11 19:22:01,500 INFO L158 Benchmark]: Witness Printer took 122.00ms. Allocated memory is still 255.9MB. Free memory was 190.7MB in the beginning and 185.5MB in the end (delta: 5.2MB). Peak memory consumption was 6.3MB. Max. memory is 16.1GB. [2024-09-11 19:22:01,501 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.23ms. Allocated memory is still 113.2MB. Free memory was 88.9MB in the beginning and 88.9MB in the end (delta: 26.6kB). There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 292.98ms. Allocated memory is still 176.2MB. Free memory was 123.7MB in the beginning and 111.9MB in the end (delta: 11.7MB). Peak memory consumption was 12.6MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 51.71ms. Allocated memory is still 176.2MB. Free memory was 111.9MB in the beginning and 110.3MB in the end (delta: 1.6MB). There was no memory consumed. Max. memory is 16.1GB. * Boogie Preprocessor took 60.60ms. Allocated memory is still 176.2MB. Free memory was 110.3MB in the beginning and 108.2MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * RCFGBuilder took 413.03ms. Allocated memory is still 176.2MB. Free memory was 108.2MB in the beginning and 145.3MB in the end (delta: -37.1MB). Peak memory consumption was 15.7MB. Max. memory is 16.1GB. * TraceAbstraction took 9939.22ms. Allocated memory was 176.2MB in the beginning and 255.9MB in the end (delta: 79.7MB). Free memory was 144.1MB in the beginning and 190.7MB in the end (delta: -46.7MB). Peak memory consumption was 33.9MB. Max. memory is 16.1GB. * Witness Printer took 122.00ms. Allocated memory is still 255.9MB. Free memory was 190.7MB in the beginning and 185.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.cacsl2boogietranslator: - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Cannot backtranslate array access to array IdentifierExpression[#memory_int#1,GLOBAL] - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Cannot backtranslate array access to array ArrayAccessExpression[IdentifierExpression[#memory_int#1,GLOBAL],[IdentifierExpression[~#array~0!base,]]] - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Cannot backtranslate array access to array IdentifierExpression[#memory_int#1,GLOBAL] - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Cannot backtranslate array access to array ArrayAccessExpression[IdentifierExpression[#memory_int#1,GLOBAL],[IdentifierExpression[~#array~0!base,]]] - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Cannot backtranslate array access to array IdentifierExpression[#memory_int#1,GLOBAL] - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Cannot backtranslate array access to array ArrayAccessExpression[IdentifierExpression[#memory_int#1,GLOBAL],[IdentifierExpression[~#array~0!base,]]] - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Cannot backtranslate array access to array IdentifierExpression[#memory_int#1,GLOBAL] - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Cannot backtranslate array access to array ArrayAccessExpression[IdentifierExpression[#memory_int#1,GLOBAL],[IdentifierExpression[~#array~0!base,]]] - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Cannot backtranslate array access to array IdentifierExpression[#memory_int#1,GLOBAL] - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Cannot backtranslate array access to array ArrayAccessExpression[IdentifierExpression[#memory_int#1,GLOBAL],[IdentifierExpression[~#array~0!base,]]] - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Cannot backtranslate array access to array IdentifierExpression[#memory_int#1,GLOBAL] - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Cannot backtranslate array access to array ArrayAccessExpression[IdentifierExpression[#memory_int#1,GLOBAL],[IdentifierExpression[~#array~0!base,]]] * 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: 26]: 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 3 procedures, 27 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 9.5s, OverallIterations: 6, TraceHistogramMax: 10, PathProgramHistogramMax: 3, EmptinessCheckTime: 0.0s, AutomataDifference: 1.9s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 26 SdHoareTripleChecker+Valid, 1.1s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 20 mSDsluCounter, 598 SdHoareTripleChecker+Invalid, 1.0s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 453 mSDsCounter, 22 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 623 IncrementalHoareTripleChecker+Invalid, 645 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 22 mSolverCounterUnsat, 145 mSDtfsCounter, 623 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 367 GetRequests, 288 SyntacticMatches, 3 SemanticMatches, 76 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 221 ImplicationChecksByTransitivity, 2.3s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=40occurred in iteration=5, InterpolantAutomatonStates: 62, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.1s AutomataMinimizationTime, 6 MinimizatonAttempts, 7 StatesRemovedByMinimization, 2 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 0.5s SatisfiabilityAnalysisTime, 5.5s InterpolantComputationTime, 337 NumberOfCodeBlocks, 323 NumberOfCodeBlocksAsserted, 13 NumberOfCheckSat, 461 ConstructedInterpolants, 3 QuantifiedInterpolants, 2359 SizeOfPredicates, 14 NumberOfNonLiveVariables, 484 ConjunctsInSsa, 65 ConjunctsInUnsatCore, 15 InterpolantComputations, 3 PerfectInterpolantSequences, 269/362 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: 40]: Loop Invariant Derived loop invariant: ((((loop_entered % 4294967296) == 0) && (i == 0)) || (((loop_entered % 4294967296) == 0) && (((4294967295 + i) % 4294967296) <= 99999))) - InvariantResult [Line: 49]: Loop Invariant Derived loop invariant: ((((((long long) index2 + 1) % 4294967296) <= 99999) && ((((index1 + 4294967295) % 4294967296) + 1) <= (((long long) index2 + 1) % 4294967296))) || (((loop_entered % 4294967296) == 0) && ((index2 % 4294967296) <= 99999))) - InvariantResult [Line: 58]: Loop Invariant Derived loop invariant: ((((((long long) index2 + 1) % 4294967296) <= 99999) && ((((index1 + 4294967295) % 4294967296) + 1) <= (((long long) index2 + 1) % 4294967296))) || ((((long long) (index1 % 4294967296) + 1) <= (index2 % 4294967296)) && ((index2 % 4294967296) <= 99999))) - ProcedureContractResult [Line: 20]: Procedure Contract for assume_abort_if_not Derived contract for procedure assume_abort_if_not. Ensures: (\old(cond) != 0) - ProcedureContractResult [Line: 23]: Procedure Contract for __VERIFIER_assert Derived contract for procedure __VERIFIER_assert. Requires: (1 <= \old(cond)) Ensures: (1 <= \old(cond)) RESULT: Ultimate proved your program to be correct! [2024-09-11 19:22:01,535 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