./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/nla-digbench-scaling/geo1-ll_valuebound20.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/geo1-ll_valuebound20.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 6fa47fed70646a19b2beeb4e0b89a260e8455b5fd506269be7803c38c9e5caa2 --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:22:50,482 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-09-20 19:22:50,552 INFO L114 SettingsManager]: Loading settings from /storage/repos/certificate-witnesses-artifact/automizer/config/svcomp-Reach-32bit-Automizer_Default.epf [2024-09-20 19:22:50,560 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-09-20 19:22:50,561 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-09-20 19:22:50,591 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-09-20 19:22:50,593 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-09-20 19:22:50,593 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-09-20 19:22:50,594 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-09-20 19:22:50,596 INFO L153 SettingsManager]: * Use memory slicer=true [2024-09-20 19:22:50,596 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-09-20 19:22:50,596 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-09-20 19:22:50,597 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-09-20 19:22:50,597 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-09-20 19:22:50,599 INFO L153 SettingsManager]: * Use SBE=true [2024-09-20 19:22:50,600 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-09-20 19:22:50,600 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-09-20 19:22:50,600 INFO L153 SettingsManager]: * sizeof long=4 [2024-09-20 19:22:50,600 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-09-20 19:22:50,601 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-09-20 19:22:50,601 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-09-20 19:22:50,604 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-09-20 19:22:50,604 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-09-20 19:22:50,605 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-09-20 19:22:50,605 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-09-20 19:22:50,605 INFO L153 SettingsManager]: * sizeof long double=12 [2024-09-20 19:22:50,605 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-09-20 19:22:50,606 INFO L153 SettingsManager]: * Use constant arrays=true [2024-09-20 19:22:50,606 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-09-20 19:22:50,606 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-09-20 19:22:50,606 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-09-20 19:22:50,607 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-09-20 19:22:50,607 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-09-20 19:22:50,607 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-09-20 19:22:50,608 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-09-20 19:22:50,608 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-09-20 19:22:50,608 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-09-20 19:22:50,608 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-09-20 19:22:50,609 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-09-20 19:22:50,609 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-09-20 19:22:50,609 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-09-20 19:22:50,610 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-09-20 19:22:50,611 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 -> 6fa47fed70646a19b2beeb4e0b89a260e8455b5fd506269be7803c38c9e5caa2 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:22:50,879 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-09-20 19:22:50,905 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-09-20 19:22:50,908 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-09-20 19:22:50,909 INFO L270 PluginConnector]: Initializing CDTParser... [2024-09-20 19:22:50,910 INFO L274 PluginConnector]: CDTParser initialized [2024-09-20 19:22:50,911 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/certificate-witnesses-artifact/automizer/../sv-benchmarks/c/nla-digbench-scaling/geo1-ll_valuebound20.c [2024-09-20 19:22:52,285 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-09-20 19:22:52,469 INFO L384 CDTParser]: Found 1 translation units. [2024-09-20 19:22:52,470 INFO L180 CDTParser]: Scanning /storage/repos/certificate-witnesses-artifact/sv-benchmarks/c/nla-digbench-scaling/geo1-ll_valuebound20.c [2024-09-20 19:22:52,476 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/certificate-witnesses-artifact/automizer/data/244f061b2/bcc4dc14b9ac4f71addc1564e51d6ee3/FLAG57f38007e [2024-09-20 19:22:52,851 INFO L435 CDTParser]: Successfully deleted /storage/repos/certificate-witnesses-artifact/automizer/data/244f061b2/bcc4dc14b9ac4f71addc1564e51d6ee3 [2024-09-20 19:22:52,854 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-09-20 19:22:52,855 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-09-20 19:22:52,859 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-09-20 19:22:52,859 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-09-20 19:22:52,864 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-09-20 19:22:52,865 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 20.09 07:22:52" (1/1) ... [2024-09-20 19:22:52,866 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@3198df1c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.09 07:22:52, skipping insertion in model container [2024-09-20 19:22:52,866 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 20.09 07:22:52" (1/1) ... [2024-09-20 19:22:52,884 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-09-20 19:22:53,019 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/geo1-ll_valuebound20.c[545,558] [2024-09-20 19:22:53,034 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-09-20 19:22:53,046 INFO L200 MainTranslator]: Completed pre-run [2024-09-20 19:22:53,062 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/geo1-ll_valuebound20.c[545,558] [2024-09-20 19:22:53,070 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-09-20 19:22:53,089 INFO L204 MainTranslator]: Completed translation [2024-09-20 19:22:53,089 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.09 07:22:53 WrapperNode [2024-09-20 19:22:53,090 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-09-20 19:22:53,091 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-09-20 19:22:53,092 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-09-20 19:22:53,092 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-09-20 19:22:53,098 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:22:53" (1/1) ... [2024-09-20 19:22:53,104 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:22:53" (1/1) ... [2024-09-20 19:22:53,111 INFO L138 Inliner]: procedures = 14, calls = 13, calls flagged for inlining = 0, calls inlined = 0, statements flattened = 0 [2024-09-20 19:22:53,112 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-09-20 19:22:53,113 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-09-20 19:22:53,113 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-09-20 19:22:53,113 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-09-20 19:22:53,123 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.09 07:22:53" (1/1) ... [2024-09-20 19:22:53,123 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.09 07:22:53" (1/1) ... [2024-09-20 19:22:53,128 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.09 07:22:53" (1/1) ... [2024-09-20 19:22:53,149 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:22:53,153 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.09 07:22:53" (1/1) ... [2024-09-20 19:22:53,153 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.09 07:22:53" (1/1) ... [2024-09-20 19:22:53,156 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.09 07:22:53" (1/1) ... [2024-09-20 19:22:53,159 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.09 07:22:53" (1/1) ... [2024-09-20 19:22:53,165 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.09 07:22:53" (1/1) ... [2024-09-20 19:22:53,166 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.09 07:22:53" (1/1) ... [2024-09-20 19:22:53,167 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-09-20 19:22:53,168 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-09-20 19:22:53,171 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-09-20 19:22:53,172 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-09-20 19:22:53,173 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.09 07:22:53" (1/1) ... [2024-09-20 19:22:53,178 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-09-20 19:22:53,188 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/certificate-witnesses-artifact/automizer/z3 [2024-09-20 19:22:53,205 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:22:53,208 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:22:53,249 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-09-20 19:22:53,250 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2024-09-20 19:22:53,250 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2024-09-20 19:22:53,250 INFO L130 BoogieDeclarations]: Found specification of procedure main [2024-09-20 19:22:53,250 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2024-09-20 19:22:53,250 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-09-20 19:22:53,250 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2024-09-20 19:22:53,252 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2024-09-20 19:22:53,252 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-09-20 19:22:53,252 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-09-20 19:22:53,253 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2024-09-20 19:22:53,253 INFO L138 BoogieDeclarations]: Found implementation of procedure __VERIFIER_assert [2024-09-20 19:22:53,308 INFO L242 CfgBuilder]: Building ICFG [2024-09-20 19:22:53,309 INFO L268 CfgBuilder]: Building CFG for each procedure with an implementation [2024-09-20 19:22:53,442 INFO L? ?]: Removed 7 outVars from TransFormulas that were not future-live. [2024-09-20 19:22:53,443 INFO L291 CfgBuilder]: Performing block encoding [2024-09-20 19:22:53,462 INFO L313 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-09-20 19:22:53,462 INFO L318 CfgBuilder]: Removed 1 assume(true) statements. [2024-09-20 19:22:53,463 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 20.09 07:22:53 BoogieIcfgContainer [2024-09-20 19:22:53,463 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-09-20 19:22:53,465 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-09-20 19:22:53,465 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-09-20 19:22:53,468 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-09-20 19:22:53,469 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 20.09 07:22:52" (1/3) ... [2024-09-20 19:22:53,469 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4226f3d9 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 20.09 07:22:53, skipping insertion in model container [2024-09-20 19:22:53,470 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.09 07:22:53" (2/3) ... [2024-09-20 19:22:53,470 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4226f3d9 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 20.09 07:22:53, skipping insertion in model container [2024-09-20 19:22:53,470 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 20.09 07:22:53" (3/3) ... [2024-09-20 19:22:53,471 INFO L112 eAbstractionObserver]: Analyzing ICFG geo1-ll_valuebound20.c [2024-09-20 19:22:53,485 INFO L209 ceAbstractionStarter]: Automizer settings: Hoare:All NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-09-20 19:22:53,486 INFO L149 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-09-20 19:22:53,562 INFO L335 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-09-20 19:22:53,572 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;@3281e842, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-09-20 19:22:53,572 INFO L337 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-09-20 19:22:53,576 INFO L276 IsEmpty]: Start isEmpty. Operand has 30 states, 16 states have (on average 1.375) internal successors, (22), 17 states have internal predecessors, (22), 8 states have call successors, (8), 4 states have call predecessors, (8), 4 states have return successors, (8), 8 states have call predecessors, (8), 8 states have call successors, (8) [2024-09-20 19:22:53,607 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2024-09-20 19:22:53,607 INFO L208 NwaCegarLoop]: Found error trace [2024-09-20 19:22:53,609 INFO L216 NwaCegarLoop]: trace histogram [4, 4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-09-20 19:22:53,609 INFO L399 AbstractCegarLoop]: === Iteration 1 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-09-20 19:22:53,614 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-20 19:22:53,615 INFO L85 PathProgramCache]: Analyzing trace with hash -615698490, now seen corresponding path program 1 times [2024-09-20 19:22:53,625 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-09-20 19:22:53,628 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1602839476] [2024-09-20 19:22:53,629 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-09-20 19:22:53,629 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-09-20 19:22:53,744 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-20 19:22:53,805 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2024-09-20 19:22:53,812 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-20 19:22:53,824 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-09-20 19:22:53,828 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-20 19:22:53,834 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-09-20 19:22:53,838 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-20 19:22:53,842 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2024-09-20 19:22:53,844 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-20 19:22:53,848 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2024-09-20 19:22:53,850 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-20 19:22:53,854 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 24 trivial. 0 not checked. [2024-09-20 19:22:53,855 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-09-20 19:22:53,855 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1602839476] [2024-09-20 19:22:53,856 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1602839476] provided 1 perfect and 0 imperfect interpolant sequences [2024-09-20 19:22:53,856 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-09-20 19:22:53,856 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-09-20 19:22:53,858 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1878363527] [2024-09-20 19:22:53,859 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-09-20 19:22:53,863 INFO L551 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-09-20 19:22:53,863 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-09-20 19:22:53,884 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-09-20 19:22:53,885 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-09-20 19:22:53,887 INFO L87 Difference]: Start difference. First operand has 30 states, 16 states have (on average 1.375) internal successors, (22), 17 states have internal predecessors, (22), 8 states have call successors, (8), 4 states have call predecessors, (8), 4 states have return successors, (8), 8 states have call predecessors, (8), 8 states have call successors, (8) Second operand has 2 states, 2 states have (on average 5.5) internal successors, (11), 2 states have internal predecessors, (11), 2 states have call successors, (7), 2 states have call predecessors, (7), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2024-09-20 19:22:53,918 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-09-20 19:22:53,918 INFO L93 Difference]: Finished difference Result 54 states and 75 transitions. [2024-09-20 19:22:53,920 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-09-20 19:22:53,921 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 5.5) internal successors, (11), 2 states have internal predecessors, (11), 2 states have call successors, (7), 2 states have call predecessors, (7), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) Word has length 32 [2024-09-20 19:22:53,921 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-09-20 19:22:53,927 INFO L225 Difference]: With dead ends: 54 [2024-09-20 19:22:53,928 INFO L226 Difference]: Without dead ends: 26 [2024-09-20 19:22:53,931 INFO L433 NwaCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 16 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:22:53,934 INFO L434 NwaCegarLoop]: 32 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, 32 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:22:53,935 INFO L435 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 32 Invalid, 2 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 2 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-09-20 19:22:53,953 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 26 states. [2024-09-20 19:22:53,967 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 26 to 26. [2024-09-20 19:22:53,968 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 26 states, 14 states have (on average 1.1428571428571428) internal successors, (16), 15 states have internal predecessors, (16), 8 states have call successors, (8), 4 states have call predecessors, (8), 3 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2024-09-20 19:22:53,970 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 26 states to 26 states and 30 transitions. [2024-09-20 19:22:53,971 INFO L78 Accepts]: Start accepts. Automaton has 26 states and 30 transitions. Word has length 32 [2024-09-20 19:22:53,971 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-09-20 19:22:53,972 INFO L474 AbstractCegarLoop]: Abstraction has 26 states and 30 transitions. [2024-09-20 19:22:53,972 INFO L475 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 5.5) internal successors, (11), 2 states have internal predecessors, (11), 2 states have call successors, (7), 2 states have call predecessors, (7), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2024-09-20 19:22:53,972 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-20 19:22:53,973 INFO L276 IsEmpty]: Start isEmpty. Operand 26 states and 30 transitions. [2024-09-20 19:22:53,974 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2024-09-20 19:22:53,974 INFO L208 NwaCegarLoop]: Found error trace [2024-09-20 19:22:53,974 INFO L216 NwaCegarLoop]: trace histogram [4, 4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-09-20 19:22:53,975 WARN L456 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-09-20 19:22:53,975 INFO L399 AbstractCegarLoop]: === Iteration 2 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-09-20 19:22:53,975 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-20 19:22:53,976 INFO L85 PathProgramCache]: Analyzing trace with hash 1799814794, now seen corresponding path program 1 times [2024-09-20 19:22:53,976 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-09-20 19:22:53,976 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [281949198] [2024-09-20 19:22:53,976 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-09-20 19:22:53,976 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-09-20 19:22:54,018 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unknown [2024-09-20 19:22:54,021 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [924921426] [2024-09-20 19:22:54,021 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-09-20 19:22:54,022 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-09-20 19:22:54,022 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/certificate-witnesses-artifact/automizer/z3 [2024-09-20 19:22:54,024 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:22:54,025 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:22:54,092 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-20 19:22:54,094 INFO L262 TraceCheckSpWp]: Trace formula consists of 84 conjuncts, 7 conjuncts are in the unsatisfiable core [2024-09-20 19:22:54,100 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2024-09-20 19:22:54,216 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 24 trivial. 0 not checked. [2024-09-20 19:22:54,217 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-09-20 19:22:54,218 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-09-20 19:22:54,219 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [281949198] [2024-09-20 19:22:54,220 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2024-09-20 19:22:54,220 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [924921426] [2024-09-20 19:22:54,222 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [924921426] provided 1 perfect and 0 imperfect interpolant sequences [2024-09-20 19:22:54,222 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-09-20 19:22:54,222 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-09-20 19:22:54,223 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1904974426] [2024-09-20 19:22:54,223 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-09-20 19:22:54,224 INFO L551 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-09-20 19:22:54,224 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-09-20 19:22:54,225 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-09-20 19:22:54,225 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-09-20 19:22:54,226 INFO L87 Difference]: Start difference. First operand 26 states and 30 transitions. Second operand has 5 states, 5 states have (on average 2.2) internal successors, (11), 4 states have internal predecessors, (11), 2 states have call successors, (7), 2 states have call predecessors, (7), 1 states have return successors, (5), 1 states have call predecessors, (5), 1 states have call successors, (5) [2024-09-20 19:22:54,288 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-09-20 19:22:54,288 INFO L93 Difference]: Finished difference Result 36 states and 41 transitions. [2024-09-20 19:22:54,289 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-09-20 19:22:54,289 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 2.2) internal successors, (11), 4 states have internal predecessors, (11), 2 states have call successors, (7), 2 states have call predecessors, (7), 1 states have return successors, (5), 1 states have call predecessors, (5), 1 states have call successors, (5) Word has length 32 [2024-09-20 19:22:54,289 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-09-20 19:22:54,290 INFO L225 Difference]: With dead ends: 36 [2024-09-20 19:22:54,291 INFO L226 Difference]: Without dead ends: 34 [2024-09-20 19:22:54,291 INFO L433 NwaCegarLoop]: 0 DeclaredPredicates, 32 GetRequests, 28 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:22:54,293 INFO L434 NwaCegarLoop]: 24 mSDtfsCounter, 4 mSDsluCounter, 69 mSDsCounter, 0 mSdLazyCounter, 26 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 5 SdHoareTripleChecker+Valid, 93 SdHoareTripleChecker+Invalid, 26 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 26 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-09-20 19:22:54,295 INFO L435 NwaCegarLoop]: SdHoareTripleChecker [5 Valid, 93 Invalid, 26 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 26 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-09-20 19:22:54,296 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 34 states. [2024-09-20 19:22:54,310 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 34 to 32. [2024-09-20 19:22:54,313 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 32 states, 18 states have (on average 1.1111111111111112) internal successors, (20), 20 states have internal predecessors, (20), 9 states have call successors, (9), 5 states have call predecessors, (9), 4 states have return successors, (7), 6 states have call predecessors, (7), 7 states have call successors, (7) [2024-09-20 19:22:54,314 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 32 states to 32 states and 36 transitions. [2024-09-20 19:22:54,314 INFO L78 Accepts]: Start accepts. Automaton has 32 states and 36 transitions. Word has length 32 [2024-09-20 19:22:54,316 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-09-20 19:22:54,316 INFO L474 AbstractCegarLoop]: Abstraction has 32 states and 36 transitions. [2024-09-20 19:22:54,316 INFO L475 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 2.2) internal successors, (11), 4 states have internal predecessors, (11), 2 states have call successors, (7), 2 states have call predecessors, (7), 1 states have return successors, (5), 1 states have call predecessors, (5), 1 states have call successors, (5) [2024-09-20 19:22:54,317 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-20 19:22:54,319 INFO L276 IsEmpty]: Start isEmpty. Operand 32 states and 36 transitions. [2024-09-20 19:22:54,320 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 40 [2024-09-20 19:22:54,320 INFO L208 NwaCegarLoop]: Found error trace [2024-09-20 19:22:54,322 INFO L216 NwaCegarLoop]: trace histogram [4, 4, 4, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-09-20 19:22:54,340 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:22:54,523 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:22:54,523 INFO L399 AbstractCegarLoop]: === Iteration 3 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-09-20 19:22:54,524 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-20 19:22:54,524 INFO L85 PathProgramCache]: Analyzing trace with hash -1396019833, now seen corresponding path program 1 times [2024-09-20 19:22:54,524 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-09-20 19:22:54,524 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1320022644] [2024-09-20 19:22:54,524 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-09-20 19:22:54,525 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-09-20 19:22:54,576 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-20 19:22:54,932 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2024-09-20 19:22:54,935 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-20 19:22:54,940 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-09-20 19:22:54,941 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-20 19:22:54,943 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-09-20 19:22:54,944 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-20 19:22:54,946 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2024-09-20 19:22:54,948 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-20 19:22:54,949 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2024-09-20 19:22:54,950 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-20 19:22:54,952 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28 [2024-09-20 19:22:54,955 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-20 19:22:54,992 INFO L134 CoverageAnalysis]: Checked inductivity of 26 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 24 trivial. 0 not checked. [2024-09-20 19:22:54,992 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-09-20 19:22:54,992 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1320022644] [2024-09-20 19:22:54,992 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1320022644] provided 0 perfect and 1 imperfect interpolant sequences [2024-09-20 19:22:54,993 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [254678961] [2024-09-20 19:22:54,993 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-09-20 19:22:54,993 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-09-20 19:22:54,993 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/certificate-witnesses-artifact/automizer/z3 [2024-09-20 19:22:54,996 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:22:54,998 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:22:55,060 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-20 19:22:55,063 INFO L262 TraceCheckSpWp]: Trace formula consists of 96 conjuncts, 9 conjuncts are in the unsatisfiable core [2024-09-20 19:22:55,066 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2024-09-20 19:22:55,248 INFO L134 CoverageAnalysis]: Checked inductivity of 26 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 24 trivial. 0 not checked. [2024-09-20 19:22:55,249 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-09-20 19:22:55,249 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [254678961] provided 1 perfect and 0 imperfect interpolant sequences [2024-09-20 19:22:55,249 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-09-20 19:22:55,249 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [7] total 11 [2024-09-20 19:22:55,249 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [855953987] [2024-09-20 19:22:55,250 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-09-20 19:22:55,250 INFO L551 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-09-20 19:22:55,250 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-09-20 19:22:55,251 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-09-20 19:22:55,251 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=87, Unknown=0, NotChecked=0, Total=110 [2024-09-20 19:22:55,252 INFO L87 Difference]: Start difference. First operand 32 states and 36 transitions. Second operand has 6 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 3 states have call successors, (8), 2 states have call predecessors, (8), 1 states have return successors, (6), 2 states have call predecessors, (6), 2 states have call successors, (6) [2024-09-20 19:22:55,314 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-09-20 19:22:55,314 INFO L93 Difference]: Finished difference Result 41 states and 45 transitions. [2024-09-20 19:22:55,314 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-09-20 19:22:55,314 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 3 states have call successors, (8), 2 states have call predecessors, (8), 1 states have return successors, (6), 2 states have call predecessors, (6), 2 states have call successors, (6) Word has length 39 [2024-09-20 19:22:55,315 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-09-20 19:22:55,316 INFO L225 Difference]: With dead ends: 41 [2024-09-20 19:22:55,316 INFO L226 Difference]: Without dead ends: 33 [2024-09-20 19:22:55,316 INFO L433 NwaCegarLoop]: 0 DeclaredPredicates, 58 GetRequests, 48 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=29, Invalid=103, Unknown=0, NotChecked=0, Total=132 [2024-09-20 19:22:55,317 INFO L434 NwaCegarLoop]: 24 mSDtfsCounter, 3 mSDsluCounter, 91 mSDsCounter, 0 mSdLazyCounter, 34 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3 SdHoareTripleChecker+Valid, 115 SdHoareTripleChecker+Invalid, 35 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 34 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-09-20 19:22:55,318 INFO L435 NwaCegarLoop]: SdHoareTripleChecker [3 Valid, 115 Invalid, 35 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 34 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-09-20 19:22:55,318 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 33 states. [2024-09-20 19:22:55,323 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 33 to 33. [2024-09-20 19:22:55,323 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 33 states, 19 states have (on average 1.105263157894737) internal successors, (21), 20 states have internal predecessors, (21), 9 states have call successors, (9), 5 states have call predecessors, (9), 4 states have return successors, (7), 7 states have call predecessors, (7), 7 states have call successors, (7) [2024-09-20 19:22:55,325 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 33 states to 33 states and 37 transitions. [2024-09-20 19:22:55,327 INFO L78 Accepts]: Start accepts. Automaton has 33 states and 37 transitions. Word has length 39 [2024-09-20 19:22:55,327 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-09-20 19:22:55,327 INFO L474 AbstractCegarLoop]: Abstraction has 33 states and 37 transitions. [2024-09-20 19:22:55,328 INFO L475 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 3 states have call successors, (8), 2 states have call predecessors, (8), 1 states have return successors, (6), 2 states have call predecessors, (6), 2 states have call successors, (6) [2024-09-20 19:22:55,329 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-20 19:22:55,329 INFO L276 IsEmpty]: Start isEmpty. Operand 33 states and 37 transitions. [2024-09-20 19:22:55,330 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 40 [2024-09-20 19:22:55,331 INFO L208 NwaCegarLoop]: Found error trace [2024-09-20 19:22:55,331 INFO L216 NwaCegarLoop]: trace histogram [4, 4, 4, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-09-20 19:22:55,348 INFO L552 MonitoredProcess]: [MP /storage/repos/certificate-witnesses-artifact/automizer/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Ended with exit code 0 [2024-09-20 19:22:55,532 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:22:55,532 INFO L399 AbstractCegarLoop]: === Iteration 4 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-09-20 19:22:55,533 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-20 19:22:55,533 INFO L85 PathProgramCache]: Analyzing trace with hash -1348056323, now seen corresponding path program 1 times [2024-09-20 19:22:55,533 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-09-20 19:22:55,533 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [672404918] [2024-09-20 19:22:55,533 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-09-20 19:22:55,534 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-09-20 19:22:55,569 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unknown [2024-09-20 19:22:55,573 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [847491644] [2024-09-20 19:22:55,574 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-09-20 19:22:55,574 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-09-20 19:22:55,576 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/certificate-witnesses-artifact/automizer/z3 [2024-09-20 19:22:55,578 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:22:55,581 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:22:55,641 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-20 19:22:55,645 INFO L262 TraceCheckSpWp]: Trace formula consists of 101 conjuncts, 16 conjuncts are in the unsatisfiable core [2024-09-20 19:22:55,648 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2024-09-20 19:22:55,801 INFO L134 CoverageAnalysis]: Checked inductivity of 28 backedges. 8 proven. 5 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2024-09-20 19:22:55,801 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2024-09-20 19:23:00,029 INFO L134 CoverageAnalysis]: Checked inductivity of 28 backedges. 2 proven. 0 refuted. 2 times theorem prover too weak. 24 trivial. 0 not checked. [2024-09-20 19:23:00,029 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-09-20 19:23:00,029 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [672404918] [2024-09-20 19:23:00,030 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2024-09-20 19:23:00,030 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [847491644] [2024-09-20 19:23:00,030 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [847491644] provided 0 perfect and 2 imperfect interpolant sequences [2024-09-20 19:23:00,030 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-09-20 19:23:00,030 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 6] total 11 [2024-09-20 19:23:00,030 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [126612535] [2024-09-20 19:23:00,030 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-09-20 19:23:00,031 INFO L551 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2024-09-20 19:23:00,031 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-09-20 19:23:00,031 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2024-09-20 19:23:00,032 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=84, Unknown=1, NotChecked=0, Total=110 [2024-09-20 19:23:00,032 INFO L87 Difference]: Start difference. First operand 33 states and 37 transitions. Second operand has 11 states, 11 states have (on average 2.090909090909091) internal successors, (23), 9 states have internal predecessors, (23), 6 states have call successors, (11), 2 states have call predecessors, (11), 2 states have return successors, (9), 4 states have call predecessors, (9), 4 states have call successors, (9) [2024-09-20 19:23:08,263 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.01s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers [] [2024-09-20 19:23:20,304 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers [] [2024-09-20 19:23:24,429 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.12s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers [] [2024-09-20 19:23:28,439 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers [] [2024-09-20 19:23:32,447 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.01s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers [] [2024-09-20 19:23:36,453 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.01s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers [] [2024-09-20 19:23:36,612 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-09-20 19:23:36,612 INFO L93 Difference]: Finished difference Result 51 states and 60 transitions. [2024-09-20 19:23:36,613 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2024-09-20 19:23:36,613 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 11 states have (on average 2.090909090909091) internal successors, (23), 9 states have internal predecessors, (23), 6 states have call successors, (11), 2 states have call predecessors, (11), 2 states have return successors, (9), 4 states have call predecessors, (9), 4 states have call successors, (9) Word has length 39 [2024-09-20 19:23:36,613 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-09-20 19:23:36,615 INFO L225 Difference]: With dead ends: 51 [2024-09-20 19:23:36,615 INFO L226 Difference]: Without dead ends: 49 [2024-09-20 19:23:36,615 INFO L433 NwaCegarLoop]: 0 DeclaredPredicates, 80 GetRequests, 66 SyntacticMatches, 2 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 16 ImplicationChecksByTransitivity, 16.3s TimeCoverageRelationStatistics Valid=43, Invalid=136, Unknown=3, NotChecked=0, Total=182 [2024-09-20 19:23:36,617 INFO L434 NwaCegarLoop]: 20 mSDtfsCounter, 18 mSDsluCounter, 138 mSDsCounter, 0 mSdLazyCounter, 128 mSolverCounterSat, 6 mSolverCounterUnsat, 6 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 24.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 20 SdHoareTripleChecker+Valid, 158 SdHoareTripleChecker+Invalid, 140 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 128 IncrementalHoareTripleChecker+Invalid, 6 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 24.4s IncrementalHoareTripleChecker+Time [2024-09-20 19:23:36,617 INFO L435 NwaCegarLoop]: SdHoareTripleChecker [20 Valid, 158 Invalid, 140 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 128 Invalid, 6 Unknown, 0 Unchecked, 24.4s Time] [2024-09-20 19:23:36,618 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 49 states. [2024-09-20 19:23:36,631 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 49 to 45. [2024-09-20 19:23:36,632 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 45 states, 27 states have (on average 1.1481481481481481) internal successors, (31), 29 states have internal predecessors, (31), 12 states have call successors, (12), 6 states have call predecessors, (12), 5 states have return successors, (10), 9 states have call predecessors, (10), 10 states have call successors, (10) [2024-09-20 19:23:36,633 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 45 states to 45 states and 53 transitions. [2024-09-20 19:23:36,633 INFO L78 Accepts]: Start accepts. Automaton has 45 states and 53 transitions. Word has length 39 [2024-09-20 19:23:36,633 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-09-20 19:23:36,633 INFO L474 AbstractCegarLoop]: Abstraction has 45 states and 53 transitions. [2024-09-20 19:23:36,634 INFO L475 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 2.090909090909091) internal successors, (23), 9 states have internal predecessors, (23), 6 states have call successors, (11), 2 states have call predecessors, (11), 2 states have return successors, (9), 4 states have call predecessors, (9), 4 states have call successors, (9) [2024-09-20 19:23:36,634 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-20 19:23:36,634 INFO L276 IsEmpty]: Start isEmpty. Operand 45 states and 53 transitions. [2024-09-20 19:23:36,635 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 47 [2024-09-20 19:23:36,635 INFO L208 NwaCegarLoop]: Found error trace [2024-09-20 19:23:36,635 INFO L216 NwaCegarLoop]: trace histogram [4, 4, 4, 3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-09-20 19:23:36,650 INFO L552 MonitoredProcess]: [MP /storage/repos/certificate-witnesses-artifact/automizer/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Ended with exit code 0 [2024-09-20 19:23:36,836 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:23:36,837 INFO L399 AbstractCegarLoop]: === Iteration 5 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-09-20 19:23:36,837 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-20 19:23:36,837 INFO L85 PathProgramCache]: Analyzing trace with hash 319080884, now seen corresponding path program 1 times [2024-09-20 19:23:36,837 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-09-20 19:23:36,837 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [204392319] [2024-09-20 19:23:36,837 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-09-20 19:23:36,837 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-09-20 19:23:36,864 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-20 19:23:37,071 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2024-09-20 19:23:37,073 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-20 19:23:37,074 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-09-20 19:23:37,077 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-20 19:23:37,083 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-09-20 19:23:37,084 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-20 19:23:37,086 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2024-09-20 19:23:37,090 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-20 19:23:37,092 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2024-09-20 19:23:37,094 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-20 19:23:37,095 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28 [2024-09-20 19:23:37,097 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-20 19:23:37,099 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2024-09-20 19:23:37,100 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-20 19:23:37,124 INFO L134 CoverageAnalysis]: Checked inductivity of 35 backedges. 7 proven. 1 refuted. 0 times theorem prover too weak. 27 trivial. 0 not checked. [2024-09-20 19:23:37,124 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-09-20 19:23:37,125 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [204392319] [2024-09-20 19:23:37,125 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [204392319] provided 0 perfect and 1 imperfect interpolant sequences [2024-09-20 19:23:37,125 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [3914380] [2024-09-20 19:23:37,125 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-09-20 19:23:37,125 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-09-20 19:23:37,126 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/certificate-witnesses-artifact/automizer/z3 [2024-09-20 19:23:37,127 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:23:37,128 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:23:37,192 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-20 19:23:37,196 INFO L262 TraceCheckSpWp]: Trace formula consists of 113 conjuncts, 10 conjuncts are in the unsatisfiable core [2024-09-20 19:23:37,198 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2024-09-20 19:23:45,659 INFO L134 CoverageAnalysis]: Checked inductivity of 35 backedges. 7 proven. 1 refuted. 0 times theorem prover too weak. 27 trivial. 0 not checked. [2024-09-20 19:23:45,659 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2024-09-20 19:23:45,907 INFO L134 CoverageAnalysis]: Checked inductivity of 35 backedges. 7 proven. 1 refuted. 0 times theorem prover too weak. 27 trivial. 0 not checked. [2024-09-20 19:23:45,909 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [3914380] provided 0 perfect and 2 imperfect interpolant sequences [2024-09-20 19:23:45,910 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-09-20 19:23:45,910 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 8, 8] total 11 [2024-09-20 19:23:45,910 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [718702235] [2024-09-20 19:23:45,910 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-09-20 19:23:45,911 INFO L551 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2024-09-20 19:23:45,911 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-09-20 19:23:45,911 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2024-09-20 19:23:45,911 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=83, Unknown=2, NotChecked=0, Total=110 [2024-09-20 19:23:45,912 INFO L87 Difference]: Start difference. First operand 45 states and 53 transitions. Second operand has 11 states, 9 states have (on average 2.7777777777777777) internal successors, (25), 10 states have internal predecessors, (25), 3 states have call successors, (10), 3 states have call predecessors, (10), 2 states have return successors, (7), 2 states have call predecessors, (7), 1 states have call successors, (7) [2024-09-20 19:23:49,940 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.01s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers [0] [2024-09-20 19:23:53,989 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers [0] [2024-09-20 19:23:58,088 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.01s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers [0] [2024-09-20 19:24:02,127 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.04s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers [] [2024-09-20 19:24:06,159 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.01s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers [0] [2024-09-20 19:24:06,227 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-09-20 19:24:06,227 INFO L93 Difference]: Finished difference Result 51 states and 58 transitions. [2024-09-20 19:24:06,227 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-09-20 19:24:06,227 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 9 states have (on average 2.7777777777777777) internal successors, (25), 10 states have internal predecessors, (25), 3 states have call successors, (10), 3 states have call predecessors, (10), 2 states have return successors, (7), 2 states have call predecessors, (7), 1 states have call successors, (7) Word has length 46 [2024-09-20 19:24:06,228 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-09-20 19:24:06,230 INFO L225 Difference]: With dead ends: 51 [2024-09-20 19:24:06,230 INFO L226 Difference]: Without dead ends: 43 [2024-09-20 19:24:06,230 INFO L433 NwaCegarLoop]: 0 DeclaredPredicates, 113 GetRequests, 98 SyntacticMatches, 5 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 13 ImplicationChecksByTransitivity, 8.4s TimeCoverageRelationStatistics Valid=33, Invalid=97, Unknown=2, NotChecked=0, Total=132 [2024-09-20 19:24:06,231 INFO L434 NwaCegarLoop]: 23 mSDtfsCounter, 4 mSDsluCounter, 125 mSDsCounter, 0 mSdLazyCounter, 51 mSolverCounterSat, 3 mSolverCounterUnsat, 5 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 20.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4 SdHoareTripleChecker+Valid, 148 SdHoareTripleChecker+Invalid, 59 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 51 IncrementalHoareTripleChecker+Invalid, 5 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 20.3s IncrementalHoareTripleChecker+Time [2024-09-20 19:24:06,231 INFO L435 NwaCegarLoop]: SdHoareTripleChecker [4 Valid, 148 Invalid, 59 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 51 Invalid, 5 Unknown, 0 Unchecked, 20.3s Time] [2024-09-20 19:24:06,232 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 43 states. [2024-09-20 19:24:06,241 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 43 to 43. [2024-09-20 19:24:06,242 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 43 states, 26 states have (on average 1.0384615384615385) internal successors, (27), 27 states have internal predecessors, (27), 11 states have call successors, (11), 6 states have call predecessors, (11), 5 states have return successors, (10), 9 states have call predecessors, (10), 10 states have call successors, (10) [2024-09-20 19:24:06,243 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 43 states to 43 states and 48 transitions. [2024-09-20 19:24:06,243 INFO L78 Accepts]: Start accepts. Automaton has 43 states and 48 transitions. Word has length 46 [2024-09-20 19:24:06,243 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-09-20 19:24:06,243 INFO L474 AbstractCegarLoop]: Abstraction has 43 states and 48 transitions. [2024-09-20 19:24:06,244 INFO L475 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 9 states have (on average 2.7777777777777777) internal successors, (25), 10 states have internal predecessors, (25), 3 states have call successors, (10), 3 states have call predecessors, (10), 2 states have return successors, (7), 2 states have call predecessors, (7), 1 states have call successors, (7) [2024-09-20 19:24:06,244 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-20 19:24:06,244 INFO L276 IsEmpty]: Start isEmpty. Operand 43 states and 48 transitions. [2024-09-20 19:24:06,245 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 61 [2024-09-20 19:24:06,245 INFO L208 NwaCegarLoop]: Found error trace [2024-09-20 19:24:06,246 INFO L216 NwaCegarLoop]: trace histogram [5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-09-20 19:24:06,263 INFO L540 MonitoredProcess]: [MP /storage/repos/certificate-witnesses-artifact/automizer/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Forceful destruction successful, exit code 0 [2024-09-20 19:24:06,446 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:24:06,446 INFO L399 AbstractCegarLoop]: === Iteration 6 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-09-20 19:24:06,447 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-20 19:24:06,447 INFO L85 PathProgramCache]: Analyzing trace with hash -409552950, now seen corresponding path program 2 times [2024-09-20 19:24:06,447 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-09-20 19:24:06,447 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [876183445] [2024-09-20 19:24:06,447 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-09-20 19:24:06,447 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-09-20 19:24:06,502 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unknown [2024-09-20 19:24:06,503 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [956046903] [2024-09-20 19:24:06,504 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2024-09-20 19:24:06,504 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-09-20 19:24:06,504 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/certificate-witnesses-artifact/automizer/z3 [2024-09-20 19:24:06,508 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:24:06,509 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:24:06,623 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2024-09-20 19:24:06,623 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2024-09-20 19:24:06,624 INFO L262 TraceCheckSpWp]: Trace formula consists of 152 conjuncts, 41 conjuncts are in the unsatisfiable core [2024-09-20 19:24:06,628 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2024-09-20 19:24:07,282 INFO L134 CoverageAnalysis]: Checked inductivity of 82 backedges. 19 proven. 36 refuted. 0 times theorem prover too weak. 27 trivial. 0 not checked. [2024-09-20 19:24:07,283 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2024-09-20 19:24:24,181 WARN L876 $PredicateComparison]: unable to prove that (or (not (= (mod (+ (* c_main_~x~0 c_main_~z~0) (* 18446744073709551615 c_main_~x~0) (* 18446744073709551615 c_main_~y~0) 1) 18446744073709551616) 0)) (= (mod (+ (* c_main_~x~0 c_main_~z~0 c_main_~z~0) (* 18446744073709551615 c_main_~y~0 c_main_~z~0) (* 18446744073709551615 c_main_~x~0 c_main_~z~0) c_main_~z~0) 18446744073709551616) 0)) is different from true [2024-09-20 19:24:44,530 WARN L876 $PredicateComparison]: unable to prove that (or (not (= (mod (+ (* c_main_~x~0 c_main_~z~0 c_main_~z~0) (* 18446744073709551615 c_main_~y~0 c_main_~z~0) (* 18446744073709551615 c_main_~x~0 c_main_~z~0) c_main_~z~0) 18446744073709551616) 0)) (= (mod (+ (* c_main_~x~0 c_main_~z~0 c_main_~z~0 c_main_~z~0) (* 18446744073709551615 c_main_~x~0 c_main_~z~0 c_main_~z~0) (* 18446744073709551615 c_main_~y~0 c_main_~z~0 c_main_~z~0) (* c_main_~z~0 c_main_~z~0)) 18446744073709551616) 0)) is different from true [2024-09-20 19:25:12,883 WARN L876 $PredicateComparison]: unable to prove that (or (= (mod (+ (* c_main_~x~0 c_main_~z~0 c_main_~z~0 c_main_~z~0 c_main_~z~0) (* c_main_~z~0 c_main_~z~0 c_main_~z~0) (* 18446744073709551615 c_main_~x~0 c_main_~z~0 c_main_~z~0 c_main_~z~0) (* 18446744073709551615 c_main_~y~0 c_main_~z~0 c_main_~z~0 c_main_~z~0)) 18446744073709551616) 0) (not (= (mod (+ (* c_main_~x~0 c_main_~z~0 c_main_~z~0 c_main_~z~0) (* 18446744073709551615 c_main_~x~0 c_main_~z~0 c_main_~z~0) (* 18446744073709551615 c_main_~y~0 c_main_~z~0 c_main_~z~0) (* c_main_~z~0 c_main_~z~0)) 18446744073709551616) 0))) is different from true [2024-09-20 19:25:42,159 WARN L876 $PredicateComparison]: unable to prove that (or (= (mod (+ (* 18446744073709551615 c_main_~y~0 c_main_~z~0 c_main_~z~0 c_main_~z~0 c_main_~z~0) (* c_main_~x~0 c_main_~z~0 c_main_~z~0 c_main_~z~0 c_main_~z~0 c_main_~z~0) (* c_main_~z~0 c_main_~z~0 c_main_~z~0 c_main_~z~0) (* 18446744073709551615 c_main_~x~0 c_main_~z~0 c_main_~z~0 c_main_~z~0 c_main_~z~0)) 18446744073709551616) 0) (not (= (mod (+ (* c_main_~x~0 c_main_~z~0 c_main_~z~0 c_main_~z~0 c_main_~z~0) (* c_main_~z~0 c_main_~z~0 c_main_~z~0) (* 18446744073709551615 c_main_~x~0 c_main_~z~0 c_main_~z~0 c_main_~z~0) (* 18446744073709551615 c_main_~y~0 c_main_~z~0 c_main_~z~0 c_main_~z~0)) 18446744073709551616) 0))) is different from true [2024-09-20 19:25:58,404 INFO L134 CoverageAnalysis]: Checked inductivity of 82 backedges. 16 proven. 1 refuted. 0 times theorem prover too weak. 39 trivial. 26 not checked. [2024-09-20 19:25:58,404 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-09-20 19:25:58,404 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [876183445] [2024-09-20 19:25:58,405 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2024-09-20 19:25:58,405 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [956046903] [2024-09-20 19:25:58,405 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [956046903] provided 0 perfect and 2 imperfect interpolant sequences [2024-09-20 19:25:58,405 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-09-20 19:25:58,405 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [15, 11] total 23 [2024-09-20 19:25:58,405 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1827407736] [2024-09-20 19:25:58,405 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-09-20 19:25:58,406 INFO L551 AbstractCegarLoop]: INTERPOLANT automaton has 23 states [2024-09-20 19:25:58,406 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-09-20 19:25:58,406 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 23 interpolants. [2024-09-20 19:25:58,407 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=69, Invalid=284, Unknown=5, NotChecked=148, Total=506 [2024-09-20 19:25:58,407 INFO L87 Difference]: Start difference. First operand 43 states and 48 transitions. Second operand has 23 states, 23 states have (on average 1.8695652173913044) internal successors, (43), 20 states have internal predecessors, (43), 13 states have call successors, (19), 3 states have call predecessors, (19), 3 states have return successors, (17), 11 states have call predecessors, (17), 11 states have call successors, (17) [2024-09-20 19:26:04,295 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.30s for a HTC check with result VALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers [] [2024-09-20 19:26:07,006 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.71s for a HTC check with result VALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers [] [2024-09-20 19:26:07,007 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-09-20 19:26:07,007 INFO L93 Difference]: Finished difference Result 47 states and 53 transitions. [2024-09-20 19:26:07,009 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2024-09-20 19:26:07,009 INFO L78 Accepts]: Start accepts. Automaton has has 23 states, 23 states have (on average 1.8695652173913044) internal successors, (43), 20 states have internal predecessors, (43), 13 states have call successors, (19), 3 states have call predecessors, (19), 3 states have return successors, (17), 11 states have call predecessors, (17), 11 states have call successors, (17) Word has length 60 [2024-09-20 19:26:07,010 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-09-20 19:26:07,010 INFO L225 Difference]: With dead ends: 47 [2024-09-20 19:26:07,010 INFO L226 Difference]: Without dead ends: 0 [2024-09-20 19:26:07,011 INFO L433 NwaCegarLoop]: 0 DeclaredPredicates, 125 GetRequests, 98 SyntacticMatches, 4 SemanticMatches, 23 ConstructedPredicates, 4 IntricatePredicates, 0 DeprecatedPredicates, 65 ImplicationChecksByTransitivity, 24.2s TimeCoverageRelationStatistics Valid=88, Invalid=343, Unknown=5, NotChecked=164, Total=600 [2024-09-20 19:26:07,012 INFO L434 NwaCegarLoop]: 22 mSDtfsCounter, 7 mSDsluCounter, 193 mSDsCounter, 0 mSdLazyCounter, 208 mSolverCounterSat, 12 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 5.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 8 SdHoareTripleChecker+Valid, 215 SdHoareTripleChecker+Invalid, 389 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 12 IncrementalHoareTripleChecker+Valid, 208 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 169 IncrementalHoareTripleChecker+Unchecked, 5.3s IncrementalHoareTripleChecker+Time [2024-09-20 19:26:07,012 INFO L435 NwaCegarLoop]: SdHoareTripleChecker [8 Valid, 215 Invalid, 389 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [12 Valid, 208 Invalid, 0 Unknown, 169 Unchecked, 5.3s Time] [2024-09-20 19:26:07,012 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2024-09-20 19:26:07,012 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2024-09-20 19:26:07,013 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:26:07,013 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2024-09-20 19:26:07,013 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 60 [2024-09-20 19:26:07,013 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-09-20 19:26:07,013 INFO L474 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2024-09-20 19:26:07,014 INFO L475 AbstractCegarLoop]: INTERPOLANT automaton has has 23 states, 23 states have (on average 1.8695652173913044) internal successors, (43), 20 states have internal predecessors, (43), 13 states have call successors, (19), 3 states have call predecessors, (19), 3 states have return successors, (17), 11 states have call predecessors, (17), 11 states have call successors, (17) [2024-09-20 19:26:07,014 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-20 19:26:07,014 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2024-09-20 19:26:07,014 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2024-09-20 19:26:07,017 INFO L785 garLoopResultBuilder]: Registering result SAFE for location __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2024-09-20 19:26:07,034 INFO L552 MonitoredProcess]: [MP /storage/repos/certificate-witnesses-artifact/automizer/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Ended with exit code 0 [2024-09-20 19:26:07,217 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:26:07,220 INFO L408 BasicCegarLoop]: Path program histogram: [2, 1, 1, 1, 1] [2024-09-20 19:26:07,222 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2024-09-20 19:26:12,422 WARN L293 SmtUtils]: Spent 5.14s on a formula simplification. DAG size of input: 51 DAG size of output: 17 (called from [L 162] de.uni_freiburg.informatik.ultimate.lib.proofs.floydhoare.HoareAnnotationComposer.combineInter) [2024-09-20 19:26:25,738 WARN L293 SmtUtils]: Spent 8.27s on a formula simplification that was a NOOP. DAG size: 21 (called from [L 162] de.uni_freiburg.informatik.ultimate.lib.proofs.floydhoare.HoareAnnotationComposer.combineInter) [2024-09-20 19:26:25,837 INFO L165 ceAbstractionStarter]: Computing trace abstraction results [2024-09-20 19:26:25,851 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 20.09 07:26:25 BoogieIcfgContainer [2024-09-20 19:26:25,851 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2024-09-20 19:26:25,852 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2024-09-20 19:26:25,852 INFO L270 PluginConnector]: Initializing Witness Printer... [2024-09-20 19:26:25,852 INFO L274 PluginConnector]: Witness Printer initialized [2024-09-20 19:26:25,852 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 20.09 07:22:53" (3/4) ... [2024-09-20 19:26:25,854 INFO L139 WitnessPrinter]: Generating witness for correct program [2024-09-20 19:26:25,929 INFO L149 WitnessManager]: Wrote witness to /storage/repos/certificate-witnesses-artifact/automizer/witness.yml [2024-09-20 19:26:25,929 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2024-09-20 19:26:25,930 INFO L158 Benchmark]: Toolchain (without parser) took 213075.21ms. Allocated memory was 159.4MB in the beginning and 230.7MB in the end (delta: 71.3MB). Free memory was 88.3MB in the beginning and 89.4MB in the end (delta: -1.1MB). Peak memory consumption was 72.0MB. Max. memory is 16.1GB. [2024-09-20 19:26:25,930 INFO L158 Benchmark]: CDTParser took 0.22ms. Allocated memory is still 159.4MB. Free memory is still 110.3MB. There was no memory consumed. Max. memory is 16.1GB. [2024-09-20 19:26:25,930 INFO L158 Benchmark]: CACSL2BoogieTranslator took 231.27ms. Allocated memory is still 159.4MB. Free memory was 88.1MB in the beginning and 76.6MB in the end (delta: 11.5MB). Peak memory consumption was 12.6MB. Max. memory is 16.1GB. [2024-09-20 19:26:25,931 INFO L158 Benchmark]: Boogie Procedure Inliner took 20.81ms. Allocated memory is still 159.4MB. Free memory was 76.6MB in the beginning and 75.7MB in the end (delta: 832.6kB). There was no memory consumed. Max. memory is 16.1GB. [2024-09-20 19:26:25,931 INFO L158 Benchmark]: Boogie Preprocessor took 54.96ms. Allocated memory is still 159.4MB. Free memory was 75.7MB in the beginning and 73.8MB in the end (delta: 1.9MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2024-09-20 19:26:25,931 INFO L158 Benchmark]: RCFGBuilder took 294.83ms. Allocated memory is still 159.4MB. Free memory was 73.8MB in the beginning and 60.8MB in the end (delta: 13.0MB). Peak memory consumption was 12.6MB. Max. memory is 16.1GB. [2024-09-20 19:26:25,932 INFO L158 Benchmark]: TraceAbstraction took 212386.12ms. Allocated memory was 159.4MB in the beginning and 230.7MB in the end (delta: 71.3MB). Free memory was 60.0MB in the beginning and 92.6MB in the end (delta: -32.5MB). Peak memory consumption was 40.6MB. Max. memory is 16.1GB. [2024-09-20 19:26:25,932 INFO L158 Benchmark]: Witness Printer took 77.87ms. Allocated memory is still 230.7MB. Free memory was 92.6MB in the beginning and 89.4MB in the end (delta: 3.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2024-09-20 19:26:25,934 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.22ms. Allocated memory is still 159.4MB. Free memory is still 110.3MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 231.27ms. Allocated memory is still 159.4MB. Free memory was 88.1MB in the beginning and 76.6MB in the end (delta: 11.5MB). Peak memory consumption was 12.6MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 20.81ms. Allocated memory is still 159.4MB. Free memory was 76.6MB in the beginning and 75.7MB in the end (delta: 832.6kB). There was no memory consumed. Max. memory is 16.1GB. * Boogie Preprocessor took 54.96ms. Allocated memory is still 159.4MB. Free memory was 75.7MB in the beginning and 73.8MB in the end (delta: 1.9MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * RCFGBuilder took 294.83ms. Allocated memory is still 159.4MB. Free memory was 73.8MB in the beginning and 60.8MB in the end (delta: 13.0MB). Peak memory consumption was 12.6MB. Max. memory is 16.1GB. * TraceAbstraction took 212386.12ms. Allocated memory was 159.4MB in the beginning and 230.7MB in the end (delta: 71.3MB). Free memory was 60.0MB in the beginning and 92.6MB in the end (delta: -32.5MB). Peak memory consumption was 40.6MB. Max. memory is 16.1GB. * Witness Printer took 77.87ms. Allocated memory is still 230.7MB. Free memory was 92.6MB in the beginning and 89.4MB in the end (delta: 3.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: 18]: 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, 30 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 193.7s, OverallIterations: 6, TraceHistogramMax: 5, PathProgramHistogramMax: 2, EmptinessCheckTime: 0.0s, AutomataDifference: 65.7s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 11 mSolverCounterUnknown, 40 SdHoareTripleChecker+Valid, 50.1s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 36 mSDsluCounter, 761 SdHoareTripleChecker+Invalid, 49.8s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 169 IncrementalHoareTripleChecker+Unchecked, 616 mSDsCounter, 22 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 449 IncrementalHoareTripleChecker+Invalid, 651 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 22 mSolverCounterUnsat, 145 mSDtfsCounter, 449 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 11 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 424 GetRequests, 354 SyntacticMatches, 11 SemanticMatches, 59 ConstructedPredicates, 4 IntricatePredicates, 0 DeprecatedPredicates, 102 ImplicationChecksByTransitivity, 49.1s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=45occurred in iteration=4, InterpolantAutomatonStates: 46, 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, 6 StatesRemovedByMinimization, 2 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 0.4s SatisfiabilityAnalysisTime, 126.0s InterpolantComputationTime, 464 NumberOfCodeBlocks, 464 NumberOfCodeBlocksAsserted, 12 NumberOfCheckSat, 467 ConstructedInterpolants, 1 QuantifiedInterpolants, 1813 SizeOfPredicates, 5 NumberOfNonLiveVariables, 546 ConjunctsInSsa, 83 ConjunctsInUnsatCore, 11 InterpolantComputations, 3 PerfectInterpolantSequences, 351/425 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: 36]: Loop Invariant Derived loop invariant: (((z <= 20) && (1 <= z)) && (((((((__int128) z * x) + ((unsigned __int128) 18446744073709551615U * x)) + ((unsigned __int128) 18446744073709551615U * y)) + 1) % ((unsigned __int128) 1 << 64)) == 0)) - ProcedureContractResult [Line: 12]: Procedure Contract for assume_abort_if_not Derived contract for procedure assume_abort_if_not. Ensures: (\old(cond) != 0) - ProcedureContractResult [Line: 15]: 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:26:26,114 INFO L552 MonitoredProcess]: [MP /storage/repos/certificate-witnesses-artifact/automizer/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Ended with exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Writing output log to file Ultimate.log Result: TRUE