./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/loop-industry-pattern/mod3.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 --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 5189fb62 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/loop-industry-pattern/mod3.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 4cb78a0927aaaf985fd071d82fe186e3e3838d2825c1d104414277cfde8a2d4d --procedureinliner.inline.calls.to.implemented.procedures NEVER --traceabstraction.positions.where.we.compute.the.hoare.annotation All --witnessprinter.yaml.format.version 2.1 --- Real Ultimate output --- This is Ultimate 0.2.4-dev-5189fb6-m [2024-09-12 21:50:55,423 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-09-12 21:50:55,483 INFO L114 SettingsManager]: Loading settings from /storage/repos/certificate-witnesses-artifact/automizer/config/svcomp-Reach-32bit-Automizer_Default.epf [2024-09-12 21:50:55,487 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-09-12 21:50:55,487 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-09-12 21:50:55,517 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-09-12 21:50:55,518 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-09-12 21:50:55,518 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-09-12 21:50:55,519 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-09-12 21:50:55,519 INFO L153 SettingsManager]: * Use memory slicer=true [2024-09-12 21:50:55,520 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-09-12 21:50:55,520 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-09-12 21:50:55,521 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-09-12 21:50:55,521 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-09-12 21:50:55,521 INFO L153 SettingsManager]: * Use SBE=true [2024-09-12 21:50:55,522 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-09-12 21:50:55,522 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-09-12 21:50:55,522 INFO L153 SettingsManager]: * sizeof long=4 [2024-09-12 21:50:55,523 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-09-12 21:50:55,523 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-09-12 21:50:55,523 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-09-12 21:50:55,524 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-09-12 21:50:55,525 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-09-12 21:50:55,525 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-09-12 21:50:55,526 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-09-12 21:50:55,529 INFO L153 SettingsManager]: * sizeof long double=12 [2024-09-12 21:50:55,529 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-09-12 21:50:55,530 INFO L153 SettingsManager]: * Use constant arrays=true [2024-09-12 21:50:55,530 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-09-12 21:50:55,530 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-09-12 21:50:55,530 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-09-12 21:50:55,530 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-09-12 21:50:55,531 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-09-12 21:50:55,531 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-09-12 21:50:55,531 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-09-12 21:50:55,532 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-09-12 21:50:55,532 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-09-12 21:50:55,532 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-09-12 21:50:55,534 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-09-12 21:50:55,535 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-09-12 21:50:55,535 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-09-12 21:50:55,535 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-09-12 21:50:55,535 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 -> 4cb78a0927aaaf985fd071d82fe186e3e3838d2825c1d104414277cfde8a2d4d 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 [2024-09-12 21:50:55,817 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-09-12 21:50:55,842 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-09-12 21:50:55,845 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-09-12 21:50:55,846 INFO L270 PluginConnector]: Initializing CDTParser... [2024-09-12 21:50:55,846 INFO L274 PluginConnector]: CDTParser initialized [2024-09-12 21:50:55,847 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/certificate-witnesses-artifact/automizer/../sv-benchmarks/c/loop-industry-pattern/mod3.c [2024-09-12 21:50:57,269 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-09-12 21:50:57,456 INFO L384 CDTParser]: Found 1 translation units. [2024-09-12 21:50:57,456 INFO L180 CDTParser]: Scanning /storage/repos/certificate-witnesses-artifact/sv-benchmarks/c/loop-industry-pattern/mod3.c [2024-09-12 21:50:57,463 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/certificate-witnesses-artifact/automizer/data/e3ac6f3f4/efa94d4efc0243ca902b7880476ded39/FLAGc50b23d44 [2024-09-12 21:50:57,868 INFO L435 CDTParser]: Successfully deleted /storage/repos/certificate-witnesses-artifact/automizer/data/e3ac6f3f4/efa94d4efc0243ca902b7880476ded39 [2024-09-12 21:50:57,870 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-09-12 21:50:57,871 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-09-12 21:50:57,872 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-09-12 21:50:57,872 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-09-12 21:50:57,877 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-09-12 21:50:57,878 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 12.09 09:50:57" (1/1) ... [2024-09-12 21:50:57,881 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@f35d428 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.09 09:50:57, skipping insertion in model container [2024-09-12 21:50:57,881 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 12.09 09:50:57" (1/1) ... [2024-09-12 21:50:57,900 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-09-12 21:50:58,037 WARN L247 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/certificate-witnesses-artifact/sv-benchmarks/c/loop-industry-pattern/mod3.c[394,407] [2024-09-12 21:50:58,050 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-09-12 21:50:58,058 INFO L200 MainTranslator]: Completed pre-run [2024-09-12 21:50:58,071 WARN L247 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/certificate-witnesses-artifact/sv-benchmarks/c/loop-industry-pattern/mod3.c[394,407] [2024-09-12 21:50:58,078 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-09-12 21:50:58,103 INFO L204 MainTranslator]: Completed translation [2024-09-12 21:50:58,104 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.09 09:50:58 WrapperNode [2024-09-12 21:50:58,104 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-09-12 21:50:58,105 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-09-12 21:50:58,106 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-09-12 21:50:58,106 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-09-12 21:50:58,113 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.09 09:50:58" (1/1) ... [2024-09-12 21:50:58,122 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.09 09:50:58" (1/1) ... [2024-09-12 21:50:58,128 INFO L138 Inliner]: procedures = 13, calls = 15, calls flagged for inlining = 0, calls inlined = 0, statements flattened = 0 [2024-09-12 21:50:58,129 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-09-12 21:50:58,130 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-09-12 21:50:58,130 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-09-12 21:50:58,130 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-09-12 21:50:58,140 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.09 09:50:58" (1/1) ... [2024-09-12 21:50:58,141 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.09 09:50:58" (1/1) ... [2024-09-12 21:50:58,145 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.09 09:50:58" (1/1) ... [2024-09-12 21:50:58,157 INFO L175 MemorySlicer]: Split 9 memory accesses to 2 slices as follows [2, 7]. 78 percent of accesses are in the largest equivalence class. The 9 initializations are split as follows [2, 7]. The 0 writes are split as follows [0, 0]. [2024-09-12 21:50:58,157 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.09 09:50:58" (1/1) ... [2024-09-12 21:50:58,157 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.09 09:50:58" (1/1) ... [2024-09-12 21:50:58,162 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.09 09:50:58" (1/1) ... [2024-09-12 21:50:58,166 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.09 09:50:58" (1/1) ... [2024-09-12 21:50:58,168 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.09 09:50:58" (1/1) ... [2024-09-12 21:50:58,169 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.09 09:50:58" (1/1) ... [2024-09-12 21:50:58,170 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-09-12 21:50:58,171 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-09-12 21:50:58,171 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-09-12 21:50:58,171 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-09-12 21:50:58,172 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.09 09:50:58" (1/1) ... [2024-09-12 21:50:58,184 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-09-12 21:50:58,196 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/certificate-witnesses-artifact/automizer/z3 [2024-09-12 21:50:58,212 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-12 21:50:58,214 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-12 21:50:58,264 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-09-12 21:50:58,264 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2024-09-12 21:50:58,264 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2024-09-12 21:50:58,265 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-09-12 21:50:58,265 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-09-12 21:50:58,265 INFO L130 BoogieDeclarations]: Found specification of procedure main [2024-09-12 21:50:58,265 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2024-09-12 21:50:58,265 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-09-12 21:50:58,265 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#1 [2024-09-12 21:50:58,265 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2024-09-12 21:50:58,266 INFO L138 BoogieDeclarations]: Found implementation of procedure __VERIFIER_assert [2024-09-12 21:50:58,334 INFO L242 CfgBuilder]: Building ICFG [2024-09-12 21:50:58,336 INFO L268 CfgBuilder]: Building CFG for each procedure with an implementation [2024-09-12 21:50:58,509 INFO L? ?]: Removed 5 outVars from TransFormulas that were not future-live. [2024-09-12 21:50:58,509 INFO L291 CfgBuilder]: Performing block encoding [2024-09-12 21:50:58,541 INFO L313 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-09-12 21:50:58,542 INFO L318 CfgBuilder]: Removed 1 assume(true) statements. [2024-09-12 21:50:58,542 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 12.09 09:50:58 BoogieIcfgContainer [2024-09-12 21:50:58,543 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-09-12 21:50:58,546 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-09-12 21:50:58,547 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-09-12 21:50:58,550 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-09-12 21:50:58,550 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 12.09 09:50:57" (1/3) ... [2024-09-12 21:50:58,550 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@30289b4e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 12.09 09:50:58, skipping insertion in model container [2024-09-12 21:50:58,551 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.09 09:50:58" (2/3) ... [2024-09-12 21:50:58,552 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@30289b4e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 12.09 09:50:58, skipping insertion in model container [2024-09-12 21:50:58,553 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 12.09 09:50:58" (3/3) ... [2024-09-12 21:50:58,554 INFO L112 eAbstractionObserver]: Analyzing ICFG mod3.c [2024-09-12 21:50:58,570 INFO L209 ceAbstractionStarter]: Automizer settings: Hoare:All NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-09-12 21:50:58,571 INFO L149 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-09-12 21:50:58,637 INFO L335 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-09-12 21:50:58,646 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;@21a064ca, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-09-12 21:50:58,647 INFO L337 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-09-12 21:50:58,651 INFO L276 IsEmpty]: Start isEmpty. Operand has 22 states, 14 states have (on average 1.5714285714285714) internal successors, (22), 16 states have internal predecessors, (22), 3 states have call successors, (3), 3 states have call predecessors, (3), 3 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2024-09-12 21:50:58,657 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2024-09-12 21:50:58,658 INFO L208 NwaCegarLoop]: Found error trace [2024-09-12 21:50:58,659 INFO L216 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-09-12 21:50:58,659 INFO L399 AbstractCegarLoop]: === Iteration 1 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-09-12 21:50:58,665 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-12 21:50:58,666 INFO L85 PathProgramCache]: Analyzing trace with hash 224607860, now seen corresponding path program 1 times [2024-09-12 21:50:58,674 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-09-12 21:50:58,674 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [973445059] [2024-09-12 21:50:58,674 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-09-12 21:50:58,675 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-09-12 21:50:58,761 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-12 21:50:58,798 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2024-09-12 21:50:58,803 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-12 21:50:58,817 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-09-12 21:50:58,818 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-09-12 21:50:58,818 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [973445059] [2024-09-12 21:50:58,818 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [973445059] provided 1 perfect and 0 imperfect interpolant sequences [2024-09-12 21:50:58,819 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-09-12 21:50:58,819 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-09-12 21:50:58,820 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [573045588] [2024-09-12 21:50:58,822 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-09-12 21:50:58,826 INFO L551 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-09-12 21:50:58,826 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-09-12 21:50:58,848 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-09-12 21:50:58,849 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-09-12 21:50:58,851 INFO L87 Difference]: Start difference. First operand has 22 states, 14 states have (on average 1.5714285714285714) internal successors, (22), 16 states have internal predecessors, (22), 3 states have call successors, (3), 3 states have call predecessors, (3), 3 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) Second operand has 2 states, 2 states have (on average 3.5) internal successors, (7), 2 states have internal predecessors, (7), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-09-12 21:50:58,872 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-09-12 21:50:58,872 INFO L93 Difference]: Finished difference Result 34 states and 42 transitions. [2024-09-12 21:50:58,874 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-09-12 21:50:58,875 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 3.5) internal successors, (7), 2 states have internal predecessors, (7), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 11 [2024-09-12 21:50:58,875 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-09-12 21:50:58,881 INFO L225 Difference]: With dead ends: 34 [2024-09-12 21:50:58,881 INFO L226 Difference]: Without dead ends: 16 [2024-09-12 21:50:58,884 INFO L433 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 4 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-12 21:50:58,888 INFO L434 NwaCegarLoop]: 24 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, 24 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-12 21:50:58,889 INFO L435 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 24 Invalid, 2 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 2 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-09-12 21:50:58,906 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 16 states. [2024-09-12 21:50:58,918 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 16 to 16. [2024-09-12 21:50:58,919 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 16 states, 11 states have (on average 1.3636363636363635) internal successors, (15), 11 states have internal predecessors, (15), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-09-12 21:50:58,920 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16 states to 16 states and 19 transitions. [2024-09-12 21:50:58,921 INFO L78 Accepts]: Start accepts. Automaton has 16 states and 19 transitions. Word has length 11 [2024-09-12 21:50:58,921 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-09-12 21:50:58,921 INFO L474 AbstractCegarLoop]: Abstraction has 16 states and 19 transitions. [2024-09-12 21:50:58,921 INFO L475 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 3.5) internal successors, (7), 2 states have internal predecessors, (7), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-09-12 21:50:58,922 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-12 21:50:58,922 INFO L276 IsEmpty]: Start isEmpty. Operand 16 states and 19 transitions. [2024-09-12 21:50:58,923 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2024-09-12 21:50:58,923 INFO L208 NwaCegarLoop]: Found error trace [2024-09-12 21:50:58,923 INFO L216 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-09-12 21:50:58,923 WARN L456 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-09-12 21:50:58,924 INFO L399 AbstractCegarLoop]: === Iteration 2 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-09-12 21:50:58,924 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-12 21:50:58,925 INFO L85 PathProgramCache]: Analyzing trace with hash -1271812232, now seen corresponding path program 1 times [2024-09-12 21:50:58,925 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-09-12 21:50:58,925 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1914493361] [2024-09-12 21:50:58,925 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-09-12 21:50:58,925 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-09-12 21:50:58,959 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-12 21:50:59,094 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2024-09-12 21:50:59,101 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-12 21:50:59,110 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-09-12 21:50:59,110 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-09-12 21:50:59,110 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1914493361] [2024-09-12 21:50:59,111 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1914493361] provided 1 perfect and 0 imperfect interpolant sequences [2024-09-12 21:50:59,111 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-09-12 21:50:59,111 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-09-12 21:50:59,111 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [638549564] [2024-09-12 21:50:59,111 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-09-12 21:50:59,112 INFO L551 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-09-12 21:50:59,113 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-09-12 21:50:59,113 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-09-12 21:50:59,114 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-09-12 21:50:59,114 INFO L87 Difference]: Start difference. First operand 16 states and 19 transitions. Second operand has 3 states, 3 states have (on average 2.6666666666666665) internal successors, (8), 3 states have internal predecessors, (8), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-09-12 21:50:59,140 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-09-12 21:50:59,140 INFO L93 Difference]: Finished difference Result 27 states and 33 transitions. [2024-09-12 21:50:59,141 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-09-12 21:50:59,141 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 2.6666666666666665) internal successors, (8), 3 states have internal predecessors, (8), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 12 [2024-09-12 21:50:59,141 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-09-12 21:50:59,142 INFO L225 Difference]: With dead ends: 27 [2024-09-12 21:50:59,142 INFO L226 Difference]: Without dead ends: 21 [2024-09-12 21:50:59,142 INFO L433 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-09-12 21:50:59,143 INFO L434 NwaCegarLoop]: 18 mSDtfsCounter, 3 mSDsluCounter, 12 mSDsCounter, 0 mSdLazyCounter, 5 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3 SdHoareTripleChecker+Valid, 30 SdHoareTripleChecker+Invalid, 9 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 5 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-09-12 21:50:59,144 INFO L435 NwaCegarLoop]: SdHoareTripleChecker [3 Valid, 30 Invalid, 9 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 5 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-09-12 21:50:59,145 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 21 states. [2024-09-12 21:50:59,149 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 21 to 18. [2024-09-12 21:50:59,152 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 18 states, 13 states have (on average 1.3076923076923077) internal successors, (17), 13 states have internal predecessors, (17), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-09-12 21:50:59,153 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18 states to 18 states and 21 transitions. [2024-09-12 21:50:59,153 INFO L78 Accepts]: Start accepts. Automaton has 18 states and 21 transitions. Word has length 12 [2024-09-12 21:50:59,154 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-09-12 21:50:59,154 INFO L474 AbstractCegarLoop]: Abstraction has 18 states and 21 transitions. [2024-09-12 21:50:59,154 INFO L475 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 2.6666666666666665) internal successors, (8), 3 states have internal predecessors, (8), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-09-12 21:50:59,155 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-12 21:50:59,155 INFO L276 IsEmpty]: Start isEmpty. Operand 18 states and 21 transitions. [2024-09-12 21:50:59,156 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2024-09-12 21:50:59,157 INFO L208 NwaCegarLoop]: Found error trace [2024-09-12 21:50:59,157 INFO L216 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-09-12 21:50:59,157 WARN L456 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-09-12 21:50:59,157 INFO L399 AbstractCegarLoop]: === Iteration 3 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-09-12 21:50:59,159 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-12 21:50:59,159 INFO L85 PathProgramCache]: Analyzing trace with hash 2135277573, now seen corresponding path program 1 times [2024-09-12 21:50:59,159 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-09-12 21:50:59,160 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [104942029] [2024-09-12 21:50:59,160 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-09-12 21:50:59,160 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-09-12 21:50:59,190 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-12 21:50:59,570 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2024-09-12 21:50:59,572 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-12 21:50:59,575 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-09-12 21:50:59,576 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-09-12 21:50:59,576 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [104942029] [2024-09-12 21:50:59,576 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [104942029] provided 0 perfect and 1 imperfect interpolant sequences [2024-09-12 21:50:59,576 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [71031264] [2024-09-12 21:50:59,577 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-09-12 21:50:59,577 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-09-12 21:50:59,577 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/certificate-witnesses-artifact/automizer/z3 [2024-09-12 21:50:59,579 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-12 21:50:59,581 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-12 21:50:59,645 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-12 21:50:59,647 INFO L262 TraceCheckSpWp]: Trace formula consists of 70 conjuncts, 9 conjuncts are in the unsatisfiable core [2024-09-12 21:50:59,655 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2024-09-12 21:50:59,941 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-09-12 21:50:59,942 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2024-09-12 21:51:12,038 WARN L876 $PredicateComparison]: unable to prove that (or (not (= (mod (mod c_main_~x~0 4294967296) 3) 1)) (< (+ c_main_~x~0 1) (let ((.cse0 (div (+ 2 c_main_~x~0) 4294967296))) (+ (* .cse0 4294967296) (* (div (+ (* .cse0 (- 4294967296)) 2 c_main_~x~0) 3) 3))))) is different from true [2024-09-12 21:51:28,123 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 2 not checked. [2024-09-12 21:51:28,124 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [71031264] provided 0 perfect and 2 imperfect interpolant sequences [2024-09-12 21:51:28,124 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-09-12 21:51:28,124 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6, 6] total 11 [2024-09-12 21:51:28,124 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [67064233] [2024-09-12 21:51:28,124 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-09-12 21:51:28,125 INFO L551 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2024-09-12 21:51:28,125 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-09-12 21:51:28,126 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2024-09-12 21:51:28,126 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=70, Unknown=1, NotChecked=16, Total=110 [2024-09-12 21:51:28,126 INFO L87 Difference]: Start difference. First operand 18 states and 21 transitions. Second operand has 11 states, 11 states have (on average 2.1818181818181817) internal successors, (24), 9 states have internal predecessors, (24), 3 states have call successors, (5), 3 states have call predecessors, (5), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-09-12 21:51:32,317 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-09-12 21:51:36,364 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-09-12 21:51:36,376 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-09-12 21:51:36,377 INFO L93 Difference]: Finished difference Result 52 states and 69 transitions. [2024-09-12 21:51:36,377 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-09-12 21:51:36,377 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 11 states have (on average 2.1818181818181817) internal successors, (24), 9 states have internal predecessors, (24), 3 states have call successors, (5), 3 states have call predecessors, (5), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 15 [2024-09-12 21:51:36,378 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-09-12 21:51:36,378 INFO L225 Difference]: With dead ends: 52 [2024-09-12 21:51:36,378 INFO L226 Difference]: Without dead ends: 33 [2024-09-12 21:51:36,379 INFO L433 NwaCegarLoop]: 0 DeclaredPredicates, 40 GetRequests, 25 SyntacticMatches, 4 SemanticMatches, 11 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 22 ImplicationChecksByTransitivity, 4.2s TimeCoverageRelationStatistics Valid=34, Invalid=101, Unknown=1, NotChecked=20, Total=156 [2024-09-12 21:51:36,380 INFO L434 NwaCegarLoop]: 18 mSDtfsCounter, 15 mSDsluCounter, 87 mSDsCounter, 0 mSdLazyCounter, 106 mSolverCounterSat, 6 mSolverCounterUnsat, 2 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 8.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 15 SdHoareTripleChecker+Valid, 105 SdHoareTripleChecker+Invalid, 157 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 106 IncrementalHoareTripleChecker+Invalid, 2 IncrementalHoareTripleChecker+Unknown, 43 IncrementalHoareTripleChecker+Unchecked, 8.2s IncrementalHoareTripleChecker+Time [2024-09-12 21:51:36,380 INFO L435 NwaCegarLoop]: SdHoareTripleChecker [15 Valid, 105 Invalid, 157 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 106 Invalid, 2 Unknown, 43 Unchecked, 8.2s Time] [2024-09-12 21:51:36,381 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 33 states. [2024-09-12 21:51:36,387 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 33 to 26. [2024-09-12 21:51:36,388 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 26 states, 21 states have (on average 1.2857142857142858) internal successors, (27), 21 states have internal predecessors, (27), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-09-12 21:51:36,388 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 26 states to 26 states and 31 transitions. [2024-09-12 21:51:36,388 INFO L78 Accepts]: Start accepts. Automaton has 26 states and 31 transitions. Word has length 15 [2024-09-12 21:51:36,389 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-09-12 21:51:36,389 INFO L474 AbstractCegarLoop]: Abstraction has 26 states and 31 transitions. [2024-09-12 21:51:36,389 INFO L475 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 2.1818181818181817) internal successors, (24), 9 states have internal predecessors, (24), 3 states have call successors, (5), 3 states have call predecessors, (5), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-09-12 21:51:36,389 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-12 21:51:36,389 INFO L276 IsEmpty]: Start isEmpty. Operand 26 states and 31 transitions. [2024-09-12 21:51:36,390 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2024-09-12 21:51:36,390 INFO L208 NwaCegarLoop]: Found error trace [2024-09-12 21:51:36,390 INFO L216 NwaCegarLoop]: trace histogram [3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-09-12 21:51:36,409 INFO L552 MonitoredProcess]: [MP /storage/repos/certificate-witnesses-artifact/automizer/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2024-09-12 21:51:36,591 WARN L456 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2,2 /storage/repos/certificate-witnesses-artifact/automizer/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-09-12 21:51:36,592 INFO L399 AbstractCegarLoop]: === Iteration 4 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-09-12 21:51:36,592 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-12 21:51:36,592 INFO L85 PathProgramCache]: Analyzing trace with hash 1270807741, now seen corresponding path program 1 times [2024-09-12 21:51:36,592 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-09-12 21:51:36,592 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2062529791] [2024-09-12 21:51:36,592 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-09-12 21:51:36,593 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-09-12 21:51:36,626 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-12 21:51:37,002 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2024-09-12 21:51:37,003 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-12 21:51:37,007 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 7 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-09-12 21:51:37,007 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-09-12 21:51:37,008 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2062529791] [2024-09-12 21:51:37,009 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2062529791] provided 1 perfect and 0 imperfect interpolant sequences [2024-09-12 21:51:37,009 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-09-12 21:51:37,009 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-09-12 21:51:37,009 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1132638029] [2024-09-12 21:51:37,009 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-09-12 21:51:37,009 INFO L551 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-09-12 21:51:37,009 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-09-12 21:51:37,010 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-09-12 21:51:37,010 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2024-09-12 21:51:37,010 INFO L87 Difference]: Start difference. First operand 26 states and 31 transitions. Second operand has 7 states, 7 states have (on average 2.2857142857142856) internal successors, (16), 6 states have internal predecessors, (16), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-09-12 21:51:41,036 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.01s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-09-12 21:51:45,073 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.04s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-09-12 21:51:49,128 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-09-12 21:51:53,139 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-09-12 21:51:53,259 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-09-12 21:51:53,259 INFO L93 Difference]: Finished difference Result 50 states and 62 transitions. [2024-09-12 21:51:53,259 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-09-12 21:51:53,260 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 2.2857142857142856) internal successors, (16), 6 states have internal predecessors, (16), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 20 [2024-09-12 21:51:53,260 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-09-12 21:51:53,260 INFO L225 Difference]: With dead ends: 50 [2024-09-12 21:51:53,261 INFO L226 Difference]: Without dead ends: 33 [2024-09-12 21:51:53,262 INFO L433 NwaCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 4 SyntacticMatches, 1 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2024-09-12 21:51:53,263 INFO L434 NwaCegarLoop]: 17 mSDtfsCounter, 5 mSDsluCounter, 52 mSDsCounter, 0 mSdLazyCounter, 43 mSolverCounterSat, 5 mSolverCounterUnsat, 4 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 16.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 5 SdHoareTripleChecker+Valid, 69 SdHoareTripleChecker+Invalid, 52 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 43 IncrementalHoareTripleChecker+Invalid, 4 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 16.2s IncrementalHoareTripleChecker+Time [2024-09-12 21:51:53,265 INFO L435 NwaCegarLoop]: SdHoareTripleChecker [5 Valid, 69 Invalid, 52 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 43 Invalid, 4 Unknown, 0 Unchecked, 16.2s Time] [2024-09-12 21:51:53,265 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 33 states. [2024-09-12 21:51:53,282 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 33 to 29. [2024-09-12 21:51:53,283 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 29 states, 24 states have (on average 1.2916666666666667) internal successors, (31), 24 states have internal predecessors, (31), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-09-12 21:51:53,284 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 29 states to 29 states and 35 transitions. [2024-09-12 21:51:53,285 INFO L78 Accepts]: Start accepts. Automaton has 29 states and 35 transitions. Word has length 20 [2024-09-12 21:51:53,286 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-09-12 21:51:53,286 INFO L474 AbstractCegarLoop]: Abstraction has 29 states and 35 transitions. [2024-09-12 21:51:53,286 INFO L475 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 2.2857142857142856) internal successors, (16), 6 states have internal predecessors, (16), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-09-12 21:51:53,286 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-12 21:51:53,286 INFO L276 IsEmpty]: Start isEmpty. Operand 29 states and 35 transitions. [2024-09-12 21:51:53,287 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2024-09-12 21:51:53,287 INFO L208 NwaCegarLoop]: Found error trace [2024-09-12 21:51:53,287 INFO L216 NwaCegarLoop]: trace histogram [3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-09-12 21:51:53,287 WARN L456 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2024-09-12 21:51:53,287 INFO L399 AbstractCegarLoop]: === Iteration 5 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-09-12 21:51:53,287 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-12 21:51:53,288 INFO L85 PathProgramCache]: Analyzing trace with hash 1971872319, now seen corresponding path program 1 times [2024-09-12 21:51:53,288 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-09-12 21:51:53,288 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1639322306] [2024-09-12 21:51:53,288 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-09-12 21:51:53,288 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-09-12 21:51:53,307 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-12 21:51:53,571 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2024-09-12 21:51:53,572 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-12 21:51:53,579 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 7 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-09-12 21:51:53,579 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-09-12 21:51:53,580 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1639322306] [2024-09-12 21:51:53,580 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1639322306] provided 1 perfect and 0 imperfect interpolant sequences [2024-09-12 21:51:53,580 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-09-12 21:51:53,580 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-09-12 21:51:53,580 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1834041355] [2024-09-12 21:51:53,580 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-09-12 21:51:53,580 INFO L551 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-09-12 21:51:53,580 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-09-12 21:51:53,581 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-09-12 21:51:53,581 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2024-09-12 21:51:53,581 INFO L87 Difference]: Start difference. First operand 29 states and 35 transitions. Second operand has 7 states, 7 states have (on average 2.2857142857142856) internal successors, (16), 6 states have internal predecessors, (16), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-09-12 21:51:57,601 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-09-12 21:52:01,606 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-09-12 21:52:05,784 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-09-12 21:52:05,825 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-09-12 21:52:05,825 INFO L93 Difference]: Finished difference Result 53 states and 66 transitions. [2024-09-12 21:52:05,825 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-09-12 21:52:05,825 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 2.2857142857142856) internal successors, (16), 6 states have internal predecessors, (16), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 20 [2024-09-12 21:52:05,826 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-09-12 21:52:05,826 INFO L225 Difference]: With dead ends: 53 [2024-09-12 21:52:05,826 INFO L226 Difference]: Without dead ends: 0 [2024-09-12 21:52:05,826 INFO L433 NwaCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=22, Invalid=50, Unknown=0, NotChecked=0, Total=72 [2024-09-12 21:52:05,829 INFO L434 NwaCegarLoop]: 15 mSDtfsCounter, 5 mSDsluCounter, 51 mSDsCounter, 0 mSdLazyCounter, 57 mSolverCounterSat, 4 mSolverCounterUnsat, 3 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 12.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 5 SdHoareTripleChecker+Valid, 66 SdHoareTripleChecker+Invalid, 64 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 57 IncrementalHoareTripleChecker+Invalid, 3 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 12.2s IncrementalHoareTripleChecker+Time [2024-09-12 21:52:05,830 INFO L435 NwaCegarLoop]: SdHoareTripleChecker [5 Valid, 66 Invalid, 64 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 57 Invalid, 3 Unknown, 0 Unchecked, 12.2s Time] [2024-09-12 21:52:05,831 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2024-09-12 21:52:05,831 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2024-09-12 21:52:05,831 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-12 21:52:05,834 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2024-09-12 21:52:05,834 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 20 [2024-09-12 21:52:05,834 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-09-12 21:52:05,834 INFO L474 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2024-09-12 21:52:05,834 INFO L475 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 2.2857142857142856) internal successors, (16), 6 states have internal predecessors, (16), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-09-12 21:52:05,835 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-12 21:52:05,835 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2024-09-12 21:52:05,835 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2024-09-12 21:52:05,839 INFO L785 garLoopResultBuilder]: Registering result SAFE for location __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2024-09-12 21:52:05,840 WARN L456 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2024-09-12 21:52:05,843 INFO L408 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1] [2024-09-12 21:52:05,846 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2024-09-12 21:52:06,327 INFO L165 ceAbstractionStarter]: Computing trace abstraction results [2024-09-12 21:52:06,347 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 12.09 09:52:06 BoogieIcfgContainer [2024-09-12 21:52:06,347 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2024-09-12 21:52:06,348 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2024-09-12 21:52:06,348 INFO L270 PluginConnector]: Initializing Witness Printer... [2024-09-12 21:52:06,349 INFO L274 PluginConnector]: Witness Printer initialized [2024-09-12 21:52:06,349 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 12.09 09:50:58" (3/4) ... [2024-09-12 21:52:06,351 INFO L139 WitnessPrinter]: Generating witness for correct program [2024-09-12 21:52:06,354 INFO L361 RCFGBacktranslator]: Ignoring RootEdge to procedure ULTIMATE.init [2024-09-12 21:52:06,354 INFO L361 RCFGBacktranslator]: Ignoring RootEdge to procedure main [2024-09-12 21:52:06,354 INFO L361 RCFGBacktranslator]: Ignoring RootEdge to procedure __VERIFIER_assert [2024-09-12 21:52:06,357 INFO L896 BoogieBacktranslator]: Reduced CFG by removing 16 nodes and edges [2024-09-12 21:52:06,359 INFO L896 BoogieBacktranslator]: Reduced CFG by removing 7 nodes and edges [2024-09-12 21:52:06,359 INFO L896 BoogieBacktranslator]: Reduced CFG by removing 4 nodes and edges [2024-09-12 21:52:06,359 INFO L896 BoogieBacktranslator]: Reduced CFG by removing 1 nodes and edges [2024-09-12 21:52:06,359 INFO L896 BoogieBacktranslator]: Reduced CFG by removing 1 nodes and edges [2024-09-12 21:52:06,437 INFO L149 WitnessManager]: Wrote witness to /storage/repos/certificate-witnesses-artifact/automizer/witness.graphml [2024-09-12 21:52:06,438 INFO L149 WitnessManager]: Wrote witness to /storage/repos/certificate-witnesses-artifact/automizer/witness.yml [2024-09-12 21:52:06,438 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2024-09-12 21:52:06,440 INFO L158 Benchmark]: Toolchain (without parser) took 68567.66ms. Allocated memory is still 146.8MB. Free memory was 112.3MB in the beginning and 88.3MB in the end (delta: 24.0MB). Peak memory consumption was 25.9MB. Max. memory is 16.1GB. [2024-09-12 21:52:06,441 INFO L158 Benchmark]: CDTParser took 0.16ms. Allocated memory is still 109.1MB. Free memory was 82.9MB in the beginning and 82.7MB in the end (delta: 159.4kB). There was no memory consumed. Max. memory is 16.1GB. [2024-09-12 21:52:06,441 INFO L158 Benchmark]: CACSL2BoogieTranslator took 232.52ms. Allocated memory is still 146.8MB. Free memory was 112.1MB in the beginning and 101.0MB in the end (delta: 11.1MB). Peak memory consumption was 12.6MB. Max. memory is 16.1GB. [2024-09-12 21:52:06,441 INFO L158 Benchmark]: Boogie Procedure Inliner took 24.17ms. Allocated memory is still 146.8MB. Free memory was 101.0MB in the beginning and 99.8MB in the end (delta: 1.2MB). There was no memory consumed. Max. memory is 16.1GB. [2024-09-12 21:52:06,441 INFO L158 Benchmark]: Boogie Preprocessor took 40.74ms. Allocated memory is still 146.8MB. Free memory was 99.8MB in the beginning and 98.2MB in the end (delta: 1.6MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2024-09-12 21:52:06,442 INFO L158 Benchmark]: RCFGBuilder took 372.50ms. Allocated memory is still 146.8MB. Free memory was 98.2MB in the beginning and 85.1MB in the end (delta: 13.1MB). Peak memory consumption was 12.6MB. Max. memory is 16.1GB. [2024-09-12 21:52:06,442 INFO L158 Benchmark]: TraceAbstraction took 67801.43ms. Allocated memory is still 146.8MB. Free memory was 84.2MB in the beginning and 92.5MB in the end (delta: -8.3MB). Peak memory consumption was 51.2MB. Max. memory is 16.1GB. [2024-09-12 21:52:06,442 INFO L158 Benchmark]: Witness Printer took 89.57ms. Allocated memory is still 146.8MB. Free memory was 92.5MB in the beginning and 88.3MB in the end (delta: 4.2MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. [2024-09-12 21:52:06,444 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.16ms. Allocated memory is still 109.1MB. Free memory was 82.9MB in the beginning and 82.7MB in the end (delta: 159.4kB). There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 232.52ms. Allocated memory is still 146.8MB. Free memory was 112.1MB in the beginning and 101.0MB in the end (delta: 11.1MB). Peak memory consumption was 12.6MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 24.17ms. Allocated memory is still 146.8MB. Free memory was 101.0MB in the beginning and 99.8MB in the end (delta: 1.2MB). There was no memory consumed. Max. memory is 16.1GB. * Boogie Preprocessor took 40.74ms. Allocated memory is still 146.8MB. Free memory was 99.8MB in the beginning and 98.2MB in the end (delta: 1.6MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * RCFGBuilder took 372.50ms. Allocated memory is still 146.8MB. Free memory was 98.2MB in the beginning and 85.1MB in the end (delta: 13.1MB). Peak memory consumption was 12.6MB. Max. memory is 16.1GB. * TraceAbstraction took 67801.43ms. Allocated memory is still 146.8MB. Free memory was 84.2MB in the beginning and 92.5MB in the end (delta: -8.3MB). Peak memory consumption was 51.2MB. Max. memory is 16.1GB. * Witness Printer took 89.57ms. Allocated memory is still 146.8MB. Free memory was 92.5MB in the beginning and 88.3MB in the end (delta: 4.2MB). Peak memory consumption was 4.2MB. 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: 10]: 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 4 procedures, 22 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 67.2s, OverallIterations: 5, TraceHistogramMax: 3, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 36.9s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 9 mSolverCounterUnknown, 28 SdHoareTripleChecker+Valid, 36.6s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 28 mSDsluCounter, 294 SdHoareTripleChecker+Invalid, 36.5s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 43 IncrementalHoareTripleChecker+Unchecked, 202 mSDsCounter, 19 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 213 IncrementalHoareTripleChecker+Invalid, 284 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 19 mSolverCounterUnsat, 92 mSDtfsCounter, 213 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 9 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 72 GetRequests, 42 SyntacticMatches, 5 SemanticMatches, 25 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 33 ImplicationChecksByTransitivity, 4.3s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=29occurred in iteration=4, InterpolantAutomatonStates: 26, 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, 5 MinimizatonAttempts, 14 StatesRemovedByMinimization, 3 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.1s SatisfiabilityAnalysisTime, 29.7s InterpolantComputationTime, 93 NumberOfCodeBlocks, 93 NumberOfCodeBlocksAsserted, 6 NumberOfCheckSat, 101 ConstructedInterpolants, 0 QuantifiedInterpolants, 1024 SizeOfPredicates, 1 NumberOfNonLiveVariables, 70 ConjunctsInSsa, 9 ConjunctsInUnsatCore, 7 InterpolantComputations, 4 PerfectInterpolantSequences, 14/20 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: 18]: Loop Invariant Derived loop invariant: ((x < (((4294967296 * (x / 4294967296)) + 1) + ((((-4294967296 * (x / 4294967296)) + x) / 3) * 3))) || (y == 1)) - ProcedureContractResult [Line: 8]: Procedure Contract for __VERIFIER_assert Derived contract for procedure __VERIFIER_assert. Requires: (\old(cond) != 0) Ensures: (\old(cond) != 0) RESULT: Ultimate proved your program to be correct! [2024-09-12 21:52:06,481 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