./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/nla-digbench-scaling/ps6-ll_valuebound5.c --full-output --procedureinliner.inline.calls.to.implemented.procedures NEVER --traceabstraction.positions.where.we.compute.the.hoare.annotation All --witnessprinter.yaml.format.version 2.1 --witnessprinter.generate.graphml.witnesses false --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version ca4ee3dd Calling Ultimate with: /root/.sdkman/candidates/java/current/bin/java -Dosgi.configuration.area=/storage/repos/certificate-witnesses-artifact/automizer/data/config -Xmx15G -Xms4m -jar /storage/repos/certificate-witnesses-artifact/automizer/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/certificate-witnesses-artifact/automizer/data -tc /storage/repos/certificate-witnesses-artifact/automizer/config/AutomizerReach.xml -i ../sv-benchmarks/c/nla-digbench-scaling/ps6-ll_valuebound5.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 9671c34313c5e47de5bd2f842db47c3009aa180bae8c949f2010db1179ac602f --procedureinliner.inline.calls.to.implemented.procedures NEVER --traceabstraction.positions.where.we.compute.the.hoare.annotation All --witnessprinter.yaml.format.version 2.1 --witnessprinter.generate.graphml.witnesses false --- Real Ultimate output --- This is Ultimate 0.2.4-tmp.dk.referee-eval-ca4ee3d-m [2024-09-20 19:44:51,323 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-09-20 19:44:51,394 INFO L114 SettingsManager]: Loading settings from /storage/repos/certificate-witnesses-artifact/automizer/config/svcomp-Reach-32bit-Automizer_Default.epf [2024-09-20 19:44:51,397 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-09-20 19:44:51,397 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-09-20 19:44:51,431 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-09-20 19:44:51,432 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-09-20 19:44:51,432 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-09-20 19:44:51,433 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-09-20 19:44:51,434 INFO L153 SettingsManager]: * Use memory slicer=true [2024-09-20 19:44:51,434 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-09-20 19:44:51,434 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-09-20 19:44:51,435 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-09-20 19:44:51,437 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-09-20 19:44:51,437 INFO L153 SettingsManager]: * Use SBE=true [2024-09-20 19:44:51,438 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-09-20 19:44:51,438 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-09-20 19:44:51,438 INFO L153 SettingsManager]: * sizeof long=4 [2024-09-20 19:44:51,438 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-09-20 19:44:51,439 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-09-20 19:44:51,439 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-09-20 19:44:51,442 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-09-20 19:44:51,443 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-09-20 19:44:51,443 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-09-20 19:44:51,443 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-09-20 19:44:51,443 INFO L153 SettingsManager]: * sizeof long double=12 [2024-09-20 19:44:51,444 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-09-20 19:44:51,444 INFO L153 SettingsManager]: * Use constant arrays=true [2024-09-20 19:44:51,444 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-09-20 19:44:51,445 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-09-20 19:44:51,445 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-09-20 19:44:51,445 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-09-20 19:44:51,445 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-09-20 19:44:51,446 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-09-20 19:44:51,446 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-09-20 19:44:51,446 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-09-20 19:44:51,447 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-09-20 19:44:51,447 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-09-20 19:44:51,447 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-09-20 19:44:51,447 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-09-20 19:44:51,448 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-09-20 19:44:51,448 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-09-20 19:44:51,448 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 -> 9671c34313c5e47de5bd2f842db47c3009aa180bae8c949f2010db1179ac602f Applying setting for plugin de.uni_freiburg.informatik.ultimate.boogie.procedureinliner: Inline calls to implemented procedures -> NEVER Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: Positions where we compute the Hoare Annotation -> All Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: YAML Format version -> 2.1 Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Generate GraphML witnesses -> false [2024-09-20 19:44:51,754 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-09-20 19:44:51,771 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-09-20 19:44:51,777 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-09-20 19:44:51,780 INFO L270 PluginConnector]: Initializing CDTParser... [2024-09-20 19:44:51,780 INFO L274 PluginConnector]: CDTParser initialized [2024-09-20 19:44:51,781 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/certificate-witnesses-artifact/automizer/../sv-benchmarks/c/nla-digbench-scaling/ps6-ll_valuebound5.c [2024-09-20 19:44:53,793 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-09-20 19:44:53,993 INFO L384 CDTParser]: Found 1 translation units. [2024-09-20 19:44:53,994 INFO L180 CDTParser]: Scanning /storage/repos/certificate-witnesses-artifact/sv-benchmarks/c/nla-digbench-scaling/ps6-ll_valuebound5.c [2024-09-20 19:44:54,002 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/certificate-witnesses-artifact/automizer/data/b263e5ba4/be302d393d4c4c2d870f53d7febc7727/FLAG07d5404a3 [2024-09-20 19:44:54,015 INFO L435 CDTParser]: Successfully deleted /storage/repos/certificate-witnesses-artifact/automizer/data/b263e5ba4/be302d393d4c4c2d870f53d7febc7727 [2024-09-20 19:44:54,017 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-09-20 19:44:54,019 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-09-20 19:44:54,020 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-09-20 19:44:54,020 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-09-20 19:44:54,026 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-09-20 19:44:54,027 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 20.09 07:44:54" (1/1) ... [2024-09-20 19:44:54,028 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@d19aca6 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.09 07:44:54, skipping insertion in model container [2024-09-20 19:44:54,029 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 20.09 07:44:54" (1/1) ... [2024-09-20 19:44:54,049 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-09-20 19:44:54,179 WARN L248 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/certificate-witnesses-artifact/sv-benchmarks/c/nla-digbench-scaling/ps6-ll_valuebound5.c[458,471] [2024-09-20 19:44:54,198 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-09-20 19:44:54,206 INFO L200 MainTranslator]: Completed pre-run [2024-09-20 19:44:54,218 WARN L248 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/certificate-witnesses-artifact/sv-benchmarks/c/nla-digbench-scaling/ps6-ll_valuebound5.c[458,471] [2024-09-20 19:44:54,230 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-09-20 19:44:54,251 INFO L204 MainTranslator]: Completed translation [2024-09-20 19:44:54,252 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.09 07:44:54 WrapperNode [2024-09-20 19:44:54,252 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-09-20 19:44:54,253 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-09-20 19:44:54,254 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-09-20 19:44:54,254 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-09-20 19:44:54,261 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.09 07:44:54" (1/1) ... [2024-09-20 19:44:54,267 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.09 07:44:54" (1/1) ... [2024-09-20 19:44:54,278 INFO L138 Inliner]: procedures = 14, calls = 12, calls flagged for inlining = 0, calls inlined = 0, statements flattened = 0 [2024-09-20 19:44:54,282 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-09-20 19:44:54,282 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-09-20 19:44:54,283 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-09-20 19:44:54,283 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-09-20 19:44:54,293 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.09 07:44:54" (1/1) ... [2024-09-20 19:44:54,294 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.09 07:44:54" (1/1) ... [2024-09-20 19:44:54,300 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.09 07:44:54" (1/1) ... [2024-09-20 19:44:54,321 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-20 19:44:54,323 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.09 07:44:54" (1/1) ... [2024-09-20 19:44:54,324 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.09 07:44:54" (1/1) ... [2024-09-20 19:44:54,326 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.09 07:44:54" (1/1) ... [2024-09-20 19:44:54,331 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.09 07:44:54" (1/1) ... [2024-09-20 19:44:54,335 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.09 07:44:54" (1/1) ... [2024-09-20 19:44:54,336 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.09 07:44:54" (1/1) ... [2024-09-20 19:44:54,337 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-09-20 19:44:54,338 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-09-20 19:44:54,338 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-09-20 19:44:54,338 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-09-20 19:44:54,339 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.09 07:44:54" (1/1) ... [2024-09-20 19:44:54,346 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-09-20 19:44:54,358 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/certificate-witnesses-artifact/automizer/z3 [2024-09-20 19:44:54,375 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-20 19:44:54,378 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-20 19:44:54,424 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-09-20 19:44:54,424 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2024-09-20 19:44:54,424 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2024-09-20 19:44:54,424 INFO L130 BoogieDeclarations]: Found specification of procedure main [2024-09-20 19:44:54,424 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2024-09-20 19:44:54,425 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-09-20 19:44:54,425 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2024-09-20 19:44:54,425 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2024-09-20 19:44:54,425 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-09-20 19:44:54,425 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-09-20 19:44:54,425 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2024-09-20 19:44:54,426 INFO L138 BoogieDeclarations]: Found implementation of procedure __VERIFIER_assert [2024-09-20 19:44:54,519 INFO L242 CfgBuilder]: Building ICFG [2024-09-20 19:44:54,520 INFO L268 CfgBuilder]: Building CFG for each procedure with an implementation [2024-09-20 19:44:54,648 INFO L? ?]: Removed 5 outVars from TransFormulas that were not future-live. [2024-09-20 19:44:54,649 INFO L291 CfgBuilder]: Performing block encoding [2024-09-20 19:44:54,667 INFO L313 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-09-20 19:44:54,667 INFO L318 CfgBuilder]: Removed 1 assume(true) statements. [2024-09-20 19:44:54,668 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 20.09 07:44:54 BoogieIcfgContainer [2024-09-20 19:44:54,669 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-09-20 19:44:54,671 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-09-20 19:44:54,671 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-09-20 19:44:54,674 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-09-20 19:44:54,675 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 20.09 07:44:54" (1/3) ... [2024-09-20 19:44:54,676 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@790f7d3b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 20.09 07:44:54, skipping insertion in model container [2024-09-20 19:44:54,676 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.09 07:44:54" (2/3) ... [2024-09-20 19:44:54,676 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@790f7d3b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 20.09 07:44:54, skipping insertion in model container [2024-09-20 19:44:54,677 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 20.09 07:44:54" (3/3) ... [2024-09-20 19:44:54,678 INFO L112 eAbstractionObserver]: Analyzing ICFG ps6-ll_valuebound5.c [2024-09-20 19:44:54,693 INFO L209 ceAbstractionStarter]: Automizer settings: Hoare:All NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-09-20 19:44:54,693 INFO L149 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-09-20 19:44:54,744 INFO L335 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-09-20 19:44:54,750 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;@27bc4506, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-09-20 19:44:54,751 INFO L337 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-09-20 19:44:54,755 INFO L276 IsEmpty]: Start isEmpty. Operand has 27 states, 14 states have (on average 1.4285714285714286) internal successors, (20), 15 states have internal predecessors, (20), 7 states have call successors, (7), 4 states have call predecessors, (7), 4 states have return successors, (7), 7 states have call predecessors, (7), 7 states have call successors, (7) [2024-09-20 19:44:54,763 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2024-09-20 19:44:54,763 INFO L208 NwaCegarLoop]: Found error trace [2024-09-20 19:44:54,764 INFO L216 NwaCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-09-20 19:44:54,766 INFO L399 AbstractCegarLoop]: === Iteration 1 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-09-20 19:44:54,774 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-20 19:44:54,774 INFO L85 PathProgramCache]: Analyzing trace with hash -620791457, now seen corresponding path program 1 times [2024-09-20 19:44:54,783 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-09-20 19:44:54,786 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [761927377] [2024-09-20 19:44:54,787 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-09-20 19:44:54,787 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-09-20 19:44:54,900 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-20 19:44:54,943 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2024-09-20 19:44:54,947 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-20 19:44:54,956 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-09-20 19:44:54,960 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-20 19:44:54,968 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-09-20 19:44:54,970 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-20 19:44:54,976 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2024-09-20 19:44:54,976 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-09-20 19:44:54,977 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [761927377] [2024-09-20 19:44:54,977 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [761927377] provided 1 perfect and 0 imperfect interpolant sequences [2024-09-20 19:44:54,977 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-09-20 19:44:54,978 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-09-20 19:44:54,986 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1802889703] [2024-09-20 19:44:54,987 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-09-20 19:44:54,995 INFO L551 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-09-20 19:44:54,995 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-09-20 19:44:55,029 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-09-20 19:44:55,031 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-09-20 19:44:55,032 INFO L87 Difference]: Start difference. First operand has 27 states, 14 states have (on average 1.4285714285714286) internal successors, (20), 15 states have internal predecessors, (20), 7 states have call successors, (7), 4 states have call predecessors, (7), 4 states have return successors, (7), 7 states have call predecessors, (7), 7 states have call successors, (7) 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, (5), 2 states have call predecessors, (5), 2 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2024-09-20 19:44:55,057 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-09-20 19:44:55,058 INFO L93 Difference]: Finished difference Result 48 states and 66 transitions. [2024-09-20 19:44:55,059 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-09-20 19:44:55,060 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, (5), 2 states have call predecessors, (5), 2 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) Word has length 21 [2024-09-20 19:44:55,061 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-09-20 19:44:55,067 INFO L225 Difference]: With dead ends: 48 [2024-09-20 19:44:55,068 INFO L226 Difference]: Without dead ends: 23 [2024-09-20 19:44:55,071 INFO L433 NwaCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 10 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-20 19:44:55,075 INFO L434 NwaCegarLoop]: 28 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, 28 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-20 19:44:55,078 INFO L435 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 28 Invalid, 2 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 2 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-09-20 19:44:55,094 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 23 states. [2024-09-20 19:44:55,109 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 23 to 23. [2024-09-20 19:44:55,110 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 23 states, 12 states have (on average 1.1666666666666667) internal successors, (14), 13 states have internal predecessors, (14), 7 states have call successors, (7), 4 states have call predecessors, (7), 3 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) [2024-09-20 19:44:55,111 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 23 states to 23 states and 26 transitions. [2024-09-20 19:44:55,113 INFO L78 Accepts]: Start accepts. Automaton has 23 states and 26 transitions. Word has length 21 [2024-09-20 19:44:55,113 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-09-20 19:44:55,113 INFO L474 AbstractCegarLoop]: Abstraction has 23 states and 26 transitions. [2024-09-20 19:44:55,114 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, (5), 2 states have call predecessors, (5), 2 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2024-09-20 19:44:55,114 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-20 19:44:55,115 INFO L276 IsEmpty]: Start isEmpty. Operand 23 states and 26 transitions. [2024-09-20 19:44:55,116 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2024-09-20 19:44:55,116 INFO L208 NwaCegarLoop]: Found error trace [2024-09-20 19:44:55,116 INFO L216 NwaCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-09-20 19:44:55,117 WARN L456 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-09-20 19:44:55,117 INFO L399 AbstractCegarLoop]: === Iteration 2 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-09-20 19:44:55,118 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-20 19:44:55,118 INFO L85 PathProgramCache]: Analyzing trace with hash -959298087, now seen corresponding path program 1 times [2024-09-20 19:44:55,118 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-09-20 19:44:55,118 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2005857482] [2024-09-20 19:44:55,118 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-09-20 19:44:55,119 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-09-20 19:44:55,158 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unknown [2024-09-20 19:44:55,165 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [198046483] [2024-09-20 19:44:55,165 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-09-20 19:44:55,165 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-09-20 19:44:55,165 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/certificate-witnesses-artifact/automizer/z3 [2024-09-20 19:44:55,168 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-20 19:44:55,170 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-20 19:44:55,259 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-20 19:44:55,261 INFO L262 TraceCheckSpWp]: Trace formula consists of 64 conjuncts, 7 conjuncts are in the unsatisfiable core [2024-09-20 19:44:55,271 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2024-09-20 19:44:55,389 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2024-09-20 19:44:55,390 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-09-20 19:44:55,390 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-09-20 19:44:55,391 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2005857482] [2024-09-20 19:44:55,392 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2024-09-20 19:44:55,392 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [198046483] [2024-09-20 19:44:55,392 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [198046483] provided 1 perfect and 0 imperfect interpolant sequences [2024-09-20 19:44:55,392 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-09-20 19:44:55,392 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-09-20 19:44:55,393 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [166161875] [2024-09-20 19:44:55,393 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-09-20 19:44:55,394 INFO L551 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-09-20 19:44:55,394 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-09-20 19:44:55,395 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-09-20 19:44:55,395 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-09-20 19:44:55,395 INFO L87 Difference]: Start difference. First operand 23 states and 26 transitions. Second operand has 5 states, 5 states have (on average 2.0) internal successors, (10), 4 states have internal predecessors, (10), 2 states have call successors, (5), 2 states have call predecessors, (5), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2024-09-20 19:44:55,466 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-09-20 19:44:55,466 INFO L93 Difference]: Finished difference Result 34 states and 39 transitions. [2024-09-20 19:44:55,467 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-09-20 19:44:55,467 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 2.0) internal successors, (10), 4 states have internal predecessors, (10), 2 states have call successors, (5), 2 states have call predecessors, (5), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) Word has length 21 [2024-09-20 19:44:55,467 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-09-20 19:44:55,468 INFO L225 Difference]: With dead ends: 34 [2024-09-20 19:44:55,468 INFO L226 Difference]: Without dead ends: 30 [2024-09-20 19:44:55,468 INFO L433 NwaCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 17 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2024-09-20 19:44:55,470 INFO L434 NwaCegarLoop]: 20 mSDtfsCounter, 4 mSDsluCounter, 57 mSDsCounter, 0 mSdLazyCounter, 26 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 6 SdHoareTripleChecker+Valid, 77 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.0s IncrementalHoareTripleChecker+Time [2024-09-20 19:44:55,470 INFO L435 NwaCegarLoop]: SdHoareTripleChecker [6 Valid, 77 Invalid, 28 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 26 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-09-20 19:44:55,471 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 30 states. [2024-09-20 19:44:55,480 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 30 to 30. [2024-09-20 19:44:55,481 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 30 states, 17 states have (on average 1.1176470588235294) internal successors, (19), 18 states have internal predecessors, (19), 8 states have call successors, (8), 5 states have call predecessors, (8), 4 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2024-09-20 19:44:55,482 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 30 states to 30 states and 33 transitions. [2024-09-20 19:44:55,483 INFO L78 Accepts]: Start accepts. Automaton has 30 states and 33 transitions. Word has length 21 [2024-09-20 19:44:55,483 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-09-20 19:44:55,483 INFO L474 AbstractCegarLoop]: Abstraction has 30 states and 33 transitions. [2024-09-20 19:44:55,483 INFO L475 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 2.0) internal successors, (10), 4 states have internal predecessors, (10), 2 states have call successors, (5), 2 states have call predecessors, (5), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2024-09-20 19:44:55,484 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-20 19:44:55,484 INFO L276 IsEmpty]: Start isEmpty. Operand 30 states and 33 transitions. [2024-09-20 19:44:55,486 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2024-09-20 19:44:55,487 INFO L208 NwaCegarLoop]: Found error trace [2024-09-20 19:44:55,487 INFO L216 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-09-20 19:44:55,504 INFO L552 MonitoredProcess]: [MP /storage/repos/certificate-witnesses-artifact/automizer/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2024-09-20 19:44:55,688 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-20 19:44:55,688 INFO L399 AbstractCegarLoop]: === Iteration 3 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-09-20 19:44:55,689 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-20 19:44:55,689 INFO L85 PathProgramCache]: Analyzing trace with hash 1544704875, now seen corresponding path program 1 times [2024-09-20 19:44:55,689 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-09-20 19:44:55,689 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [219833543] [2024-09-20 19:44:55,689 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-09-20 19:44:55,689 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-09-20 19:44:55,718 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unknown [2024-09-20 19:44:55,723 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1914858491] [2024-09-20 19:44:55,723 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-09-20 19:44:55,723 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-09-20 19:44:55,724 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/certificate-witnesses-artifact/automizer/z3 [2024-09-20 19:44:55,726 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-20 19:44:55,729 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-20 19:44:55,777 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-20 19:44:55,782 INFO L262 TraceCheckSpWp]: Trace formula consists of 81 conjuncts, 11 conjuncts are in the unsatisfiable core [2024-09-20 19:44:55,785 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2024-09-20 19:44:55,885 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 2 proven. 2 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2024-09-20 19:44:55,885 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2024-09-20 19:44:56,017 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2024-09-20 19:44:56,018 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-09-20 19:44:56,018 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [219833543] [2024-09-20 19:44:56,018 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2024-09-20 19:44:56,018 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1914858491] [2024-09-20 19:44:56,019 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1914858491] provided 1 perfect and 1 imperfect interpolant sequences [2024-09-20 19:44:56,019 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-09-20 19:44:56,019 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [6] total 7 [2024-09-20 19:44:56,019 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1228805919] [2024-09-20 19:44:56,020 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-09-20 19:44:56,020 INFO L551 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-09-20 19:44:56,020 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-09-20 19:44:56,021 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-09-20 19:44:56,022 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2024-09-20 19:44:56,023 INFO L87 Difference]: Start difference. First operand 30 states and 33 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, (6), 2 states have call predecessors, (6), 1 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) [2024-09-20 19:44:56,084 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-09-20 19:44:56,085 INFO L93 Difference]: Finished difference Result 36 states and 38 transitions. [2024-09-20 19:44:56,085 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-09-20 19:44:56,086 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, (6), 2 states have call predecessors, (6), 1 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) Word has length 28 [2024-09-20 19:44:56,086 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-09-20 19:44:56,087 INFO L225 Difference]: With dead ends: 36 [2024-09-20 19:44:56,087 INFO L226 Difference]: Without dead ends: 32 [2024-09-20 19:44:56,088 INFO L433 NwaCegarLoop]: 0 DeclaredPredicates, 56 GetRequests, 48 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-20 19:44:56,089 INFO L434 NwaCegarLoop]: 20 mSDtfsCounter, 4 mSDsluCounter, 53 mSDsCounter, 0 mSdLazyCounter, 23 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 5 SdHoareTripleChecker+Valid, 73 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-20 19:44:56,089 INFO L435 NwaCegarLoop]: SdHoareTripleChecker [5 Valid, 73 Invalid, 24 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 23 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-09-20 19:44:56,091 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 32 states. [2024-09-20 19:44:56,102 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 32 to 32. [2024-09-20 19:44:56,103 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 32 states, 19 states have (on average 1.0526315789473684) internal successors, (20), 19 states have internal predecessors, (20), 8 states have call successors, (8), 6 states have call predecessors, (8), 4 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2024-09-20 19:44:56,103 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 32 states to 32 states and 34 transitions. [2024-09-20 19:44:56,104 INFO L78 Accepts]: Start accepts. Automaton has 32 states and 34 transitions. Word has length 28 [2024-09-20 19:44:56,104 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-09-20 19:44:56,104 INFO L474 AbstractCegarLoop]: Abstraction has 32 states and 34 transitions. [2024-09-20 19:44:56,105 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, (6), 2 states have call predecessors, (6), 1 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) [2024-09-20 19:44:56,105 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-20 19:44:56,105 INFO L276 IsEmpty]: Start isEmpty. Operand 32 states and 34 transitions. [2024-09-20 19:44:56,106 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 40 [2024-09-20 19:44:56,106 INFO L208 NwaCegarLoop]: Found error trace [2024-09-20 19:44:56,107 INFO L216 NwaCegarLoop]: trace histogram [4, 3, 3, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-09-20 19:44:56,124 INFO L540 MonitoredProcess]: [MP /storage/repos/certificate-witnesses-artifact/automizer/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2024-09-20 19:44:56,310 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-20 19:44:56,311 INFO L399 AbstractCegarLoop]: === Iteration 4 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-09-20 19:44:56,312 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-20 19:44:56,312 INFO L85 PathProgramCache]: Analyzing trace with hash 21814286, now seen corresponding path program 1 times [2024-09-20 19:44:56,312 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-09-20 19:44:56,312 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1295495447] [2024-09-20 19:44:56,312 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-09-20 19:44:56,313 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-09-20 19:44:56,342 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unknown [2024-09-20 19:44:56,344 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [294012649] [2024-09-20 19:44:56,344 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-09-20 19:44:56,344 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-09-20 19:44:56,344 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/certificate-witnesses-artifact/automizer/z3 [2024-09-20 19:44:56,346 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-20 19:44:56,348 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-20 19:44:56,403 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-20 19:44:56,408 INFO L262 TraceCheckSpWp]: Trace formula consists of 100 conjuncts, 26 conjuncts are in the unsatisfiable core [2024-09-20 19:44:56,411 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2024-09-20 19:44:56,625 INFO L134 CoverageAnalysis]: Checked inductivity of 25 backedges. 7 proven. 8 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2024-09-20 19:44:56,626 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2024-09-20 19:44:57,148 INFO L134 CoverageAnalysis]: Checked inductivity of 25 backedges. 11 proven. 4 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2024-09-20 19:44:57,148 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-09-20 19:44:57,148 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1295495447] [2024-09-20 19:44:57,148 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2024-09-20 19:44:57,148 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [294012649] [2024-09-20 19:44:57,149 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [294012649] provided 0 perfect and 2 imperfect interpolant sequences [2024-09-20 19:44:57,149 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-09-20 19:44:57,149 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 10] total 15 [2024-09-20 19:44:57,149 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [798056273] [2024-09-20 19:44:57,150 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-09-20 19:44:57,151 INFO L551 AbstractCegarLoop]: INTERPOLANT automaton has 15 states [2024-09-20 19:44:57,151 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-09-20 19:44:57,152 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2024-09-20 19:44:57,153 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=46, Invalid=164, Unknown=0, NotChecked=0, Total=210 [2024-09-20 19:44:57,153 INFO L87 Difference]: Start difference. First operand 32 states and 34 transitions. Second operand has 15 states, 11 states have (on average 2.3636363636363638) internal successors, (26), 12 states have internal predecessors, (26), 9 states have call successors, (12), 2 states have call predecessors, (12), 2 states have return successors, (9), 7 states have call predecessors, (9), 7 states have call successors, (9) [2024-09-20 19:44:57,497 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-09-20 19:44:57,497 INFO L93 Difference]: Finished difference Result 53 states and 61 transitions. [2024-09-20 19:44:57,498 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2024-09-20 19:44:57,498 INFO L78 Accepts]: Start accepts. Automaton has has 15 states, 11 states have (on average 2.3636363636363638) internal successors, (26), 12 states have internal predecessors, (26), 9 states have call successors, (12), 2 states have call predecessors, (12), 2 states have return successors, (9), 7 states have call predecessors, (9), 7 states have call successors, (9) Word has length 39 [2024-09-20 19:44:57,498 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-09-20 19:44:57,499 INFO L225 Difference]: With dead ends: 53 [2024-09-20 19:44:57,499 INFO L226 Difference]: Without dead ends: 45 [2024-09-20 19:44:57,500 INFO L433 NwaCegarLoop]: 0 DeclaredPredicates, 80 GetRequests, 62 SyntacticMatches, 2 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 26 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=64, Invalid=242, Unknown=0, NotChecked=0, Total=306 [2024-09-20 19:44:57,501 INFO L434 NwaCegarLoop]: 20 mSDtfsCounter, 4 mSDsluCounter, 158 mSDsCounter, 0 mSdLazyCounter, 111 mSolverCounterSat, 11 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 5 SdHoareTripleChecker+Valid, 178 SdHoareTripleChecker+Invalid, 122 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 11 IncrementalHoareTripleChecker+Valid, 111 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-09-20 19:44:57,501 INFO L435 NwaCegarLoop]: SdHoareTripleChecker [5 Valid, 178 Invalid, 122 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [11 Valid, 111 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-09-20 19:44:57,502 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 45 states. [2024-09-20 19:44:57,538 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 45 to 45. [2024-09-20 19:44:57,538 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 45 states, 28 states have (on average 1.0357142857142858) internal successors, (29), 28 states have internal predecessors, (29), 11 states have call successors, (11), 7 states have call predecessors, (11), 5 states have return successors, (9), 9 states have call predecessors, (9), 9 states have call successors, (9) [2024-09-20 19:44:57,539 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 45 states to 45 states and 49 transitions. [2024-09-20 19:44:57,541 INFO L78 Accepts]: Start accepts. Automaton has 45 states and 49 transitions. Word has length 39 [2024-09-20 19:44:57,541 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-09-20 19:44:57,541 INFO L474 AbstractCegarLoop]: Abstraction has 45 states and 49 transitions. [2024-09-20 19:44:57,542 INFO L475 AbstractCegarLoop]: INTERPOLANT automaton has has 15 states, 11 states have (on average 2.3636363636363638) internal successors, (26), 12 states have internal predecessors, (26), 9 states have call successors, (12), 2 states have call predecessors, (12), 2 states have return successors, (9), 7 states have call predecessors, (9), 7 states have call successors, (9) [2024-09-20 19:44:57,542 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-20 19:44:57,542 INFO L276 IsEmpty]: Start isEmpty. Operand 45 states and 49 transitions. [2024-09-20 19:44:57,543 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 61 [2024-09-20 19:44:57,544 INFO L208 NwaCegarLoop]: Found error trace [2024-09-20 19:44:57,544 INFO L216 NwaCegarLoop]: trace histogram [7, 6, 6, 5, 5, 5, 4, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-09-20 19:44:57,561 INFO L540 MonitoredProcess]: [MP /storage/repos/certificate-witnesses-artifact/automizer/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Forceful destruction successful, exit code 0 [2024-09-20 19:44:57,748 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-20 19:44:57,749 INFO L399 AbstractCegarLoop]: === Iteration 5 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-09-20 19:44:57,749 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-20 19:44:57,750 INFO L85 PathProgramCache]: Analyzing trace with hash -244405920, now seen corresponding path program 2 times [2024-09-20 19:44:57,750 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-09-20 19:44:57,750 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [736761413] [2024-09-20 19:44:57,750 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-09-20 19:44:57,750 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-09-20 19:44:57,786 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unknown [2024-09-20 19:44:57,788 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [482660979] [2024-09-20 19:44:57,788 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2024-09-20 19:44:57,789 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-09-20 19:44:57,789 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/certificate-witnesses-artifact/automizer/z3 [2024-09-20 19:44:57,790 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-20 19:44:57,792 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-20 19:44:57,856 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2024-09-20 19:44:57,856 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2024-09-20 19:44:57,858 INFO L262 TraceCheckSpWp]: Trace formula consists of 151 conjuncts, 46 conjuncts are in the unsatisfiable core [2024-09-20 19:44:57,862 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2024-09-20 19:44:58,222 INFO L134 CoverageAnalysis]: Checked inductivity of 106 backedges. 31 proven. 38 refuted. 0 times theorem prover too weak. 37 trivial. 0 not checked. [2024-09-20 19:44:58,223 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2024-09-20 19:46:28,169 INFO L134 CoverageAnalysis]: Checked inductivity of 106 backedges. 26 proven. 31 refuted. 0 times theorem prover too weak. 49 trivial. 0 not checked. [2024-09-20 19:46:28,170 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-09-20 19:46:28,170 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [736761413] [2024-09-20 19:46:28,170 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2024-09-20 19:46:28,170 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [482660979] [2024-09-20 19:46:28,170 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [482660979] provided 0 perfect and 2 imperfect interpolant sequences [2024-09-20 19:46:28,170 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-09-20 19:46:28,171 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [17, 13] total 27 [2024-09-20 19:46:28,171 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1298389592] [2024-09-20 19:46:28,171 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-09-20 19:46:28,171 INFO L551 AbstractCegarLoop]: INTERPOLANT automaton has 27 states [2024-09-20 19:46:28,172 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-09-20 19:46:28,173 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 27 interpolants. [2024-09-20 19:46:28,173 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=105, Invalid=591, Unknown=6, NotChecked=0, Total=702 [2024-09-20 19:46:28,173 INFO L87 Difference]: Start difference. First operand 45 states and 49 transitions. Second operand has 27 states, 23 states have (on average 1.8695652173913044) internal successors, (43), 21 states have internal predecessors, (43), 15 states have call successors, (18), 3 states have call predecessors, (18), 3 states have return successors, (16), 14 states have call predecessors, (16), 13 states have call successors, (16) [2024-09-20 19:46:32,617 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse2 (* c_main_~y~0 c_main_~y~0))) (let ((.cse0 (not (= (+ (* 5 (* c_main_~y~0 c_main_~y~0 c_main_~y~0 c_main_~y~0)) (* (* c_main_~y~0 c_main_~y~0 c_main_~y~0 c_main_~y~0 c_main_~y~0 c_main_~y~0) 2) (* 6 (* c_main_~y~0 c_main_~y~0 c_main_~y~0 c_main_~y~0 c_main_~y~0))) (+ (* 12 c_main_~x~0) .cse2)))) (.cse3 (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) .cse2) 12) 0))) (.cse1 (* c_main_~y~0 c_main_~k~0))) (and (<= c_main_~k~0 256) (or .cse0 (= (+ .cse1 c_main_~k~0) (+ (* 2 c_main_~y~0) .cse2 1)) (not (= (+ c_main_~c~0 1) c_main_~k~0))) (or (not (= (+ 3 c_main_~c~0) c_main_~k~0)) .cse3 (= (+ .cse1 (* 3 c_main_~k~0)) (+ (* 6 c_main_~y~0) 9 .cse2))) (or .cse0 (< c_main_~c~0 c_main_~k~0) (= .cse1 .cse2)) (or (not (= (+ 2 c_main_~c~0) c_main_~k~0)) .cse3 (= (+ .cse1 (* 2 c_main_~k~0)) (+ (* 4 c_main_~y~0) 4 .cse2)))))) is different from false [2024-09-20 19:46:36,633 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse2 (* c_main_~y~0 c_main_~y~0))) (let ((.cse0 (not (= (+ (* 5 (* c_main_~y~0 c_main_~y~0 c_main_~y~0 c_main_~y~0)) (* (* c_main_~y~0 c_main_~y~0 c_main_~y~0 c_main_~y~0 c_main_~y~0 c_main_~y~0) 2) (* 6 (* c_main_~y~0 c_main_~y~0 c_main_~y~0 c_main_~y~0 c_main_~y~0))) (+ (* 12 c_main_~x~0) .cse2)))) (.cse3 (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) .cse2) 12) 0))) (.cse1 (* c_main_~y~0 c_main_~k~0))) (and (or .cse0 (= (+ .cse1 c_main_~k~0) (+ (* 2 c_main_~y~0) .cse2 1)) (not (= (+ c_main_~c~0 1) c_main_~k~0))) (or (not (= (+ 3 c_main_~c~0) c_main_~k~0)) .cse3 (= (+ .cse1 (* 3 c_main_~k~0)) (+ (* 6 c_main_~y~0) 9 .cse2))) (or .cse0 (< c_main_~c~0 c_main_~k~0) (= .cse1 .cse2)) (or (not (= (+ 2 c_main_~c~0) c_main_~k~0)) .cse3 (= (+ .cse1 (* 2 c_main_~k~0)) (+ (* 4 c_main_~y~0) 4 .cse2)))))) is different from false [2024-09-20 19:46:40,658 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse2 (* c_main_~y~0 c_main_~y~0))) (let ((.cse0 (not (= (+ (* 5 (* c_main_~y~0 c_main_~y~0 c_main_~y~0 c_main_~y~0)) (* (* c_main_~y~0 c_main_~y~0 c_main_~y~0 c_main_~y~0 c_main_~y~0 c_main_~y~0) 2) (* 6 (* c_main_~y~0 c_main_~y~0 c_main_~y~0 c_main_~y~0 c_main_~y~0))) (+ (* 12 c_main_~x~0) .cse2)))) (.cse1 (* c_main_~y~0 c_main_~k~0))) (and (or .cse0 (not (= (+ 2 c_main_~c~0) c_main_~k~0)) (= (+ .cse1 (* 2 c_main_~k~0)) (+ (* 4 c_main_~y~0) 4 .cse2))) (or .cse0 (= (+ .cse1 c_main_~k~0) (+ (* 2 c_main_~y~0) .cse2 1)) (not (= (+ c_main_~c~0 1) c_main_~k~0))) (or (not (= (+ 3 c_main_~c~0) c_main_~k~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) .cse2) 12) 0)) (= (+ .cse1 (* 3 c_main_~k~0)) (+ (* 6 c_main_~y~0) 9 .cse2))) (or .cse0 (< c_main_~c~0 c_main_~k~0) (= .cse1 .cse2))))) is different from false [2024-09-20 19:46:44,673 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse2 (* c_main_~y~0 c_main_~y~0))) (let ((.cse0 (not (= (+ (* 5 (* c_main_~y~0 c_main_~y~0 c_main_~y~0 c_main_~y~0)) (* (* c_main_~y~0 c_main_~y~0 c_main_~y~0 c_main_~y~0 c_main_~y~0 c_main_~y~0) 2) (* 6 (* c_main_~y~0 c_main_~y~0 c_main_~y~0 c_main_~y~0 c_main_~y~0))) (+ (* 12 c_main_~x~0) .cse2)))) (.cse1 (* c_main_~y~0 c_main_~k~0))) (and (or .cse0 (= (+ .cse1 c_main_~k~0) (+ (* 2 c_main_~y~0) .cse2 1)) (not (= (+ c_main_~c~0 1) c_main_~k~0))) (or .cse0 (< c_main_~c~0 c_main_~k~0) (= .cse1 .cse2)) (or (not (= (+ 2 c_main_~c~0) c_main_~k~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) .cse2) 12) 0)) (= (+ .cse1 (* 2 c_main_~k~0)) (+ (* 4 c_main_~y~0) 4 .cse2)))))) is different from false [2024-09-20 19:46:44,924 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-09-20 19:46:44,925 INFO L93 Difference]: Finished difference Result 74 states and 88 transitions. [2024-09-20 19:46:44,925 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 26 states. [2024-09-20 19:46:44,925 INFO L78 Accepts]: Start accepts. Automaton has has 27 states, 23 states have (on average 1.8695652173913044) internal successors, (43), 21 states have internal predecessors, (43), 15 states have call successors, (18), 3 states have call predecessors, (18), 3 states have return successors, (16), 14 states have call predecessors, (16), 13 states have call successors, (16) Word has length 60 [2024-09-20 19:46:44,926 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-09-20 19:46:44,927 INFO L225 Difference]: With dead ends: 74 [2024-09-20 19:46:44,927 INFO L226 Difference]: Without dead ends: 66 [2024-09-20 19:46:44,928 INFO L433 NwaCegarLoop]: 0 DeclaredPredicates, 132 GetRequests, 94 SyntacticMatches, 0 SemanticMatches, 38 ConstructedPredicates, 4 IntricatePredicates, 0 DeprecatedPredicates, 248 ImplicationChecksByTransitivity, 73.0s TimeCoverageRelationStatistics Valid=199, Invalid=1067, Unknown=10, NotChecked=284, Total=1560 [2024-09-20 19:46:44,928 INFO L434 NwaCegarLoop]: 25 mSDtfsCounter, 5 mSDsluCounter, 280 mSDsCounter, 0 mSdLazyCounter, 321 mSolverCounterSat, 8 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 6 SdHoareTripleChecker+Valid, 305 SdHoareTripleChecker+Invalid, 519 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 8 IncrementalHoareTripleChecker+Valid, 321 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 190 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2024-09-20 19:46:44,929 INFO L435 NwaCegarLoop]: SdHoareTripleChecker [6 Valid, 305 Invalid, 519 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [8 Valid, 321 Invalid, 0 Unknown, 190 Unchecked, 0.3s Time] [2024-09-20 19:46:44,930 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 66 states. [2024-09-20 19:46:44,958 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 66 to 64. [2024-09-20 19:46:44,960 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 64 states, 41 states have (on average 1.024390243902439) internal successors, (42), 41 states have internal predecessors, (42), 16 states have call successors, (16), 8 states have call predecessors, (16), 6 states have return successors, (14), 14 states have call predecessors, (14), 14 states have call successors, (14) [2024-09-20 19:46:44,961 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 64 states to 64 states and 72 transitions. [2024-09-20 19:46:44,964 INFO L78 Accepts]: Start accepts. Automaton has 64 states and 72 transitions. Word has length 60 [2024-09-20 19:46:44,965 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-09-20 19:46:44,965 INFO L474 AbstractCegarLoop]: Abstraction has 64 states and 72 transitions. [2024-09-20 19:46:44,965 INFO L475 AbstractCegarLoop]: INTERPOLANT automaton has has 27 states, 23 states have (on average 1.8695652173913044) internal successors, (43), 21 states have internal predecessors, (43), 15 states have call successors, (18), 3 states have call predecessors, (18), 3 states have return successors, (16), 14 states have call predecessors, (16), 13 states have call successors, (16) [2024-09-20 19:46:44,965 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-20 19:46:44,965 INFO L276 IsEmpty]: Start isEmpty. Operand 64 states and 72 transitions. [2024-09-20 19:46:44,968 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 96 [2024-09-20 19:46:44,968 INFO L208 NwaCegarLoop]: Found error trace [2024-09-20 19:46:44,968 INFO L216 NwaCegarLoop]: trace histogram [12, 11, 11, 10, 10, 10, 9, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-09-20 19:46:44,984 INFO L552 MonitoredProcess]: [MP /storage/repos/certificate-witnesses-artifact/automizer/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Ended with exit code 0 [2024-09-20 19:46:45,168 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-20 19:46:45,168 INFO L399 AbstractCegarLoop]: === Iteration 6 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-09-20 19:46:45,169 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-20 19:46:45,169 INFO L85 PathProgramCache]: Analyzing trace with hash -235169010, now seen corresponding path program 3 times [2024-09-20 19:46:45,169 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-09-20 19:46:45,169 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [46509112] [2024-09-20 19:46:45,169 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-09-20 19:46:45,169 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-09-20 19:46:45,232 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-20 19:46:45,767 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2024-09-20 19:46:45,769 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-20 19:46:45,771 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-09-20 19:46:45,775 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-20 19:46:45,825 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-09-20 19:46:45,828 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-20 19:46:45,833 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-09-20 19:46:45,835 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-20 19:46:45,839 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2024-09-20 19:46:45,844 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-20 19:46:45,852 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 31 [2024-09-20 19:46:45,854 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-20 19:46:45,858 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-09-20 19:46:45,859 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-20 19:46:45,864 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 45 [2024-09-20 19:46:45,866 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-20 19:46:45,871 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 52 [2024-09-20 19:46:45,873 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-20 19:46:45,879 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2024-09-20 19:46:45,882 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-20 19:46:45,887 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 66 [2024-09-20 19:46:45,890 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-20 19:46:45,894 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 73 [2024-09-20 19:46:45,895 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-20 19:46:45,900 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 80 [2024-09-20 19:46:45,902 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-20 19:46:45,904 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 86 [2024-09-20 19:46:45,905 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-20 19:46:45,907 INFO L134 CoverageAnalysis]: Checked inductivity of 381 backedges. 133 proven. 27 refuted. 0 times theorem prover too weak. 221 trivial. 0 not checked. [2024-09-20 19:46:45,907 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-09-20 19:46:45,908 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [46509112] [2024-09-20 19:46:45,908 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [46509112] provided 0 perfect and 1 imperfect interpolant sequences [2024-09-20 19:46:45,908 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [632886756] [2024-09-20 19:46:45,908 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2024-09-20 19:46:45,908 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-09-20 19:46:45,908 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/certificate-witnesses-artifact/automizer/z3 [2024-09-20 19:46:45,910 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-20 19:46:45,911 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-20 19:46:46,019 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 10 check-sat command(s) [2024-09-20 19:46:46,019 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2024-09-20 19:46:46,020 INFO L262 TraceCheckSpWp]: Trace formula consists of 236 conjuncts, 15 conjuncts are in the unsatisfiable core [2024-09-20 19:46:46,023 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2024-09-20 19:46:46,324 INFO L134 CoverageAnalysis]: Checked inductivity of 381 backedges. 225 proven. 3 refuted. 0 times theorem prover too weak. 153 trivial. 0 not checked. [2024-09-20 19:46:46,324 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2024-09-20 19:46:46,548 INFO L134 CoverageAnalysis]: Checked inductivity of 381 backedges. 157 proven. 3 refuted. 0 times theorem prover too weak. 221 trivial. 0 not checked. [2024-09-20 19:46:46,548 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [632886756] provided 0 perfect and 2 imperfect interpolant sequences [2024-09-20 19:46:46,548 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-09-20 19:46:46,548 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 14, 14] total 34 [2024-09-20 19:46:46,548 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1419305958] [2024-09-20 19:46:46,548 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-09-20 19:46:46,549 INFO L551 AbstractCegarLoop]: INTERPOLANT automaton has 34 states [2024-09-20 19:46:46,549 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-09-20 19:46:46,550 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 34 interpolants. [2024-09-20 19:46:46,551 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=383, Invalid=739, Unknown=0, NotChecked=0, Total=1122 [2024-09-20 19:46:46,551 INFO L87 Difference]: Start difference. First operand 64 states and 72 transitions. Second operand has 34 states, 34 states have (on average 2.264705882352941) internal successors, (77), 32 states have internal predecessors, (77), 31 states have call successors, (37), 2 states have call predecessors, (37), 3 states have return successors, (36), 31 states have call predecessors, (36), 31 states have call successors, (36) [2024-09-20 19:46:46,660 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-09-20 19:46:46,660 INFO L93 Difference]: Finished difference Result 70 states and 77 transitions. [2024-09-20 19:46:46,660 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2024-09-20 19:46:46,661 INFO L78 Accepts]: Start accepts. Automaton has has 34 states, 34 states have (on average 2.264705882352941) internal successors, (77), 32 states have internal predecessors, (77), 31 states have call successors, (37), 2 states have call predecessors, (37), 3 states have return successors, (36), 31 states have call predecessors, (36), 31 states have call successors, (36) Word has length 95 [2024-09-20 19:46:46,661 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-09-20 19:46:46,661 INFO L225 Difference]: With dead ends: 70 [2024-09-20 19:46:46,661 INFO L226 Difference]: Without dead ends: 0 [2024-09-20 19:46:46,662 INFO L433 NwaCegarLoop]: 0 DeclaredPredicates, 231 GetRequests, 198 SyntacticMatches, 0 SemanticMatches, 33 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 464 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=388, Invalid=802, Unknown=0, NotChecked=0, Total=1190 [2024-09-20 19:46:46,663 INFO L434 NwaCegarLoop]: 30 mSDtfsCounter, 1 mSDsluCounter, 170 mSDsCounter, 0 mSdLazyCounter, 113 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 200 SdHoareTripleChecker+Invalid, 115 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 113 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-09-20 19:46:46,663 INFO L435 NwaCegarLoop]: SdHoareTripleChecker [1 Valid, 200 Invalid, 115 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 113 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-09-20 19:46:46,664 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2024-09-20 19:46:46,664 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2024-09-20 19:46:46,664 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-20 19:46:46,664 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2024-09-20 19:46:46,665 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 95 [2024-09-20 19:46:46,665 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-09-20 19:46:46,665 INFO L474 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2024-09-20 19:46:46,665 INFO L475 AbstractCegarLoop]: INTERPOLANT automaton has has 34 states, 34 states have (on average 2.264705882352941) internal successors, (77), 32 states have internal predecessors, (77), 31 states have call successors, (37), 2 states have call predecessors, (37), 3 states have return successors, (36), 31 states have call predecessors, (36), 31 states have call successors, (36) [2024-09-20 19:46:46,665 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-20 19:46:46,666 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2024-09-20 19:46:46,666 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2024-09-20 19:46:46,668 INFO L785 garLoopResultBuilder]: Registering result SAFE for location __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2024-09-20 19:46:46,686 INFO L540 MonitoredProcess]: [MP /storage/repos/certificate-witnesses-artifact/automizer/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Forceful destruction successful, exit code 0 [2024-09-20 19:46:46,869 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-20 19:46:46,872 INFO L408 BasicCegarLoop]: Path program histogram: [3, 1, 1, 1] [2024-09-20 19:46:46,874 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2024-09-20 19:46:48,053 INFO L165 ceAbstractionStarter]: Computing trace abstraction results [2024-09-20 19:46:48,077 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 20.09 07:46:48 BoogieIcfgContainer [2024-09-20 19:46:48,079 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2024-09-20 19:46:48,080 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2024-09-20 19:46:48,080 INFO L270 PluginConnector]: Initializing Witness Printer... [2024-09-20 19:46:48,080 INFO L274 PluginConnector]: Witness Printer initialized [2024-09-20 19:46:48,080 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 20.09 07:44:54" (3/4) ... [2024-09-20 19:46:48,082 INFO L139 WitnessPrinter]: Generating witness for correct program [2024-09-20 19:46:48,132 INFO L149 WitnessManager]: Wrote witness to /storage/repos/certificate-witnesses-artifact/automizer/witness.yml [2024-09-20 19:46:48,132 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2024-09-20 19:46:48,133 INFO L158 Benchmark]: Toolchain (without parser) took 114114.23ms. Allocated memory was 172.0MB in the beginning and 207.6MB in the end (delta: 35.7MB). Free memory was 113.7MB in the beginning and 117.9MB in the end (delta: -4.2MB). Peak memory consumption was 29.9MB. Max. memory is 16.1GB. [2024-09-20 19:46:48,133 INFO L158 Benchmark]: CDTParser took 0.12ms. Allocated memory is still 100.7MB. Free memory is still 64.9MB. There was no memory consumed. Max. memory is 16.1GB. [2024-09-20 19:46:48,133 INFO L158 Benchmark]: CACSL2BoogieTranslator took 232.78ms. Allocated memory is still 172.0MB. Free memory was 113.7MB in the beginning and 102.0MB in the end (delta: 11.7MB). Peak memory consumption was 10.5MB. Max. memory is 16.1GB. [2024-09-20 19:46:48,135 INFO L158 Benchmark]: Boogie Procedure Inliner took 28.77ms. Allocated memory is still 172.0MB. Free memory was 102.0MB in the beginning and 101.1MB in the end (delta: 895.9kB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2024-09-20 19:46:48,135 INFO L158 Benchmark]: Boogie Preprocessor took 55.04ms. Allocated memory is still 172.0MB. Free memory was 101.1MB in the beginning and 99.6MB in the end (delta: 1.5MB). There was no memory consumed. Max. memory is 16.1GB. [2024-09-20 19:46:48,135 INFO L158 Benchmark]: RCFGBuilder took 330.50ms. Allocated memory is still 172.0MB. Free memory was 99.6MB in the beginning and 133.0MB in the end (delta: -33.4MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2024-09-20 19:46:48,136 INFO L158 Benchmark]: TraceAbstraction took 113408.49ms. Allocated memory was 172.0MB in the beginning and 207.6MB in the end (delta: 35.7MB). Free memory was 131.9MB in the beginning and 120.0MB in the end (delta: 11.9MB). Peak memory consumption was 111.5MB. Max. memory is 16.1GB. [2024-09-20 19:46:48,136 INFO L158 Benchmark]: Witness Printer took 52.75ms. Allocated memory is still 207.6MB. Free memory was 120.0MB in the beginning and 117.9MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2024-09-20 19:46:48,138 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 100.7MB. Free memory is still 64.9MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 232.78ms. Allocated memory is still 172.0MB. Free memory was 113.7MB in the beginning and 102.0MB in the end (delta: 11.7MB). Peak memory consumption was 10.5MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 28.77ms. Allocated memory is still 172.0MB. Free memory was 102.0MB in the beginning and 101.1MB in the end (delta: 895.9kB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * Boogie Preprocessor took 55.04ms. Allocated memory is still 172.0MB. Free memory was 101.1MB in the beginning and 99.6MB in the end (delta: 1.5MB). There was no memory consumed. Max. memory is 16.1GB. * RCFGBuilder took 330.50ms. Allocated memory is still 172.0MB. Free memory was 99.6MB in the beginning and 133.0MB in the end (delta: -33.4MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * TraceAbstraction took 113408.49ms. Allocated memory was 172.0MB in the beginning and 207.6MB in the end (delta: 35.7MB). Free memory was 131.9MB in the beginning and 120.0MB in the end (delta: 11.9MB). Peak memory consumption was 111.5MB. Max. memory is 16.1GB. * Witness Printer took 52.75ms. Allocated memory is still 207.6MB. Free memory was 120.0MB in the beginning and 117.9MB 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.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, 27 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 112.1s, OverallIterations: 6, TraceHistogramMax: 12, PathProgramHistogramMax: 3, EmptinessCheckTime: 0.0s, AutomataDifference: 17.5s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 23 SdHoareTripleChecker+Valid, 0.8s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 18 mSDsluCounter, 861 SdHoareTripleChecker+Invalid, 0.7s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 190 IncrementalHoareTripleChecker+Unchecked, 718 mSDsCounter, 24 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 596 IncrementalHoareTripleChecker+Invalid, 810 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 24 mSolverCounterUnsat, 143 mSDtfsCounter, 596 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 530 GetRequests, 429 SyntacticMatches, 4 SemanticMatches, 97 ConstructedPredicates, 4 IntricatePredicates, 0 DeprecatedPredicates, 738 ImplicationChecksByTransitivity, 73.9s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=64occurred in iteration=5, InterpolantAutomatonStates: 63, 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, 2 StatesRemovedByMinimization, 1 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 0.4s SatisfiabilityAnalysisTime, 92.7s InterpolantComputationTime, 507 NumberOfCodeBlocks, 507 NumberOfCodeBlocksAsserted, 21 NumberOfCheckSat, 570 ConstructedInterpolants, 0 QuantifiedInterpolants, 2942 SizeOfPredicates, 8 NumberOfNonLiveVariables, 632 ConjunctsInSsa, 105 ConjunctsInUnsatCore, 11 InterpolantComputations, 3 PerfectInterpolantSequences, 1313/1429 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: 28]: Loop Invariant Derived loop invariant: ((((((((((k <= 5) && ((k == 3) || (3 < k))) && (276 == x)) && (y == 3)) && (c == 3)) || (((((k <= 5) && ((1 < k) || (k == 1))) && (y == 1)) && (x == 1)) && (c == 1))) || (((((x == 33) && (y == 2)) && (k <= 5)) && ((k == 2) || (2 < k))) && (c == 2))) || (((((x == 0) && (k <= 5)) && (0 <= k)) && (c == 0)) && (y == 0))) || (((((k <= 5) && (0 <= k)) && (((__int128) y * y) == ((__int128) k * 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)))) && (5 <= c))) || (((((k <= 5) && (4 <= k)) && (y == 4)) && (c == 4)) && (1300 == x))) - ProcedureContractResult [Line: 6]: Procedure Contract for assume_abort_if_not Derived contract for procedure assume_abort_if_not. Ensures: (\old(cond) != 0) - ProcedureContractResult [Line: 9]: Procedure Contract for __VERIFIER_assert Derived contract for procedure __VERIFIER_assert. Requires: (1 <= \old(cond)) Ensures: (1 <= \old(cond)) RESULT: Ultimate proved your program to be correct! [2024-09-20 19:46:48,168 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