./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/nla-digbench-scaling/divbin_valuebound10.i --full-output --procedureinliner.inline.calls.to.implemented.procedures NEVER --traceabstraction.positions.where.we.compute.the.hoare.annotation All --traceabstraction.encode.modifies.clause.in.ensures.clause.of.contracts true --witnessprinter.yaml.format.version 2.1 --witnessprinter.generate.graphml.witnesses false --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version fb1cb0b9 Calling Ultimate with: /root/.sdkman/candidates/java/11.0.12-open/bin/java -Dosgi.configuration.area=/storage/repos/certificate-witnesses-artifact/automizer/data/config -Xmx15G -Xms4m -jar /storage/repos/certificate-witnesses-artifact/automizer/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/certificate-witnesses-artifact/automizer/data -tc /storage/repos/certificate-witnesses-artifact/automizer/config/AutomizerReach.xml -i ../sv-benchmarks/c/nla-digbench-scaling/divbin_valuebound10.i -s /storage/repos/certificate-witnesses-artifact/automizer/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/certificate-witnesses-artifact/automizer --witnessprinter.witness.filename witness --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! call(reach_error())) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash 7cd88f875a58f4eeda0acf74fa673f6c9452a00f17e8b4a3e93b35765440e39d --procedureinliner.inline.calls.to.implemented.procedures NEVER --traceabstraction.positions.where.we.compute.the.hoare.annotation All --traceabstraction.encode.modifies.clause.in.ensures.clause.of.contracts true --witnessprinter.yaml.format.version 2.1 --witnessprinter.generate.graphml.witnesses false --- Real Ultimate output --- This is Ultimate 0.2.4-tmp.dk.referee-eval-fb1cb0b-m [2024-09-25 10:49:25,182 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-09-25 10:49:25,237 INFO L114 SettingsManager]: Loading settings from /storage/repos/certificate-witnesses-artifact/automizer/config/svcomp-Reach-32bit-Automizer_Default.epf [2024-09-25 10:49:25,240 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-09-25 10:49:25,240 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-09-25 10:49:25,258 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-09-25 10:49:25,260 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-09-25 10:49:25,260 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-09-25 10:49:25,260 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-09-25 10:49:25,261 INFO L153 SettingsManager]: * Use memory slicer=true [2024-09-25 10:49:25,261 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-09-25 10:49:25,261 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-09-25 10:49:25,261 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-09-25 10:49:25,262 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-09-25 10:49:25,262 INFO L153 SettingsManager]: * Use SBE=true [2024-09-25 10:49:25,262 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-09-25 10:49:25,262 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-09-25 10:49:25,262 INFO L153 SettingsManager]: * sizeof long=4 [2024-09-25 10:49:25,263 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-09-25 10:49:25,263 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-09-25 10:49:25,265 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-09-25 10:49:25,266 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-09-25 10:49:25,266 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-09-25 10:49:25,266 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-09-25 10:49:25,267 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-09-25 10:49:25,267 INFO L153 SettingsManager]: * sizeof long double=12 [2024-09-25 10:49:25,267 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-09-25 10:49:25,267 INFO L153 SettingsManager]: * Use constant arrays=true [2024-09-25 10:49:25,268 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-09-25 10:49:25,268 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-09-25 10:49:25,268 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-09-25 10:49:25,268 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-09-25 10:49:25,269 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-09-25 10:49:25,280 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-09-25 10:49:25,281 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-09-25 10:49:25,281 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-09-25 10:49:25,281 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-09-25 10:49:25,281 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-09-25 10:49:25,281 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-09-25 10:49:25,282 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-09-25 10:49:25,282 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-09-25 10:49:25,283 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-09-25 10:49:25,283 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 -> 7cd88f875a58f4eeda0acf74fa673f6c9452a00f17e8b4a3e93b35765440e39d Applying setting for plugin de.uni_freiburg.informatik.ultimate.boogie.procedureinliner: Inline calls to implemented procedures -> NEVER Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: Positions where we compute the Hoare Annotation -> All Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: Encode 'modifies' clause in 'ensures' clause of contracts -> true Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: YAML Format version -> 2.1 Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Generate GraphML witnesses -> false [2024-09-25 10:49:25,574 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-09-25 10:49:25,592 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-09-25 10:49:25,594 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-09-25 10:49:25,595 INFO L270 PluginConnector]: Initializing CDTParser... [2024-09-25 10:49:25,598 INFO L274 PluginConnector]: CDTParser initialized [2024-09-25 10:49:25,656 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/certificate-witnesses-artifact/automizer/../sv-benchmarks/c/nla-digbench-scaling/divbin_valuebound10.i [2024-09-25 10:49:27,292 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-09-25 10:49:27,495 INFO L384 CDTParser]: Found 1 translation units. [2024-09-25 10:49:27,496 INFO L180 CDTParser]: Scanning /storage/repos/certificate-witnesses-artifact/sv-benchmarks/c/nla-digbench-scaling/divbin_valuebound10.i [2024-09-25 10:49:27,508 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/certificate-witnesses-artifact/automizer/data/417e0ff62/66470e0ac53443b7bede7950f39854a9/FLAGea9983de5 [2024-09-25 10:49:27,862 INFO L435 CDTParser]: Successfully deleted /storage/repos/certificate-witnesses-artifact/automizer/data/417e0ff62/66470e0ac53443b7bede7950f39854a9 [2024-09-25 10:49:27,865 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-09-25 10:49:27,866 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-09-25 10:49:27,867 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-09-25 10:49:27,867 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-09-25 10:49:27,872 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-09-25 10:49:27,873 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 25.09 10:49:27" (1/1) ... [2024-09-25 10:49:27,873 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@2a1119ea and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.09 10:49:27, skipping insertion in model container [2024-09-25 10:49:27,874 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 25.09 10:49:27" (1/1) ... [2024-09-25 10:49:27,892 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-09-25 10:49:28,070 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/divbin_valuebound10.i[950,963] [2024-09-25 10:49:28,084 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-09-25 10:49:28,093 INFO L200 MainTranslator]: Completed pre-run [2024-09-25 10:49:28,103 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/divbin_valuebound10.i[950,963] [2024-09-25 10:49:28,108 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-09-25 10:49:28,122 INFO L204 MainTranslator]: Completed translation [2024-09-25 10:49:28,123 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.09 10:49:28 WrapperNode [2024-09-25 10:49:28,123 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-09-25 10:49:28,124 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-09-25 10:49:28,124 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-09-25 10:49:28,124 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-09-25 10:49:28,129 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.09 10:49:28" (1/1) ... [2024-09-25 10:49:28,134 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.09 10:49:28" (1/1) ... [2024-09-25 10:49:28,142 INFO L138 Inliner]: procedures = 16, calls = 12, calls flagged for inlining = 0, calls inlined = 0, statements flattened = 0 [2024-09-25 10:49:28,142 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-09-25 10:49:28,144 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-09-25 10:49:28,144 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-09-25 10:49:28,144 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-09-25 10:49:28,151 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.09 10:49:28" (1/1) ... [2024-09-25 10:49:28,151 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.09 10:49:28" (1/1) ... [2024-09-25 10:49:28,153 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.09 10:49:28" (1/1) ... [2024-09-25 10:49:28,161 INFO L175 MemorySlicer]: Split 2 memory accesses to 1 slices as follows [2]. 100 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2]. The 0 writes are split as follows [0]. [2024-09-25 10:49:28,161 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.09 10:49:28" (1/1) ... [2024-09-25 10:49:28,161 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.09 10:49:28" (1/1) ... [2024-09-25 10:49:28,163 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.09 10:49:28" (1/1) ... [2024-09-25 10:49:28,165 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.09 10:49:28" (1/1) ... [2024-09-25 10:49:28,166 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.09 10:49:28" (1/1) ... [2024-09-25 10:49:28,167 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.09 10:49:28" (1/1) ... [2024-09-25 10:49:28,169 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-09-25 10:49:28,170 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-09-25 10:49:28,170 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-09-25 10:49:28,170 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-09-25 10:49:28,171 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.09 10:49:28" (1/1) ... [2024-09-25 10:49:28,175 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-09-25 10:49:28,184 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/certificate-witnesses-artifact/automizer/z3 [2024-09-25 10:49:28,196 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/certificate-witnesses-artifact/automizer/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2024-09-25 10:49:28,199 INFO L327 MonitoredProcess]: [MP /storage/repos/certificate-witnesses-artifact/automizer/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2024-09-25 10:49:28,232 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-09-25 10:49:28,232 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2024-09-25 10:49:28,232 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2024-09-25 10:49:28,232 INFO L130 BoogieDeclarations]: Found specification of procedure main [2024-09-25 10:49:28,232 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2024-09-25 10:49:28,232 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-09-25 10:49:28,232 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2024-09-25 10:49:28,233 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2024-09-25 10:49:28,234 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-09-25 10:49:28,234 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-09-25 10:49:28,234 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2024-09-25 10:49:28,234 INFO L138 BoogieDeclarations]: Found implementation of procedure __VERIFIER_assert [2024-09-25 10:49:28,284 INFO L241 CfgBuilder]: Building ICFG [2024-09-25 10:49:28,286 INFO L267 CfgBuilder]: Building CFG for each procedure with an implementation [2024-09-25 10:49:28,408 INFO L? ?]: Removed 5 outVars from TransFormulas that were not future-live. [2024-09-25 10:49:28,408 INFO L290 CfgBuilder]: Performing block encoding [2024-09-25 10:49:28,422 INFO L312 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-09-25 10:49:28,422 INFO L317 CfgBuilder]: Removed 2 assume(true) statements. [2024-09-25 10:49:28,422 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 25.09 10:49:28 BoogieIcfgContainer [2024-09-25 10:49:28,423 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-09-25 10:49:28,424 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-09-25 10:49:28,424 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-09-25 10:49:28,427 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-09-25 10:49:28,427 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 25.09 10:49:27" (1/3) ... [2024-09-25 10:49:28,428 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@33d42a0 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 25.09 10:49:28, skipping insertion in model container [2024-09-25 10:49:28,428 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.09 10:49:28" (2/3) ... [2024-09-25 10:49:28,429 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@33d42a0 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 25.09 10:49:28, skipping insertion in model container [2024-09-25 10:49:28,430 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 25.09 10:49:28" (3/3) ... [2024-09-25 10:49:28,431 INFO L112 eAbstractionObserver]: Analyzing ICFG divbin_valuebound10.i [2024-09-25 10:49:28,444 INFO L209 ceAbstractionStarter]: Automizer settings: Hoare:All NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-09-25 10:49:28,444 INFO L149 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-09-25 10:49:28,511 INFO L335 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-09-25 10:49:28,520 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;@5bfc089c, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-09-25 10:49:28,520 INFO L337 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-09-25 10:49:28,523 INFO L276 IsEmpty]: Start isEmpty. Operand has 32 states, 18 states have (on average 1.5555555555555556) internal successors, (28), 19 states have internal predecessors, (28), 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-25 10:49:28,529 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 34 [2024-09-25 10:49:28,530 INFO L208 NwaCegarLoop]: Found error trace [2024-09-25 10:49:28,531 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, 1] [2024-09-25 10:49:28,531 INFO L399 AbstractCegarLoop]: === Iteration 1 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-09-25 10:49:28,536 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-25 10:49:28,537 INFO L85 PathProgramCache]: Analyzing trace with hash -923394275, now seen corresponding path program 1 times [2024-09-25 10:49:28,544 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-09-25 10:49:28,544 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [93322219] [2024-09-25 10:49:28,545 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-09-25 10:49:28,545 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-09-25 10:49:28,636 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-25 10:49:28,679 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2024-09-25 10:49:28,681 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-25 10:49:28,689 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-09-25 10:49:28,692 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-25 10:49:28,696 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-09-25 10:49:28,697 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-25 10:49:28,704 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2024-09-25 10:49:28,706 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-25 10:49:28,713 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2024-09-25 10:49:28,714 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-25 10:49:28,718 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-25 10:49:28,719 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-09-25 10:49:28,720 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [93322219] [2024-09-25 10:49:28,720 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [93322219] provided 1 perfect and 0 imperfect interpolant sequences [2024-09-25 10:49:28,720 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-09-25 10:49:28,721 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-09-25 10:49:28,722 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [535484540] [2024-09-25 10:49:28,722 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-09-25 10:49:28,726 INFO L551 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-09-25 10:49:28,726 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-09-25 10:49:28,743 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-09-25 10:49:28,744 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-09-25 10:49:28,746 INFO L87 Difference]: Start difference. First operand has 32 states, 18 states have (on average 1.5555555555555556) internal successors, (28), 19 states have internal predecessors, (28), 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 6.0) internal successors, (12), 2 states have internal predecessors, (12), 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-25 10:49:28,772 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-09-25 10:49:28,772 INFO L93 Difference]: Finished difference Result 58 states and 87 transitions. [2024-09-25 10:49:28,774 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-09-25 10:49:28,775 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 6.0) internal successors, (12), 2 states have internal predecessors, (12), 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 33 [2024-09-25 10:49:28,775 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-09-25 10:49:28,784 INFO L225 Difference]: With dead ends: 58 [2024-09-25 10:49:28,784 INFO L226 Difference]: Without dead ends: 28 [2024-09-25 10:49:28,796 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-25 10:49:28,802 INFO L434 NwaCegarLoop]: 36 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, 36 SdHoareTripleChecker+Invalid, 2 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 2 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-09-25 10:49:28,803 INFO L435 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 36 Invalid, 2 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 2 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-09-25 10:49:28,821 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 28 states. [2024-09-25 10:49:28,842 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 28 to 28. [2024-09-25 10:49:28,845 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 28 states, 16 states have (on average 1.25) internal successors, (20), 17 states have internal predecessors, (20), 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-25 10:49:28,847 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 28 states to 28 states and 34 transitions. [2024-09-25 10:49:28,848 INFO L78 Accepts]: Start accepts. Automaton has 28 states and 34 transitions. Word has length 33 [2024-09-25 10:49:28,848 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-09-25 10:49:28,849 INFO L474 AbstractCegarLoop]: Abstraction has 28 states and 34 transitions. [2024-09-25 10:49:28,849 INFO L475 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 6.0) internal successors, (12), 2 states have internal predecessors, (12), 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-25 10:49:28,850 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-25 10:49:28,850 INFO L276 IsEmpty]: Start isEmpty. Operand 28 states and 34 transitions. [2024-09-25 10:49:28,854 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2024-09-25 10:49:28,854 INFO L208 NwaCegarLoop]: Found error trace [2024-09-25 10:49:28,854 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, 1, 1] [2024-09-25 10:49:28,854 WARN L456 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-09-25 10:49:28,855 INFO L399 AbstractCegarLoop]: === Iteration 2 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-09-25 10:49:28,856 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-25 10:49:28,856 INFO L85 PathProgramCache]: Analyzing trace with hash 1193042891, now seen corresponding path program 1 times [2024-09-25 10:49:28,856 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-09-25 10:49:28,859 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1056059261] [2024-09-25 10:49:28,859 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-09-25 10:49:28,860 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-09-25 10:49:28,940 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unknown [2024-09-25 10:49:28,946 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [819922177] [2024-09-25 10:49:28,946 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-09-25 10:49:28,946 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-09-25 10:49:28,947 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/certificate-witnesses-artifact/automizer/z3 [2024-09-25 10:49:28,951 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/certificate-witnesses-artifact/automizer/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-09-25 10:49:28,953 INFO L327 MonitoredProcess]: [MP /storage/repos/certificate-witnesses-artifact/automizer/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2024-09-25 10:49:29,011 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-25 10:49:29,013 INFO L262 TraceCheckSpWp]: Trace formula consists of 80 conjuncts, 12 conjuncts are in the unsatisfiable core [2024-09-25 10:49:29,018 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2024-09-25 10:49:29,228 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 0 proven. 9 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2024-09-25 10:49:29,228 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2024-09-25 10:49:29,368 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-25 10:49:29,368 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-09-25 10:49:29,368 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1056059261] [2024-09-25 10:49:29,369 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2024-09-25 10:49:29,370 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [819922177] [2024-09-25 10:49:29,370 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [819922177] provided 1 perfect and 1 imperfect interpolant sequences [2024-09-25 10:49:29,371 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-09-25 10:49:29,371 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [8] total 9 [2024-09-25 10:49:29,372 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [862515809] [2024-09-25 10:49:29,372 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-09-25 10:49:29,373 INFO L551 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-09-25 10:49:29,373 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-09-25 10:49:29,374 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-09-25 10:49:29,374 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2024-09-25 10:49:29,375 INFO L87 Difference]: Start difference. First operand 28 states and 34 transitions. Second operand has 5 states, 5 states have (on average 2.6) internal successors, (13), 4 states have internal predecessors, (13), 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-25 10:49:33,460 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 [1] [2024-09-25 10:49:33,499 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-09-25 10:49:33,500 INFO L93 Difference]: Finished difference Result 38 states and 45 transitions. [2024-09-25 10:49:33,500 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-09-25 10:49:33,500 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 2.6) internal successors, (13), 4 states have internal predecessors, (13), 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 34 [2024-09-25 10:49:33,501 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-09-25 10:49:33,502 INFO L225 Difference]: With dead ends: 38 [2024-09-25 10:49:33,502 INFO L226 Difference]: Without dead ends: 35 [2024-09-25 10:49:33,502 INFO L433 NwaCegarLoop]: 0 DeclaredPredicates, 68 GetRequests, 58 SyntacticMatches, 2 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=21, Invalid=69, Unknown=0, NotChecked=0, Total=90 [2024-09-25 10:49:33,503 INFO L434 NwaCegarLoop]: 27 mSDtfsCounter, 5 mSDsluCounter, 75 mSDsCounter, 0 mSdLazyCounter, 30 mSolverCounterSat, 1 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 4.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 6 SdHoareTripleChecker+Valid, 102 SdHoareTripleChecker+Invalid, 32 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 30 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 4.1s IncrementalHoareTripleChecker+Time [2024-09-25 10:49:33,504 INFO L435 NwaCegarLoop]: SdHoareTripleChecker [6 Valid, 102 Invalid, 32 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 30 Invalid, 1 Unknown, 0 Unchecked, 4.1s Time] [2024-09-25 10:49:33,505 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 35 states. [2024-09-25 10:49:33,512 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 35 to 35. [2024-09-25 10:49:33,513 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 35 states, 21 states have (on average 1.1904761904761905) internal successors, (25), 22 states have internal predecessors, (25), 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-25 10:49:33,514 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 35 states to 35 states and 41 transitions. [2024-09-25 10:49:33,514 INFO L78 Accepts]: Start accepts. Automaton has 35 states and 41 transitions. Word has length 34 [2024-09-25 10:49:33,515 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-09-25 10:49:33,515 INFO L474 AbstractCegarLoop]: Abstraction has 35 states and 41 transitions. [2024-09-25 10:49:33,515 INFO L475 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 2.6) internal successors, (13), 4 states have internal predecessors, (13), 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-25 10:49:33,516 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-25 10:49:33,516 INFO L276 IsEmpty]: Start isEmpty. Operand 35 states and 41 transitions. [2024-09-25 10:49:33,517 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 43 [2024-09-25 10:49:33,517 INFO L208 NwaCegarLoop]: Found error trace [2024-09-25 10:49:33,518 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, 1, 1, 1] [2024-09-25 10:49:33,531 INFO L552 MonitoredProcess]: [MP /storage/repos/certificate-witnesses-artifact/automizer/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2024-09-25 10:49:33,722 WARN L456 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1,2 /storage/repos/certificate-witnesses-artifact/automizer/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-09-25 10:49:33,723 INFO L399 AbstractCegarLoop]: === Iteration 3 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-09-25 10:49:33,723 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-25 10:49:33,723 INFO L85 PathProgramCache]: Analyzing trace with hash 513117096, now seen corresponding path program 1 times [2024-09-25 10:49:33,724 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-09-25 10:49:33,724 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [244834922] [2024-09-25 10:49:33,724 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-09-25 10:49:33,724 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-09-25 10:49:33,782 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-25 10:49:34,148 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2024-09-25 10:49:34,150 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-25 10:49:34,152 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-09-25 10:49:34,153 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-25 10:49:34,154 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-09-25 10:49:34,155 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-25 10:49:34,157 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2024-09-25 10:49:34,157 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-25 10:49:34,159 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2024-09-25 10:49:34,159 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-25 10:49:34,161 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 30 [2024-09-25 10:49:34,165 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-25 10:49:34,174 INFO L134 CoverageAnalysis]: Checked inductivity of 28 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 24 trivial. 0 not checked. [2024-09-25 10:49:34,175 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-09-25 10:49:34,175 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [244834922] [2024-09-25 10:49:34,175 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [244834922] provided 1 perfect and 0 imperfect interpolant sequences [2024-09-25 10:49:34,175 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-09-25 10:49:34,175 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-09-25 10:49:34,176 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [959096769] [2024-09-25 10:49:34,176 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-09-25 10:49:34,176 INFO L551 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-09-25 10:49:34,176 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-09-25 10:49:34,177 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-09-25 10:49:34,177 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2024-09-25 10:49:34,177 INFO L87 Difference]: Start difference. First operand 35 states and 41 transitions. Second operand has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 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-25 10:49:34,217 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-09-25 10:49:34,217 INFO L93 Difference]: Finished difference Result 51 states and 61 transitions. [2024-09-25 10:49:34,218 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-09-25 10:49:34,218 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 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 42 [2024-09-25 10:49:34,218 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-09-25 10:49:34,219 INFO L225 Difference]: With dead ends: 51 [2024-09-25 10:49:34,219 INFO L226 Difference]: Without dead ends: 37 [2024-09-25 10:49:34,219 INFO L433 NwaCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 17 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2024-09-25 10:49:34,220 INFO L434 NwaCegarLoop]: 31 mSDtfsCounter, 1 mSDsluCounter, 24 mSDsCounter, 0 mSdLazyCounter, 12 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 55 SdHoareTripleChecker+Invalid, 13 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 12 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-09-25 10:49:34,220 INFO L435 NwaCegarLoop]: SdHoareTripleChecker [1 Valid, 55 Invalid, 13 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 12 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-09-25 10:49:34,221 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 37 states. [2024-09-25 10:49:34,226 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 37 to 37. [2024-09-25 10:49:34,226 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 37 states, 23 states have (on average 1.173913043478261) internal successors, (27), 24 states have internal predecessors, (27), 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-25 10:49:34,227 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 37 states to 37 states and 43 transitions. [2024-09-25 10:49:34,227 INFO L78 Accepts]: Start accepts. Automaton has 37 states and 43 transitions. Word has length 42 [2024-09-25 10:49:34,228 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-09-25 10:49:34,228 INFO L474 AbstractCegarLoop]: Abstraction has 37 states and 43 transitions. [2024-09-25 10:49:34,228 INFO L475 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 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-25 10:49:34,228 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-25 10:49:34,228 INFO L276 IsEmpty]: Start isEmpty. Operand 37 states and 43 transitions. [2024-09-25 10:49:34,229 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 45 [2024-09-25 10:49:34,229 INFO L208 NwaCegarLoop]: Found error trace [2024-09-25 10:49:34,229 INFO L216 NwaCegarLoop]: trace histogram [4, 4, 4, 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, 1, 1, 1] [2024-09-25 10:49:34,229 WARN L456 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-09-25 10:49:34,230 INFO L399 AbstractCegarLoop]: === Iteration 4 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-09-25 10:49:34,230 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-25 10:49:34,230 INFO L85 PathProgramCache]: Analyzing trace with hash 980542403, now seen corresponding path program 1 times [2024-09-25 10:49:34,230 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-09-25 10:49:34,230 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [486236192] [2024-09-25 10:49:34,230 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-09-25 10:49:34,230 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-09-25 10:49:34,249 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unknown [2024-09-25 10:49:34,251 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1448186287] [2024-09-25 10:49:34,251 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-09-25 10:49:34,251 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-09-25 10:49:34,251 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/certificate-witnesses-artifact/automizer/z3 [2024-09-25 10:49:34,252 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/certificate-witnesses-artifact/automizer/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-09-25 10:49:34,254 INFO L327 MonitoredProcess]: [MP /storage/repos/certificate-witnesses-artifact/automizer/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2024-09-25 10:49:34,334 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-25 10:49:34,339 INFO L262 TraceCheckSpWp]: Trace formula consists of 104 conjuncts, 21 conjuncts are in the unsatisfiable core [2024-09-25 10:49:34,341 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2024-09-25 10:49:34,517 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 1 proven. 12 refuted. 0 times theorem prover too weak. 17 trivial. 0 not checked. [2024-09-25 10:49:34,518 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2024-09-25 10:50:00,635 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-09-25 10:50:00,636 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [486236192] [2024-09-25 10:50:00,637 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2024-09-25 10:50:00,638 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1448186287] [2024-09-25 10:50:00,638 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1448186287] provided 0 perfect and 1 imperfect interpolant sequences [2024-09-25 10:50:00,638 INFO L185 FreeRefinementEngine]: Found 0 perfect and 1 imperfect interpolant sequences. [2024-09-25 10:50:00,638 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12] total 12 [2024-09-25 10:50:00,638 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [835452007] [2024-09-25 10:50:00,638 INFO L85 oduleStraightlineAll]: Using 1 imperfect interpolants to construct interpolant automaton [2024-09-25 10:50:00,638 INFO L551 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2024-09-25 10:50:00,639 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-09-25 10:50:00,639 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2024-09-25 10:50:00,639 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=43, Invalid=192, Unknown=5, NotChecked=0, Total=240 [2024-09-25 10:50:00,639 INFO L87 Difference]: Start difference. First operand 37 states and 43 transitions. Second operand has 12 states, 12 states have (on average 1.9166666666666667) internal successors, (23), 11 states have internal predecessors, (23), 4 states have call successors, (8), 2 states have call predecessors, (8), 3 states have return successors, (6), 3 states have call predecessors, (6), 3 states have call successors, (6) [2024-09-25 10:50:00,857 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-09-25 10:50:00,857 INFO L93 Difference]: Finished difference Result 52 states and 62 transitions. [2024-09-25 10:50:00,857 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2024-09-25 10:50:00,857 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 12 states have (on average 1.9166666666666667) internal successors, (23), 11 states have internal predecessors, (23), 4 states have call successors, (8), 2 states have call predecessors, (8), 3 states have return successors, (6), 3 states have call predecessors, (6), 3 states have call successors, (6) Word has length 44 [2024-09-25 10:50:00,858 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-09-25 10:50:00,858 INFO L225 Difference]: With dead ends: 52 [2024-09-25 10:50:00,860 INFO L226 Difference]: Without dead ends: 48 [2024-09-25 10:50:00,861 INFO L433 NwaCegarLoop]: 0 DeclaredPredicates, 52 GetRequests, 35 SyntacticMatches, 2 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 40 ImplicationChecksByTransitivity, 25.3s TimeCoverageRelationStatistics Valid=49, Invalid=218, Unknown=5, NotChecked=0, Total=272 [2024-09-25 10:50:00,861 INFO L434 NwaCegarLoop]: 21 mSDtfsCounter, 19 mSDsluCounter, 138 mSDsCounter, 0 mSdLazyCounter, 180 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 21 SdHoareTripleChecker+Valid, 159 SdHoareTripleChecker+Invalid, 185 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 180 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-09-25 10:50:00,862 INFO L435 NwaCegarLoop]: SdHoareTripleChecker [21 Valid, 159 Invalid, 185 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 180 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-09-25 10:50:00,862 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 48 states. [2024-09-25 10:50:00,868 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 48 to 47. [2024-09-25 10:50:00,869 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 47 states, 30 states have (on average 1.1666666666666667) internal successors, (35), 32 states have internal predecessors, (35), 11 states have call successors, (11), 6 states have call predecessors, (11), 5 states have return successors, (9), 8 states have call predecessors, (9), 9 states have call successors, (9) [2024-09-25 10:50:00,870 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 47 states to 47 states and 55 transitions. [2024-09-25 10:50:00,870 INFO L78 Accepts]: Start accepts. Automaton has 47 states and 55 transitions. Word has length 44 [2024-09-25 10:50:00,870 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-09-25 10:50:00,870 INFO L474 AbstractCegarLoop]: Abstraction has 47 states and 55 transitions. [2024-09-25 10:50:00,870 INFO L475 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 1.9166666666666667) internal successors, (23), 11 states have internal predecessors, (23), 4 states have call successors, (8), 2 states have call predecessors, (8), 3 states have return successors, (6), 3 states have call predecessors, (6), 3 states have call successors, (6) [2024-09-25 10:50:00,871 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-25 10:50:00,871 INFO L276 IsEmpty]: Start isEmpty. Operand 47 states and 55 transitions. [2024-09-25 10:50:00,872 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 53 [2024-09-25 10:50:00,873 INFO L208 NwaCegarLoop]: Found error trace [2024-09-25 10:50:00,874 INFO L216 NwaCegarLoop]: trace histogram [4, 4, 4, 3, 3, 3, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-09-25 10:50:00,888 INFO L552 MonitoredProcess]: [MP /storage/repos/certificate-witnesses-artifact/automizer/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Ended with exit code 0 [2024-09-25 10:50:01,074 WARN L456 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3,3 /storage/repos/certificate-witnesses-artifact/automizer/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-09-25 10:50:01,075 INFO L399 AbstractCegarLoop]: === Iteration 5 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-09-25 10:50:01,075 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-25 10:50:01,075 INFO L85 PathProgramCache]: Analyzing trace with hash -2109238368, now seen corresponding path program 2 times [2024-09-25 10:50:01,078 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-09-25 10:50:01,078 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [381722991] [2024-09-25 10:50:01,078 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-09-25 10:50:01,078 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-09-25 10:50:01,111 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-25 10:50:01,623 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2024-09-25 10:50:01,624 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-25 10:50:01,625 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-09-25 10:50:01,626 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-25 10:50:01,627 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-09-25 10:50:01,630 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-25 10:50:01,631 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2024-09-25 10:50:01,631 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-25 10:50:01,632 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2024-09-25 10:50:01,635 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-25 10:50:01,636 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-09-25 10:50:01,639 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-25 10:50:01,644 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2024-09-25 10:50:01,645 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-25 10:50:01,649 INFO L134 CoverageAnalysis]: Checked inductivity of 42 backedges. 9 proven. 5 refuted. 0 times theorem prover too weak. 28 trivial. 0 not checked. [2024-09-25 10:50:01,649 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-09-25 10:50:01,650 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [381722991] [2024-09-25 10:50:01,650 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [381722991] provided 0 perfect and 1 imperfect interpolant sequences [2024-09-25 10:50:01,650 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1337515697] [2024-09-25 10:50:01,650 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2024-09-25 10:50:01,650 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-09-25 10:50:01,650 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/certificate-witnesses-artifact/automizer/z3 [2024-09-25 10:50:01,651 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/certificate-witnesses-artifact/automizer/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-09-25 10:50:01,653 INFO L327 MonitoredProcess]: [MP /storage/repos/certificate-witnesses-artifact/automizer/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2024-09-25 10:50:01,739 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2024-09-25 10:50:01,740 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2024-09-25 10:50:01,744 INFO L262 TraceCheckSpWp]: Trace formula consists of 124 conjuncts, 27 conjuncts are in the unsatisfiable core [2024-09-25 10:50:01,746 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2024-09-25 10:50:02,086 INFO L134 CoverageAnalysis]: Checked inductivity of 42 backedges. 12 proven. 11 refuted. 0 times theorem prover too weak. 19 trivial. 0 not checked. [2024-09-25 10:50:02,087 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2024-09-25 10:50:02,611 INFO L134 CoverageAnalysis]: Checked inductivity of 42 backedges. 12 proven. 11 refuted. 0 times theorem prover too weak. 19 trivial. 0 not checked. [2024-09-25 10:50:02,612 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1337515697] provided 0 perfect and 2 imperfect interpolant sequences [2024-09-25 10:50:02,612 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-09-25 10:50:02,612 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 11, 9] total 21 [2024-09-25 10:50:02,612 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1332275814] [2024-09-25 10:50:02,613 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-09-25 10:50:02,613 INFO L551 AbstractCegarLoop]: INTERPOLANT automaton has 21 states [2024-09-25 10:50:02,613 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-09-25 10:50:02,615 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2024-09-25 10:50:02,615 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=76, Invalid=344, Unknown=0, NotChecked=0, Total=420 [2024-09-25 10:50:02,615 INFO L87 Difference]: Start difference. First operand 47 states and 55 transitions. Second operand has 21 states, 20 states have (on average 2.4) internal successors, (48), 18 states have internal predecessors, (48), 10 states have call successors, (17), 2 states have call predecessors, (17), 2 states have return successors, (17), 10 states have call predecessors, (17), 9 states have call successors, (17) [2024-09-25 10:50:03,531 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-09-25 10:50:03,531 INFO L93 Difference]: Finished difference Result 86 states and 105 transitions. [2024-09-25 10:50:03,532 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2024-09-25 10:50:03,532 INFO L78 Accepts]: Start accepts. Automaton has has 21 states, 20 states have (on average 2.4) internal successors, (48), 18 states have internal predecessors, (48), 10 states have call successors, (17), 2 states have call predecessors, (17), 2 states have return successors, (17), 10 states have call predecessors, (17), 9 states have call successors, (17) Word has length 52 [2024-09-25 10:50:03,532 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-09-25 10:50:03,534 INFO L225 Difference]: With dead ends: 86 [2024-09-25 10:50:03,534 INFO L226 Difference]: Without dead ends: 54 [2024-09-25 10:50:03,535 INFO L433 NwaCegarLoop]: 0 DeclaredPredicates, 131 GetRequests, 106 SyntacticMatches, 0 SemanticMatches, 25 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 154 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=138, Invalid=564, Unknown=0, NotChecked=0, Total=702 [2024-09-25 10:50:03,535 INFO L434 NwaCegarLoop]: 25 mSDtfsCounter, 28 mSDsluCounter, 176 mSDsCounter, 0 mSdLazyCounter, 176 mSolverCounterSat, 13 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 29 SdHoareTripleChecker+Valid, 201 SdHoareTripleChecker+Invalid, 189 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 13 IncrementalHoareTripleChecker+Valid, 176 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2024-09-25 10:50:03,535 INFO L435 NwaCegarLoop]: SdHoareTripleChecker [29 Valid, 201 Invalid, 189 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [13 Valid, 176 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2024-09-25 10:50:03,536 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 54 states. [2024-09-25 10:50:03,543 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 54 to 49. [2024-09-25 10:50:03,544 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 49 states, 32 states have (on average 1.15625) internal successors, (37), 34 states have internal predecessors, (37), 11 states have call successors, (11), 6 states have call predecessors, (11), 5 states have return successors, (9), 8 states have call predecessors, (9), 9 states have call successors, (9) [2024-09-25 10:50:03,544 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 49 states to 49 states and 57 transitions. [2024-09-25 10:50:03,545 INFO L78 Accepts]: Start accepts. Automaton has 49 states and 57 transitions. Word has length 52 [2024-09-25 10:50:03,545 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-09-25 10:50:03,545 INFO L474 AbstractCegarLoop]: Abstraction has 49 states and 57 transitions. [2024-09-25 10:50:03,545 INFO L475 AbstractCegarLoop]: INTERPOLANT automaton has has 21 states, 20 states have (on average 2.4) internal successors, (48), 18 states have internal predecessors, (48), 10 states have call successors, (17), 2 states have call predecessors, (17), 2 states have return successors, (17), 10 states have call predecessors, (17), 9 states have call successors, (17) [2024-09-25 10:50:03,545 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-25 10:50:03,545 INFO L276 IsEmpty]: Start isEmpty. Operand 49 states and 57 transitions. [2024-09-25 10:50:03,546 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 55 [2024-09-25 10:50:03,546 INFO L208 NwaCegarLoop]: Found error trace [2024-09-25 10:50:03,546 INFO L216 NwaCegarLoop]: trace histogram [4, 4, 4, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-09-25 10:50:03,552 INFO L552 MonitoredProcess]: [MP /storage/repos/certificate-witnesses-artifact/automizer/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Ended with exit code 0 [2024-09-25 10:50:03,750 WARN L456 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4,4 /storage/repos/certificate-witnesses-artifact/automizer/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-09-25 10:50:03,751 INFO L399 AbstractCegarLoop]: === Iteration 6 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-09-25 10:50:03,751 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-25 10:50:03,751 INFO L85 PathProgramCache]: Analyzing trace with hash -860568069, now seen corresponding path program 3 times [2024-09-25 10:50:03,751 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-09-25 10:50:03,751 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1195756870] [2024-09-25 10:50:03,751 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-09-25 10:50:03,752 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-09-25 10:50:03,820 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unknown [2024-09-25 10:50:03,821 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [448308395] [2024-09-25 10:50:03,821 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2024-09-25 10:50:03,821 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-09-25 10:50:03,822 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/certificate-witnesses-artifact/automizer/z3 [2024-09-25 10:50:03,823 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/certificate-witnesses-artifact/automizer/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-09-25 10:50:03,824 INFO L327 MonitoredProcess]: [MP /storage/repos/certificate-witnesses-artifact/automizer/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2024-09-25 10:50:04,426 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) [2024-09-25 10:50:04,427 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2024-09-25 10:50:04,433 INFO L262 TraceCheckSpWp]: Trace formula consists of 118 conjuncts, 51 conjuncts are in the unsatisfiable core [2024-09-25 10:50:04,435 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2024-09-25 10:50:05,231 INFO L134 CoverageAnalysis]: Checked inductivity of 46 backedges. 9 proven. 21 refuted. 0 times theorem prover too weak. 16 trivial. 0 not checked. [2024-09-25 10:50:05,231 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2024-09-25 10:51:23,332 WARN L293 SmtUtils]: Spent 1.00m on a formula simplification. DAG size of input: 31 DAG size of output: 24 (called from [L 188] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.DualJunctionTir.tryToEliminateOne) [2024-09-25 10:51:47,835 WARN L293 SmtUtils]: Spent 24.50s on a formula simplification that was a NOOP. DAG size: 20 (called from [L 731] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2024-09-25 10:52:15,939 WARN L293 SmtUtils]: Spent 28.10s on a formula simplification that was a NOOP. DAG size: 19 (called from [L 731] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2024-09-25 10:52:32,083 WARN L293 SmtUtils]: Spent 16.14s on a formula simplification that was a NOOP. DAG size: 11 (called from [L 731] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2024-09-25 10:52:51,049 WARN L293 SmtUtils]: Spent 16.08s on a formula simplification that was a NOOP. DAG size: 9 (called from [L 731] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2024-09-25 10:52:55,071 WARN L876 $PredicateComparison]: unable to prove that (let ((.cse5 (mod (* c_main_~b~0 c_main_~q~0) 1073741824)) (.cse0 (mod c_main_~b~0 1073741824))) (let ((.cse2 (* .cse0 4)) (.cse4 (* 4 .cse5))) (let ((.cse1 (mod (+ .cse2 (* c_main_~A~0 4294967295) 4294967295 .cse4) 4294967296)) (.cse3 (mod c_main_~A~0 4294967296))) (or (< (* .cse0 2) (+ .cse1 1)) (< .cse2 (+ (mod c_main_~b~0 4294967296) .cse1 1)) (< .cse3 .cse4) (= .cse2 (mod c_main_~B~0 4294967296)) (= .cse3 (mod (+ (* 4294967292 .cse5) c_main_~A~0 (* .cse0 c_main_~q~0 4)) 4294967296)))))) is different from true [2024-09-25 10:53:15,196 WARN L293 SmtUtils]: Spent 16.06s on a formula simplification that was a NOOP. DAG size: 9 (called from [L 731] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2024-09-25 10:53:39,235 WARN L293 SmtUtils]: Spent 24.04s on a formula simplification that was a NOOP. DAG size: 20 (called from [L 731] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2024-09-25 10:54:07,344 WARN L293 SmtUtils]: Spent 28.11s on a formula simplification that was a NOOP. DAG size: 19 (called from [L 731] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify)