./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/nla-digbench/ps6-ll.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/nla-digbench/ps6-ll.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 07abfb6a25bc8999c03b9e73c88de3af15c2169770f93c7bfb47efae6a8a30d3 --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 10:42:24,166 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-09-25 10:42:24,241 INFO L114 SettingsManager]: Loading settings from /storage/repos/certificate-witnesses-artifact/automizer/config/svcomp-Reach-32bit-Automizer_Default.epf [2024-09-25 10:42:24,245 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-09-25 10:42:24,245 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-09-25 10:42:24,267 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-09-25 10:42:24,269 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-09-25 10:42:24,270 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-09-25 10:42:24,271 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-09-25 10:42:24,272 INFO L153 SettingsManager]: * Use memory slicer=true [2024-09-25 10:42:24,272 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-09-25 10:42:24,273 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-09-25 10:42:24,275 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-09-25 10:42:24,275 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-09-25 10:42:24,276 INFO L153 SettingsManager]: * Use SBE=true [2024-09-25 10:42:24,276 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-09-25 10:42:24,276 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-09-25 10:42:24,277 INFO L153 SettingsManager]: * sizeof long=4 [2024-09-25 10:42:24,277 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-09-25 10:42:24,277 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-09-25 10:42:24,277 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-09-25 10:42:24,281 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-09-25 10:42:24,281 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-09-25 10:42:24,281 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-09-25 10:42:24,282 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-09-25 10:42:24,282 INFO L153 SettingsManager]: * sizeof long double=12 [2024-09-25 10:42:24,282 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-09-25 10:42:24,282 INFO L153 SettingsManager]: * Use constant arrays=true [2024-09-25 10:42:24,282 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-09-25 10:42:24,283 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-09-25 10:42:24,283 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-09-25 10:42:24,283 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-09-25 10:42:24,283 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-09-25 10:42:24,284 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-09-25 10:42:24,284 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-09-25 10:42:24,284 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-09-25 10:42:24,284 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-09-25 10:42:24,285 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-09-25 10:42:24,285 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-09-25 10:42:24,285 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-09-25 10:42:24,285 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-09-25 10:42:24,287 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-09-25 10:42:24,287 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 -> 07abfb6a25bc8999c03b9e73c88de3af15c2169770f93c7bfb47efae6a8a30d3 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 10:42:24,572 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-09-25 10:42:24,594 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-09-25 10:42:24,596 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-09-25 10:42:24,597 INFO L270 PluginConnector]: Initializing CDTParser... [2024-09-25 10:42:24,597 INFO L274 PluginConnector]: CDTParser initialized [2024-09-25 10:42:24,598 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/certificate-witnesses-artifact/automizer/../sv-benchmarks/c/nla-digbench/ps6-ll.c [2024-09-25 10:42:25,994 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-09-25 10:42:26,196 INFO L384 CDTParser]: Found 1 translation units. [2024-09-25 10:42:26,196 INFO L180 CDTParser]: Scanning /storage/repos/certificate-witnesses-artifact/sv-benchmarks/c/nla-digbench/ps6-ll.c [2024-09-25 10:42:26,203 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/certificate-witnesses-artifact/automizer/data/33c7cfe7e/b3f0cf2fc27340abae3d54d5827cb32e/FLAG8a73d5604 [2024-09-25 10:42:26,213 INFO L435 CDTParser]: Successfully deleted /storage/repos/certificate-witnesses-artifact/automizer/data/33c7cfe7e/b3f0cf2fc27340abae3d54d5827cb32e [2024-09-25 10:42:26,215 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-09-25 10:42:26,216 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-09-25 10:42:26,218 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-09-25 10:42:26,218 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-09-25 10:42:26,222 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-09-25 10:42:26,222 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 25.09 10:42:26" (1/1) ... [2024-09-25 10:42:26,223 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@44c702bd and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.09 10:42:26, skipping insertion in model container [2024-09-25 10:42:26,223 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 25.09 10:42:26" (1/1) ... [2024-09-25 10:42:26,240 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-09-25 10:42:26,407 WARN L248 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/certificate-witnesses-artifact/sv-benchmarks/c/nla-digbench/ps6-ll.c[458,471] [2024-09-25 10:42:26,431 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-09-25 10:42:26,441 INFO L200 MainTranslator]: Completed pre-run [2024-09-25 10:42:26,452 WARN L248 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/certificate-witnesses-artifact/sv-benchmarks/c/nla-digbench/ps6-ll.c[458,471] [2024-09-25 10:42:26,460 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-09-25 10:42:26,484 INFO L204 MainTranslator]: Completed translation [2024-09-25 10:42:26,485 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.09 10:42:26 WrapperNode [2024-09-25 10:42:26,485 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-09-25 10:42:26,486 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-09-25 10:42:26,487 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-09-25 10:42:26,487 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-09-25 10:42:26,493 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.09 10:42:26" (1/1) ... [2024-09-25 10:42:26,499 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.09 10:42:26" (1/1) ... [2024-09-25 10:42:26,505 INFO L138 Inliner]: procedures = 14, calls = 11, calls flagged for inlining = 0, calls inlined = 0, statements flattened = 0 [2024-09-25 10:42:26,505 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-09-25 10:42:26,506 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-09-25 10:42:26,506 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-09-25 10:42:26,507 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-09-25 10:42:26,515 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.09 10:42:26" (1/1) ... [2024-09-25 10:42:26,516 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.09 10:42:26" (1/1) ... [2024-09-25 10:42:26,517 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.09 10:42:26" (1/1) ... [2024-09-25 10:42:26,532 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 10:42:26,534 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.09 10:42:26" (1/1) ... [2024-09-25 10:42:26,534 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.09 10:42:26" (1/1) ... [2024-09-25 10:42:26,540 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.09 10:42:26" (1/1) ... [2024-09-25 10:42:26,543 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.09 10:42:26" (1/1) ... [2024-09-25 10:42:26,544 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.09 10:42:26" (1/1) ... [2024-09-25 10:42:26,546 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.09 10:42:26" (1/1) ... [2024-09-25 10:42:26,548 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-09-25 10:42:26,549 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-09-25 10:42:26,549 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-09-25 10:42:26,550 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-09-25 10:42:26,550 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.09 10:42:26" (1/1) ... [2024-09-25 10:42:26,555 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-09-25 10:42:26,566 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/certificate-witnesses-artifact/automizer/z3 [2024-09-25 10:42:26,579 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 10:42:26,585 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 10:42:26,624 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-09-25 10:42:26,624 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2024-09-25 10:42:26,625 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2024-09-25 10:42:26,625 INFO L130 BoogieDeclarations]: Found specification of procedure main [2024-09-25 10:42:26,625 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2024-09-25 10:42:26,625 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-09-25 10:42:26,626 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2024-09-25 10:42:26,627 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2024-09-25 10:42:26,627 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-09-25 10:42:26,627 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-09-25 10:42:26,627 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2024-09-25 10:42:26,627 INFO L138 BoogieDeclarations]: Found implementation of procedure __VERIFIER_assert [2024-09-25 10:42:26,702 INFO L241 CfgBuilder]: Building ICFG [2024-09-25 10:42:26,704 INFO L267 CfgBuilder]: Building CFG for each procedure with an implementation [2024-09-25 10:42:26,866 INFO L? ?]: Removed 5 outVars from TransFormulas that were not future-live. [2024-09-25 10:42:26,867 INFO L290 CfgBuilder]: Performing block encoding [2024-09-25 10:42:26,895 INFO L312 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-09-25 10:42:26,896 INFO L317 CfgBuilder]: Removed 1 assume(true) statements. [2024-09-25 10:42:26,896 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 25.09 10:42:26 BoogieIcfgContainer [2024-09-25 10:42:26,896 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-09-25 10:42:26,900 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-09-25 10:42:26,900 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-09-25 10:42:26,904 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-09-25 10:42:26,905 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 25.09 10:42:26" (1/3) ... [2024-09-25 10:42:26,906 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@21edd667 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 25.09 10:42:26, skipping insertion in model container [2024-09-25 10:42:26,906 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.09 10:42:26" (2/3) ... [2024-09-25 10:42:26,907 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@21edd667 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 25.09 10:42:26, skipping insertion in model container [2024-09-25 10:42:26,907 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 25.09 10:42:26" (3/3) ... [2024-09-25 10:42:26,908 INFO L112 eAbstractionObserver]: Analyzing ICFG ps6-ll.c [2024-09-25 10:42:26,924 INFO L209 ceAbstractionStarter]: Automizer settings: Hoare:All NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-09-25 10:42:26,925 INFO L149 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-09-25 10:42:26,986 INFO L335 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-09-25 10:42:26,994 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;@7954a2cf, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-09-25 10:42:26,994 INFO L337 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-09-25 10:42:26,998 INFO L276 IsEmpty]: Start isEmpty. Operand has 26 states, 14 states have (on average 1.4285714285714286) internal successors, (20), 15 states have internal predecessors, (20), 6 states have call successors, (6), 4 states have call predecessors, (6), 4 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2024-09-25 10:42:27,005 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2024-09-25 10:42:27,005 INFO L208 NwaCegarLoop]: Found error trace [2024-09-25 10:42:27,006 INFO L216 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-09-25 10:42:27,007 INFO L399 AbstractCegarLoop]: === Iteration 1 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-09-25 10:42:27,011 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-25 10:42:27,013 INFO L85 PathProgramCache]: Analyzing trace with hash 1238311395, now seen corresponding path program 1 times [2024-09-25 10:42:27,022 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-09-25 10:42:27,025 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2014909380] [2024-09-25 10:42:27,026 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-09-25 10:42:27,026 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-09-25 10:42:27,129 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-25 10:42:27,170 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2024-09-25 10:42:27,178 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-25 10:42:27,185 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-09-25 10:42:27,189 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-25 10:42:27,194 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 10:42:27,195 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-09-25 10:42:27,195 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2014909380] [2024-09-25 10:42:27,196 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2014909380] provided 1 perfect and 0 imperfect interpolant sequences [2024-09-25 10:42:27,196 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-09-25 10:42:27,196 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-09-25 10:42:27,198 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1003329882] [2024-09-25 10:42:27,199 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-09-25 10:42:27,202 INFO L551 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-09-25 10:42:27,203 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-09-25 10:42:27,220 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-09-25 10:42:27,221 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-09-25 10:42:27,222 INFO L87 Difference]: Start difference. First operand has 26 states, 14 states have (on average 1.4285714285714286) internal successors, (20), 15 states have internal predecessors, (20), 6 states have call successors, (6), 4 states have call predecessors, (6), 4 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) Second operand has 2 states, 2 states have (on average 5.0) internal successors, (10), 2 states have internal predecessors, (10), 2 states have call successors, (4), 2 states have call predecessors, (4), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) [2024-09-25 10:42:27,242 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-09-25 10:42:27,242 INFO L93 Difference]: Finished difference Result 44 states and 58 transitions. [2024-09-25 10:42:27,244 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-09-25 10:42:27,245 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 5.0) internal successors, (10), 2 states have internal predecessors, (10), 2 states have call successors, (4), 2 states have call predecessors, (4), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) Word has length 16 [2024-09-25 10:42:27,245 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-09-25 10:42:27,250 INFO L225 Difference]: With dead ends: 44 [2024-09-25 10:42:27,251 INFO L226 Difference]: Without dead ends: 22 [2024-09-25 10:42:27,253 INFO L433 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 7 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-09-25 10:42:27,256 INFO L434 NwaCegarLoop]: 26 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 2 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 26 SdHoareTripleChecker+Invalid, 2 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 2 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-09-25 10:42:27,257 INFO L435 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 26 Invalid, 2 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 2 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-09-25 10:42:27,269 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 22 states. [2024-09-25 10:42:27,283 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 22 to 22. [2024-09-25 10:42:27,285 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 22 states, 12 states have (on average 1.1666666666666667) internal successors, (14), 13 states have internal predecessors, (14), 6 states have call successors, (6), 4 states have call predecessors, (6), 3 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2024-09-25 10:42:27,286 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 22 states to 22 states and 24 transitions. [2024-09-25 10:42:27,287 INFO L78 Accepts]: Start accepts. Automaton has 22 states and 24 transitions. Word has length 16 [2024-09-25 10:42:27,288 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-09-25 10:42:27,288 INFO L474 AbstractCegarLoop]: Abstraction has 22 states and 24 transitions. [2024-09-25 10:42:27,288 INFO L475 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 5.0) internal successors, (10), 2 states have internal predecessors, (10), 2 states have call successors, (4), 2 states have call predecessors, (4), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) [2024-09-25 10:42:27,289 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-25 10:42:27,289 INFO L276 IsEmpty]: Start isEmpty. Operand 22 states and 24 transitions. [2024-09-25 10:42:27,289 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2024-09-25 10:42:27,290 INFO L208 NwaCegarLoop]: Found error trace [2024-09-25 10:42:27,290 INFO L216 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-09-25 10:42:27,290 WARN L456 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-09-25 10:42:27,290 INFO L399 AbstractCegarLoop]: === Iteration 2 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-09-25 10:42:27,291 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-25 10:42:27,291 INFO L85 PathProgramCache]: Analyzing trace with hash 1910922015, now seen corresponding path program 1 times [2024-09-25 10:42:27,291 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-09-25 10:42:27,291 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1844791121] [2024-09-25 10:42:27,292 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-09-25 10:42:27,292 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-09-25 10:42:27,330 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unknown [2024-09-25 10:42:27,337 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1935213570] [2024-09-25 10:42:27,337 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-09-25 10:42:27,337 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-09-25 10:42:27,337 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/certificate-witnesses-artifact/automizer/z3 [2024-09-25 10:42:27,346 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 10:42:27,354 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 10:42:27,427 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-25 10:42:27,432 INFO L262 TraceCheckSpWp]: Trace formula consists of 55 conjuncts, 7 conjuncts are in the unsatisfiable core [2024-09-25 10:42:27,442 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2024-09-25 10:42:27,541 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 10:42:27,541 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-09-25 10:42:27,541 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-09-25 10:42:27,541 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1844791121] [2024-09-25 10:42:27,542 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2024-09-25 10:42:27,542 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1935213570] [2024-09-25 10:42:27,542 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1935213570] provided 1 perfect and 0 imperfect interpolant sequences [2024-09-25 10:42:27,542 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-09-25 10:42:27,542 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-09-25 10:42:27,544 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [214810563] [2024-09-25 10:42:27,544 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-09-25 10:42:27,545 INFO L551 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-09-25 10:42:27,545 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-09-25 10:42:27,548 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-09-25 10:42:27,548 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-09-25 10:42:27,548 INFO L87 Difference]: Start difference. First operand 22 states and 24 transitions. Second operand has 5 states, 5 states have (on average 2.0) internal successors, (10), 4 states have internal predecessors, (10), 2 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2024-09-25 10:42:27,627 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-09-25 10:42:27,627 INFO L93 Difference]: Finished difference Result 33 states and 37 transitions. [2024-09-25 10:42:27,628 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-09-25 10:42:27,628 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 2.0) internal successors, (10), 4 states have internal predecessors, (10), 2 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) Word has length 16 [2024-09-25 10:42:27,628 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-09-25 10:42:27,629 INFO L225 Difference]: With dead ends: 33 [2024-09-25 10:42:27,630 INFO L226 Difference]: Without dead ends: 29 [2024-09-25 10:42:27,630 INFO L433 NwaCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 12 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2024-09-25 10:42:27,631 INFO L434 NwaCegarLoop]: 18 mSDtfsCounter, 4 mSDsluCounter, 51 mSDsCounter, 0 mSdLazyCounter, 26 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 6 SdHoareTripleChecker+Valid, 69 SdHoareTripleChecker+Invalid, 28 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 26 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-09-25 10:42:27,633 INFO L435 NwaCegarLoop]: SdHoareTripleChecker [6 Valid, 69 Invalid, 28 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 26 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-09-25 10:42:27,634 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 29 states. [2024-09-25 10:42:27,641 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 29 to 29. [2024-09-25 10:42:27,644 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 29 states, 17 states have (on average 1.1176470588235294) internal successors, (19), 18 states have internal predecessors, (19), 7 states have call successors, (7), 5 states have call predecessors, (7), 4 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) [2024-09-25 10:42:27,645 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 29 states to 29 states and 31 transitions. [2024-09-25 10:42:27,645 INFO L78 Accepts]: Start accepts. Automaton has 29 states and 31 transitions. Word has length 16 [2024-09-25 10:42:27,645 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-09-25 10:42:27,646 INFO L474 AbstractCegarLoop]: Abstraction has 29 states and 31 transitions. [2024-09-25 10:42:27,646 INFO L475 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 2.0) internal successors, (10), 4 states have internal predecessors, (10), 2 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2024-09-25 10:42:27,646 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-25 10:42:27,646 INFO L276 IsEmpty]: Start isEmpty. Operand 29 states and 31 transitions. [2024-09-25 10:42:27,647 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2024-09-25 10:42:27,647 INFO L208 NwaCegarLoop]: Found error trace [2024-09-25 10:42:27,647 INFO L216 NwaCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-09-25 10:42:27,665 INFO L540 MonitoredProcess]: [MP /storage/repos/certificate-witnesses-artifact/automizer/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2024-09-25 10:42:27,847 WARN L456 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1,2 /storage/repos/certificate-witnesses-artifact/automizer/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-09-25 10:42:27,848 INFO L399 AbstractCegarLoop]: === Iteration 3 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-09-25 10:42:27,848 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-25 10:42:27,849 INFO L85 PathProgramCache]: Analyzing trace with hash 306700420, now seen corresponding path program 1 times [2024-09-25 10:42:27,849 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-09-25 10:42:27,849 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2051173141] [2024-09-25 10:42:27,849 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-09-25 10:42:27,849 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-09-25 10:42:27,883 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unknown [2024-09-25 10:42:27,889 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [467570152] [2024-09-25 10:42:27,889 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-09-25 10:42:27,889 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-09-25 10:42:27,889 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/certificate-witnesses-artifact/automizer/z3 [2024-09-25 10:42:27,892 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 10:42:27,894 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 10:42:27,948 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-25 10:42:27,949 INFO L262 TraceCheckSpWp]: Trace formula consists of 72 conjuncts, 11 conjuncts are in the unsatisfiable core [2024-09-25 10:42:27,951 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2024-09-25 10:42:28,035 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 2 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-09-25 10:42:28,036 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2024-09-25 10:42:28,145 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2024-09-25 10:42:28,145 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-09-25 10:42:28,146 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2051173141] [2024-09-25 10:42:28,146 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2024-09-25 10:42:28,146 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [467570152] [2024-09-25 10:42:28,146 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [467570152] provided 1 perfect and 1 imperfect interpolant sequences [2024-09-25 10:42:28,146 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-09-25 10:42:28,146 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [6] total 7 [2024-09-25 10:42:28,147 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1845364270] [2024-09-25 10:42:28,147 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-09-25 10:42:28,147 INFO L551 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-09-25 10:42:28,147 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-09-25 10:42:28,148 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-09-25 10:42:28,148 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2024-09-25 10:42:28,150 INFO L87 Difference]: Start difference. First operand 29 states and 31 transitions. Second operand has 5 states, 5 states have (on average 2.8) internal successors, (14), 4 states have internal predecessors, (14), 2 states have call successors, (5), 2 states have call predecessors, (5), 1 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2024-09-25 10:42:28,211 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-09-25 10:42:28,211 INFO L93 Difference]: Finished difference Result 35 states and 36 transitions. [2024-09-25 10:42:28,212 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-09-25 10:42:28,212 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 2.8) internal successors, (14), 4 states have internal predecessors, (14), 2 states have call successors, (5), 2 states have call predecessors, (5), 1 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) Word has length 23 [2024-09-25 10:42:28,212 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-09-25 10:42:28,213 INFO L225 Difference]: With dead ends: 35 [2024-09-25 10:42:28,213 INFO L226 Difference]: Without dead ends: 31 [2024-09-25 10:42:28,214 INFO L433 NwaCegarLoop]: 0 DeclaredPredicates, 46 GetRequests, 38 SyntacticMatches, 2 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2024-09-25 10:42:28,215 INFO L434 NwaCegarLoop]: 18 mSDtfsCounter, 4 mSDsluCounter, 47 mSDsCounter, 0 mSdLazyCounter, 23 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 5 SdHoareTripleChecker+Valid, 65 SdHoareTripleChecker+Invalid, 24 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 23 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-09-25 10:42:28,215 INFO L435 NwaCegarLoop]: SdHoareTripleChecker [5 Valid, 65 Invalid, 24 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 23 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-09-25 10:42:28,216 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 31 states. [2024-09-25 10:42:28,229 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 31 to 31. [2024-09-25 10:42:28,231 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 31 states, 19 states have (on average 1.0526315789473684) internal successors, (20), 19 states have internal predecessors, (20), 7 states have call successors, (7), 6 states have call predecessors, (7), 4 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) [2024-09-25 10:42:28,231 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 31 states to 31 states and 32 transitions. [2024-09-25 10:42:28,232 INFO L78 Accepts]: Start accepts. Automaton has 31 states and 32 transitions. Word has length 23 [2024-09-25 10:42:28,233 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-09-25 10:42:28,233 INFO L474 AbstractCegarLoop]: Abstraction has 31 states and 32 transitions. [2024-09-25 10:42:28,233 INFO L475 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 2.8) internal successors, (14), 4 states have internal predecessors, (14), 2 states have call successors, (5), 2 states have call predecessors, (5), 1 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2024-09-25 10:42:28,234 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-25 10:42:28,234 INFO L276 IsEmpty]: Start isEmpty. Operand 31 states and 32 transitions. [2024-09-25 10:42:28,235 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2024-09-25 10:42:28,235 INFO L208 NwaCegarLoop]: Found error trace [2024-09-25 10:42:28,236 INFO L216 NwaCegarLoop]: trace histogram [4, 3, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-09-25 10:42:28,251 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 10:42:28,436 WARN L456 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2,3 /storage/repos/certificate-witnesses-artifact/automizer/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-09-25 10:42:28,437 INFO L399 AbstractCegarLoop]: === Iteration 4 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-09-25 10:42:28,437 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-25 10:42:28,437 INFO L85 PathProgramCache]: Analyzing trace with hash 1375311536, now seen corresponding path program 1 times [2024-09-25 10:42:28,438 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-09-25 10:42:28,438 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [801376349] [2024-09-25 10:42:28,438 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-09-25 10:42:28,438 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-09-25 10:42:28,472 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unknown [2024-09-25 10:42:28,474 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1703509839] [2024-09-25 10:42:28,474 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-09-25 10:42:28,474 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-09-25 10:42:28,474 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/certificate-witnesses-artifact/automizer/z3 [2024-09-25 10:42:28,477 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 10:42:28,479 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 10:42:28,528 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-25 10:42:28,529 INFO L262 TraceCheckSpWp]: Trace formula consists of 91 conjuncts, 12 conjuncts are in the unsatisfiable core [2024-09-25 10:42:28,531 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2024-09-25 10:42:28,621 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 6 proven. 3 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2024-09-25 10:42:28,622 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2024-09-25 10:42:28,756 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 6 proven. 3 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2024-09-25 10:42:28,757 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-09-25 10:42:28,757 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [801376349] [2024-09-25 10:42:28,757 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2024-09-25 10:42:28,757 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1703509839] [2024-09-25 10:42:28,757 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1703509839] provided 0 perfect and 2 imperfect interpolant sequences [2024-09-25 10:42:28,757 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-09-25 10:42:28,758 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7] total 10 [2024-09-25 10:42:28,758 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1172866322] [2024-09-25 10:42:28,758 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-09-25 10:42:28,759 INFO L551 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-09-25 10:42:28,761 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-09-25 10:42:28,762 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-09-25 10:42:28,762 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=66, Unknown=0, NotChecked=0, Total=90 [2024-09-25 10:42:28,762 INFO L87 Difference]: Start difference. First operand 31 states and 32 transitions. Second operand has 10 states, 8 states have (on average 2.625) internal successors, (21), 9 states have internal predecessors, (21), 7 states have call successors, (11), 2 states have call predecessors, (11), 1 states have return successors, (8), 7 states have call predecessors, (8), 7 states have call successors, (8) [2024-09-25 10:42:28,892 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-09-25 10:42:28,893 INFO L93 Difference]: Finished difference Result 48 states and 56 transitions. [2024-09-25 10:42:28,893 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-09-25 10:42:28,894 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 8 states have (on average 2.625) internal successors, (21), 9 states have internal predecessors, (21), 7 states have call successors, (11), 2 states have call predecessors, (11), 1 states have return successors, (8), 7 states have call predecessors, (8), 7 states have call successors, (8) Word has length 34 [2024-09-25 10:42:28,894 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-09-25 10:42:28,895 INFO L225 Difference]: With dead ends: 48 [2024-09-25 10:42:28,895 INFO L226 Difference]: Without dead ends: 40 [2024-09-25 10:42:28,895 INFO L433 NwaCegarLoop]: 0 DeclaredPredicates, 70 GetRequests, 57 SyntacticMatches, 2 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=39, Invalid=117, Unknown=0, NotChecked=0, Total=156 [2024-09-25 10:42:28,897 INFO L434 NwaCegarLoop]: 24 mSDtfsCounter, 1 mSDsluCounter, 117 mSDsCounter, 0 mSdLazyCounter, 57 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 141 SdHoareTripleChecker+Invalid, 59 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 57 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-09-25 10:42:28,898 INFO L435 NwaCegarLoop]: SdHoareTripleChecker [1 Valid, 141 Invalid, 59 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 57 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-09-25 10:42:28,899 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 40 states. [2024-09-25 10:42:28,918 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 40 to 40. [2024-09-25 10:42:28,918 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 40 states, 25 states have (on average 1.04) internal successors, (26), 25 states have internal predecessors, (26), 10 states have call successors, (10), 6 states have call predecessors, (10), 4 states have return successors, (8), 8 states have call predecessors, (8), 8 states have call successors, (8) [2024-09-25 10:42:28,919 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 40 states to 40 states and 44 transitions. [2024-09-25 10:42:28,919 INFO L78 Accepts]: Start accepts. Automaton has 40 states and 44 transitions. Word has length 34 [2024-09-25 10:42:28,919 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-09-25 10:42:28,919 INFO L474 AbstractCegarLoop]: Abstraction has 40 states and 44 transitions. [2024-09-25 10:42:28,920 INFO L475 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 8 states have (on average 2.625) internal successors, (21), 9 states have internal predecessors, (21), 7 states have call successors, (11), 2 states have call predecessors, (11), 1 states have return successors, (8), 7 states have call predecessors, (8), 7 states have call successors, (8) [2024-09-25 10:42:28,920 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-25 10:42:28,920 INFO L276 IsEmpty]: Start isEmpty. Operand 40 states and 44 transitions. [2024-09-25 10:42:28,921 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 56 [2024-09-25 10:42:28,921 INFO L208 NwaCegarLoop]: Found error trace [2024-09-25 10:42:28,921 INFO L216 NwaCegarLoop]: trace histogram [7, 6, 6, 5, 5, 5, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-09-25 10:42:28,938 INFO L552 MonitoredProcess]: [MP /storage/repos/certificate-witnesses-artifact/automizer/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Ended with exit code 0 [2024-09-25 10:42:29,122 WARN L456 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3,4 /storage/repos/certificate-witnesses-artifact/automizer/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-09-25 10:42:29,122 INFO L399 AbstractCegarLoop]: === Iteration 5 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-09-25 10:42:29,123 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-25 10:42:29,123 INFO L85 PathProgramCache]: Analyzing trace with hash -1108147083, now seen corresponding path program 2 times [2024-09-25 10:42:29,123 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-09-25 10:42:29,123 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1775024273] [2024-09-25 10:42:29,124 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-09-25 10:42:29,124 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-09-25 10:42:29,168 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unknown [2024-09-25 10:42:29,171 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1954970943] [2024-09-25 10:42:29,171 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2024-09-25 10:42:29,171 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-09-25 10:42:29,171 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/certificate-witnesses-artifact/automizer/z3 [2024-09-25 10:42:29,176 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 10:42:29,177 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 10:42:29,232 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2024-09-25 10:42:29,232 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2024-09-25 10:42:29,233 INFO L262 TraceCheckSpWp]: Trace formula consists of 142 conjuncts, 32 conjuncts are in the unsatisfiable core [2024-09-25 10:42:29,236 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2024-09-25 10:42:29,535 INFO L134 CoverageAnalysis]: Checked inductivity of 102 backedges. 12 proven. 30 refuted. 0 times theorem prover too weak. 60 trivial. 0 not checked. [2024-09-25 10:42:29,536 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2024-09-25 10:42:29,876 INFO L134 CoverageAnalysis]: Checked inductivity of 102 backedges. 12 proven. 30 refuted. 0 times theorem prover too weak. 60 trivial. 0 not checked. [2024-09-25 10:42:29,876 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-09-25 10:42:29,877 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1775024273] [2024-09-25 10:42:29,877 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2024-09-25 10:42:29,877 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1954970943] [2024-09-25 10:42:29,877 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1954970943] provided 0 perfect and 2 imperfect interpolant sequences [2024-09-25 10:42:29,877 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-09-25 10:42:29,877 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 10] total 21 [2024-09-25 10:42:29,877 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1164897030] [2024-09-25 10:42:29,877 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-09-25 10:42:29,878 INFO L551 AbstractCegarLoop]: INTERPOLANT automaton has 21 states [2024-09-25 10:42:29,878 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-09-25 10:42:29,879 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2024-09-25 10:42:29,879 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=69, Invalid=351, Unknown=0, NotChecked=0, Total=420 [2024-09-25 10:42:29,884 INFO L87 Difference]: Start difference. First operand 40 states and 44 transitions. Second operand has 21 states, 19 states have (on average 2.0) internal successors, (38), 18 states have internal predecessors, (38), 13 states have call successors, (17), 3 states have call predecessors, (17), 2 states have return successors, (15), 14 states have call predecessors, (15), 13 states have call successors, (15) [2024-09-25 10:42:30,405 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-09-25 10:42:30,405 INFO L93 Difference]: Finished difference Result 63 states and 78 transitions. [2024-09-25 10:42:30,406 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2024-09-25 10:42:30,406 INFO L78 Accepts]: Start accepts. Automaton has has 21 states, 19 states have (on average 2.0) internal successors, (38), 18 states have internal predecessors, (38), 13 states have call successors, (17), 3 states have call predecessors, (17), 2 states have return successors, (15), 14 states have call predecessors, (15), 13 states have call successors, (15) Word has length 55 [2024-09-25 10:42:30,407 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-09-25 10:42:30,407 INFO L225 Difference]: With dead ends: 63 [2024-09-25 10:42:30,407 INFO L226 Difference]: Without dead ends: 55 [2024-09-25 10:42:30,408 INFO L433 NwaCegarLoop]: 0 DeclaredPredicates, 119 GetRequests, 90 SyntacticMatches, 0 SemanticMatches, 29 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 133 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=169, Invalid=761, Unknown=0, NotChecked=0, Total=930 [2024-09-25 10:42:30,411 INFO L434 NwaCegarLoop]: 31 mSDtfsCounter, 18 mSDsluCounter, 274 mSDsCounter, 0 mSdLazyCounter, 181 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 20 SdHoareTripleChecker+Valid, 305 SdHoareTripleChecker+Invalid, 188 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 181 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-09-25 10:42:30,412 INFO L435 NwaCegarLoop]: SdHoareTripleChecker [20 Valid, 305 Invalid, 188 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 181 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-09-25 10:42:30,413 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 55 states. [2024-09-25 10:42:30,448 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 55 to 55. [2024-09-25 10:42:30,448 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 55 states, 35 states have (on average 1.0285714285714285) internal successors, (36), 35 states have internal predecessors, (36), 15 states have call successors, (15), 6 states have call predecessors, (15), 4 states have return successors, (13), 13 states have call predecessors, (13), 13 states have call successors, (13) [2024-09-25 10:42:30,450 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 55 states to 55 states and 64 transitions. [2024-09-25 10:42:30,450 INFO L78 Accepts]: Start accepts. Automaton has 55 states and 64 transitions. Word has length 55 [2024-09-25 10:42:30,450 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-09-25 10:42:30,450 INFO L474 AbstractCegarLoop]: Abstraction has 55 states and 64 transitions. [2024-09-25 10:42:30,451 INFO L475 AbstractCegarLoop]: INTERPOLANT automaton has has 21 states, 19 states have (on average 2.0) internal successors, (38), 18 states have internal predecessors, (38), 13 states have call successors, (17), 3 states have call predecessors, (17), 2 states have return successors, (15), 14 states have call predecessors, (15), 13 states have call successors, (15) [2024-09-25 10:42:30,451 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-25 10:42:30,451 INFO L276 IsEmpty]: Start isEmpty. Operand 55 states and 64 transitions. [2024-09-25 10:42:30,456 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 91 [2024-09-25 10:42:30,456 INFO L208 NwaCegarLoop]: Found error trace [2024-09-25 10:42:30,456 INFO L216 NwaCegarLoop]: trace histogram [12, 11, 11, 10, 10, 10, 9, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-09-25 10:42:30,475 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 10:42:30,660 WARN L456 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4,5 /storage/repos/certificate-witnesses-artifact/automizer/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-09-25 10:42:30,661 INFO L399 AbstractCegarLoop]: === Iteration 6 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-09-25 10:42:30,661 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-25 10:42:30,662 INFO L85 PathProgramCache]: Analyzing trace with hash 639998000, now seen corresponding path program 3 times [2024-09-25 10:42:30,662 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-09-25 10:42:30,662 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1965323373] [2024-09-25 10:42:30,662 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-09-25 10:42:30,662 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-09-25 10:42:30,729 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unknown [2024-09-25 10:42:30,732 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1589317128] [2024-09-25 10:42:30,733 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2024-09-25 10:42:30,733 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-09-25 10:42:30,733 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/certificate-witnesses-artifact/automizer/z3 [2024-09-25 10:42:30,736 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 10:42:30,737 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 10:42:30,858 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 10 check-sat command(s) [2024-09-25 10:42:30,858 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2024-09-25 10:42:30,860 INFO L262 TraceCheckSpWp]: Trace formula consists of 227 conjuncts, 54 conjuncts are in the unsatisfiable core [2024-09-25 10:42:30,863 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2024-09-25 10:42:31,172 INFO L134 CoverageAnalysis]: Checked inductivity of 377 backedges. 30 proven. 157 refuted. 0 times theorem prover too weak. 190 trivial. 0 not checked. [2024-09-25 10:42:31,173 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2024-09-25 10:42:39,596 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse0 (* c_main_~y~0 c_main_~y~0))) (or (= (+ (* 6 c_main_~y~0) .cse0) (+ (* 6 c_main_~c~0) (* c_main_~c~0 c_main_~y~0))) (not (= (mod (+ (* 10 c_main_~y~0 c_main_~y~0 c_main_~y~0 c_main_~y~0 c_main_~y~0 c_main_~y~0) (* 7 c_main_~y~0 c_main_~y~0 c_main_~y~0 c_main_~y~0) (* 6 c_main_~y~0 c_main_~y~0 c_main_~y~0 c_main_~y~0 c_main_~y~0) .cse0) 12) 0)))) is different from false [2024-09-25 10:42:47,884 WARN L293 SmtUtils]: Spent 8.01s on a formula simplification that was a NOOP. DAG size: 4 (called from [L 731] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2024-09-25 10:42:55,896 WARN L293 SmtUtils]: Spent 8.01s on a formula simplification that was a NOOP. DAG size: 4 (called from [L 731] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2024-09-25 10:43:11,929 WARN L293 SmtUtils]: Spent 8.01s on a formula simplification that was a NOOP. DAG size: 10 (called from [L 731] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2024-09-25 10:43:19,945 WARN L876 $PredicateComparison]: unable to prove that (or (not (= |c___VERIFIER_assert_#in~cond| 0)) (forall ((v_main_~y~0_BEFORE_CALL_44 Int) (v_main_~c~0_BEFORE_CALL_31 Int)) (let ((.cse0 (* v_main_~y~0_BEFORE_CALL_44 v_main_~y~0_BEFORE_CALL_44))) (or (= (+ (* v_main_~y~0_BEFORE_CALL_44 v_main_~c~0_BEFORE_CALL_31) (* 6 v_main_~c~0_BEFORE_CALL_31)) (+ (* v_main_~y~0_BEFORE_CALL_44 6) .cse0)) (= 0 (mod (+ (* v_main_~y~0_BEFORE_CALL_44 v_main_~y~0_BEFORE_CALL_44 v_main_~y~0_BEFORE_CALL_44 v_main_~y~0_BEFORE_CALL_44 v_main_~y~0_BEFORE_CALL_44 v_main_~y~0_BEFORE_CALL_44 10) (* 7 v_main_~y~0_BEFORE_CALL_44 v_main_~y~0_BEFORE_CALL_44 v_main_~y~0_BEFORE_CALL_44 v_main_~y~0_BEFORE_CALL_44) .cse0 (* v_main_~y~0_BEFORE_CALL_44 v_main_~y~0_BEFORE_CALL_44 v_main_~y~0_BEFORE_CALL_44 v_main_~y~0_BEFORE_CALL_44 v_main_~y~0_BEFORE_CALL_44 6)) 12)))))) is different from true [2024-09-25 10:43:31,983 WARN L293 SmtUtils]: Spent 8.00s on a formula simplification that was a NOOP. DAG size: 10 (called from [L 731] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2024-09-25 10:43:48,019 WARN L293 SmtUtils]: Spent 8.01s on a formula simplification that was a NOOP. DAG size: 10 (called from [L 731] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2024-09-25 10:43:56,034 WARN L876 $PredicateComparison]: unable to prove that (or (not (= |c___VERIFIER_assert_#in~cond| 0)) (forall ((v_main_~y~0_BEFORE_CALL_44 Int) (v_main_~c~0_BEFORE_CALL_31 Int)) (let ((.cse0 (* v_main_~y~0_BEFORE_CALL_44 v_main_~y~0_BEFORE_CALL_44))) (or (= (+ (* v_main_~y~0_BEFORE_CALL_44 v_main_~c~0_BEFORE_CALL_31) (* 6 v_main_~c~0_BEFORE_CALL_31)) (+ (* v_main_~y~0_BEFORE_CALL_44 6) .cse0)) (= 0 (mod (+ (* v_main_~y~0_BEFORE_CALL_44 v_main_~y~0_BEFORE_CALL_44 v_main_~y~0_BEFORE_CALL_44 v_main_~y~0_BEFORE_CALL_44 v_main_~y~0_BEFORE_CALL_44 v_main_~y~0_BEFORE_CALL_44 10) (* 7 v_main_~y~0_BEFORE_CALL_44 v_main_~y~0_BEFORE_CALL_44 v_main_~y~0_BEFORE_CALL_44 v_main_~y~0_BEFORE_CALL_44) .cse0 (* v_main_~y~0_BEFORE_CALL_44 v_main_~y~0_BEFORE_CALL_44 v_main_~y~0_BEFORE_CALL_44 v_main_~y~0_BEFORE_CALL_44 v_main_~y~0_BEFORE_CALL_44 6)) 12))))) (= c___VERIFIER_assert_~cond 0)) is different from true [2024-09-25 10:44:08,174 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse0 (* c_main_~y~0 c_main_~y~0))) (or (= (+ (* 7 c_main_~c~0) (* c_main_~c~0 c_main_~y~0)) (+ (* 7 c_main_~y~0) .cse0)) (not (= (mod (+ (* 10 c_main_~y~0 c_main_~y~0 c_main_~y~0 c_main_~y~0 c_main_~y~0 c_main_~y~0) (* 7 c_main_~y~0 c_main_~y~0 c_main_~y~0 c_main_~y~0) (* 6 c_main_~y~0 c_main_~y~0 c_main_~y~0 c_main_~y~0 c_main_~y~0) .cse0) 12) 0)))) is different from false [2024-09-25 10:44:24,232 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse0 (* c_main_~y~0 c_main_~y~0))) (or (= (+ (* 8 c_main_~y~0) .cse0) (+ (* c_main_~c~0 8) (* c_main_~c~0 c_main_~y~0))) (not (= (mod (+ (* 10 c_main_~y~0 c_main_~y~0 c_main_~y~0 c_main_~y~0 c_main_~y~0 c_main_~y~0) (* 7 c_main_~y~0 c_main_~y~0 c_main_~y~0 c_main_~y~0) (* 6 c_main_~y~0 c_main_~y~0 c_main_~y~0 c_main_~y~0 c_main_~y~0) .cse0) 12) 0)))) is different from false [2024-09-25 10:44:40,291 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse0 (* c_main_~y~0 c_main_~y~0))) (or (= (+ (* 9 c_main_~y~0) .cse0) (+ (* c_main_~c~0 c_main_~y~0) (* 9 c_main_~c~0))) (not (= (mod (+ (* 10 c_main_~y~0 c_main_~y~0 c_main_~y~0 c_main_~y~0 c_main_~y~0 c_main_~y~0) (* 7 c_main_~y~0 c_main_~y~0 c_main_~y~0 c_main_~y~0) (* 6 c_main_~y~0 c_main_~y~0 c_main_~y~0 c_main_~y~0 c_main_~y~0) .cse0) 12) 0)))) is different from false [2024-09-25 10:44:48,791 INFO L134 CoverageAnalysis]: Checked inductivity of 377 backedges. 30 proven. 51 refuted. 21 times theorem prover too weak. 190 trivial. 85 not checked. [2024-09-25 10:44:48,791 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-09-25 10:44:48,791 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1965323373] [2024-09-25 10:44:48,792 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2024-09-25 10:44:48,792 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1589317128] [2024-09-25 10:44:48,792 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1589317128] provided 0 perfect and 2 imperfect interpolant sequences [2024-09-25 10:44:48,792 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-09-25 10:44:48,792 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [17, 18] total 32 [2024-09-25 10:44:48,792 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [593807060] [2024-09-25 10:44:48,792 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-09-25 10:44:48,793 INFO L551 AbstractCegarLoop]: INTERPOLANT automaton has 32 states [2024-09-25 10:44:48,793 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-09-25 10:44:48,794 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 32 interpolants. [2024-09-25 10:44:48,795 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=123, Invalid=545, Unknown=6, NotChecked=318, Total=992 [2024-09-25 10:44:48,795 INFO L87 Difference]: Start difference. First operand 55 states and 64 transitions. Second operand has 32 states, 30 states have (on average 2.033333333333333) internal successors, (61), 30 states have internal predecessors, (61), 23 states have call successors, (27), 3 states have call predecessors, (27), 3 states have return successors, (24), 23 states have call predecessors, (24), 23 states have call successors, (24) [2024-09-25 10:44:49,431 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-09-25 10:44:49,432 INFO L93 Difference]: Finished difference Result 60 states and 72 transitions. [2024-09-25 10:44:49,432 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2024-09-25 10:44:49,433 INFO L78 Accepts]: Start accepts. Automaton has has 32 states, 30 states have (on average 2.033333333333333) internal successors, (61), 30 states have internal predecessors, (61), 23 states have call successors, (27), 3 states have call predecessors, (27), 3 states have return successors, (24), 23 states have call predecessors, (24), 23 states have call successors, (24) Word has length 90 [2024-09-25 10:44:49,433 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-09-25 10:44:49,434 INFO L225 Difference]: With dead ends: 60 [2024-09-25 10:44:49,434 INFO L226 Difference]: Without dead ends: 0 [2024-09-25 10:44:49,436 INFO L433 NwaCegarLoop]: 0 DeclaredPredicates, 194 GetRequests, 149 SyntacticMatches, 4 SemanticMatches, 41 ConstructedPredicates, 6 IntricatePredicates, 0 DeprecatedPredicates, 99 ImplicationChecksByTransitivity, 25.0s TimeCoverageRelationStatistics Valid=239, Invalid=1111, Unknown=6, NotChecked=450, Total=1806 [2024-09-25 10:44:49,437 INFO L434 NwaCegarLoop]: 34 mSDtfsCounter, 3 mSDsluCounter, 475 mSDsCounter, 0 mSdLazyCounter, 456 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3 SdHoareTripleChecker+Valid, 509 SdHoareTripleChecker+Invalid, 753 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 456 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 291 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2024-09-25 10:44:49,437 INFO L435 NwaCegarLoop]: SdHoareTripleChecker [3 Valid, 509 Invalid, 753 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 456 Invalid, 0 Unknown, 291 Unchecked, 0.3s Time] [2024-09-25 10:44:49,439 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2024-09-25 10:44:49,439 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2024-09-25 10:44:49,439 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 10:44:49,440 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2024-09-25 10:44:49,440 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 90 [2024-09-25 10:44:49,440 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-09-25 10:44:49,440 INFO L474 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2024-09-25 10:44:49,441 INFO L475 AbstractCegarLoop]: INTERPOLANT automaton has has 32 states, 30 states have (on average 2.033333333333333) internal successors, (61), 30 states have internal predecessors, (61), 23 states have call successors, (27), 3 states have call predecessors, (27), 3 states have return successors, (24), 23 states have call predecessors, (24), 23 states have call successors, (24) [2024-09-25 10:44:49,443 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-25 10:44:49,443 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2024-09-25 10:44:49,443 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2024-09-25 10:44:49,446 INFO L785 garLoopResultBuilder]: Registering result SAFE for location __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2024-09-25 10:44:49,464 INFO L552 MonitoredProcess]: [MP /storage/repos/certificate-witnesses-artifact/automizer/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Ended with exit code 0 [2024-09-25 10:44:49,646 WARN L456 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 /storage/repos/certificate-witnesses-artifact/automizer/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable5 [2024-09-25 10:44:49,650 INFO L408 BasicCegarLoop]: Path program histogram: [3, 1, 1, 1] [2024-09-25 10:44:49,652 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2024-09-25 10:44:50,184 INFO L165 ceAbstractionStarter]: Computing trace abstraction results [2024-09-25 10:44:50,213 WARN L953 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: #length [2024-09-25 10:44:50,214 WARN L953 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: #length [2024-09-25 10:44:50,214 WARN L953 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: #StackHeapBarrier [2024-09-25 10:44:50,214 WARN L953 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: #StackHeapBarrier [2024-09-25 10:44:50,214 WARN L953 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: #memory_int#0 [2024-09-25 10:44:50,214 WARN L953 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: #memory_int#0 [2024-09-25 10:44:50,215 WARN L953 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: #valid [2024-09-25 10:44:50,215 WARN L953 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: #valid [2024-09-25 10:44:50,218 WARN L953 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: #length [2024-09-25 10:44:50,218 WARN L953 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: #length [2024-09-25 10:44:50,219 WARN L953 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: #StackHeapBarrier [2024-09-25 10:44:50,219 WARN L953 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: #StackHeapBarrier [2024-09-25 10:44:50,219 WARN L953 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: #memory_int#0 [2024-09-25 10:44:50,219 WARN L953 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: #memory_int#0 [2024-09-25 10:44:50,219 WARN L953 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: #valid [2024-09-25 10:44:50,219 WARN L953 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: #valid [2024-09-25 10:44:50,220 WARN L953 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: #length [2024-09-25 10:44:50,222 WARN L953 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: #length [2024-09-25 10:44:50,222 WARN L953 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: #StackHeapBarrier [2024-09-25 10:44:50,223 WARN L953 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: #StackHeapBarrier [2024-09-25 10:44:50,223 WARN L953 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: #memory_int#0 [2024-09-25 10:44:50,223 WARN L953 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: #memory_int#0 [2024-09-25 10:44:50,223 WARN L953 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: #valid [2024-09-25 10:44:50,223 WARN L953 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: #valid [2024-09-25 10:44:50,223 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 25.09 10:44:50 BoogieIcfgContainer [2024-09-25 10:44:50,223 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2024-09-25 10:44:50,224 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2024-09-25 10:44:50,224 INFO L270 PluginConnector]: Initializing Witness Printer... [2024-09-25 10:44:50,224 INFO L274 PluginConnector]: Witness Printer initialized [2024-09-25 10:44:50,225 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 25.09 10:42:26" (3/4) ... [2024-09-25 10:44:50,227 INFO L139 WitnessPrinter]: Generating witness for correct program [2024-09-25 10:44:50,276 INFO L149 WitnessManager]: Wrote witness to /storage/repos/certificate-witnesses-artifact/automizer/witness.yml [2024-09-25 10:44:50,279 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2024-09-25 10:44:50,280 INFO L158 Benchmark]: Toolchain (without parser) took 144063.32ms. Allocated memory was 56.6MB in the beginning and 100.7MB in the end (delta: 44.0MB). Free memory was 25.5MB in the beginning and 25.0MB in the end (delta: 464.7kB). Peak memory consumption was 45.6MB. Max. memory is 16.1GB. [2024-09-25 10:44:50,280 INFO L158 Benchmark]: CDTParser took 0.12ms. Allocated memory is still 44.0MB. Free memory was 20.4MB in the beginning and 20.4MB in the end (delta: 42.0kB). There was no memory consumed. Max. memory is 16.1GB. [2024-09-25 10:44:50,280 INFO L158 Benchmark]: CACSL2BoogieTranslator took 267.82ms. Allocated memory is still 56.6MB. Free memory was 25.3MB in the beginning and 27.8MB in the end (delta: -2.4MB). Peak memory consumption was 2.4MB. Max. memory is 16.1GB. [2024-09-25 10:44:50,281 INFO L158 Benchmark]: Boogie Procedure Inliner took 18.98ms. Allocated memory is still 56.6MB. Free memory was 27.8MB in the beginning and 26.7MB in the end (delta: 1.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2024-09-25 10:44:50,281 INFO L158 Benchmark]: Boogie Preprocessor took 42.75ms. Allocated memory is still 56.6MB. Free memory was 26.7MB in the beginning and 25.0MB in the end (delta: 1.7MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2024-09-25 10:44:50,281 INFO L158 Benchmark]: RCFGBuilder took 347.41ms. Allocated memory was 56.6MB in the beginning and 69.2MB in the end (delta: 12.6MB). Free memory was 25.0MB in the beginning and 40.8MB in the end (delta: -15.8MB). Peak memory consumption was 6.3MB. Max. memory is 16.1GB. [2024-09-25 10:44:50,282 INFO L158 Benchmark]: TraceAbstraction took 143323.77ms. Allocated memory was 69.2MB in the beginning and 100.7MB in the end (delta: 31.5MB). Free memory was 40.2MB in the beginning and 27.1MB in the end (delta: 13.1MB). Peak memory consumption was 48.2MB. Max. memory is 16.1GB. [2024-09-25 10:44:50,282 INFO L158 Benchmark]: Witness Printer took 55.33ms. Allocated memory is still 100.7MB. Free memory was 27.1MB in the beginning and 25.0MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2024-09-25 10:44:50,284 INFO L338 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.12ms. Allocated memory is still 44.0MB. Free memory was 20.4MB in the beginning and 20.4MB in the end (delta: 42.0kB). There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 267.82ms. Allocated memory is still 56.6MB. Free memory was 25.3MB in the beginning and 27.8MB in the end (delta: -2.4MB). Peak memory consumption was 2.4MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 18.98ms. Allocated memory is still 56.6MB. Free memory was 27.8MB in the beginning and 26.7MB in the end (delta: 1.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * Boogie Preprocessor took 42.75ms. Allocated memory is still 56.6MB. Free memory was 26.7MB in the beginning and 25.0MB in the end (delta: 1.7MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * RCFGBuilder took 347.41ms. Allocated memory was 56.6MB in the beginning and 69.2MB in the end (delta: 12.6MB). Free memory was 25.0MB in the beginning and 40.8MB in the end (delta: -15.8MB). Peak memory consumption was 6.3MB. Max. memory is 16.1GB. * TraceAbstraction took 143323.77ms. Allocated memory was 69.2MB in the beginning and 100.7MB in the end (delta: 31.5MB). Free memory was 40.2MB in the beginning and 27.1MB in the end (delta: 13.1MB). Peak memory consumption was 48.2MB. Max. memory is 16.1GB. * Witness Printer took 55.33ms. Allocated memory is still 100.7MB. Free memory was 27.1MB in the beginning and 25.0MB 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: 12]: 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: 142.7s, OverallIterations: 6, TraceHistogramMax: 12, PathProgramHistogramMax: 3, EmptinessCheckTime: 0.0s, AutomataDifference: 1.5s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 35 SdHoareTripleChecker+Valid, 0.6s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 30 mSDsluCounter, 1115 SdHoareTripleChecker+Invalid, 0.5s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 291 IncrementalHoareTripleChecker+Unchecked, 964 mSDsCounter, 18 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 745 IncrementalHoareTripleChecker+Invalid, 1054 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 18 mSolverCounterUnsat, 151 mSDtfsCounter, 745 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 452 GetRequests, 353 SyntacticMatches, 8 SemanticMatches, 91 ConstructedPredicates, 6 IntricatePredicates, 0 DeprecatedPredicates, 237 ImplicationChecksByTransitivity, 25.7s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=55occurred in iteration=5, InterpolantAutomatonStates: 59, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.1s AutomataMinimizationTime, 6 MinimizatonAttempts, 0 StatesRemovedByMinimization, 0 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.4s SatisfiabilityAnalysisTime, 139.2s InterpolantComputationTime, 452 NumberOfCodeBlocks, 452 NumberOfCodeBlocksAsserted, 21 NumberOfCheckSat, 426 ConstructedInterpolants, 3 QuantifiedInterpolants, 2374 SizeOfPredicates, 10 NumberOfNonLiveVariables, 587 ConjunctsInSsa, 116 ConjunctsInUnsatCore, 10 InterpolantComputations, 3 PerfectInterpolantSequences, 626/1008 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available - AllSpecificationsHoldResult: All specifications hold 1 specifications checked. All of them hold - InvariantResult [Line: 27]: Loop Invariant Derived loop invariant: (((((k <= 256) && ((c + ((__int128) c * y)) == (y + ((__int128) y * y)))) && ((((__int128) 5 * c) + ((__int128) c * y)) == (((__int128) 5 * y) + ((__int128) y * y)))) && ((((2 * ((((((__int128) y * y) * y) * y) * y) * y)) + (6 * (((((__int128) y * y) * y) * y) * y))) + (5 * ((((__int128) y * y) * y) * y))) == (((__int128) x * 12) + ((__int128) y * y)))) && ((c < k) || (((__int128) y * y) == ((__int128) k * y)))) - ProcedureContractResult [Line: 6]: Procedure Contract for assume_abort_if_not Derived contract for procedure assume_abort_if_not. Ensures: (cond != 0) - ProcedureContractResult [Line: 9]: Procedure Contract for __VERIFIER_assert Derived contract for procedure __VERIFIER_assert. Requires: (1 <= cond) Ensures: (1 <= cond) RESULT: Ultimate proved your program to be correct! [2024-09-25 10:44:50,328 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