./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/nla-digbench-scaling/ps4-ll_valuebound5.c --full-output --procedureinliner.inline.calls.to.implemented.procedures NEVER --traceabstraction.positions.where.we.compute.the.hoare.annotation All --witnessprinter.yaml.format.version 2.1 --witnessprinter.generate.graphml.witnesses false --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version de325976 Calling Ultimate with: /root/.sdkman/candidates/java/current/bin/java -Dosgi.configuration.area=/storage/repos/certificate-witnesses-artifact/automizer/data/config -Xmx15G -Xms4m -jar /storage/repos/certificate-witnesses-artifact/automizer/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/certificate-witnesses-artifact/automizer/data -tc /storage/repos/certificate-witnesses-artifact/automizer/config/AutomizerReach.xml -i ../sv-benchmarks/c/nla-digbench-scaling/ps4-ll_valuebound5.c -s /storage/repos/certificate-witnesses-artifact/automizer/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/certificate-witnesses-artifact/automizer --witnessprinter.witness.filename witness --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! call(reach_error())) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash b2a54f54b02d2bb65a6f46eeae11edba1907f4f082d2aaa313102e422e7e6122 --procedureinliner.inline.calls.to.implemented.procedures NEVER --traceabstraction.positions.where.we.compute.the.hoare.annotation All --witnessprinter.yaml.format.version 2.1 --witnessprinter.generate.graphml.witnesses false --- Real Ultimate output --- This is Ultimate 0.2.4-tmp.dk.referee-eval-de32597-m [2024-09-18 16:34:08,955 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-09-18 16:34:09,008 INFO L114 SettingsManager]: Loading settings from /storage/repos/certificate-witnesses-artifact/automizer/config/svcomp-Reach-32bit-Automizer_Default.epf [2024-09-18 16:34:09,011 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-09-18 16:34:09,014 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-09-18 16:34:09,046 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-09-18 16:34:09,047 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-09-18 16:34:09,048 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-09-18 16:34:09,048 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-09-18 16:34:09,050 INFO L153 SettingsManager]: * Use memory slicer=true [2024-09-18 16:34:09,051 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-09-18 16:34:09,051 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-09-18 16:34:09,051 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-09-18 16:34:09,051 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-09-18 16:34:09,052 INFO L153 SettingsManager]: * Use SBE=true [2024-09-18 16:34:09,052 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-09-18 16:34:09,052 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-09-18 16:34:09,052 INFO L153 SettingsManager]: * sizeof long=4 [2024-09-18 16:34:09,052 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-09-18 16:34:09,052 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-09-18 16:34:09,053 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-09-18 16:34:09,058 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-09-18 16:34:09,058 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-09-18 16:34:09,058 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-09-18 16:34:09,059 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-09-18 16:34:09,059 INFO L153 SettingsManager]: * sizeof long double=12 [2024-09-18 16:34:09,059 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-09-18 16:34:09,059 INFO L153 SettingsManager]: * Use constant arrays=true [2024-09-18 16:34:09,059 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-09-18 16:34:09,059 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-09-18 16:34:09,059 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-09-18 16:34:09,059 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-09-18 16:34:09,060 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-09-18 16:34:09,060 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-09-18 16:34:09,060 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-09-18 16:34:09,060 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-09-18 16:34:09,060 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-09-18 16:34:09,060 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-09-18 16:34:09,060 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-09-18 16:34:09,060 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-09-18 16:34:09,060 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-09-18 16:34:09,061 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-09-18 16:34:09,061 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 -> b2a54f54b02d2bb65a6f46eeae11edba1907f4f082d2aaa313102e422e7e6122 Applying setting for plugin de.uni_freiburg.informatik.ultimate.boogie.procedureinliner: Inline calls to implemented procedures -> NEVER Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: Positions where we compute the Hoare Annotation -> All Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: YAML Format version -> 2.1 Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Generate GraphML witnesses -> false [2024-09-18 16:34:09,244 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-09-18 16:34:09,262 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-09-18 16:34:09,265 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-09-18 16:34:09,265 INFO L270 PluginConnector]: Initializing CDTParser... [2024-09-18 16:34:09,266 INFO L274 PluginConnector]: CDTParser initialized [2024-09-18 16:34:09,267 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/certificate-witnesses-artifact/automizer/../sv-benchmarks/c/nla-digbench-scaling/ps4-ll_valuebound5.c [2024-09-18 16:34:10,559 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-09-18 16:34:10,688 INFO L384 CDTParser]: Found 1 translation units. [2024-09-18 16:34:10,689 INFO L180 CDTParser]: Scanning /storage/repos/certificate-witnesses-artifact/sv-benchmarks/c/nla-digbench-scaling/ps4-ll_valuebound5.c [2024-09-18 16:34:10,695 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/certificate-witnesses-artifact/automizer/data/b2bd39ac6/25007d911c2b4f97940d6080013e99ea/FLAGdab73885f [2024-09-18 16:34:11,105 INFO L435 CDTParser]: Successfully deleted /storage/repos/certificate-witnesses-artifact/automizer/data/b2bd39ac6/25007d911c2b4f97940d6080013e99ea [2024-09-18 16:34:11,107 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-09-18 16:34:11,108 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-09-18 16:34:11,108 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-09-18 16:34:11,112 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-09-18 16:34:11,116 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-09-18 16:34:11,116 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 18.09 04:34:11" (1/1) ... [2024-09-18 16:34:11,117 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@7ce20f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.09 04:34:11, skipping insertion in model container [2024-09-18 16:34:11,117 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 18.09 04:34:11" (1/1) ... [2024-09-18 16:34:11,132 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-09-18 16:34:11,251 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/ps4-ll_valuebound5.c[458,471] [2024-09-18 16:34:11,266 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-09-18 16:34:11,275 INFO L200 MainTranslator]: Completed pre-run [2024-09-18 16:34:11,285 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/ps4-ll_valuebound5.c[458,471] [2024-09-18 16:34:11,291 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-09-18 16:34:11,307 INFO L204 MainTranslator]: Completed translation [2024-09-18 16:34:11,307 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.09 04:34:11 WrapperNode [2024-09-18 16:34:11,307 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-09-18 16:34:11,308 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-09-18 16:34:11,308 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-09-18 16:34:11,309 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-09-18 16:34:11,314 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.09 04:34:11" (1/1) ... [2024-09-18 16:34:11,319 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.09 04:34:11" (1/1) ... [2024-09-18 16:34:11,323 INFO L138 Inliner]: procedures = 14, calls = 11, calls flagged for inlining = 0, calls inlined = 0, statements flattened = 0 [2024-09-18 16:34:11,323 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-09-18 16:34:11,324 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-09-18 16:34:11,324 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-09-18 16:34:11,324 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-09-18 16:34:11,331 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.09 04:34:11" (1/1) ... [2024-09-18 16:34:11,331 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.09 04:34:11" (1/1) ... [2024-09-18 16:34:11,332 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.09 04:34:11" (1/1) ... [2024-09-18 16:34:11,344 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-18 16:34:11,344 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.09 04:34:11" (1/1) ... [2024-09-18 16:34:11,345 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.09 04:34:11" (1/1) ... [2024-09-18 16:34:11,346 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.09 04:34:11" (1/1) ... [2024-09-18 16:34:11,348 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.09 04:34:11" (1/1) ... [2024-09-18 16:34:11,349 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.09 04:34:11" (1/1) ... [2024-09-18 16:34:11,349 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.09 04:34:11" (1/1) ... [2024-09-18 16:34:11,350 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-09-18 16:34:11,351 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-09-18 16:34:11,351 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-09-18 16:34:11,351 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-09-18 16:34:11,352 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.09 04:34:11" (1/1) ... [2024-09-18 16:34:11,356 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-09-18 16:34:11,365 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/certificate-witnesses-artifact/automizer/z3 [2024-09-18 16:34:11,377 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-18 16:34:11,379 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-18 16:34:11,412 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-09-18 16:34:11,412 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2024-09-18 16:34:11,412 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2024-09-18 16:34:11,412 INFO L130 BoogieDeclarations]: Found specification of procedure main [2024-09-18 16:34:11,412 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2024-09-18 16:34:11,412 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-09-18 16:34:11,412 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2024-09-18 16:34:11,414 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2024-09-18 16:34:11,414 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-09-18 16:34:11,414 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-09-18 16:34:11,414 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2024-09-18 16:34:11,414 INFO L138 BoogieDeclarations]: Found implementation of procedure __VERIFIER_assert [2024-09-18 16:34:11,487 INFO L242 CfgBuilder]: Building ICFG [2024-09-18 16:34:11,489 INFO L268 CfgBuilder]: Building CFG for each procedure with an implementation [2024-09-18 16:34:11,631 INFO L? ?]: Removed 5 outVars from TransFormulas that were not future-live. [2024-09-18 16:34:11,633 INFO L291 CfgBuilder]: Performing block encoding [2024-09-18 16:34:11,654 INFO L313 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-09-18 16:34:11,655 INFO L318 CfgBuilder]: Removed 1 assume(true) statements. [2024-09-18 16:34:11,655 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 18.09 04:34:11 BoogieIcfgContainer [2024-09-18 16:34:11,655 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-09-18 16:34:11,657 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-09-18 16:34:11,657 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-09-18 16:34:11,659 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-09-18 16:34:11,659 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 18.09 04:34:11" (1/3) ... [2024-09-18 16:34:11,660 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@60214174 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 18.09 04:34:11, skipping insertion in model container [2024-09-18 16:34:11,660 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.09 04:34:11" (2/3) ... [2024-09-18 16:34:11,660 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@60214174 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 18.09 04:34:11, skipping insertion in model container [2024-09-18 16:34:11,660 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 18.09 04:34:11" (3/3) ... [2024-09-18 16:34:11,661 INFO L112 eAbstractionObserver]: Analyzing ICFG ps4-ll_valuebound5.c [2024-09-18 16:34:11,673 INFO L209 ceAbstractionStarter]: Automizer settings: Hoare:All NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-09-18 16:34:11,673 INFO L149 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-09-18 16:34:11,711 INFO L335 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-09-18 16:34:11,716 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;@233fa06a, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-09-18 16:34:11,716 INFO L337 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-09-18 16:34:11,719 INFO L276 IsEmpty]: Start isEmpty. Operand has 26 states, 14 states have (on average 1.4285714285714286) internal successors, (20), 15 states have internal predecessors, (20), 6 states have call successors, (6), 4 states have call predecessors, (6), 4 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2024-09-18 16:34:11,724 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2024-09-18 16:34:11,724 INFO L208 NwaCegarLoop]: Found error trace [2024-09-18 16:34:11,724 INFO L216 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-09-18 16:34:11,725 INFO L399 AbstractCegarLoop]: === Iteration 1 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-09-18 16:34:11,728 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-18 16:34:11,729 INFO L85 PathProgramCache]: Analyzing trace with hash 1238311395, now seen corresponding path program 1 times [2024-09-18 16:34:11,735 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-09-18 16:34:11,735 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [15362114] [2024-09-18 16:34:11,736 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-09-18 16:34:11,736 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-09-18 16:34:11,800 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-18 16:34:11,830 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2024-09-18 16:34:11,833 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-18 16:34:11,838 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-09-18 16:34:11,839 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-18 16:34:11,842 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-18 16:34:11,843 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-09-18 16:34:11,843 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [15362114] [2024-09-18 16:34:11,844 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [15362114] provided 1 perfect and 0 imperfect interpolant sequences [2024-09-18 16:34:11,844 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-09-18 16:34:11,844 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-09-18 16:34:11,845 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1209426144] [2024-09-18 16:34:11,846 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-09-18 16:34:11,848 INFO L551 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-09-18 16:34:11,849 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-09-18 16:34:11,865 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-09-18 16:34:11,866 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-09-18 16:34:11,868 INFO L87 Difference]: Start difference. First operand has 26 states, 14 states have (on average 1.4285714285714286) internal successors, (20), 15 states have internal predecessors, (20), 6 states have call successors, (6), 4 states have call predecessors, (6), 4 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) Second operand has 2 states, 2 states have (on average 5.0) internal successors, (10), 2 states have internal predecessors, (10), 2 states have call successors, (4), 2 states have call predecessors, (4), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) [2024-09-18 16:34:11,885 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-09-18 16:34:11,885 INFO L93 Difference]: Finished difference Result 44 states and 58 transitions. [2024-09-18 16:34:11,886 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-09-18 16:34:11,887 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 5.0) internal successors, (10), 2 states have internal predecessors, (10), 2 states have call successors, (4), 2 states have call predecessors, (4), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) Word has length 16 [2024-09-18 16:34:11,888 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-09-18 16:34:11,892 INFO L225 Difference]: With dead ends: 44 [2024-09-18 16:34:11,892 INFO L226 Difference]: Without dead ends: 22 [2024-09-18 16:34:11,894 INFO L433 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 7 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-09-18 16:34:11,897 INFO L434 NwaCegarLoop]: 26 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 2 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 26 SdHoareTripleChecker+Invalid, 2 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 2 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-09-18 16:34:11,897 INFO L435 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 26 Invalid, 2 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 2 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-09-18 16:34:11,909 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 22 states. [2024-09-18 16:34:11,923 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 22 to 22. [2024-09-18 16:34:11,924 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 22 states, 12 states have (on average 1.1666666666666667) internal successors, (14), 13 states have internal predecessors, (14), 6 states have call successors, (6), 4 states have call predecessors, (6), 3 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2024-09-18 16:34:11,925 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 22 states to 22 states and 24 transitions. [2024-09-18 16:34:11,926 INFO L78 Accepts]: Start accepts. Automaton has 22 states and 24 transitions. Word has length 16 [2024-09-18 16:34:11,926 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-09-18 16:34:11,926 INFO L474 AbstractCegarLoop]: Abstraction has 22 states and 24 transitions. [2024-09-18 16:34:11,927 INFO L475 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 5.0) internal successors, (10), 2 states have internal predecessors, (10), 2 states have call successors, (4), 2 states have call predecessors, (4), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) [2024-09-18 16:34:11,927 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-18 16:34:11,927 INFO L276 IsEmpty]: Start isEmpty. Operand 22 states and 24 transitions. [2024-09-18 16:34:11,928 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2024-09-18 16:34:11,928 INFO L208 NwaCegarLoop]: Found error trace [2024-09-18 16:34:11,928 INFO L216 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-09-18 16:34:11,928 WARN L456 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-09-18 16:34:11,928 INFO L399 AbstractCegarLoop]: === Iteration 2 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-09-18 16:34:11,929 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-18 16:34:11,929 INFO L85 PathProgramCache]: Analyzing trace with hash 1910922015, now seen corresponding path program 1 times [2024-09-18 16:34:11,929 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-09-18 16:34:11,929 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1052862568] [2024-09-18 16:34:11,929 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-09-18 16:34:11,929 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-09-18 16:34:11,945 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unknown [2024-09-18 16:34:11,947 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [984912282] [2024-09-18 16:34:11,947 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-09-18 16:34:11,947 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-09-18 16:34:11,947 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/certificate-witnesses-artifact/automizer/z3 [2024-09-18 16:34:11,949 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-18 16:34:11,950 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-18 16:34:11,999 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-18 16:34:12,003 INFO L262 TraceCheckSpWp]: Trace formula consists of 55 conjuncts, 7 conjuncts are in the unsatisfiable core [2024-09-18 16:34:12,012 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2024-09-18 16:34:12,103 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-18 16:34:12,104 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-09-18 16:34:12,104 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-09-18 16:34:12,105 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1052862568] [2024-09-18 16:34:12,105 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2024-09-18 16:34:12,106 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [984912282] [2024-09-18 16:34:12,106 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [984912282] provided 1 perfect and 0 imperfect interpolant sequences [2024-09-18 16:34:12,106 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-09-18 16:34:12,106 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-09-18 16:34:12,107 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [859905444] [2024-09-18 16:34:12,108 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-09-18 16:34:12,108 INFO L551 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-09-18 16:34:12,109 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-09-18 16:34:12,109 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-09-18 16:34:12,109 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-09-18 16:34:12,110 INFO L87 Difference]: Start difference. First operand 22 states and 24 transitions. Second operand has 5 states, 5 states have (on average 2.0) internal successors, (10), 4 states have internal predecessors, (10), 2 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2024-09-18 16:34:12,155 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-09-18 16:34:12,155 INFO L93 Difference]: Finished difference Result 33 states and 37 transitions. [2024-09-18 16:34:12,155 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-09-18 16:34:12,156 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 2.0) internal successors, (10), 4 states have internal predecessors, (10), 2 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) Word has length 16 [2024-09-18 16:34:12,156 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-09-18 16:34:12,156 INFO L225 Difference]: With dead ends: 33 [2024-09-18 16:34:12,156 INFO L226 Difference]: Without dead ends: 29 [2024-09-18 16:34:12,157 INFO L433 NwaCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 12 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2024-09-18 16:34:12,158 INFO L434 NwaCegarLoop]: 18 mSDtfsCounter, 4 mSDsluCounter, 51 mSDsCounter, 0 mSdLazyCounter, 26 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 6 SdHoareTripleChecker+Valid, 69 SdHoareTripleChecker+Invalid, 28 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 26 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-09-18 16:34:12,158 INFO L435 NwaCegarLoop]: SdHoareTripleChecker [6 Valid, 69 Invalid, 28 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 26 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-09-18 16:34:12,159 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 29 states. [2024-09-18 16:34:12,164 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 29 to 29. [2024-09-18 16:34:12,164 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 29 states, 17 states have (on average 1.1176470588235294) internal successors, (19), 18 states have internal predecessors, (19), 7 states have call successors, (7), 5 states have call predecessors, (7), 4 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) [2024-09-18 16:34:12,165 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 29 states to 29 states and 31 transitions. [2024-09-18 16:34:12,165 INFO L78 Accepts]: Start accepts. Automaton has 29 states and 31 transitions. Word has length 16 [2024-09-18 16:34:12,165 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-09-18 16:34:12,166 INFO L474 AbstractCegarLoop]: Abstraction has 29 states and 31 transitions. [2024-09-18 16:34:12,166 INFO L475 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 2.0) internal successors, (10), 4 states have internal predecessors, (10), 2 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2024-09-18 16:34:12,166 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-18 16:34:12,166 INFO L276 IsEmpty]: Start isEmpty. Operand 29 states and 31 transitions. [2024-09-18 16:34:12,167 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2024-09-18 16:34:12,167 INFO L208 NwaCegarLoop]: Found error trace [2024-09-18 16:34:12,167 INFO L216 NwaCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-09-18 16:34:12,180 INFO L552 MonitoredProcess]: [MP /storage/repos/certificate-witnesses-artifact/automizer/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2024-09-18 16:34:12,368 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-18 16:34:12,368 INFO L399 AbstractCegarLoop]: === Iteration 3 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-09-18 16:34:12,369 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-18 16:34:12,369 INFO L85 PathProgramCache]: Analyzing trace with hash 306700420, now seen corresponding path program 1 times [2024-09-18 16:34:12,369 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-09-18 16:34:12,369 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1507425694] [2024-09-18 16:34:12,369 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-09-18 16:34:12,370 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-09-18 16:34:12,386 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unknown [2024-09-18 16:34:12,387 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [804144910] [2024-09-18 16:34:12,387 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-09-18 16:34:12,387 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-09-18 16:34:12,388 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/certificate-witnesses-artifact/automizer/z3 [2024-09-18 16:34:12,390 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-18 16:34:12,395 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-18 16:34:12,439 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-18 16:34:12,440 INFO L262 TraceCheckSpWp]: Trace formula consists of 72 conjuncts, 11 conjuncts are in the unsatisfiable core [2024-09-18 16:34:12,442 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2024-09-18 16:34:12,503 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 2 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-09-18 16:34:12,503 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2024-09-18 16:34:12,623 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2024-09-18 16:34:12,623 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-09-18 16:34:12,623 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1507425694] [2024-09-18 16:34:12,623 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2024-09-18 16:34:12,623 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [804144910] [2024-09-18 16:34:12,623 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [804144910] provided 1 perfect and 1 imperfect interpolant sequences [2024-09-18 16:34:12,624 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-09-18 16:34:12,625 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [6] total 7 [2024-09-18 16:34:12,626 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1925305768] [2024-09-18 16:34:12,626 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-09-18 16:34:12,626 INFO L551 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-09-18 16:34:12,626 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-09-18 16:34:12,627 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-09-18 16:34:12,628 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2024-09-18 16:34:12,628 INFO L87 Difference]: Start difference. First operand 29 states and 31 transitions. Second operand has 5 states, 5 states have (on average 2.8) internal successors, (14), 4 states have internal predecessors, (14), 2 states have call successors, (5), 2 states have call predecessors, (5), 1 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2024-09-18 16:34:12,678 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-09-18 16:34:12,678 INFO L93 Difference]: Finished difference Result 35 states and 36 transitions. [2024-09-18 16:34:12,680 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-09-18 16:34:12,680 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 2.8) internal successors, (14), 4 states have internal predecessors, (14), 2 states have call successors, (5), 2 states have call predecessors, (5), 1 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) Word has length 23 [2024-09-18 16:34:12,681 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-09-18 16:34:12,682 INFO L225 Difference]: With dead ends: 35 [2024-09-18 16:34:12,682 INFO L226 Difference]: Without dead ends: 30 [2024-09-18 16:34:12,683 INFO L433 NwaCegarLoop]: 0 DeclaredPredicates, 46 GetRequests, 38 SyntacticMatches, 2 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2024-09-18 16:34:12,684 INFO L434 NwaCegarLoop]: 19 mSDtfsCounter, 4 mSDsluCounter, 49 mSDsCounter, 0 mSdLazyCounter, 20 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 5 SdHoareTripleChecker+Valid, 68 SdHoareTripleChecker+Invalid, 21 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 20 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-09-18 16:34:12,684 INFO L435 NwaCegarLoop]: SdHoareTripleChecker [5 Valid, 68 Invalid, 21 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 20 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-09-18 16:34:12,685 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 30 states. [2024-09-18 16:34:12,689 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 30 to 30. [2024-09-18 16:34:12,690 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 30 states, 19 states have (on average 1.0526315789473684) internal successors, (20), 19 states have internal predecessors, (20), 6 states have call successors, (6), 6 states have call predecessors, (6), 4 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2024-09-18 16:34:12,690 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 30 states to 30 states and 30 transitions. [2024-09-18 16:34:12,690 INFO L78 Accepts]: Start accepts. Automaton has 30 states and 30 transitions. Word has length 23 [2024-09-18 16:34:12,690 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-09-18 16:34:12,691 INFO L474 AbstractCegarLoop]: Abstraction has 30 states and 30 transitions. [2024-09-18 16:34:12,691 INFO L475 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 2.8) internal successors, (14), 4 states have internal predecessors, (14), 2 states have call successors, (5), 2 states have call predecessors, (5), 1 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2024-09-18 16:34:12,691 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-18 16:34:12,691 INFO L276 IsEmpty]: Start isEmpty. Operand 30 states and 30 transitions. [2024-09-18 16:34:12,692 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2024-09-18 16:34:12,692 INFO L208 NwaCegarLoop]: Found error trace [2024-09-18 16:34:12,692 INFO L216 NwaCegarLoop]: trace histogram [3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-09-18 16:34:12,706 INFO L540 MonitoredProcess]: [MP /storage/repos/certificate-witnesses-artifact/automizer/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2024-09-18 16:34:12,892 WARN L456 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2,3 /storage/repos/certificate-witnesses-artifact/automizer/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-09-18 16:34:12,893 INFO L399 AbstractCegarLoop]: === Iteration 4 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-09-18 16:34:12,894 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-18 16:34:12,894 INFO L85 PathProgramCache]: Analyzing trace with hash 749725687, now seen corresponding path program 1 times [2024-09-18 16:34:12,894 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-09-18 16:34:12,894 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1978432018] [2024-09-18 16:34:12,894 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-09-18 16:34:12,894 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-09-18 16:34:12,908 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unknown [2024-09-18 16:34:12,909 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1405223581] [2024-09-18 16:34:12,909 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-09-18 16:34:12,910 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-09-18 16:34:12,910 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/certificate-witnesses-artifact/automizer/z3 [2024-09-18 16:34:12,914 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-18 16:34:12,915 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-18 16:34:12,948 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-18 16:34:12,949 INFO L262 TraceCheckSpWp]: Trace formula consists of 82 conjuncts, 12 conjuncts are in the unsatisfiable core [2024-09-18 16:34:12,955 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2024-09-18 16:34:13,085 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 4 proven. 3 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2024-09-18 16:34:13,086 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2024-09-18 16:34:13,195 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 4 proven. 3 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2024-09-18 16:34:13,196 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-09-18 16:34:13,196 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1978432018] [2024-09-18 16:34:13,196 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2024-09-18 16:34:13,196 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1405223581] [2024-09-18 16:34:13,196 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1405223581] provided 0 perfect and 2 imperfect interpolant sequences [2024-09-18 16:34:13,196 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-09-18 16:34:13,196 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7] total 10 [2024-09-18 16:34:13,196 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1651747206] [2024-09-18 16:34:13,196 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-09-18 16:34:13,197 INFO L551 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-09-18 16:34:13,197 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-09-18 16:34:13,197 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-09-18 16:34:13,197 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=66, Unknown=0, NotChecked=0, Total=90 [2024-09-18 16:34:13,197 INFO L87 Difference]: Start difference. First operand 30 states and 30 transitions. Second operand has 10 states, 8 states have (on average 2.625) internal successors, (21), 9 states have internal predecessors, (21), 7 states have call successors, (9), 2 states have call predecessors, (9), 1 states have return successors, (6), 5 states have call predecessors, (6), 5 states have call successors, (6) [2024-09-18 16:34:13,303 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-09-18 16:34:13,303 INFO L93 Difference]: Finished difference Result 45 states and 50 transitions. [2024-09-18 16:34:13,304 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-09-18 16:34:13,304 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 8 states have (on average 2.625) internal successors, (21), 9 states have internal predecessors, (21), 7 states have call successors, (9), 2 states have call predecessors, (9), 1 states have return successors, (6), 5 states have call predecessors, (6), 5 states have call successors, (6) Word has length 29 [2024-09-18 16:34:13,304 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-09-18 16:34:13,305 INFO L225 Difference]: With dead ends: 45 [2024-09-18 16:34:13,305 INFO L226 Difference]: Without dead ends: 39 [2024-09-18 16:34:13,306 INFO L433 NwaCegarLoop]: 0 DeclaredPredicates, 60 GetRequests, 47 SyntacticMatches, 2 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=39, Invalid=117, Unknown=0, NotChecked=0, Total=156 [2024-09-18 16:34:13,307 INFO L434 NwaCegarLoop]: 22 mSDtfsCounter, 1 mSDsluCounter, 76 mSDsCounter, 0 mSdLazyCounter, 45 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 98 SdHoareTripleChecker+Invalid, 47 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 45 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-09-18 16:34:13,308 INFO L435 NwaCegarLoop]: SdHoareTripleChecker [1 Valid, 98 Invalid, 47 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 45 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-09-18 16:34:13,309 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 39 states. [2024-09-18 16:34:13,322 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 39 to 39. [2024-09-18 16:34:13,323 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 39 states, 25 states have (on average 1.04) internal successors, (26), 25 states have internal predecessors, (26), 9 states have call successors, (9), 6 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-18 16:34:13,324 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 39 states to 39 states and 42 transitions. [2024-09-18 16:34:13,324 INFO L78 Accepts]: Start accepts. Automaton has 39 states and 42 transitions. Word has length 29 [2024-09-18 16:34:13,325 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-09-18 16:34:13,325 INFO L474 AbstractCegarLoop]: Abstraction has 39 states and 42 transitions. [2024-09-18 16:34:13,326 INFO L475 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 8 states have (on average 2.625) internal successors, (21), 9 states have internal predecessors, (21), 7 states have call successors, (9), 2 states have call predecessors, (9), 1 states have return successors, (6), 5 states have call predecessors, (6), 5 states have call successors, (6) [2024-09-18 16:34:13,326 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-18 16:34:13,326 INFO L276 IsEmpty]: Start isEmpty. Operand 39 states and 42 transitions. [2024-09-18 16:34:13,328 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 51 [2024-09-18 16:34:13,328 INFO L208 NwaCegarLoop]: Found error trace [2024-09-18 16:34:13,328 INFO L216 NwaCegarLoop]: trace histogram [6, 5, 5, 5, 5, 5, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-09-18 16:34:13,346 INFO L552 MonitoredProcess]: [MP /storage/repos/certificate-witnesses-artifact/automizer/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Ended with exit code 0 [2024-09-18 16:34:13,528 WARN L456 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3,4 /storage/repos/certificate-witnesses-artifact/automizer/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-09-18 16:34:13,530 INFO L399 AbstractCegarLoop]: === Iteration 5 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-09-18 16:34:13,530 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-18 16:34:13,530 INFO L85 PathProgramCache]: Analyzing trace with hash 608187154, now seen corresponding path program 2 times [2024-09-18 16:34:13,531 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-09-18 16:34:13,531 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [118352720] [2024-09-18 16:34:13,531 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-09-18 16:34:13,531 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-09-18 16:34:13,581 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unknown [2024-09-18 16:34:13,584 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1058428406] [2024-09-18 16:34:13,584 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2024-09-18 16:34:13,585 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-09-18 16:34:13,585 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/certificate-witnesses-artifact/automizer/z3 [2024-09-18 16:34:13,586 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-18 16:34:13,587 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-18 16:34:13,637 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2024-09-18 16:34:13,637 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2024-09-18 16:34:13,640 INFO L262 TraceCheckSpWp]: Trace formula consists of 133 conjuncts, 46 conjuncts are in the unsatisfiable core [2024-09-18 16:34:13,642 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2024-09-18 16:34:13,850 INFO L134 CoverageAnalysis]: Checked inductivity of 80 backedges. 19 proven. 39 refuted. 0 times theorem prover too weak. 22 trivial. 0 not checked. [2024-09-18 16:34:13,851 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2024-09-18 16:34:22,084 WARN L854 $PredicateComparison]: unable to prove that (or (not (= (mod (+ (* 3 c_main_~y~0 c_main_~y~0) (* 2 c_main_~y~0 c_main_~y~0 c_main_~y~0) (* 3 c_main_~y~0 c_main_~y~0 c_main_~y~0 c_main_~y~0)) 4) 0)) (= (+ c_main_~y~0 (* c_main_~y~0 c_main_~y~0)) (+ c_main_~c~0 (* c_main_~c~0 c_main_~y~0)))) is different from false [2024-09-18 16:34:34,124 WARN L854 $PredicateComparison]: unable to prove that (or (not (= (mod (+ (* 3 c_main_~y~0 c_main_~y~0) (* 2 c_main_~y~0 c_main_~y~0 c_main_~y~0) (* 3 c_main_~y~0 c_main_~y~0 c_main_~y~0 c_main_~y~0)) 4) 0)) (= (+ (* 2 c_main_~y~0) (* c_main_~y~0 c_main_~y~0)) (+ (* 2 c_main_~c~0) (* c_main_~c~0 c_main_~y~0)))) is different from false [2024-09-18 16:34:50,179 WARN L854 $PredicateComparison]: unable to prove that (or (not (= (mod (+ (* 3 c_main_~y~0 c_main_~y~0) (* 2 c_main_~y~0 c_main_~y~0 c_main_~y~0) (* 3 c_main_~y~0 c_main_~y~0 c_main_~y~0 c_main_~y~0)) 4) 0)) (= (+ (* 3 c_main_~c~0) (* c_main_~c~0 c_main_~y~0)) (+ (* 3 c_main_~y~0) (* c_main_~y~0 c_main_~y~0)))) is different from false [2024-09-18 16:35:06,230 WARN L854 $PredicateComparison]: unable to prove that (or (not (= (mod (+ (* 3 c_main_~y~0 c_main_~y~0) (* 2 c_main_~y~0 c_main_~y~0 c_main_~y~0) (* 3 c_main_~y~0 c_main_~y~0 c_main_~y~0 c_main_~y~0)) 4) 0)) (= (+ (* c_main_~c~0 4) (* c_main_~c~0 c_main_~y~0)) (+ (* 4 c_main_~y~0) (* c_main_~y~0 c_main_~y~0)))) is different from false [2024-09-18 16:35:06,321 INFO L134 CoverageAnalysis]: Checked inductivity of 80 backedges. 17 proven. 14 refuted. 0 times theorem prover too weak. 22 trivial. 27 not checked. [2024-09-18 16:35:06,321 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-09-18 16:35:06,321 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [118352720] [2024-09-18 16:35:06,322 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2024-09-18 16:35:06,322 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1058428406] [2024-09-18 16:35:06,322 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1058428406] provided 0 perfect and 2 imperfect interpolant sequences [2024-09-18 16:35:06,322 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-09-18 16:35:06,322 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [15, 14] total 26 [2024-09-18 16:35:06,323 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [458907123] [2024-09-18 16:35:06,323 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-09-18 16:35:06,323 INFO L551 AbstractCegarLoop]: INTERPOLANT automaton has 26 states [2024-09-18 16:35:06,324 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-09-18 16:35:06,324 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 26 interpolants. [2024-09-18 16:35:06,325 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=85, Invalid=389, Unknown=4, NotChecked=172, Total=650 [2024-09-18 16:35:06,325 INFO L87 Difference]: Start difference. First operand 39 states and 42 transitions. Second operand has 26 states, 24 states have (on average 1.6666666666666667) internal successors, (40), 19 states have internal predecessors, (40), 13 states have call successors, (15), 3 states have call predecessors, (15), 2 states have return successors, (12), 11 states have call predecessors, (12), 11 states have call successors, (12) [2024-09-18 16:35:10,662 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse1 (* c_main_~c~0 c_main_~y~0)) (.cse2 (* c_main_~y~0 c_main_~y~0))) (let ((.cse0 (not (= (* 4 c_main_~x~0) (+ (* (* c_main_~y~0 c_main_~y~0 c_main_~y~0) 2) .cse2 (* c_main_~y~0 c_main_~y~0 c_main_~y~0 c_main_~y~0))))) (.cse3 (= (+ c_main_~y~0 .cse2) (+ c_main_~c~0 .cse1))) (.cse4 (not (= (mod (+ (* 3 c_main_~y~0 c_main_~y~0) (* 2 c_main_~y~0 c_main_~y~0 c_main_~y~0) (* 3 c_main_~y~0 c_main_~y~0 c_main_~y~0 c_main_~y~0)) 4) 0)))) (and (or .cse0 (= (+ (* c_main_~c~0 4) .cse1) (+ (* 4 c_main_~y~0) .cse2))) (or .cse0 .cse3) (or (< c_main_~c~0 c_main_~k~0) (= (* c_main_~y~0 c_main_~k~0) .cse2)) (or .cse4 .cse3) (or .cse4 (= (+ (* 2 c_main_~y~0) .cse2) (+ (* 2 c_main_~c~0) .cse1))) (or .cse4 (= (+ (* 3 c_main_~c~0) .cse1) (+ (* 3 c_main_~y~0) .cse2)))))) is different from false [2024-09-18 16:35:14,673 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse2 (* c_main_~y~0 c_main_~y~0))) (let ((.cse0 (not (= (* 4 c_main_~x~0) (+ (* (* c_main_~y~0 c_main_~y~0 c_main_~y~0) 2) .cse2 (* c_main_~y~0 c_main_~y~0 c_main_~y~0 c_main_~y~0))))) (.cse3 (not (= (mod (+ (* 3 c_main_~y~0 c_main_~y~0) (* 2 c_main_~y~0 c_main_~y~0 c_main_~y~0) (* 3 c_main_~y~0 c_main_~y~0 c_main_~y~0 c_main_~y~0)) 4) 0))) (.cse1 (* c_main_~c~0 c_main_~y~0))) (and (or .cse0 (= (+ (* c_main_~c~0 4) .cse1) (+ (* 4 c_main_~y~0) .cse2))) (or .cse3 (= (+ c_main_~y~0 .cse2) (+ c_main_~c~0 .cse1))) (or (< c_main_~c~0 c_main_~k~0) .cse0 (= (* c_main_~y~0 c_main_~k~0) .cse2)) (or .cse3 (= (+ (* 2 c_main_~y~0) .cse2) (+ (* 2 c_main_~c~0) .cse1))) (or .cse3 (= (+ (* 3 c_main_~c~0) .cse1) (+ (* 3 c_main_~y~0) .cse2)))))) is different from false [2024-09-18 16:35:18,682 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse2 (not (= (mod (+ (* 3 c_main_~y~0 c_main_~y~0) (* 2 c_main_~y~0 c_main_~y~0 c_main_~y~0) (* 3 c_main_~y~0 c_main_~y~0 c_main_~y~0 c_main_~y~0)) 4) 0))) (.cse1 (* c_main_~c~0 c_main_~y~0)) (.cse0 (* c_main_~y~0 c_main_~y~0))) (and (or (not (= (* 4 c_main_~x~0) (+ (* (* c_main_~y~0 c_main_~y~0 c_main_~y~0) 2) .cse0 (* c_main_~y~0 c_main_~y~0 c_main_~y~0 c_main_~y~0)))) (= (+ c_main_~y~0 .cse0) (+ c_main_~c~0 .cse1))) (or (< c_main_~c~0 c_main_~k~0) (= (* c_main_~y~0 c_main_~k~0) .cse0)) (or .cse2 (= (+ (* c_main_~c~0 4) .cse1) (+ (* 4 c_main_~y~0) .cse0))) (or .cse2 (= (+ (* 2 c_main_~y~0) .cse0) (+ (* 2 c_main_~c~0) .cse1))) (or .cse2 (= (+ (* 3 c_main_~c~0) .cse1) (+ (* 3 c_main_~y~0) .cse0))))) is different from false [2024-09-18 16:35:22,690 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse0 (not (= (mod (+ (* 3 c_main_~y~0 c_main_~y~0) (* 2 c_main_~y~0 c_main_~y~0 c_main_~y~0) (* 3 c_main_~y~0 c_main_~y~0 c_main_~y~0 c_main_~y~0)) 4) 0))) (.cse2 (* c_main_~c~0 c_main_~y~0)) (.cse1 (* c_main_~y~0 c_main_~y~0))) (and (or .cse0 (= (+ c_main_~y~0 .cse1) (+ c_main_~c~0 .cse2))) (or (< c_main_~c~0 c_main_~k~0) (not (= (* 4 c_main_~x~0) (+ (* (* c_main_~y~0 c_main_~y~0 c_main_~y~0) 2) .cse1 (* c_main_~y~0 c_main_~y~0 c_main_~y~0 c_main_~y~0)))) (= (* c_main_~y~0 c_main_~k~0) .cse1)) (or .cse0 (= (+ (* 2 c_main_~y~0) .cse1) (+ (* 2 c_main_~c~0) .cse2))) (or .cse0 (= (+ (* 3 c_main_~c~0) .cse2) (+ (* 3 c_main_~y~0) .cse1))))) is different from false [2024-09-18 16:35:26,705 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse2 (not (= (mod (+ (* 3 c_main_~y~0 c_main_~y~0) (* 2 c_main_~y~0 c_main_~y~0 c_main_~y~0) (* 3 c_main_~y~0 c_main_~y~0 c_main_~y~0 c_main_~y~0)) 4) 0))) (.cse1 (* c_main_~c~0 c_main_~y~0)) (.cse0 (* c_main_~y~0 c_main_~y~0))) (and (or (not (= (* 4 c_main_~x~0) (+ (* (* c_main_~y~0 c_main_~y~0 c_main_~y~0) 2) .cse0 (* c_main_~y~0 c_main_~y~0 c_main_~y~0 c_main_~y~0)))) (= (+ c_main_~y~0 .cse0) (+ c_main_~c~0 .cse1))) (or (< c_main_~c~0 c_main_~k~0) (= (* c_main_~y~0 c_main_~k~0) .cse0)) (or .cse2 (= (+ (* 2 c_main_~y~0) .cse0) (+ (* 2 c_main_~c~0) .cse1))) (or .cse2 (= (+ (* 3 c_main_~c~0) .cse1) (+ (* 3 c_main_~y~0) .cse0))))) is different from false [2024-09-18 16:35:30,713 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse0 (not (= (mod (+ (* 3 c_main_~y~0 c_main_~y~0) (* 2 c_main_~y~0 c_main_~y~0 c_main_~y~0) (* 3 c_main_~y~0 c_main_~y~0 c_main_~y~0 c_main_~y~0)) 4) 0))) (.cse1 (* c_main_~y~0 c_main_~y~0)) (.cse2 (* c_main_~c~0 c_main_~y~0))) (and (or .cse0 (= (+ c_main_~y~0 .cse1) (+ c_main_~c~0 .cse2))) (or (< c_main_~c~0 c_main_~k~0) (not (= (* 4 c_main_~x~0) (+ (* (* c_main_~y~0 c_main_~y~0 c_main_~y~0) 2) .cse1 (* c_main_~y~0 c_main_~y~0 c_main_~y~0 c_main_~y~0)))) (= (* c_main_~y~0 c_main_~k~0) .cse1)) (or .cse0 (= (+ (* 2 c_main_~y~0) .cse1) (+ (* 2 c_main_~c~0) .cse2))))) is different from false [2024-09-18 16:35:34,729 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse0 (* c_main_~y~0 c_main_~y~0)) (.cse1 (* c_main_~c~0 c_main_~y~0))) (and (or (not (= (* 4 c_main_~x~0) (+ (* (* c_main_~y~0 c_main_~y~0 c_main_~y~0) 2) .cse0 (* c_main_~y~0 c_main_~y~0 c_main_~y~0 c_main_~y~0)))) (= (+ c_main_~y~0 .cse0) (+ c_main_~c~0 .cse1))) (or (< c_main_~c~0 c_main_~k~0) (= (* c_main_~y~0 c_main_~k~0) .cse0)) (or (not (= (mod (+ (* 3 c_main_~y~0 c_main_~y~0) (* 2 c_main_~y~0 c_main_~y~0 c_main_~y~0) (* 3 c_main_~y~0 c_main_~y~0 c_main_~y~0 c_main_~y~0)) 4) 0)) (= (+ (* 2 c_main_~y~0) .cse0) (+ (* 2 c_main_~c~0) .cse1))))) is different from false [2024-09-18 16:35:38,754 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse0 (* c_main_~y~0 c_main_~y~0))) (and (or (not (= (mod (+ (* 3 c_main_~y~0 c_main_~y~0) (* 2 c_main_~y~0 c_main_~y~0 c_main_~y~0) (* 3 c_main_~y~0 c_main_~y~0 c_main_~y~0 c_main_~y~0)) 4) 0)) (= (+ c_main_~y~0 .cse0) (+ c_main_~c~0 (* c_main_~c~0 c_main_~y~0)))) (or (< c_main_~c~0 c_main_~k~0) (not (= (* 4 c_main_~x~0) (+ (* (* c_main_~y~0 c_main_~y~0 c_main_~y~0) 2) .cse0 (* c_main_~y~0 c_main_~y~0 c_main_~y~0 c_main_~y~0)))) (= (* c_main_~y~0 c_main_~k~0) .cse0)))) is different from false [2024-09-18 16:35:39,634 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-09-18 16:35:39,635 INFO L93 Difference]: Finished difference Result 67 states and 80 transitions. [2024-09-18 16:35:39,635 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 25 states. [2024-09-18 16:35:39,635 INFO L78 Accepts]: Start accepts. Automaton has has 26 states, 24 states have (on average 1.6666666666666667) internal successors, (40), 19 states have internal predecessors, (40), 13 states have call successors, (15), 3 states have call predecessors, (15), 2 states have return successors, (12), 11 states have call predecessors, (12), 11 states have call successors, (12) Word has length 50 [2024-09-18 16:35:39,635 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-09-18 16:35:39,637 INFO L225 Difference]: With dead ends: 67 [2024-09-18 16:35:39,637 INFO L226 Difference]: Without dead ends: 61 [2024-09-18 16:35:39,638 INFO L433 NwaCegarLoop]: 0 DeclaredPredicates, 118 GetRequests, 75 SyntacticMatches, 4 SemanticMatches, 39 ConstructedPredicates, 12 IntricatePredicates, 0 DeprecatedPredicates, 105 ImplicationChecksByTransitivity, 48.5s TimeCoverageRelationStatistics Valid=159, Invalid=689, Unknown=12, NotChecked=780, Total=1640 [2024-09-18 16:35:39,638 INFO L434 NwaCegarLoop]: 23 mSDtfsCounter, 7 mSDsluCounter, 326 mSDsCounter, 0 mSdLazyCounter, 226 mSolverCounterSat, 13 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 8 SdHoareTripleChecker+Valid, 349 SdHoareTripleChecker+Invalid, 752 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 13 IncrementalHoareTripleChecker+Valid, 226 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 513 IncrementalHoareTripleChecker+Unchecked, 1.0s IncrementalHoareTripleChecker+Time [2024-09-18 16:35:39,639 INFO L435 NwaCegarLoop]: SdHoareTripleChecker [8 Valid, 349 Invalid, 752 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [13 Valid, 226 Invalid, 0 Unknown, 513 Unchecked, 1.0s Time] [2024-09-18 16:35:39,641 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 61 states. [2024-09-18 16:35:39,661 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 61 to 61. [2024-09-18 16:35:39,662 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 61 states, 40 states have (on average 1.025) internal successors, (41), 40 states have internal predecessors, (41), 15 states have call successors, (15), 7 states have call predecessors, (15), 5 states have return successors, (13), 13 states have call predecessors, (13), 13 states have call successors, (13) [2024-09-18 16:35:39,662 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 61 states to 61 states and 69 transitions. [2024-09-18 16:35:39,663 INFO L78 Accepts]: Start accepts. Automaton has 61 states and 69 transitions. Word has length 50 [2024-09-18 16:35:39,663 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-09-18 16:35:39,663 INFO L474 AbstractCegarLoop]: Abstraction has 61 states and 69 transitions. [2024-09-18 16:35:39,663 INFO L475 AbstractCegarLoop]: INTERPOLANT automaton has has 26 states, 24 states have (on average 1.6666666666666667) internal successors, (40), 19 states have internal predecessors, (40), 13 states have call successors, (15), 3 states have call predecessors, (15), 2 states have return successors, (12), 11 states have call predecessors, (12), 11 states have call successors, (12) [2024-09-18 16:35:39,664 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-18 16:35:39,664 INFO L276 IsEmpty]: Start isEmpty. Operand 61 states and 69 transitions. [2024-09-18 16:35:39,666 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 93 [2024-09-18 16:35:39,666 INFO L208 NwaCegarLoop]: Found error trace [2024-09-18 16:35:39,666 INFO L216 NwaCegarLoop]: trace histogram [12, 11, 11, 11, 11, 11, 10, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-09-18 16:35:39,678 INFO L552 MonitoredProcess]: [MP /storage/repos/certificate-witnesses-artifact/automizer/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Ended with exit code 0 [2024-09-18 16:35:39,866 WARN L456 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4,5 /storage/repos/certificate-witnesses-artifact/automizer/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-09-18 16:35:39,867 INFO L399 AbstractCegarLoop]: === Iteration 6 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-09-18 16:35:39,867 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-18 16:35:39,867 INFO L85 PathProgramCache]: Analyzing trace with hash -1050628046, now seen corresponding path program 3 times [2024-09-18 16:35:39,867 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-09-18 16:35:39,867 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2134701813] [2024-09-18 16:35:39,867 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-09-18 16:35:39,868 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-09-18 16:35:39,916 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-18 16:35:40,330 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2024-09-18 16:35:40,331 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-18 16:35:40,333 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-09-18 16:35:40,334 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-18 16:35:40,371 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2024-09-18 16:35:40,373 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-18 16:35:40,376 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 19 [2024-09-18 16:35:40,379 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-18 16:35:40,384 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2024-09-18 16:35:40,388 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-18 16:35:40,394 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2024-09-18 16:35:40,396 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-18 16:35:40,398 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2024-09-18 16:35:40,399 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-18 16:35:40,402 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2024-09-18 16:35:40,403 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-18 16:35:40,405 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 54 [2024-09-18 16:35:40,407 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-18 16:35:40,409 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 61 [2024-09-18 16:35:40,411 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-18 16:35:40,414 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2024-09-18 16:35:40,416 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-18 16:35:40,423 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 75 [2024-09-18 16:35:40,424 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-18 16:35:40,431 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 82 [2024-09-18 16:35:40,432 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-18 16:35:40,436 INFO L134 CoverageAnalysis]: Checked inductivity of 407 backedges. 160 proven. 27 refuted. 0 times theorem prover too weak. 220 trivial. 0 not checked. [2024-09-18 16:35:40,437 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-09-18 16:35:40,437 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2134701813] [2024-09-18 16:35:40,437 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2134701813] provided 0 perfect and 1 imperfect interpolant sequences [2024-09-18 16:35:40,437 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [688854590] [2024-09-18 16:35:40,437 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2024-09-18 16:35:40,437 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-09-18 16:35:40,437 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/certificate-witnesses-artifact/automizer/z3 [2024-09-18 16:35:40,439 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/certificate-witnesses-artifact/automizer/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-09-18 16:35:40,442 INFO L327 MonitoredProcess]: [MP /storage/repos/certificate-witnesses-artifact/automizer/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2024-09-18 16:35:40,522 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 11 check-sat command(s) [2024-09-18 16:35:40,522 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2024-09-18 16:35:40,523 INFO L262 TraceCheckSpWp]: Trace formula consists of 235 conjuncts, 16 conjuncts are in the unsatisfiable core [2024-09-18 16:35:40,525 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2024-09-18 16:35:40,854 INFO L134 CoverageAnalysis]: Checked inductivity of 407 backedges. 225 proven. 0 refuted. 0 times theorem prover too weak. 182 trivial. 0 not checked. [2024-09-18 16:35:40,857 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-09-18 16:35:40,857 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [688854590] provided 1 perfect and 0 imperfect interpolant sequences [2024-09-18 16:35:40,857 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-09-18 16:35:40,857 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [15] imperfect sequences [15] total 25 [2024-09-18 16:35:40,858 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1710767731] [2024-09-18 16:35:40,858 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-09-18 16:35:40,858 INFO L551 AbstractCegarLoop]: INTERPOLANT automaton has 15 states [2024-09-18 16:35:40,858 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-09-18 16:35:40,859 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2024-09-18 16:35:40,859 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=209, Invalid=391, Unknown=0, NotChecked=0, Total=600 [2024-09-18 16:35:40,859 INFO L87 Difference]: Start difference. First operand 61 states and 69 transitions. Second operand has 15 states, 15 states have (on average 2.4) internal successors, (36), 14 states have internal predecessors, (36), 12 states have call successors, (15), 2 states have call predecessors, (15), 3 states have return successors, (13), 13 states have call predecessors, (13), 12 states have call successors, (13) [2024-09-18 16:35:40,922 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-09-18 16:35:40,923 INFO L93 Difference]: Finished difference Result 65 states and 72 transitions. [2024-09-18 16:35:40,923 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2024-09-18 16:35:40,924 INFO L78 Accepts]: Start accepts. Automaton has has 15 states, 15 states have (on average 2.4) internal successors, (36), 14 states have internal predecessors, (36), 12 states have call successors, (15), 2 states have call predecessors, (15), 3 states have return successors, (13), 13 states have call predecessors, (13), 12 states have call successors, (13) Word has length 92 [2024-09-18 16:35:40,924 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-09-18 16:35:40,928 INFO L225 Difference]: With dead ends: 65 [2024-09-18 16:35:40,928 INFO L226 Difference]: Without dead ends: 0 [2024-09-18 16:35:40,929 INFO L433 NwaCegarLoop]: 0 DeclaredPredicates, 131 GetRequests, 108 SyntacticMatches, 0 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 116 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=209, Invalid=391, Unknown=0, NotChecked=0, Total=600 [2024-09-18 16:35:40,929 INFO L434 NwaCegarLoop]: 29 mSDtfsCounter, 0 mSDsluCounter, 94 mSDsCounter, 0 mSdLazyCounter, 57 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 123 SdHoareTripleChecker+Invalid, 58 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 57 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-09-18 16:35:40,929 INFO L435 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 123 Invalid, 58 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 57 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-09-18 16:35:40,930 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2024-09-18 16:35:40,930 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2024-09-18 16:35:40,930 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-18 16:35:40,930 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2024-09-18 16:35:40,930 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 92 [2024-09-18 16:35:40,930 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-09-18 16:35:40,930 INFO L474 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2024-09-18 16:35:40,930 INFO L475 AbstractCegarLoop]: INTERPOLANT automaton has has 15 states, 15 states have (on average 2.4) internal successors, (36), 14 states have internal predecessors, (36), 12 states have call successors, (15), 2 states have call predecessors, (15), 3 states have return successors, (13), 13 states have call predecessors, (13), 12 states have call successors, (13) [2024-09-18 16:35:40,931 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-18 16:35:40,931 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2024-09-18 16:35:40,931 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2024-09-18 16:35:40,933 INFO L785 garLoopResultBuilder]: Registering result SAFE for location __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2024-09-18 16:35:40,949 INFO L552 MonitoredProcess]: [MP /storage/repos/certificate-witnesses-artifact/automizer/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Ended with exit code 0 [2024-09-18 16:35:41,139 WARN L456 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 /storage/repos/certificate-witnesses-artifact/automizer/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable5 [2024-09-18 16:35:41,143 INFO L408 BasicCegarLoop]: Path program histogram: [3, 1, 1, 1] [2024-09-18 16:35:41,145 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2024-09-18 16:35:41,915 INFO L165 ceAbstractionStarter]: Computing trace abstraction results [2024-09-18 16:35:41,934 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 18.09 04:35:41 BoogieIcfgContainer [2024-09-18 16:35:41,934 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2024-09-18 16:35:41,934 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2024-09-18 16:35:41,934 INFO L270 PluginConnector]: Initializing Witness Printer... [2024-09-18 16:35:41,935 INFO L274 PluginConnector]: Witness Printer initialized [2024-09-18 16:35:41,935 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 18.09 04:34:11" (3/4) ... [2024-09-18 16:35:41,936 INFO L139 WitnessPrinter]: Generating witness for correct program [2024-09-18 16:35:41,973 INFO L149 WitnessManager]: Wrote witness to /storage/repos/certificate-witnesses-artifact/automizer/witness.yml [2024-09-18 16:35:41,973 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2024-09-18 16:35:41,974 INFO L158 Benchmark]: Toolchain (without parser) took 90866.24ms. Allocated memory was 142.6MB in the beginning and 283.1MB in the end (delta: 140.5MB). Free memory was 70.1MB in the beginning and 146.1MB in the end (delta: -76.0MB). Peak memory consumption was 67.2MB. Max. memory is 16.1GB. [2024-09-18 16:35:41,974 INFO L158 Benchmark]: CDTParser took 0.08ms. Allocated memory is still 142.6MB. Free memory is still 104.7MB. There was no memory consumed. Max. memory is 16.1GB. [2024-09-18 16:35:41,974 INFO L158 Benchmark]: CACSL2BoogieTranslator took 199.01ms. Allocated memory is still 142.6MB. Free memory was 69.9MB in the beginning and 58.3MB in the end (delta: 11.5MB). Peak memory consumption was 12.6MB. Max. memory is 16.1GB. [2024-09-18 16:35:41,974 INFO L158 Benchmark]: Boogie Procedure Inliner took 15.51ms. Allocated memory is still 142.6MB. Free memory was 58.3MB in the beginning and 57.5MB in the end (delta: 847.6kB). There was no memory consumed. Max. memory is 16.1GB. [2024-09-18 16:35:41,975 INFO L158 Benchmark]: Boogie Preprocessor took 26.53ms. Allocated memory is still 142.6MB. Free memory was 57.5MB in the beginning and 55.6MB in the end (delta: 1.9MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2024-09-18 16:35:41,975 INFO L158 Benchmark]: RCFGBuilder took 304.19ms. Allocated memory was 142.6MB in the beginning and 232.8MB in the end (delta: 90.2MB). Free memory was 55.6MB in the beginning and 197.5MB in the end (delta: -141.9MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. [2024-09-18 16:35:41,975 INFO L158 Benchmark]: TraceAbstraction took 90277.37ms. Allocated memory was 232.8MB in the beginning and 283.1MB in the end (delta: 50.3MB). Free memory was 196.5MB in the beginning and 148.2MB in the end (delta: 48.3MB). Peak memory consumption was 98.6MB. Max. memory is 16.1GB. [2024-09-18 16:35:41,975 INFO L158 Benchmark]: Witness Printer took 39.14ms. Allocated memory is still 283.1MB. Free memory was 148.2MB in the beginning and 146.1MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2024-09-18 16:35:41,976 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.08ms. Allocated memory is still 142.6MB. Free memory is still 104.7MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 199.01ms. Allocated memory is still 142.6MB. Free memory was 69.9MB in the beginning and 58.3MB in the end (delta: 11.5MB). Peak memory consumption was 12.6MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 15.51ms. Allocated memory is still 142.6MB. Free memory was 58.3MB in the beginning and 57.5MB in the end (delta: 847.6kB). There was no memory consumed. Max. memory is 16.1GB. * Boogie Preprocessor took 26.53ms. Allocated memory is still 142.6MB. Free memory was 57.5MB in the beginning and 55.6MB in the end (delta: 1.9MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * RCFGBuilder took 304.19ms. Allocated memory was 142.6MB in the beginning and 232.8MB in the end (delta: 90.2MB). Free memory was 55.6MB in the beginning and 197.5MB in the end (delta: -141.9MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. * TraceAbstraction took 90277.37ms. Allocated memory was 232.8MB in the beginning and 283.1MB in the end (delta: 50.3MB). Free memory was 196.5MB in the beginning and 148.2MB in the end (delta: 48.3MB). Peak memory consumption was 98.6MB. Max. memory is 16.1GB. * Witness Printer took 39.14ms. Allocated memory is still 283.1MB. Free memory was 148.2MB in the beginning and 146.1MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: ErrorAutomatonStatistics NumberErrorTraces: 0, NumberStatementsAllTraces: 0, NumberRelevantStatements: 0, 0.0s ErrorAutomatonConstructionTimeTotal, 0.0s FaulLocalizationTime, NumberStatementsFirstTrace: -1, TraceLengthAvg: 0, 0.0s ErrorAutomatonConstructionTimeAvg, 0.0s ErrorAutomatonDifferenceTimeAvg, 0.0s ErrorAutomatonDifferenceTimeTotal, NumberOfNoEnhancement: 0, NumberOfFiniteEnhancement: 0, NumberOfInfiniteEnhancement: 0 - PositiveResult [Line: 12]: a call to reach_error is unreachable For all program executions holds that a call to reach_error is unreachable at this location - StatisticsResult: Ultimate Automizer benchmark data CFG has 5 procedures, 26 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 89.4s, OverallIterations: 6, TraceHistogramMax: 12, PathProgramHistogramMax: 3, EmptinessCheckTime: 0.0s, AutomataDifference: 33.7s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 20 SdHoareTripleChecker+Valid, 1.2s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 16 mSDsluCounter, 733 SdHoareTripleChecker+Invalid, 1.1s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 513 IncrementalHoareTripleChecker+Unchecked, 596 mSDsCounter, 19 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 376 IncrementalHoareTripleChecker+Invalid, 908 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 19 mSolverCounterUnsat, 137 mSDtfsCounter, 376 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 378 GetRequests, 287 SyntacticMatches, 8 SemanticMatches, 83 ConstructedPredicates, 12 IntricatePredicates, 0 DeprecatedPredicates, 226 ImplicationChecksByTransitivity, 48.9s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=61occurred in iteration=5, InterpolantAutomatonStates: 58, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.1s AutomataMinimizationTime, 6 MinimizatonAttempts, 0 StatesRemovedByMinimization, 0 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.2s SatisfiabilityAnalysisTime, 54.1s InterpolantComputationTime, 436 NumberOfCodeBlocks, 436 NumberOfCodeBlocksAsserted, 22 NumberOfCheckSat, 410 ConstructedInterpolants, 0 QuantifiedInterpolants, 1968 SizeOfPredicates, 9 NumberOfNonLiveVariables, 577 ConjunctsInSsa, 92 ConjunctsInUnsatCore, 10 InterpolantComputations, 4 PerfectInterpolantSequences, 889/1004 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available - AllSpecificationsHoldResult: All specifications hold 1 specifications checked. All of them hold - InvariantResult [Line: 27]: Loop Invariant Derived loop invariant: ((((((((((k <= 5) && ((1 < k) || (k == 1))) && (y == 1)) && (x == 1)) && (c == 1)) || (((((y == 2) && (k <= 5)) && ((k == 2) || (2 < k))) && (c == 2)) && (x == 9))) || (((((k <= 5) && (4 <= k)) && (y == 4)) && (c == 4)) && (x == 100))) || (((((k <= 5) && ((k == 3) || (3 < k))) && (y == 3)) && (x == 36)) && (c == 3))) || (((((x == 0) && (k <= 5)) && (0 <= k)) && (c == 0)) && (y == 0))) || ((((((k <= 5) && ((((__int128) c * 3) + ((__int128) c * y)) == (((__int128) y * 3) + ((__int128) y * y)))) && (((__int128) y * y) == ((__int128) k * y))) && ((((__int128) c * 2) + ((__int128) c * y)) == (((__int128) y * 2) + ((__int128) y * y)))) && (((((((__int128) y * y) * y) * y) + ((__int128) y * y)) + ((((__int128) y * y) * y) * 2)) == ((__int128) x * 4))) && (5 <= c))) - ProcedureContractResult [Line: 6]: Procedure Contract for assume_abort_if_not Derived contract for procedure assume_abort_if_not. Ensures: (\old(cond) != 0) - ProcedureContractResult [Line: 9]: Procedure Contract for __VERIFIER_assert Derived contract for procedure __VERIFIER_assert. Requires: (1 <= \old(cond)) Ensures: (1 <= \old(cond)) RESULT: Ultimate proved your program to be correct! [2024-09-18 16:35:42,005 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