./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/recursive-simple/id2_i5_o5-2.c --full-output --procedureinliner.inline.calls.to.implemented.procedures NEVER --traceabstraction.positions.where.we.compute.the.hoare.annotation All --traceabstraction.encode.modifies.clause.in.ensures.clause.of.contracts true --witnessprinter.yaml.format.version 2.1 --witnessprinter.generate.graphml.witnesses false --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version fb1cb0b9 Calling Ultimate with: /root/.sdkman/candidates/java/11.0.12-open/bin/java -Dosgi.configuration.area=/storage/repos/certificate-witnesses-artifact/automizer/data/config -Xmx15G -Xms4m -jar /storage/repos/certificate-witnesses-artifact/automizer/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/certificate-witnesses-artifact/automizer/data -tc /storage/repos/certificate-witnesses-artifact/automizer/config/AutomizerReach.xml -i ../sv-benchmarks/c/recursive-simple/id2_i5_o5-2.c -s /storage/repos/certificate-witnesses-artifact/automizer/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/certificate-witnesses-artifact/automizer --witnessprinter.witness.filename witness --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! call(reach_error())) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash 9c0fb6a0d32b99c9a776859d2bc15d9177dc584955a2c1baa8ac133e976f40f7 --procedureinliner.inline.calls.to.implemented.procedures NEVER --traceabstraction.positions.where.we.compute.the.hoare.annotation All --traceabstraction.encode.modifies.clause.in.ensures.clause.of.contracts true --witnessprinter.yaml.format.version 2.1 --witnessprinter.generate.graphml.witnesses false --- Real Ultimate output --- This is Ultimate 0.2.4-tmp.dk.referee-eval-fb1cb0b-m [2024-09-25 11:27:58,669 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-09-25 11:27:58,751 INFO L114 SettingsManager]: Loading settings from /storage/repos/certificate-witnesses-artifact/automizer/config/svcomp-Reach-32bit-Automizer_Default.epf [2024-09-25 11:27:58,757 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-09-25 11:27:58,758 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-09-25 11:27:58,790 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-09-25 11:27:58,791 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-09-25 11:27:58,791 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-09-25 11:27:58,792 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-09-25 11:27:58,793 INFO L153 SettingsManager]: * Use memory slicer=true [2024-09-25 11:27:58,793 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-09-25 11:27:58,796 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-09-25 11:27:58,796 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-09-25 11:27:58,798 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-09-25 11:27:58,798 INFO L153 SettingsManager]: * Use SBE=true [2024-09-25 11:27:58,799 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-09-25 11:27:58,799 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-09-25 11:27:58,799 INFO L153 SettingsManager]: * sizeof long=4 [2024-09-25 11:27:58,800 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-09-25 11:27:58,803 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-09-25 11:27:58,803 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-09-25 11:27:58,804 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-09-25 11:27:58,804 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-09-25 11:27:58,804 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-09-25 11:27:58,804 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-09-25 11:27:58,805 INFO L153 SettingsManager]: * sizeof long double=12 [2024-09-25 11:27:58,805 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-09-25 11:27:58,805 INFO L153 SettingsManager]: * Use constant arrays=true [2024-09-25 11:27:58,805 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-09-25 11:27:58,805 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-09-25 11:27:58,806 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-09-25 11:27:58,806 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-09-25 11:27:58,806 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-09-25 11:27:58,807 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-09-25 11:27:58,807 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-09-25 11:27:58,808 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-09-25 11:27:58,808 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-09-25 11:27:58,809 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-09-25 11:27:58,809 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-09-25 11:27:58,809 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-09-25 11:27:58,810 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-09-25 11:27:58,810 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-09-25 11:27:58,810 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 -> 9c0fb6a0d32b99c9a776859d2bc15d9177dc584955a2c1baa8ac133e976f40f7 Applying setting for plugin de.uni_freiburg.informatik.ultimate.boogie.procedureinliner: Inline calls to implemented procedures -> NEVER Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: Positions where we compute the Hoare Annotation -> All Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: Encode 'modifies' clause in 'ensures' clause of contracts -> true Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: YAML Format version -> 2.1 Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Generate GraphML witnesses -> false [2024-09-25 11:27:59,108 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-09-25 11:27:59,134 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-09-25 11:27:59,136 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-09-25 11:27:59,142 INFO L270 PluginConnector]: Initializing CDTParser... [2024-09-25 11:27:59,145 INFO L274 PluginConnector]: CDTParser initialized [2024-09-25 11:27:59,146 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/certificate-witnesses-artifact/automizer/../sv-benchmarks/c/recursive-simple/id2_i5_o5-2.c [2024-09-25 11:28:00,634 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-09-25 11:28:00,817 INFO L384 CDTParser]: Found 1 translation units. [2024-09-25 11:28:00,818 INFO L180 CDTParser]: Scanning /storage/repos/certificate-witnesses-artifact/sv-benchmarks/c/recursive-simple/id2_i5_o5-2.c [2024-09-25 11:28:00,824 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/certificate-witnesses-artifact/automizer/data/84b260f0b/416c6a93602c479dabb69021776d6fb1/FLAG790aa7195 [2024-09-25 11:28:01,210 INFO L435 CDTParser]: Successfully deleted /storage/repos/certificate-witnesses-artifact/automizer/data/84b260f0b/416c6a93602c479dabb69021776d6fb1 [2024-09-25 11:28:01,212 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-09-25 11:28:01,213 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-09-25 11:28:01,214 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-09-25 11:28:01,215 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-09-25 11:28:01,219 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-09-25 11:28:01,219 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 25.09 11:28:01" (1/1) ... [2024-09-25 11:28:01,220 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@7f8d179c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.09 11:28:01, skipping insertion in model container [2024-09-25 11:28:01,220 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 25.09 11:28:01" (1/1) ... [2024-09-25 11:28:01,233 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-09-25 11:28:01,374 WARN L248 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/certificate-witnesses-artifact/sv-benchmarks/c/recursive-simple/id2_i5_o5-2.c[548,561] [2024-09-25 11:28:01,380 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-09-25 11:28:01,399 INFO L200 MainTranslator]: Completed pre-run [2024-09-25 11:28:01,414 WARN L248 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/certificate-witnesses-artifact/sv-benchmarks/c/recursive-simple/id2_i5_o5-2.c[548,561] [2024-09-25 11:28:01,415 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-09-25 11:28:01,432 INFO L204 MainTranslator]: Completed translation [2024-09-25 11:28:01,432 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.09 11:28:01 WrapperNode [2024-09-25 11:28:01,432 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-09-25 11:28:01,433 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-09-25 11:28:01,433 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-09-25 11:28:01,434 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-09-25 11:28:01,440 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.09 11:28:01" (1/1) ... [2024-09-25 11:28:01,445 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.09 11:28:01" (1/1) ... [2024-09-25 11:28:01,452 INFO L138 Inliner]: procedures = 14, calls = 10, calls flagged for inlining = 0, calls inlined = 0, statements flattened = 0 [2024-09-25 11:28:01,452 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-09-25 11:28:01,453 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-09-25 11:28:01,454 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-09-25 11:28:01,454 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-09-25 11:28:01,462 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.09 11:28:01" (1/1) ... [2024-09-25 11:28:01,463 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.09 11:28:01" (1/1) ... [2024-09-25 11:28:01,464 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.09 11:28:01" (1/1) ... [2024-09-25 11:28:01,475 INFO L175 MemorySlicer]: Split 2 memory accesses to 1 slices as follows [2]. 100 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2]. The 0 writes are split as follows [0]. [2024-09-25 11:28:01,479 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.09 11:28:01" (1/1) ... [2024-09-25 11:28:01,479 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.09 11:28:01" (1/1) ... [2024-09-25 11:28:01,481 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.09 11:28:01" (1/1) ... [2024-09-25 11:28:01,482 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.09 11:28:01" (1/1) ... [2024-09-25 11:28:01,483 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.09 11:28:01" (1/1) ... [2024-09-25 11:28:01,484 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.09 11:28:01" (1/1) ... [2024-09-25 11:28:01,485 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-09-25 11:28:01,490 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-09-25 11:28:01,490 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-09-25 11:28:01,490 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-09-25 11:28:01,491 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.09 11:28:01" (1/1) ... [2024-09-25 11:28:01,496 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-09-25 11:28:01,508 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/certificate-witnesses-artifact/automizer/z3 [2024-09-25 11:28:01,525 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/certificate-witnesses-artifact/automizer/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2024-09-25 11:28:01,528 INFO L327 MonitoredProcess]: [MP /storage/repos/certificate-witnesses-artifact/automizer/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2024-09-25 11:28:01,565 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-09-25 11:28:01,565 INFO L130 BoogieDeclarations]: Found specification of procedure main [2024-09-25 11:28:01,566 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2024-09-25 11:28:01,566 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-09-25 11:28:01,566 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2024-09-25 11:28:01,566 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2024-09-25 11:28:01,567 INFO L130 BoogieDeclarations]: Found specification of procedure id2 [2024-09-25 11:28:01,567 INFO L138 BoogieDeclarations]: Found implementation of procedure id2 [2024-09-25 11:28:01,567 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-09-25 11:28:01,567 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-09-25 11:28:01,567 INFO L130 BoogieDeclarations]: Found specification of procedure id [2024-09-25 11:28:01,567 INFO L138 BoogieDeclarations]: Found implementation of procedure id [2024-09-25 11:28:01,620 INFO L241 CfgBuilder]: Building ICFG [2024-09-25 11:28:01,623 INFO L267 CfgBuilder]: Building CFG for each procedure with an implementation [2024-09-25 11:28:01,781 INFO L? ?]: Removed 5 outVars from TransFormulas that were not future-live. [2024-09-25 11:28:01,782 INFO L290 CfgBuilder]: Performing block encoding [2024-09-25 11:28:01,809 INFO L312 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-09-25 11:28:01,811 INFO L317 CfgBuilder]: Removed 0 assume(true) statements. [2024-09-25 11:28:01,811 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 25.09 11:28:01 BoogieIcfgContainer [2024-09-25 11:28:01,812 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-09-25 11:28:01,813 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-09-25 11:28:01,815 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-09-25 11:28:01,818 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-09-25 11:28:01,819 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 25.09 11:28:01" (1/3) ... [2024-09-25 11:28:01,819 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4b6093a9 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 25.09 11:28:01, skipping insertion in model container [2024-09-25 11:28:01,820 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.09 11:28:01" (2/3) ... [2024-09-25 11:28:01,820 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4b6093a9 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 25.09 11:28:01, skipping insertion in model container [2024-09-25 11:28:01,820 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 25.09 11:28:01" (3/3) ... [2024-09-25 11:28:01,821 INFO L112 eAbstractionObserver]: Analyzing ICFG id2_i5_o5-2.c [2024-09-25 11:28:01,838 INFO L209 ceAbstractionStarter]: Automizer settings: Hoare:All NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-09-25 11:28:01,839 INFO L149 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-09-25 11:28:01,911 INFO L335 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-09-25 11:28:01,919 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;@6e30b939, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-09-25 11:28:01,920 INFO L337 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-09-25 11:28:01,923 INFO L276 IsEmpty]: Start isEmpty. Operand has 26 states, 15 states have (on average 1.2666666666666666) internal successors, (19), 16 states have internal predecessors, (19), 5 states have call successors, (5), 4 states have call predecessors, (5), 4 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) [2024-09-25 11:28:01,929 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2024-09-25 11:28:01,929 INFO L208 NwaCegarLoop]: Found error trace [2024-09-25 11:28:01,930 INFO L216 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-09-25 11:28:01,930 INFO L399 AbstractCegarLoop]: === Iteration 1 === Targeting mainErr0ASSERT_VIOLATIONERROR_FUNCTION === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-09-25 11:28:01,937 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-25 11:28:01,937 INFO L85 PathProgramCache]: Analyzing trace with hash -600647039, now seen corresponding path program 1 times [2024-09-25 11:28:01,947 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-09-25 11:28:01,948 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1624159709] [2024-09-25 11:28:01,949 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-09-25 11:28:01,949 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-09-25 11:28:02,032 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-25 11:28:02,102 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2024-09-25 11:28:02,105 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-25 11:28:02,111 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-09-25 11:28:02,114 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-25 11:28:02,154 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-09-25 11:28:02,154 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-09-25 11:28:02,155 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1624159709] [2024-09-25 11:28:02,155 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1624159709] provided 1 perfect and 0 imperfect interpolant sequences [2024-09-25 11:28:02,156 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-09-25 11:28:02,156 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-09-25 11:28:02,157 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1348347176] [2024-09-25 11:28:02,158 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-09-25 11:28:02,161 INFO L551 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-09-25 11:28:02,162 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-09-25 11:28:02,187 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-09-25 11:28:02,187 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-09-25 11:28:02,189 INFO L87 Difference]: Start difference. First operand has 26 states, 15 states have (on average 1.2666666666666666) internal successors, (19), 16 states have internal predecessors, (19), 5 states have call successors, (5), 4 states have call predecessors, (5), 4 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) Second operand has 5 states, 4 states have (on average 2.0) internal successors, (8), 5 states have internal predecessors, (8), 2 states have call successors, (3), 1 states have call predecessors, (3), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2024-09-25 11:28:02,250 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-09-25 11:28:02,251 INFO L93 Difference]: Finished difference Result 36 states and 40 transitions. [2024-09-25 11:28:02,256 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-09-25 11:28:02,257 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 2.0) internal successors, (8), 5 states have internal predecessors, (8), 2 states have call successors, (3), 1 states have call predecessors, (3), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Word has length 13 [2024-09-25 11:28:02,258 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-09-25 11:28:02,264 INFO L225 Difference]: With dead ends: 36 [2024-09-25 11:28:02,264 INFO L226 Difference]: Without dead ends: 24 [2024-09-25 11:28:02,267 INFO L433 NwaCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-09-25 11:28:02,272 INFO L434 NwaCegarLoop]: 24 mSDtfsCounter, 8 mSDsluCounter, 55 mSDsCounter, 0 mSdLazyCounter, 27 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 10 SdHoareTripleChecker+Valid, 79 SdHoareTripleChecker+Invalid, 27 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 27 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-09-25 11:28:02,273 INFO L435 NwaCegarLoop]: SdHoareTripleChecker [10 Valid, 79 Invalid, 27 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 27 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-09-25 11:28:02,295 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 24 states. [2024-09-25 11:28:02,315 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 24 to 24. [2024-09-25 11:28:02,317 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 24 states, 14 states have (on average 1.1428571428571428) internal successors, (16), 15 states have internal predecessors, (16), 5 states have call successors, (5), 4 states have call predecessors, (5), 4 states have return successors, (5), 4 states have call predecessors, (5), 4 states have call successors, (5) [2024-09-25 11:28:02,317 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 24 states to 24 states and 26 transitions. [2024-09-25 11:28:02,319 INFO L78 Accepts]: Start accepts. Automaton has 24 states and 26 transitions. Word has length 13 [2024-09-25 11:28:02,319 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-09-25 11:28:02,319 INFO L474 AbstractCegarLoop]: Abstraction has 24 states and 26 transitions. [2024-09-25 11:28:02,320 INFO L475 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 2.0) internal successors, (8), 5 states have internal predecessors, (8), 2 states have call successors, (3), 1 states have call predecessors, (3), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2024-09-25 11:28:02,320 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-25 11:28:02,320 INFO L276 IsEmpty]: Start isEmpty. Operand 24 states and 26 transitions. [2024-09-25 11:28:02,322 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2024-09-25 11:28:02,322 INFO L208 NwaCegarLoop]: Found error trace [2024-09-25 11:28:02,322 INFO L216 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-09-25 11:28:02,322 WARN L456 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-09-25 11:28:02,323 INFO L399 AbstractCegarLoop]: === Iteration 2 === Targeting mainErr0ASSERT_VIOLATIONERROR_FUNCTION === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-09-25 11:28:02,323 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-25 11:28:02,323 INFO L85 PathProgramCache]: Analyzing trace with hash -1186051473, now seen corresponding path program 1 times [2024-09-25 11:28:02,323 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-09-25 11:28:02,324 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1334646424] [2024-09-25 11:28:02,324 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-09-25 11:28:02,324 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-09-25 11:28:02,341 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-25 11:28:02,441 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2024-09-25 11:28:02,444 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-25 11:28:02,449 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-09-25 11:28:02,462 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-25 11:28:02,628 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-09-25 11:28:02,636 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-25 11:28:02,697 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-09-25 11:28:02,697 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-09-25 11:28:02,697 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1334646424] [2024-09-25 11:28:02,698 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1334646424] provided 1 perfect and 0 imperfect interpolant sequences [2024-09-25 11:28:02,698 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-09-25 11:28:02,698 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-09-25 11:28:02,698 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [247838899] [2024-09-25 11:28:02,699 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-09-25 11:28:02,700 INFO L551 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-09-25 11:28:02,700 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-09-25 11:28:02,701 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-09-25 11:28:02,701 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2024-09-25 11:28:02,701 INFO L87 Difference]: Start difference. First operand 24 states and 26 transitions. Second operand has 7 states, 6 states have (on average 2.0) internal successors, (12), 7 states have internal predecessors, (12), 3 states have call successors, (4), 1 states have call predecessors, (4), 3 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2024-09-25 11:28:02,784 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-09-25 11:28:02,785 INFO L93 Difference]: Finished difference Result 33 states and 35 transitions. [2024-09-25 11:28:02,785 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-09-25 11:28:02,786 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 6 states have (on average 2.0) internal successors, (12), 7 states have internal predecessors, (12), 3 states have call successors, (4), 1 states have call predecessors, (4), 3 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) Word has length 19 [2024-09-25 11:28:02,787 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-09-25 11:28:02,788 INFO L225 Difference]: With dead ends: 33 [2024-09-25 11:28:02,789 INFO L226 Difference]: Without dead ends: 29 [2024-09-25 11:28:02,789 INFO L433 NwaCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56 [2024-09-25 11:28:02,791 INFO L434 NwaCegarLoop]: 17 mSDtfsCounter, 10 mSDsluCounter, 53 mSDsCounter, 0 mSdLazyCounter, 52 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 15 SdHoareTripleChecker+Valid, 70 SdHoareTripleChecker+Invalid, 53 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 52 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-09-25 11:28:02,792 INFO L435 NwaCegarLoop]: SdHoareTripleChecker [15 Valid, 70 Invalid, 53 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 52 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-09-25 11:28:02,793 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 29 states. [2024-09-25 11:28:02,806 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 29 to 27. [2024-09-25 11:28:02,807 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 27 states, 16 states have (on average 1.125) internal successors, (18), 17 states have internal predecessors, (18), 5 states have call successors, (5), 4 states have call predecessors, (5), 5 states have return successors, (6), 5 states have call predecessors, (6), 4 states have call successors, (6) [2024-09-25 11:28:02,808 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 27 states to 27 states and 29 transitions. [2024-09-25 11:28:02,808 INFO L78 Accepts]: Start accepts. Automaton has 27 states and 29 transitions. Word has length 19 [2024-09-25 11:28:02,808 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-09-25 11:28:02,808 INFO L474 AbstractCegarLoop]: Abstraction has 27 states and 29 transitions. [2024-09-25 11:28:02,808 INFO L475 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 6 states have (on average 2.0) internal successors, (12), 7 states have internal predecessors, (12), 3 states have call successors, (4), 1 states have call predecessors, (4), 3 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2024-09-25 11:28:02,809 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-25 11:28:02,810 INFO L276 IsEmpty]: Start isEmpty. Operand 27 states and 29 transitions. [2024-09-25 11:28:02,811 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2024-09-25 11:28:02,812 INFO L208 NwaCegarLoop]: Found error trace [2024-09-25 11:28:02,812 INFO L216 NwaCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-09-25 11:28:02,813 WARN L456 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-09-25 11:28:02,813 INFO L399 AbstractCegarLoop]: === Iteration 3 === Targeting mainErr0ASSERT_VIOLATIONERROR_FUNCTION === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-09-25 11:28:02,814 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-25 11:28:02,814 INFO L85 PathProgramCache]: Analyzing trace with hash -1993719855, now seen corresponding path program 1 times [2024-09-25 11:28:02,816 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-09-25 11:28:02,816 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [768191621] [2024-09-25 11:28:02,816 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-09-25 11:28:02,817 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-09-25 11:28:02,837 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-25 11:28:02,906 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2024-09-25 11:28:02,908 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-25 11:28:02,913 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-09-25 11:28:02,918 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-25 11:28:02,989 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-09-25 11:28:02,995 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-25 11:28:03,047 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-09-25 11:28:03,049 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-25 11:28:03,093 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2024-09-25 11:28:03,094 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-09-25 11:28:03,094 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [768191621] [2024-09-25 11:28:03,094 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [768191621] provided 0 perfect and 1 imperfect interpolant sequences [2024-09-25 11:28:03,094 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [741067295] [2024-09-25 11:28:03,094 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-09-25 11:28:03,094 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-09-25 11:28:03,095 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/certificate-witnesses-artifact/automizer/z3 [2024-09-25 11:28:03,097 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/certificate-witnesses-artifact/automizer/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-09-25 11:28:03,099 INFO L327 MonitoredProcess]: [MP /storage/repos/certificate-witnesses-artifact/automizer/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2024-09-25 11:28:03,155 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-25 11:28:03,157 INFO L262 TraceCheckSpWp]: Trace formula consists of 77 conjuncts, 8 conjuncts are in the unsatisfiable core [2024-09-25 11:28:03,162 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2024-09-25 11:28:03,252 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2024-09-25 11:28:03,252 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2024-09-25 11:28:03,601 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2024-09-25 11:28:03,601 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [741067295] provided 0 perfect and 2 imperfect interpolant sequences [2024-09-25 11:28:03,601 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-09-25 11:28:03,602 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 8, 9] total 16 [2024-09-25 11:28:03,602 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2118761549] [2024-09-25 11:28:03,602 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-09-25 11:28:03,602 INFO L551 AbstractCegarLoop]: INTERPOLANT automaton has 16 states [2024-09-25 11:28:03,603 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-09-25 11:28:03,603 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2024-09-25 11:28:03,604 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=51, Invalid=189, Unknown=0, NotChecked=0, Total=240 [2024-09-25 11:28:03,606 INFO L87 Difference]: Start difference. First operand 27 states and 29 transitions. Second operand has 16 states, 14 states have (on average 2.0714285714285716) internal successors, (29), 16 states have internal predecessors, (29), 9 states have call successors, (10), 1 states have call predecessors, (10), 5 states have return successors, (9), 4 states have call predecessors, (9), 9 states have call successors, (9) [2024-09-25 11:28:03,722 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-09-25 11:28:03,722 INFO L93 Difference]: Finished difference Result 39 states and 41 transitions. [2024-09-25 11:28:03,723 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-09-25 11:28:03,723 INFO L78 Accepts]: Start accepts. Automaton has has 16 states, 14 states have (on average 2.0714285714285716) internal successors, (29), 16 states have internal predecessors, (29), 9 states have call successors, (10), 1 states have call predecessors, (10), 5 states have return successors, (9), 4 states have call predecessors, (9), 9 states have call successors, (9) Word has length 25 [2024-09-25 11:28:03,723 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-09-25 11:28:03,724 INFO L225 Difference]: With dead ends: 39 [2024-09-25 11:28:03,724 INFO L226 Difference]: Without dead ends: 35 [2024-09-25 11:28:03,725 INFO L433 NwaCegarLoop]: 0 DeclaredPredicates, 65 GetRequests, 46 SyntacticMatches, 3 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 58 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=65, Invalid=241, Unknown=0, NotChecked=0, Total=306 [2024-09-25 11:28:03,726 INFO L434 NwaCegarLoop]: 18 mSDtfsCounter, 21 mSDsluCounter, 99 mSDsCounter, 0 mSdLazyCounter, 77 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 27 SdHoareTripleChecker+Valid, 117 SdHoareTripleChecker+Invalid, 84 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 77 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-09-25 11:28:03,726 INFO L435 NwaCegarLoop]: SdHoareTripleChecker [27 Valid, 117 Invalid, 84 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 77 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-09-25 11:28:03,728 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 35 states. [2024-09-25 11:28:03,736 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 35 to 30. [2024-09-25 11:28:03,737 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 30 states, 18 states have (on average 1.1111111111111112) internal successors, (20), 19 states have internal predecessors, (20), 5 states have call successors, (5), 4 states have call predecessors, (5), 6 states have return successors, (7), 6 states have call predecessors, (7), 4 states have call successors, (7) [2024-09-25 11:28:03,740 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 30 states to 30 states and 32 transitions. [2024-09-25 11:28:03,741 INFO L78 Accepts]: Start accepts. Automaton has 30 states and 32 transitions. Word has length 25 [2024-09-25 11:28:03,741 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-09-25 11:28:03,741 INFO L474 AbstractCegarLoop]: Abstraction has 30 states and 32 transitions. [2024-09-25 11:28:03,742 INFO L475 AbstractCegarLoop]: INTERPOLANT automaton has has 16 states, 14 states have (on average 2.0714285714285716) internal successors, (29), 16 states have internal predecessors, (29), 9 states have call successors, (10), 1 states have call predecessors, (10), 5 states have return successors, (9), 4 states have call predecessors, (9), 9 states have call successors, (9) [2024-09-25 11:28:03,742 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-25 11:28:03,742 INFO L276 IsEmpty]: Start isEmpty. Operand 30 states and 32 transitions. [2024-09-25 11:28:03,743 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2024-09-25 11:28:03,743 INFO L208 NwaCegarLoop]: Found error trace [2024-09-25 11:28:03,743 INFO L216 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-09-25 11:28:03,761 INFO L552 MonitoredProcess]: [MP /storage/repos/certificate-witnesses-artifact/automizer/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2024-09-25 11:28:03,944 WARN L456 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2,2 /storage/repos/certificate-witnesses-artifact/automizer/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-09-25 11:28:03,944 INFO L399 AbstractCegarLoop]: === Iteration 4 === Targeting mainErr0ASSERT_VIOLATIONERROR_FUNCTION === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-09-25 11:28:03,945 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-25 11:28:03,945 INFO L85 PathProgramCache]: Analyzing trace with hash 1577860927, now seen corresponding path program 1 times [2024-09-25 11:28:03,945 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-09-25 11:28:03,945 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [867540332] [2024-09-25 11:28:03,946 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-09-25 11:28:03,946 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-09-25 11:28:03,954 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-25 11:28:03,993 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2024-09-25 11:28:03,994 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-25 11:28:03,996 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-09-25 11:28:04,003 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-25 11:28:04,051 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-09-25 11:28:04,060 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-25 11:28:04,101 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-09-25 11:28:04,104 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-25 11:28:04,123 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-09-25 11:28:04,124 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-25 11:28:04,153 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2024-09-25 11:28:04,153 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-09-25 11:28:04,153 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [867540332] [2024-09-25 11:28:04,154 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [867540332] provided 0 perfect and 1 imperfect interpolant sequences [2024-09-25 11:28:04,154 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [674383264] [2024-09-25 11:28:04,154 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-09-25 11:28:04,154 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-09-25 11:28:04,154 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/certificate-witnesses-artifact/automizer/z3 [2024-09-25 11:28:04,156 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/certificate-witnesses-artifact/automizer/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-09-25 11:28:04,158 INFO L327 MonitoredProcess]: [MP /storage/repos/certificate-witnesses-artifact/automizer/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2024-09-25 11:28:04,215 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-25 11:28:04,216 INFO L262 TraceCheckSpWp]: Trace formula consists of 91 conjuncts, 10 conjuncts are in the unsatisfiable core [2024-09-25 11:28:04,217 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2024-09-25 11:28:04,285 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2024-09-25 11:28:04,286 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2024-09-25 11:28:04,827 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 8 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2024-09-25 11:28:04,827 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [674383264] provided 0 perfect and 2 imperfect interpolant sequences [2024-09-25 11:28:04,827 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-09-25 11:28:04,828 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 9, 11] total 18 [2024-09-25 11:28:04,828 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2102289915] [2024-09-25 11:28:04,828 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-09-25 11:28:04,831 INFO L551 AbstractCegarLoop]: INTERPOLANT automaton has 18 states [2024-09-25 11:28:04,831 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-09-25 11:28:04,831 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2024-09-25 11:28:04,832 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=60, Invalid=246, Unknown=0, NotChecked=0, Total=306 [2024-09-25 11:28:04,832 INFO L87 Difference]: Start difference. First operand 30 states and 32 transitions. Second operand has 18 states, 16 states have (on average 2.0625) internal successors, (33), 18 states have internal predecessors, (33), 10 states have call successors, (11), 1 states have call predecessors, (11), 6 states have return successors, (12), 5 states have call predecessors, (12), 10 states have call successors, (12) [2024-09-25 11:28:04,959 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-09-25 11:28:04,959 INFO L93 Difference]: Finished difference Result 45 states and 47 transitions. [2024-09-25 11:28:04,960 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-09-25 11:28:04,960 INFO L78 Accepts]: Start accepts. Automaton has has 18 states, 16 states have (on average 2.0625) internal successors, (33), 18 states have internal predecessors, (33), 10 states have call successors, (11), 1 states have call predecessors, (11), 6 states have return successors, (12), 5 states have call predecessors, (12), 10 states have call successors, (12) Word has length 31 [2024-09-25 11:28:04,961 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-09-25 11:28:04,961 INFO L225 Difference]: With dead ends: 45 [2024-09-25 11:28:04,961 INFO L226 Difference]: Without dead ends: 41 [2024-09-25 11:28:04,962 INFO L433 NwaCegarLoop]: 0 DeclaredPredicates, 81 GetRequests, 58 SyntacticMatches, 4 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 93 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=84, Invalid=336, Unknown=0, NotChecked=0, Total=420 [2024-09-25 11:28:04,963 INFO L434 NwaCegarLoop]: 18 mSDtfsCounter, 21 mSDsluCounter, 154 mSDsCounter, 0 mSdLazyCounter, 113 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 28 SdHoareTripleChecker+Valid, 172 SdHoareTripleChecker+Invalid, 120 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 113 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-09-25 11:28:04,963 INFO L435 NwaCegarLoop]: SdHoareTripleChecker [28 Valid, 172 Invalid, 120 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 113 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-09-25 11:28:04,965 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 41 states. [2024-09-25 11:28:04,974 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 41 to 33. [2024-09-25 11:28:04,974 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 33 states, 20 states have (on average 1.1) internal successors, (22), 21 states have internal predecessors, (22), 5 states have call successors, (5), 4 states have call predecessors, (5), 7 states have return successors, (8), 7 states have call predecessors, (8), 4 states have call successors, (8) [2024-09-25 11:28:04,974 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 33 states to 33 states and 35 transitions. [2024-09-25 11:28:04,975 INFO L78 Accepts]: Start accepts. Automaton has 33 states and 35 transitions. Word has length 31 [2024-09-25 11:28:04,975 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-09-25 11:28:04,975 INFO L474 AbstractCegarLoop]: Abstraction has 33 states and 35 transitions. [2024-09-25 11:28:04,976 INFO L475 AbstractCegarLoop]: INTERPOLANT automaton has has 18 states, 16 states have (on average 2.0625) internal successors, (33), 18 states have internal predecessors, (33), 10 states have call successors, (11), 1 states have call predecessors, (11), 6 states have return successors, (12), 5 states have call predecessors, (12), 10 states have call successors, (12) [2024-09-25 11:28:04,977 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-25 11:28:04,977 INFO L276 IsEmpty]: Start isEmpty. Operand 33 states and 35 transitions. [2024-09-25 11:28:04,979 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2024-09-25 11:28:04,979 INFO L208 NwaCegarLoop]: Found error trace [2024-09-25 11:28:04,980 INFO L216 NwaCegarLoop]: trace histogram [3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-09-25 11:28:04,995 INFO L552 MonitoredProcess]: [MP /storage/repos/certificate-witnesses-artifact/automizer/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Ended with exit code 0 [2024-09-25 11:28:05,180 WARN L456 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3,3 /storage/repos/certificate-witnesses-artifact/automizer/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-09-25 11:28:05,181 INFO L399 AbstractCegarLoop]: === Iteration 5 === Targeting mainErr0ASSERT_VIOLATIONERROR_FUNCTION === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-09-25 11:28:05,181 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-25 11:28:05,181 INFO L85 PathProgramCache]: Analyzing trace with hash -1839833823, now seen corresponding path program 2 times [2024-09-25 11:28:05,181 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-09-25 11:28:05,182 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [882758112] [2024-09-25 11:28:05,182 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-09-25 11:28:05,182 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-09-25 11:28:05,189 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-25 11:28:05,218 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2024-09-25 11:28:05,219 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-25 11:28:05,221 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-09-25 11:28:05,224 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-25 11:28:05,258 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-09-25 11:28:05,266 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-25 11:28:05,316 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-09-25 11:28:05,319 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-25 11:28:05,342 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-09-25 11:28:05,344 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-25 11:28:05,368 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-09-25 11:28:05,371 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-25 11:28:05,399 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 0 proven. 12 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2024-09-25 11:28:05,399 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-09-25 11:28:05,399 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [882758112] [2024-09-25 11:28:05,399 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [882758112] provided 0 perfect and 1 imperfect interpolant sequences [2024-09-25 11:28:05,400 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [14528246] [2024-09-25 11:28:05,400 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2024-09-25 11:28:05,400 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-09-25 11:28:05,400 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/certificate-witnesses-artifact/automizer/z3 [2024-09-25 11:28:05,402 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/certificate-witnesses-artifact/automizer/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-09-25 11:28:05,403 INFO L327 MonitoredProcess]: [MP /storage/repos/certificate-witnesses-artifact/automizer/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2024-09-25 11:28:05,449 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2024-09-25 11:28:05,450 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2024-09-25 11:28:05,450 INFO L262 TraceCheckSpWp]: Trace formula consists of 105 conjuncts, 12 conjuncts are in the unsatisfiable core [2024-09-25 11:28:05,452 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2024-09-25 11:28:05,519 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2024-09-25 11:28:05,519 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2024-09-25 11:28:06,293 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 0 proven. 16 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2024-09-25 11:28:06,294 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [14528246] provided 0 perfect and 2 imperfect interpolant sequences [2024-09-25 11:28:06,294 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-09-25 11:28:06,294 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 10, 13] total 19 [2024-09-25 11:28:06,294 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1878831373] [2024-09-25 11:28:06,294 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-09-25 11:28:06,295 INFO L551 AbstractCegarLoop]: INTERPOLANT automaton has 19 states [2024-09-25 11:28:06,296 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-09-25 11:28:06,297 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2024-09-25 11:28:06,297 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=71, Invalid=271, Unknown=0, NotChecked=0, Total=342 [2024-09-25 11:28:06,297 INFO L87 Difference]: Start difference. First operand 33 states and 35 transitions. Second operand has 19 states, 18 states have (on average 2.0) internal successors, (36), 19 states have internal predecessors, (36), 10 states have call successors, (11), 1 states have call predecessors, (11), 7 states have return successors, (14), 6 states have call predecessors, (14), 10 states have call successors, (14) [2024-09-25 11:28:06,420 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-09-25 11:28:06,420 INFO L93 Difference]: Finished difference Result 51 states and 53 transitions. [2024-09-25 11:28:06,421 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2024-09-25 11:28:06,421 INFO L78 Accepts]: Start accepts. Automaton has has 19 states, 18 states have (on average 2.0) internal successors, (36), 19 states have internal predecessors, (36), 10 states have call successors, (11), 1 states have call predecessors, (11), 7 states have return successors, (14), 6 states have call predecessors, (14), 10 states have call successors, (14) Word has length 37 [2024-09-25 11:28:06,421 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-09-25 11:28:06,422 INFO L225 Difference]: With dead ends: 51 [2024-09-25 11:28:06,422 INFO L226 Difference]: Without dead ends: 47 [2024-09-25 11:28:06,423 INFO L433 NwaCegarLoop]: 0 DeclaredPredicates, 97 GetRequests, 70 SyntacticMatches, 6 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 123 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=107, Invalid=399, Unknown=0, NotChecked=0, Total=506 [2024-09-25 11:28:06,424 INFO L434 NwaCegarLoop]: 18 mSDtfsCounter, 35 mSDsluCounter, 113 mSDsCounter, 0 mSdLazyCounter, 90 mSolverCounterSat, 15 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 43 SdHoareTripleChecker+Valid, 131 SdHoareTripleChecker+Invalid, 105 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 15 IncrementalHoareTripleChecker+Valid, 90 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-09-25 11:28:06,424 INFO L435 NwaCegarLoop]: SdHoareTripleChecker [43 Valid, 131 Invalid, 105 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [15 Valid, 90 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-09-25 11:28:06,425 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 47 states. [2024-09-25 11:28:06,435 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 47 to 36. [2024-09-25 11:28:06,435 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 36 states, 22 states have (on average 1.0909090909090908) internal successors, (24), 23 states have internal predecessors, (24), 5 states have call successors, (5), 4 states have call predecessors, (5), 8 states have return successors, (9), 8 states have call predecessors, (9), 4 states have call successors, (9) [2024-09-25 11:28:06,436 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 36 states to 36 states and 38 transitions. [2024-09-25 11:28:06,436 INFO L78 Accepts]: Start accepts. Automaton has 36 states and 38 transitions. Word has length 37 [2024-09-25 11:28:06,437 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-09-25 11:28:06,437 INFO L474 AbstractCegarLoop]: Abstraction has 36 states and 38 transitions. [2024-09-25 11:28:06,437 INFO L475 AbstractCegarLoop]: INTERPOLANT automaton has has 19 states, 18 states have (on average 2.0) internal successors, (36), 19 states have internal predecessors, (36), 10 states have call successors, (11), 1 states have call predecessors, (11), 7 states have return successors, (14), 6 states have call predecessors, (14), 10 states have call successors, (14) [2024-09-25 11:28:06,437 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-25 11:28:06,438 INFO L276 IsEmpty]: Start isEmpty. Operand 36 states and 38 transitions. [2024-09-25 11:28:06,438 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 44 [2024-09-25 11:28:06,438 INFO L208 NwaCegarLoop]: Found error trace [2024-09-25 11:28:06,439 INFO L216 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-09-25 11:28:06,450 INFO L540 MonitoredProcess]: [MP /storage/repos/certificate-witnesses-artifact/automizer/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Forceful destruction successful, exit code 0 [2024-09-25 11:28:06,639 WARN L456 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4,4 /storage/repos/certificate-witnesses-artifact/automizer/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-09-25 11:28:06,640 INFO L399 AbstractCegarLoop]: === Iteration 6 === Targeting mainErr0ASSERT_VIOLATIONERROR_FUNCTION === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-09-25 11:28:06,640 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-25 11:28:06,641 INFO L85 PathProgramCache]: Analyzing trace with hash 342772751, now seen corresponding path program 2 times [2024-09-25 11:28:06,641 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-09-25 11:28:06,641 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [300713155] [2024-09-25 11:28:06,641 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-09-25 11:28:06,641 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-09-25 11:28:06,651 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-25 11:28:06,721 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2024-09-25 11:28:06,722 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-25 11:28:06,724 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-09-25 11:28:06,727 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-25 11:28:06,783 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-09-25 11:28:06,787 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-25 11:28:06,826 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-09-25 11:28:06,829 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-25 11:28:06,883 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-09-25 11:28:06,886 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-25 11:28:06,922 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-09-25 11:28:06,924 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-25 11:28:06,955 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-09-25 11:28:06,957 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-25 11:28:06,974 INFO L134 CoverageAnalysis]: Checked inductivity of 32 backedges. 0 proven. 16 refuted. 0 times theorem prover too weak. 16 trivial. 0 not checked. [2024-09-25 11:28:06,974 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-09-25 11:28:06,974 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [300713155] [2024-09-25 11:28:06,975 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [300713155] provided 0 perfect and 1 imperfect interpolant sequences [2024-09-25 11:28:06,975 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2003540784] [2024-09-25 11:28:06,975 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2024-09-25 11:28:06,975 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-09-25 11:28:06,975 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/certificate-witnesses-artifact/automizer/z3 [2024-09-25 11:28:06,977 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/certificate-witnesses-artifact/automizer/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-09-25 11:28:06,978 INFO L327 MonitoredProcess]: [MP /storage/repos/certificate-witnesses-artifact/automizer/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2024-09-25 11:28:07,031 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2024-09-25 11:28:07,031 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2024-09-25 11:28:07,032 INFO L262 TraceCheckSpWp]: Trace formula consists of 119 conjuncts, 27 conjuncts are in the unsatisfiable core [2024-09-25 11:28:07,034 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2024-09-25 11:28:07,083 INFO L134 CoverageAnalysis]: Checked inductivity of 32 backedges. 0 proven. 16 refuted. 0 times theorem prover too weak. 16 trivial. 0 not checked. [2024-09-25 11:28:07,084 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2024-09-25 11:28:07,241 INFO L134 CoverageAnalysis]: Checked inductivity of 32 backedges. 0 proven. 16 refuted. 0 times theorem prover too weak. 16 trivial. 0 not checked. [2024-09-25 11:28:07,242 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2003540784] provided 0 perfect and 2 imperfect interpolant sequences [2024-09-25 11:28:07,242 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-09-25 11:28:07,242 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [15, 15, 15] total 15 [2024-09-25 11:28:07,242 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [526445391] [2024-09-25 11:28:07,242 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-09-25 11:28:07,243 INFO L551 AbstractCegarLoop]: INTERPOLANT automaton has 15 states [2024-09-25 11:28:07,243 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-09-25 11:28:07,243 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2024-09-25 11:28:07,244 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=183, Unknown=0, NotChecked=0, Total=210 [2024-09-25 11:28:07,244 INFO L87 Difference]: Start difference. First operand 36 states and 38 transitions. Second operand has 15 states, 15 states have (on average 1.4) internal successors, (21), 9 states have internal predecessors, (21), 1 states have call successors, (5), 1 states have call predecessors, (5), 7 states have return successors, (7), 7 states have call predecessors, (7), 1 states have call successors, (7) [2024-09-25 11:28:07,327 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-09-25 11:28:07,327 INFO L93 Difference]: Finished difference Result 57 states and 59 transitions. [2024-09-25 11:28:07,327 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2024-09-25 11:28:07,327 INFO L78 Accepts]: Start accepts. Automaton has has 15 states, 15 states have (on average 1.4) internal successors, (21), 9 states have internal predecessors, (21), 1 states have call successors, (5), 1 states have call predecessors, (5), 7 states have return successors, (7), 7 states have call predecessors, (7), 1 states have call successors, (7) Word has length 43 [2024-09-25 11:28:07,328 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-09-25 11:28:07,329 INFO L225 Difference]: With dead ends: 57 [2024-09-25 11:28:07,329 INFO L226 Difference]: Without dead ends: 53 [2024-09-25 11:28:07,329 INFO L433 NwaCegarLoop]: 0 DeclaredPredicates, 114 GetRequests, 101 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=27, Invalid=183, Unknown=0, NotChecked=0, Total=210 [2024-09-25 11:28:07,330 INFO L434 NwaCegarLoop]: 33 mSDtfsCounter, 0 mSDsluCounter, 395 mSDsCounter, 0 mSdLazyCounter, 116 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 428 SdHoareTripleChecker+Invalid, 116 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 116 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-09-25 11:28:07,330 INFO L435 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 428 Invalid, 116 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 116 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-09-25 11:28:07,330 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 53 states. [2024-09-25 11:28:07,344 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 53 to 39. [2024-09-25 11:28:07,344 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 39 states, 24 states have (on average 1.0833333333333333) internal successors, (26), 25 states have internal predecessors, (26), 5 states have call successors, (5), 4 states have call predecessors, (5), 9 states have return successors, (10), 9 states have call predecessors, (10), 4 states have call successors, (10) [2024-09-25 11:28:07,345 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 39 states to 39 states and 41 transitions. [2024-09-25 11:28:07,345 INFO L78 Accepts]: Start accepts. Automaton has 39 states and 41 transitions. Word has length 43 [2024-09-25 11:28:07,345 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-09-25 11:28:07,346 INFO L474 AbstractCegarLoop]: Abstraction has 39 states and 41 transitions. [2024-09-25 11:28:07,346 INFO L475 AbstractCegarLoop]: INTERPOLANT automaton has has 15 states, 15 states have (on average 1.4) internal successors, (21), 9 states have internal predecessors, (21), 1 states have call successors, (5), 1 states have call predecessors, (5), 7 states have return successors, (7), 7 states have call predecessors, (7), 1 states have call successors, (7) [2024-09-25 11:28:07,346 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-25 11:28:07,350 INFO L276 IsEmpty]: Start isEmpty. Operand 39 states and 41 transitions. [2024-09-25 11:28:07,351 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 50 [2024-09-25 11:28:07,351 INFO L208 NwaCegarLoop]: Found error trace [2024-09-25 11:28:07,351 INFO L216 NwaCegarLoop]: trace histogram [4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-09-25 11:28:07,370 INFO L552 MonitoredProcess]: [MP /storage/repos/certificate-witnesses-artifact/automizer/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Ended with exit code 0 [2024-09-25 11:28:07,551 WARN L456 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5,5 /storage/repos/certificate-witnesses-artifact/automizer/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-09-25 11:28:07,552 INFO L399 AbstractCegarLoop]: === Iteration 7 === Targeting mainErr0ASSERT_VIOLATIONERROR_FUNCTION === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-09-25 11:28:07,552 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-25 11:28:07,552 INFO L85 PathProgramCache]: Analyzing trace with hash 872362609, now seen corresponding path program 3 times [2024-09-25 11:28:07,552 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-09-25 11:28:07,552 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [14787053] [2024-09-25 11:28:07,553 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-09-25 11:28:07,553 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-09-25 11:28:07,560 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-25 11:28:07,609 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2024-09-25 11:28:07,610 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-25 11:28:07,612 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-09-25 11:28:07,616 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-25 11:28:07,662 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-09-25 11:28:07,666 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-25 11:28:07,705 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-09-25 11:28:07,708 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-25 11:28:07,749 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-09-25 11:28:07,753 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-25 11:28:07,790 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-09-25 11:28:07,793 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-25 11:28:07,819 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-09-25 11:28:07,822 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-25 11:28:07,843 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-09-25 11:28:07,846 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-25 11:28:07,877 INFO L134 CoverageAnalysis]: Checked inductivity of 48 backedges. 18 proven. 9 refuted. 0 times theorem prover too weak. 21 trivial. 0 not checked. [2024-09-25 11:28:07,878 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-09-25 11:28:07,878 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [14787053] [2024-09-25 11:28:07,878 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [14787053] provided 0 perfect and 1 imperfect interpolant sequences [2024-09-25 11:28:07,878 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [490196569] [2024-09-25 11:28:07,878 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2024-09-25 11:28:07,878 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-09-25 11:28:07,879 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/certificate-witnesses-artifact/automizer/z3 [2024-09-25 11:28:07,880 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/certificate-witnesses-artifact/automizer/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-09-25 11:28:07,882 INFO L327 MonitoredProcess]: [MP /storage/repos/certificate-witnesses-artifact/automizer/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2024-09-25 11:28:07,943 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 4 check-sat command(s) [2024-09-25 11:28:07,944 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2024-09-25 11:28:07,945 INFO L262 TraceCheckSpWp]: Trace formula consists of 133 conjuncts, 16 conjuncts are in the unsatisfiable core [2024-09-25 11:28:07,946 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2024-09-25 11:28:08,021 INFO L134 CoverageAnalysis]: Checked inductivity of 48 backedges. 24 proven. 0 refuted. 0 times theorem prover too weak. 24 trivial. 0 not checked. [2024-09-25 11:28:08,022 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-09-25 11:28:08,022 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [490196569] provided 1 perfect and 0 imperfect interpolant sequences [2024-09-25 11:28:08,022 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-09-25 11:28:08,022 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [13] total 16 [2024-09-25 11:28:08,022 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1339002385] [2024-09-25 11:28:08,022 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-09-25 11:28:08,023 INFO L551 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2024-09-25 11:28:08,023 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-09-25 11:28:08,023 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2024-09-25 11:28:08,024 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=43, Invalid=197, Unknown=0, NotChecked=0, Total=240 [2024-09-25 11:28:08,024 INFO L87 Difference]: Start difference. First operand 39 states and 41 transitions. Second operand has 12 states, 11 states have (on average 2.090909090909091) internal successors, (23), 12 states have internal predecessors, (23), 4 states have call successors, (5), 1 states have call predecessors, (5), 8 states have return successors, (8), 8 states have call predecessors, (8), 4 states have call successors, (8) [2024-09-25 11:28:08,149 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-09-25 11:28:08,149 INFO L93 Difference]: Finished difference Result 63 states and 65 transitions. [2024-09-25 11:28:08,149 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2024-09-25 11:28:08,150 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 11 states have (on average 2.090909090909091) internal successors, (23), 12 states have internal predecessors, (23), 4 states have call successors, (5), 1 states have call predecessors, (5), 8 states have return successors, (8), 8 states have call predecessors, (8), 4 states have call successors, (8) Word has length 49 [2024-09-25 11:28:08,150 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-09-25 11:28:08,151 INFO L225 Difference]: With dead ends: 63 [2024-09-25 11:28:08,151 INFO L226 Difference]: Without dead ends: 39 [2024-09-25 11:28:08,152 INFO L433 NwaCegarLoop]: 0 DeclaredPredicates, 80 GetRequests, 60 SyntacticMatches, 0 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 46 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=82, Invalid=380, Unknown=0, NotChecked=0, Total=462 [2024-09-25 11:28:08,152 INFO L434 NwaCegarLoop]: 29 mSDtfsCounter, 9 mSDsluCounter, 154 mSDsCounter, 0 mSdLazyCounter, 103 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 13 SdHoareTripleChecker+Valid, 183 SdHoareTripleChecker+Invalid, 103 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 103 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-09-25 11:28:08,152 INFO L435 NwaCegarLoop]: SdHoareTripleChecker [13 Valid, 183 Invalid, 103 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 103 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-09-25 11:28:08,153 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 39 states. [2024-09-25 11:28:08,169 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 39 to 39. [2024-09-25 11:28:08,170 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 39 states, 24 states have (on average 1.0416666666666667) internal successors, (25), 25 states have internal predecessors, (25), 5 states have call successors, (5), 4 states have call predecessors, (5), 9 states have return successors, (10), 9 states have call predecessors, (10), 4 states have call successors, (10) [2024-09-25 11:28:08,170 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 39 states to 39 states and 40 transitions. [2024-09-25 11:28:08,171 INFO L78 Accepts]: Start accepts. Automaton has 39 states and 40 transitions. Word has length 49 [2024-09-25 11:28:08,171 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-09-25 11:28:08,171 INFO L474 AbstractCegarLoop]: Abstraction has 39 states and 40 transitions. [2024-09-25 11:28:08,171 INFO L475 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 11 states have (on average 2.090909090909091) internal successors, (23), 12 states have internal predecessors, (23), 4 states have call successors, (5), 1 states have call predecessors, (5), 8 states have return successors, (8), 8 states have call predecessors, (8), 4 states have call successors, (8) [2024-09-25 11:28:08,172 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-25 11:28:08,172 INFO L276 IsEmpty]: Start isEmpty. Operand 39 states and 40 transitions. [2024-09-25 11:28:08,172 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 56 [2024-09-25 11:28:08,173 INFO L208 NwaCegarLoop]: Found error trace [2024-09-25 11:28:08,173 INFO L216 NwaCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-09-25 11:28:08,189 INFO L540 MonitoredProcess]: [MP /storage/repos/certificate-witnesses-artifact/automizer/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Forceful destruction successful, exit code 0 [2024-09-25 11:28:08,376 WARN L456 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 /storage/repos/certificate-witnesses-artifact/automizer/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable6 [2024-09-25 11:28:08,377 INFO L399 AbstractCegarLoop]: === Iteration 8 === Targeting mainErr0ASSERT_VIOLATIONERROR_FUNCTION === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-09-25 11:28:08,377 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-25 11:28:08,377 INFO L85 PathProgramCache]: Analyzing trace with hash -1842056993, now seen corresponding path program 3 times [2024-09-25 11:28:08,377 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-09-25 11:28:08,377 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1705045795] [2024-09-25 11:28:08,377 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-09-25 11:28:08,378 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-09-25 11:28:08,386 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-25 11:28:08,452 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2024-09-25 11:28:08,453 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-25 11:28:08,454 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-09-25 11:28:08,464 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-25 11:28:08,519 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-09-25 11:28:08,523 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-25 11:28:08,576 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-09-25 11:28:08,580 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-25 11:28:08,617 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-09-25 11:28:08,620 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-25 11:28:08,654 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-09-25 11:28:08,657 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-25 11:28:08,692 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-09-25 11:28:08,694 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-25 11:28:08,716 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-09-25 11:28:08,717 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-25 11:28:08,738 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-09-25 11:28:08,739 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-25 11:28:08,766 INFO L134 CoverageAnalysis]: Checked inductivity of 66 backedges. 27 proven. 9 refuted. 0 times theorem prover too weak. 30 trivial. 0 not checked. [2024-09-25 11:28:08,767 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-09-25 11:28:08,767 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1705045795] [2024-09-25 11:28:08,767 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1705045795] provided 0 perfect and 1 imperfect interpolant sequences [2024-09-25 11:28:08,767 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1266821949] [2024-09-25 11:28:08,767 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2024-09-25 11:28:08,767 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-09-25 11:28:08,767 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/certificate-witnesses-artifact/automizer/z3 [2024-09-25 11:28:08,769 INFO L229 MonitoredProcess]: Starting monitored process 7 with /storage/repos/certificate-witnesses-artifact/automizer/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-09-25 11:28:08,770 INFO L327 MonitoredProcess]: [MP /storage/repos/certificate-witnesses-artifact/automizer/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Waiting until timeout for monitored process [2024-09-25 11:28:08,831 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 4 check-sat command(s) [2024-09-25 11:28:08,831 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2024-09-25 11:28:08,832 INFO L262 TraceCheckSpWp]: Trace formula consists of 147 conjuncts, 18 conjuncts are in the unsatisfiable core [2024-09-25 11:28:08,834 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2024-09-25 11:28:08,938 INFO L134 CoverageAnalysis]: Checked inductivity of 66 backedges. 33 proven. 0 refuted. 0 times theorem prover too weak. 33 trivial. 0 not checked. [2024-09-25 11:28:08,938 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-09-25 11:28:08,939 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1266821949] provided 1 perfect and 0 imperfect interpolant sequences [2024-09-25 11:28:08,939 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-09-25 11:28:08,939 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [14] total 17 [2024-09-25 11:28:08,939 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1466012499] [2024-09-25 11:28:08,940 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-09-25 11:28:08,940 INFO L551 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2024-09-25 11:28:08,940 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-09-25 11:28:08,941 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2024-09-25 11:28:08,941 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=48, Invalid=224, Unknown=0, NotChecked=0, Total=272 [2024-09-25 11:28:08,941 INFO L87 Difference]: Start difference. First operand 39 states and 40 transitions. Second operand has 13 states, 12 states have (on average 2.0833333333333335) internal successors, (25), 13 states have internal predecessors, (25), 4 states have call successors, (5), 1 states have call predecessors, (5), 9 states have return successors, (9), 9 states have call predecessors, (9), 4 states have call successors, (9) [2024-09-25 11:28:09,073 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-09-25 11:28:09,073 INFO L93 Difference]: Finished difference Result 39 states and 40 transitions. [2024-09-25 11:28:09,073 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2024-09-25 11:28:09,074 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 12 states have (on average 2.0833333333333335) internal successors, (25), 13 states have internal predecessors, (25), 4 states have call successors, (5), 1 states have call predecessors, (5), 9 states have return successors, (9), 9 states have call predecessors, (9), 4 states have call successors, (9) Word has length 55 [2024-09-25 11:28:09,074 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-09-25 11:28:09,074 INFO L225 Difference]: With dead ends: 39 [2024-09-25 11:28:09,074 INFO L226 Difference]: Without dead ends: 0 [2024-09-25 11:28:09,075 INFO L433 NwaCegarLoop]: 0 DeclaredPredicates, 90 GetRequests, 68 SyntacticMatches, 0 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 57 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=97, Invalid=455, Unknown=0, NotChecked=0, Total=552 [2024-09-25 11:28:09,076 INFO L434 NwaCegarLoop]: 24 mSDtfsCounter, 4 mSDsluCounter, 137 mSDsCounter, 0 mSdLazyCounter, 101 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 6 SdHoareTripleChecker+Valid, 161 SdHoareTripleChecker+Invalid, 101 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 101 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-09-25 11:28:09,076 INFO L435 NwaCegarLoop]: SdHoareTripleChecker [6 Valid, 161 Invalid, 101 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 101 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-09-25 11:28:09,076 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2024-09-25 11:28:09,077 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2024-09-25 11:28:09,077 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 0 states, 0 states have (on average 0.0) internal successors, (0), 0 states have internal predecessors, (0), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-09-25 11:28:09,077 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2024-09-25 11:28:09,077 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 55 [2024-09-25 11:28:09,077 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-09-25 11:28:09,077 INFO L474 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2024-09-25 11:28:09,078 INFO L475 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 12 states have (on average 2.0833333333333335) internal successors, (25), 13 states have internal predecessors, (25), 4 states have call successors, (5), 1 states have call predecessors, (5), 9 states have return successors, (9), 9 states have call predecessors, (9), 4 states have call successors, (9) [2024-09-25 11:28:09,078 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-25 11:28:09,079 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2024-09-25 11:28:09,079 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2024-09-25 11:28:09,081 INFO L785 garLoopResultBuilder]: Registering result SAFE for location mainErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2024-09-25 11:28:09,099 INFO L540 MonitoredProcess]: [MP /storage/repos/certificate-witnesses-artifact/automizer/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Forceful destruction successful, exit code 0 [2024-09-25 11:28:09,282 WARN L456 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7,7 /storage/repos/certificate-witnesses-artifact/automizer/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-09-25 11:28:09,285 INFO L408 BasicCegarLoop]: Path program histogram: [3, 3, 1, 1] [2024-09-25 11:28:09,286 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2024-09-25 11:28:10,453 INFO L165 ceAbstractionStarter]: Computing trace abstraction results [2024-09-25 11:28:10,471 WARN L953 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: #length [2024-09-25 11:28:10,472 WARN L953 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: #length [2024-09-25 11:28:10,472 WARN L953 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: #StackHeapBarrier [2024-09-25 11:28:10,472 WARN L953 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: #StackHeapBarrier [2024-09-25 11:28:10,473 WARN L953 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: #memory_int#0 [2024-09-25 11:28:10,474 WARN L953 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: #memory_int#0 [2024-09-25 11:28:10,474 WARN L953 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: #valid [2024-09-25 11:28:10,474 WARN L953 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: #valid [2024-09-25 11:28:10,475 WARN L953 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: #length [2024-09-25 11:28:10,475 WARN L953 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: #length [2024-09-25 11:28:10,476 WARN L953 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: #StackHeapBarrier [2024-09-25 11:28:10,476 WARN L953 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: #StackHeapBarrier [2024-09-25 11:28:10,476 WARN L953 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: #memory_int#0 [2024-09-25 11:28:10,476 WARN L953 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: #memory_int#0 [2024-09-25 11:28:10,476 WARN L953 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: #valid [2024-09-25 11:28:10,476 WARN L953 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: #valid [2024-09-25 11:28:10,482 WARN L953 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: #length [2024-09-25 11:28:10,483 WARN L953 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: #length [2024-09-25 11:28:10,483 WARN L953 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: #StackHeapBarrier [2024-09-25 11:28:10,483 WARN L953 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: #StackHeapBarrier [2024-09-25 11:28:10,483 WARN L953 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: #memory_int#0 [2024-09-25 11:28:10,483 WARN L953 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: #memory_int#0 [2024-09-25 11:28:10,484 WARN L953 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: #valid [2024-09-25 11:28:10,484 WARN L953 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: #valid [2024-09-25 11:28:10,484 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 25.09 11:28:10 BoogieIcfgContainer [2024-09-25 11:28:10,485 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2024-09-25 11:28:10,485 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2024-09-25 11:28:10,485 INFO L270 PluginConnector]: Initializing Witness Printer... [2024-09-25 11:28:10,486 INFO L274 PluginConnector]: Witness Printer initialized [2024-09-25 11:28:10,486 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 25.09 11:28:01" (3/4) ... [2024-09-25 11:28:10,488 INFO L139 WitnessPrinter]: Generating witness for correct program [2024-09-25 11:28:10,533 INFO L149 WitnessManager]: Wrote witness to /storage/repos/certificate-witnesses-artifact/automizer/witness.yml [2024-09-25 11:28:10,534 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2024-09-25 11:28:10,534 INFO L158 Benchmark]: Toolchain (without parser) took 9320.63ms. Allocated memory was 69.2MB in the beginning and 146.8MB in the end (delta: 77.6MB). Free memory was 39.8MB in the beginning and 104.4MB in the end (delta: -64.6MB). Peak memory consumption was 12.2MB. Max. memory is 16.1GB. [2024-09-25 11:28:10,535 INFO L158 Benchmark]: CDTParser took 0.13ms. Allocated memory is still 56.6MB. Free memory was 41.3MB in the beginning and 41.2MB in the end (delta: 44.9kB). There was no memory consumed. Max. memory is 16.1GB. [2024-09-25 11:28:10,535 INFO L158 Benchmark]: CACSL2BoogieTranslator took 218.22ms. Allocated memory is still 69.2MB. Free memory was 39.6MB in the beginning and 45.9MB in the end (delta: -6.2MB). Peak memory consumption was 11.4MB. Max. memory is 16.1GB. [2024-09-25 11:28:10,535 INFO L158 Benchmark]: Boogie Procedure Inliner took 18.85ms. Allocated memory is still 69.2MB. Free memory was 45.9MB in the beginning and 44.9MB in the end (delta: 1.0MB). There was no memory consumed. Max. memory is 16.1GB. [2024-09-25 11:28:10,535 INFO L158 Benchmark]: Boogie Preprocessor took 35.67ms. Allocated memory is still 69.2MB. Free memory was 44.9MB in the beginning and 43.4MB in the end (delta: 1.4MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. [2024-09-25 11:28:10,536 INFO L158 Benchmark]: RCFGBuilder took 322.09ms. Allocated memory is still 69.2MB. Free memory was 43.4MB in the beginning and 32.1MB in the end (delta: 11.3MB). Peak memory consumption was 10.5MB. Max. memory is 16.1GB. [2024-09-25 11:28:10,536 INFO L158 Benchmark]: TraceAbstraction took 8671.33ms. Allocated memory was 69.2MB in the beginning and 146.8MB in the end (delta: 77.6MB). Free memory was 31.3MB in the beginning and 106.5MB in the end (delta: -75.2MB). Peak memory consumption was 70.7MB. Max. memory is 16.1GB. [2024-09-25 11:28:10,536 INFO L158 Benchmark]: Witness Printer took 48.36ms. Allocated memory is still 146.8MB. Free memory was 106.5MB in the beginning and 104.4MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2024-09-25 11:28:10,538 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.13ms. Allocated memory is still 56.6MB. Free memory was 41.3MB in the beginning and 41.2MB in the end (delta: 44.9kB). There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 218.22ms. Allocated memory is still 69.2MB. Free memory was 39.6MB in the beginning and 45.9MB in the end (delta: -6.2MB). Peak memory consumption was 11.4MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 18.85ms. Allocated memory is still 69.2MB. Free memory was 45.9MB in the beginning and 44.9MB in the end (delta: 1.0MB). There was no memory consumed. Max. memory is 16.1GB. * Boogie Preprocessor took 35.67ms. Allocated memory is still 69.2MB. Free memory was 44.9MB in the beginning and 43.4MB in the end (delta: 1.4MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. * RCFGBuilder took 322.09ms. Allocated memory is still 69.2MB. Free memory was 43.4MB in the beginning and 32.1MB in the end (delta: 11.3MB). Peak memory consumption was 10.5MB. Max. memory is 16.1GB. * TraceAbstraction took 8671.33ms. Allocated memory was 69.2MB in the beginning and 146.8MB in the end (delta: 77.6MB). Free memory was 31.3MB in the beginning and 106.5MB in the end (delta: -75.2MB). Peak memory consumption was 70.7MB. Max. memory is 16.1GB. * Witness Printer took 48.36ms. Allocated memory is still 146.8MB. Free memory was 106.5MB in the beginning and 104.4MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Unknown variable: #length - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Unknown variable: #length - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Unknown variable: #StackHeapBarrier - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Unknown variable: #StackHeapBarrier - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Unknown variable: #memory_int#0 - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Unknown variable: #memory_int#0 - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Unknown variable: #valid - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Unknown variable: #valid - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Unknown variable: #length - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Unknown variable: #length - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Unknown variable: #StackHeapBarrier - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Unknown variable: #StackHeapBarrier - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Unknown variable: #memory_int#0 - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Unknown variable: #memory_int#0 - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Unknown variable: #valid - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Unknown variable: #valid - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Unknown variable: #length - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Unknown variable: #length - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Unknown variable: #StackHeapBarrier - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Unknown variable: #StackHeapBarrier - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Unknown variable: #memory_int#0 - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Unknown variable: #memory_int#0 - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Unknown variable: #valid - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Unknown variable: #valid * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: ErrorAutomatonStatistics NumberErrorTraces: 0, NumberStatementsAllTraces: 0, NumberRelevantStatements: 0, 0.0s ErrorAutomatonConstructionTimeTotal, 0.0s FaulLocalizationTime, NumberStatementsFirstTrace: -1, TraceLengthAvg: 0, 0.0s ErrorAutomatonConstructionTimeAvg, 0.0s ErrorAutomatonDifferenceTimeAvg, 0.0s ErrorAutomatonDifferenceTimeTotal, NumberOfNoEnhancement: 0, NumberOfFiniteEnhancement: 0, NumberOfInfiniteEnhancement: 0 - PositiveResult [Line: 23]: a call to reach_error is unreachable For all program executions holds that a call to reach_error is unreachable at this location - StatisticsResult: Ultimate Automizer benchmark data CFG has 5 procedures, 26 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 7.4s, OverallIterations: 8, TraceHistogramMax: 4, PathProgramHistogramMax: 3, EmptinessCheckTime: 0.0s, AutomataDifference: 1.0s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 142 SdHoareTripleChecker+Valid, 0.5s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 108 mSDsluCounter, 1341 SdHoareTripleChecker+Invalid, 0.4s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 1160 mSDsCounter, 30 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 679 IncrementalHoareTripleChecker+Invalid, 709 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 30 mSolverCounterUnsat, 181 mSDtfsCounter, 679 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 547 GetRequests, 414 SyntacticMatches, 13 SemanticMatches, 120 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 378 ImplicationChecksByTransitivity, 1.1s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=39occurred in iteration=6, InterpolantAutomatonStates: 83, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.1s AutomataMinimizationTime, 8 MinimizatonAttempts, 40 StatesRemovedByMinimization, 5 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.2s SatisfiabilityAnalysisTime, 4.5s InterpolantComputationTime, 512 NumberOfCodeBlocks, 512 NumberOfCodeBlocksAsserted, 22 NumberOfCheckSat, 630 ConstructedInterpolants, 0 QuantifiedInterpolants, 1512 SizeOfPredicates, 22 NumberOfNonLiveVariables, 672 ConjunctsInSsa, 91 ConjunctsInUnsatCore, 18 InterpolantComputations, 4 PerfectInterpolantSequences, 295/426 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 - ProcedureContractResult [Line: 14]: Procedure Contract for id2 Derived contract for procedure id2. Ensures: ((((((x == 0) && (\result == 0)) || (x == 1)) || (((\result == 2) && (x <= 3)) && (2 <= x))) || (4 < x)) || (((3 == x) || (\result == 4)) && (3 <= x))) - ProcedureContractResult [Line: 9]: Procedure Contract for id Derived contract for procedure id. Ensures: ((((((x == 0) || (x == 4)) || ((5 == \result) && (5 == x))) || ((((3 == \result) && (x <= 4)) || (x == 2)) && (2 <= x))) || (((\result == 1) && (x <= 2)) && (1 <= x))) || (5 < x)) RESULT: Ultimate proved your program to be correct! [2024-09-25 11:28:10,567 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