./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/nla-digbench-scaling/ps6-ll_valuebound50.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 6908dde5 Calling Ultimate with: /root/.sdkman/candidates/java/11.0.12-open/bin/java -Dosgi.configuration.area=/storage/repos/certificate-witnesses-artifact/automizer/data/config -Xmx15G -Xms4m -jar /storage/repos/certificate-witnesses-artifact/automizer/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/certificate-witnesses-artifact/automizer/data -tc /storage/repos/certificate-witnesses-artifact/automizer/config/AutomizerReach.xml -i ../sv-benchmarks/c/nla-digbench-scaling/ps6-ll_valuebound50.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 aa3033c827040052fc2b3f2ac84da9b892249c5596676af10298d2e88bf55166 --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-6908dde-m [2024-09-25 00:02:51,971 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-09-25 00:02:52,046 INFO L114 SettingsManager]: Loading settings from /storage/repos/certificate-witnesses-artifact/automizer/config/svcomp-Reach-32bit-Automizer_Default.epf [2024-09-25 00:02:52,052 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-09-25 00:02:52,054 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-09-25 00:02:52,087 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-09-25 00:02:52,087 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-09-25 00:02:52,088 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-09-25 00:02:52,089 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-09-25 00:02:52,090 INFO L153 SettingsManager]: * Use memory slicer=true [2024-09-25 00:02:52,090 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-09-25 00:02:52,090 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-09-25 00:02:52,091 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-09-25 00:02:52,093 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-09-25 00:02:52,093 INFO L153 SettingsManager]: * Use SBE=true [2024-09-25 00:02:52,094 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-09-25 00:02:52,094 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-09-25 00:02:52,094 INFO L153 SettingsManager]: * sizeof long=4 [2024-09-25 00:02:52,094 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-09-25 00:02:52,095 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-09-25 00:02:52,095 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-09-25 00:02:52,099 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-09-25 00:02:52,099 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-09-25 00:02:52,099 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-09-25 00:02:52,100 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-09-25 00:02:52,100 INFO L153 SettingsManager]: * sizeof long double=12 [2024-09-25 00:02:52,100 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-09-25 00:02:52,100 INFO L153 SettingsManager]: * Use constant arrays=true [2024-09-25 00:02:52,101 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-09-25 00:02:52,101 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-09-25 00:02:52,101 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-09-25 00:02:52,101 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-09-25 00:02:52,101 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-09-25 00:02:52,102 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-09-25 00:02:52,102 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-09-25 00:02:52,102 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-09-25 00:02:52,103 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-09-25 00:02:52,103 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-09-25 00:02:52,103 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-09-25 00:02:52,103 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-09-25 00:02:52,104 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-09-25 00:02:52,105 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-09-25 00:02:52,105 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 -> aa3033c827040052fc2b3f2ac84da9b892249c5596676af10298d2e88bf55166 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-25 00:02:52,327 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-09-25 00:02:52,353 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-09-25 00:02:52,355 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-09-25 00:02:52,357 INFO L270 PluginConnector]: Initializing CDTParser... [2024-09-25 00:02:52,357 INFO L274 PluginConnector]: CDTParser initialized [2024-09-25 00:02:52,358 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/certificate-witnesses-artifact/automizer/../sv-benchmarks/c/nla-digbench-scaling/ps6-ll_valuebound50.c [2024-09-25 00:02:53,812 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-09-25 00:02:53,983 INFO L384 CDTParser]: Found 1 translation units. [2024-09-25 00:02:53,984 INFO L180 CDTParser]: Scanning /storage/repos/certificate-witnesses-artifact/sv-benchmarks/c/nla-digbench-scaling/ps6-ll_valuebound50.c [2024-09-25 00:02:53,990 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/certificate-witnesses-artifact/automizer/data/bb789c2dd/079c3a3f68b54be18107358e23e694e7/FLAG3a6be6006 [2024-09-25 00:02:54,002 INFO L435 CDTParser]: Successfully deleted /storage/repos/certificate-witnesses-artifact/automizer/data/bb789c2dd/079c3a3f68b54be18107358e23e694e7 [2024-09-25 00:02:54,004 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-09-25 00:02:54,005 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-09-25 00:02:54,006 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-09-25 00:02:54,007 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-09-25 00:02:54,011 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-09-25 00:02:54,011 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 25.09 12:02:54" (1/1) ... [2024-09-25 00:02:54,012 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@2666dda8 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.09 12:02:54, skipping insertion in model container [2024-09-25 00:02:54,012 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 25.09 12:02:54" (1/1) ... [2024-09-25 00:02:54,027 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-09-25 00:02:54,158 WARN L248 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/certificate-witnesses-artifact/sv-benchmarks/c/nla-digbench-scaling/ps6-ll_valuebound50.c[458,471] [2024-09-25 00:02:54,176 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-09-25 00:02:54,183 INFO L200 MainTranslator]: Completed pre-run [2024-09-25 00:02:54,194 WARN L248 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/certificate-witnesses-artifact/sv-benchmarks/c/nla-digbench-scaling/ps6-ll_valuebound50.c[458,471] [2024-09-25 00:02:54,200 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-09-25 00:02:54,218 INFO L204 MainTranslator]: Completed translation [2024-09-25 00:02:54,218 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.09 12:02:54 WrapperNode [2024-09-25 00:02:54,219 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-09-25 00:02:54,220 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-09-25 00:02:54,220 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-09-25 00:02:54,220 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-09-25 00:02:54,226 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.09 12:02:54" (1/1) ... [2024-09-25 00:02:54,232 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.09 12:02:54" (1/1) ... [2024-09-25 00:02:54,237 INFO L138 Inliner]: procedures = 14, calls = 12, calls flagged for inlining = 0, calls inlined = 0, statements flattened = 0 [2024-09-25 00:02:54,237 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-09-25 00:02:54,238 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-09-25 00:02:54,238 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-09-25 00:02:54,238 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-09-25 00:02:54,247 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.09 12:02:54" (1/1) ... [2024-09-25 00:02:54,247 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.09 12:02:54" (1/1) ... [2024-09-25 00:02:54,249 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.09 12:02:54" (1/1) ... [2024-09-25 00:02:54,265 INFO L175 MemorySlicer]: Split 2 memory accesses to 1 slices as follows [2]. 100 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2]. The 0 writes are split as follows [0]. [2024-09-25 00:02:54,265 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.09 12:02:54" (1/1) ... [2024-09-25 00:02:54,265 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.09 12:02:54" (1/1) ... [2024-09-25 00:02:54,268 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.09 12:02:54" (1/1) ... [2024-09-25 00:02:54,271 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.09 12:02:54" (1/1) ... [2024-09-25 00:02:54,272 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.09 12:02:54" (1/1) ... [2024-09-25 00:02:54,272 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.09 12:02:54" (1/1) ... [2024-09-25 00:02:54,274 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-09-25 00:02:54,274 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-09-25 00:02:54,275 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-09-25 00:02:54,275 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-09-25 00:02:54,275 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.09 12:02:54" (1/1) ... [2024-09-25 00:02:54,281 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-09-25 00:02:54,292 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/certificate-witnesses-artifact/automizer/z3 [2024-09-25 00:02:54,307 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/certificate-witnesses-artifact/automizer/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2024-09-25 00:02:54,310 INFO L327 MonitoredProcess]: [MP /storage/repos/certificate-witnesses-artifact/automizer/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2024-09-25 00:02:54,346 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-09-25 00:02:54,346 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2024-09-25 00:02:54,346 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2024-09-25 00:02:54,346 INFO L130 BoogieDeclarations]: Found specification of procedure main [2024-09-25 00:02:54,346 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2024-09-25 00:02:54,347 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-09-25 00:02:54,347 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2024-09-25 00:02:54,347 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2024-09-25 00:02:54,347 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-09-25 00:02:54,347 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-09-25 00:02:54,347 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2024-09-25 00:02:54,348 INFO L138 BoogieDeclarations]: Found implementation of procedure __VERIFIER_assert [2024-09-25 00:02:54,396 INFO L241 CfgBuilder]: Building ICFG [2024-09-25 00:02:54,397 INFO L267 CfgBuilder]: Building CFG for each procedure with an implementation [2024-09-25 00:02:54,535 INFO L? ?]: Removed 5 outVars from TransFormulas that were not future-live. [2024-09-25 00:02:54,535 INFO L290 CfgBuilder]: Performing block encoding [2024-09-25 00:02:54,565 INFO L312 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-09-25 00:02:54,565 INFO L317 CfgBuilder]: Removed 1 assume(true) statements. [2024-09-25 00:02:54,566 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 25.09 12:02:54 BoogieIcfgContainer [2024-09-25 00:02:54,566 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-09-25 00:02:54,568 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-09-25 00:02:54,568 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-09-25 00:02:54,571 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-09-25 00:02:54,572 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 25.09 12:02:54" (1/3) ... [2024-09-25 00:02:54,572 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3416701b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 25.09 12:02:54, skipping insertion in model container [2024-09-25 00:02:54,572 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.09 12:02:54" (2/3) ... [2024-09-25 00:02:54,573 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3416701b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 25.09 12:02:54, skipping insertion in model container [2024-09-25 00:02:54,573 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 25.09 12:02:54" (3/3) ... [2024-09-25 00:02:54,575 INFO L112 eAbstractionObserver]: Analyzing ICFG ps6-ll_valuebound50.c [2024-09-25 00:02:54,615 INFO L209 ceAbstractionStarter]: Automizer settings: Hoare:All NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-09-25 00:02:54,615 INFO L149 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-09-25 00:02:54,673 INFO L335 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-09-25 00:02:54,681 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;@53a0131f, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-09-25 00:02:54,682 INFO L337 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-09-25 00:02:54,687 INFO L276 IsEmpty]: Start isEmpty. Operand has 27 states, 14 states have (on average 1.4285714285714286) internal successors, (20), 15 states have internal predecessors, (20), 7 states have call successors, (7), 4 states have call predecessors, (7), 4 states have return successors, (7), 7 states have call predecessors, (7), 7 states have call successors, (7) [2024-09-25 00:02:54,695 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2024-09-25 00:02:54,696 INFO L208 NwaCegarLoop]: Found error trace [2024-09-25 00:02:54,697 INFO L216 NwaCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-09-25 00:02:54,698 INFO L399 AbstractCegarLoop]: === Iteration 1 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-09-25 00:02:54,702 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-25 00:02:54,703 INFO L85 PathProgramCache]: Analyzing trace with hash -620791457, now seen corresponding path program 1 times [2024-09-25 00:02:54,716 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-09-25 00:02:54,717 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [802942417] [2024-09-25 00:02:54,717 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-09-25 00:02:54,718 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-09-25 00:02:54,814 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-25 00:02:54,855 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2024-09-25 00:02:54,858 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-25 00:02:54,868 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-09-25 00:02:54,870 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-25 00:02:54,875 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-09-25 00:02:54,877 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-25 00:02:54,881 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2024-09-25 00:02:54,881 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-09-25 00:02:54,882 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [802942417] [2024-09-25 00:02:54,882 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [802942417] provided 1 perfect and 0 imperfect interpolant sequences [2024-09-25 00:02:54,883 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-09-25 00:02:54,883 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-09-25 00:02:54,884 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1425853197] [2024-09-25 00:02:54,885 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-09-25 00:02:54,893 INFO L551 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-09-25 00:02:54,893 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-09-25 00:02:54,916 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-09-25 00:02:54,917 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-09-25 00:02:54,919 INFO L87 Difference]: Start difference. First operand has 27 states, 14 states have (on average 1.4285714285714286) internal successors, (20), 15 states have internal predecessors, (20), 7 states have call successors, (7), 4 states have call predecessors, (7), 4 states have return successors, (7), 7 states have call predecessors, (7), 7 states have call successors, (7) Second operand has 2 states, 2 states have (on average 5.0) internal successors, (10), 2 states have internal predecessors, (10), 2 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2024-09-25 00:02:54,944 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-09-25 00:02:54,944 INFO L93 Difference]: Finished difference Result 48 states and 66 transitions. [2024-09-25 00:02:54,946 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-09-25 00:02:54,948 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 5.0) internal successors, (10), 2 states have internal predecessors, (10), 2 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) Word has length 21 [2024-09-25 00:02:54,948 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-09-25 00:02:54,955 INFO L225 Difference]: With dead ends: 48 [2024-09-25 00:02:54,955 INFO L226 Difference]: Without dead ends: 23 [2024-09-25 00:02:54,958 INFO L433 NwaCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 10 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-09-25 00:02:54,961 INFO L434 NwaCegarLoop]: 28 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 2 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 28 SdHoareTripleChecker+Invalid, 2 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 2 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-09-25 00:02:54,962 INFO L435 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 28 Invalid, 2 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 2 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-09-25 00:02:54,975 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 23 states. [2024-09-25 00:02:54,988 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 23 to 23. [2024-09-25 00:02:54,989 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 23 states, 12 states have (on average 1.1666666666666667) internal successors, (14), 13 states have internal predecessors, (14), 7 states have call successors, (7), 4 states have call predecessors, (7), 3 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) [2024-09-25 00:02:54,990 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 23 states to 23 states and 26 transitions. [2024-09-25 00:02:54,991 INFO L78 Accepts]: Start accepts. Automaton has 23 states and 26 transitions. Word has length 21 [2024-09-25 00:02:54,992 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-09-25 00:02:54,992 INFO L474 AbstractCegarLoop]: Abstraction has 23 states and 26 transitions. [2024-09-25 00:02:54,992 INFO L475 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 5.0) internal successors, (10), 2 states have internal predecessors, (10), 2 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2024-09-25 00:02:54,993 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-25 00:02:54,993 INFO L276 IsEmpty]: Start isEmpty. Operand 23 states and 26 transitions. [2024-09-25 00:02:54,994 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2024-09-25 00:02:54,994 INFO L208 NwaCegarLoop]: Found error trace [2024-09-25 00:02:54,995 INFO L216 NwaCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-09-25 00:02:54,995 WARN L456 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-09-25 00:02:54,995 INFO L399 AbstractCegarLoop]: === Iteration 2 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-09-25 00:02:54,996 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-25 00:02:54,996 INFO L85 PathProgramCache]: Analyzing trace with hash -959298087, now seen corresponding path program 1 times [2024-09-25 00:02:54,996 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-09-25 00:02:54,996 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1987706803] [2024-09-25 00:02:54,996 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-09-25 00:02:54,997 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-09-25 00:02:55,021 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unknown [2024-09-25 00:02:55,023 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1829410667] [2024-09-25 00:02:55,023 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-09-25 00:02:55,023 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-09-25 00:02:55,023 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/certificate-witnesses-artifact/automizer/z3 [2024-09-25 00:02:55,025 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/certificate-witnesses-artifact/automizer/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-09-25 00:02:55,029 INFO L327 MonitoredProcess]: [MP /storage/repos/certificate-witnesses-artifact/automizer/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2024-09-25 00:02:55,096 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-25 00:02:55,098 INFO L262 TraceCheckSpWp]: Trace formula consists of 64 conjuncts, 7 conjuncts are in the unsatisfiable core [2024-09-25 00:02:55,104 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2024-09-25 00:02:55,180 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2024-09-25 00:02:55,180 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-09-25 00:02:55,180 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-09-25 00:02:55,181 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1987706803] [2024-09-25 00:02:55,181 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2024-09-25 00:02:55,181 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1829410667] [2024-09-25 00:02:55,181 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1829410667] provided 1 perfect and 0 imperfect interpolant sequences [2024-09-25 00:02:55,182 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-09-25 00:02:55,182 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-09-25 00:02:55,185 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1766180643] [2024-09-25 00:02:55,185 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-09-25 00:02:55,185 INFO L551 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-09-25 00:02:55,186 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-09-25 00:02:55,186 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-09-25 00:02:55,186 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-09-25 00:02:55,187 INFO L87 Difference]: Start difference. First operand 23 states and 26 transitions. Second operand has 5 states, 5 states have (on average 2.0) internal successors, (10), 4 states have internal predecessors, (10), 2 states have call successors, (5), 2 states have call predecessors, (5), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2024-09-25 00:02:55,261 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-09-25 00:02:55,261 INFO L93 Difference]: Finished difference Result 34 states and 39 transitions. [2024-09-25 00:02:55,261 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-09-25 00:02:55,262 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 2.0) internal successors, (10), 4 states have internal predecessors, (10), 2 states have call successors, (5), 2 states have call predecessors, (5), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) Word has length 21 [2024-09-25 00:02:55,262 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-09-25 00:02:55,263 INFO L225 Difference]: With dead ends: 34 [2024-09-25 00:02:55,263 INFO L226 Difference]: Without dead ends: 30 [2024-09-25 00:02:55,263 INFO L433 NwaCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 17 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2024-09-25 00:02:55,264 INFO L434 NwaCegarLoop]: 20 mSDtfsCounter, 4 mSDsluCounter, 57 mSDsCounter, 0 mSdLazyCounter, 26 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 6 SdHoareTripleChecker+Valid, 77 SdHoareTripleChecker+Invalid, 28 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 26 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-09-25 00:02:55,265 INFO L435 NwaCegarLoop]: SdHoareTripleChecker [6 Valid, 77 Invalid, 28 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 26 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-09-25 00:02:55,265 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 30 states. [2024-09-25 00:02:55,273 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 30 to 30. [2024-09-25 00:02:55,274 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 30 states, 17 states have (on average 1.1176470588235294) internal successors, (19), 18 states have internal predecessors, (19), 8 states have call successors, (8), 5 states have call predecessors, (8), 4 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2024-09-25 00:02:55,275 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 30 states to 30 states and 33 transitions. [2024-09-25 00:02:55,275 INFO L78 Accepts]: Start accepts. Automaton has 30 states and 33 transitions. Word has length 21 [2024-09-25 00:02:55,275 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-09-25 00:02:55,275 INFO L474 AbstractCegarLoop]: Abstraction has 30 states and 33 transitions. [2024-09-25 00:02:55,276 INFO L475 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 2.0) internal successors, (10), 4 states have internal predecessors, (10), 2 states have call successors, (5), 2 states have call predecessors, (5), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2024-09-25 00:02:55,276 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-25 00:02:55,276 INFO L276 IsEmpty]: Start isEmpty. Operand 30 states and 33 transitions. [2024-09-25 00:02:55,277 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2024-09-25 00:02:55,277 INFO L208 NwaCegarLoop]: Found error trace [2024-09-25 00:02:55,277 INFO L216 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-09-25 00:02:55,290 INFO L552 MonitoredProcess]: [MP /storage/repos/certificate-witnesses-artifact/automizer/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2024-09-25 00:02:55,478 WARN L456 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1,2 /storage/repos/certificate-witnesses-artifact/automizer/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-09-25 00:02:55,479 INFO L399 AbstractCegarLoop]: === Iteration 3 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-09-25 00:02:55,480 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-25 00:02:55,480 INFO L85 PathProgramCache]: Analyzing trace with hash 1544704875, now seen corresponding path program 1 times [2024-09-25 00:02:55,480 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-09-25 00:02:55,480 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1952764615] [2024-09-25 00:02:55,480 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-09-25 00:02:55,481 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-09-25 00:02:55,506 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unknown [2024-09-25 00:02:55,508 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1129276979] [2024-09-25 00:02:55,508 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-09-25 00:02:55,508 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-09-25 00:02:55,509 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/certificate-witnesses-artifact/automizer/z3 [2024-09-25 00:02:55,510 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/certificate-witnesses-artifact/automizer/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-09-25 00:02:55,511 INFO L327 MonitoredProcess]: [MP /storage/repos/certificate-witnesses-artifact/automizer/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2024-09-25 00:02:55,578 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-25 00:02:55,583 INFO L262 TraceCheckSpWp]: Trace formula consists of 81 conjuncts, 11 conjuncts are in the unsatisfiable core [2024-09-25 00:02:55,585 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2024-09-25 00:02:55,663 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 2 proven. 2 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2024-09-25 00:02:55,664 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2024-09-25 00:02:55,775 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2024-09-25 00:02:55,775 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-09-25 00:02:55,776 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1952764615] [2024-09-25 00:02:55,776 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2024-09-25 00:02:55,776 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1129276979] [2024-09-25 00:02:55,776 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1129276979] provided 1 perfect and 1 imperfect interpolant sequences [2024-09-25 00:02:55,776 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-09-25 00:02:55,776 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [6] total 7 [2024-09-25 00:02:55,776 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1423144302] [2024-09-25 00:02:55,776 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-09-25 00:02:55,777 INFO L551 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-09-25 00:02:55,777 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-09-25 00:02:55,778 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-09-25 00:02:55,778 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2024-09-25 00:02:55,780 INFO L87 Difference]: Start difference. First operand 30 states and 33 transitions. Second operand has 5 states, 5 states have (on average 2.8) internal successors, (14), 4 states have internal predecessors, (14), 2 states have call successors, (6), 2 states have call predecessors, (6), 1 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) [2024-09-25 00:02:55,835 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-09-25 00:02:55,835 INFO L93 Difference]: Finished difference Result 36 states and 38 transitions. [2024-09-25 00:02:55,835 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-09-25 00:02:55,836 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 2.8) internal successors, (14), 4 states have internal predecessors, (14), 2 states have call successors, (6), 2 states have call predecessors, (6), 1 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) Word has length 28 [2024-09-25 00:02:55,836 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-09-25 00:02:55,837 INFO L225 Difference]: With dead ends: 36 [2024-09-25 00:02:55,837 INFO L226 Difference]: Without dead ends: 32 [2024-09-25 00:02:55,837 INFO L433 NwaCegarLoop]: 0 DeclaredPredicates, 56 GetRequests, 48 SyntacticMatches, 2 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2024-09-25 00:02:55,838 INFO L434 NwaCegarLoop]: 20 mSDtfsCounter, 4 mSDsluCounter, 53 mSDsCounter, 0 mSdLazyCounter, 23 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 5 SdHoareTripleChecker+Valid, 73 SdHoareTripleChecker+Invalid, 24 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 23 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-09-25 00:02:55,839 INFO L435 NwaCegarLoop]: SdHoareTripleChecker [5 Valid, 73 Invalid, 24 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 23 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-09-25 00:02:55,839 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 32 states. [2024-09-25 00:02:55,853 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 32 to 32. [2024-09-25 00:02:55,854 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 32 states, 19 states have (on average 1.0526315789473684) internal successors, (20), 19 states have internal predecessors, (20), 8 states have call successors, (8), 6 states have call predecessors, (8), 4 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2024-09-25 00:02:55,855 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 32 states to 32 states and 34 transitions. [2024-09-25 00:02:55,856 INFO L78 Accepts]: Start accepts. Automaton has 32 states and 34 transitions. Word has length 28 [2024-09-25 00:02:55,856 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-09-25 00:02:55,857 INFO L474 AbstractCegarLoop]: Abstraction has 32 states and 34 transitions. [2024-09-25 00:02:55,857 INFO L475 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 2.8) internal successors, (14), 4 states have internal predecessors, (14), 2 states have call successors, (6), 2 states have call predecessors, (6), 1 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) [2024-09-25 00:02:55,857 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-25 00:02:55,857 INFO L276 IsEmpty]: Start isEmpty. Operand 32 states and 34 transitions. [2024-09-25 00:02:55,858 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 40 [2024-09-25 00:02:55,858 INFO L208 NwaCegarLoop]: Found error trace [2024-09-25 00:02:55,859 INFO L216 NwaCegarLoop]: trace histogram [4, 3, 3, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-09-25 00:02:55,872 INFO L552 MonitoredProcess]: [MP /storage/repos/certificate-witnesses-artifact/automizer/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Ended with exit code 0 [2024-09-25 00:02:56,059 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-25 00:02:56,059 INFO L399 AbstractCegarLoop]: === Iteration 4 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-09-25 00:02:56,060 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-25 00:02:56,060 INFO L85 PathProgramCache]: Analyzing trace with hash 21814286, now seen corresponding path program 1 times [2024-09-25 00:02:56,060 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-09-25 00:02:56,061 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [542772745] [2024-09-25 00:02:56,061 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-09-25 00:02:56,061 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-09-25 00:02:56,110 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unknown [2024-09-25 00:02:56,116 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [366896954] [2024-09-25 00:02:56,117 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-09-25 00:02:56,117 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-09-25 00:02:56,117 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/certificate-witnesses-artifact/automizer/z3 [2024-09-25 00:02:56,122 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/certificate-witnesses-artifact/automizer/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-09-25 00:02:56,134 INFO L327 MonitoredProcess]: [MP /storage/repos/certificate-witnesses-artifact/automizer/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2024-09-25 00:02:56,204 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-25 00:02:56,210 INFO L262 TraceCheckSpWp]: Trace formula consists of 100 conjuncts, 26 conjuncts are in the unsatisfiable core [2024-09-25 00:02:56,217 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2024-09-25 00:02:56,409 INFO L134 CoverageAnalysis]: Checked inductivity of 25 backedges. 7 proven. 8 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2024-09-25 00:02:56,409 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2024-09-25 00:02:56,941 INFO L134 CoverageAnalysis]: Checked inductivity of 25 backedges. 11 proven. 4 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2024-09-25 00:02:56,941 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-09-25 00:02:56,941 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [542772745] [2024-09-25 00:02:56,942 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2024-09-25 00:02:56,942 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [366896954] [2024-09-25 00:02:56,942 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [366896954] provided 0 perfect and 2 imperfect interpolant sequences [2024-09-25 00:02:56,942 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-09-25 00:02:56,942 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 10] total 15 [2024-09-25 00:02:56,942 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1653761895] [2024-09-25 00:02:56,943 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-09-25 00:02:56,943 INFO L551 AbstractCegarLoop]: INTERPOLANT automaton has 15 states [2024-09-25 00:02:56,943 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-09-25 00:02:56,944 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2024-09-25 00:02:56,945 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=46, Invalid=164, Unknown=0, NotChecked=0, Total=210 [2024-09-25 00:02:56,946 INFO L87 Difference]: Start difference. First operand 32 states and 34 transitions. Second operand has 15 states, 11 states have (on average 2.3636363636363638) internal successors, (26), 12 states have internal predecessors, (26), 9 states have call successors, (12), 2 states have call predecessors, (12), 2 states have return successors, (9), 7 states have call predecessors, (9), 7 states have call successors, (9) [2024-09-25 00:02:57,296 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-09-25 00:02:57,296 INFO L93 Difference]: Finished difference Result 53 states and 61 transitions. [2024-09-25 00:02:57,297 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2024-09-25 00:02:57,297 INFO L78 Accepts]: Start accepts. Automaton has has 15 states, 11 states have (on average 2.3636363636363638) internal successors, (26), 12 states have internal predecessors, (26), 9 states have call successors, (12), 2 states have call predecessors, (12), 2 states have return successors, (9), 7 states have call predecessors, (9), 7 states have call successors, (9) Word has length 39 [2024-09-25 00:02:57,298 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-09-25 00:02:57,298 INFO L225 Difference]: With dead ends: 53 [2024-09-25 00:02:57,299 INFO L226 Difference]: Without dead ends: 45 [2024-09-25 00:02:57,299 INFO L433 NwaCegarLoop]: 0 DeclaredPredicates, 80 GetRequests, 62 SyntacticMatches, 2 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 26 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=64, Invalid=242, Unknown=0, NotChecked=0, Total=306 [2024-09-25 00:02:57,300 INFO L434 NwaCegarLoop]: 20 mSDtfsCounter, 4 mSDsluCounter, 158 mSDsCounter, 0 mSdLazyCounter, 111 mSolverCounterSat, 11 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 5 SdHoareTripleChecker+Valid, 178 SdHoareTripleChecker+Invalid, 122 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 11 IncrementalHoareTripleChecker+Valid, 111 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2024-09-25 00:02:57,300 INFO L435 NwaCegarLoop]: SdHoareTripleChecker [5 Valid, 178 Invalid, 122 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [11 Valid, 111 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2024-09-25 00:02:57,301 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 45 states. [2024-09-25 00:02:57,321 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 45 to 45. [2024-09-25 00:02:57,321 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 45 states, 28 states have (on average 1.0357142857142858) internal successors, (29), 28 states have internal predecessors, (29), 11 states have call successors, (11), 7 states have call predecessors, (11), 5 states have return successors, (9), 9 states have call predecessors, (9), 9 states have call successors, (9) [2024-09-25 00:02:57,323 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 45 states to 45 states and 49 transitions. [2024-09-25 00:02:57,324 INFO L78 Accepts]: Start accepts. Automaton has 45 states and 49 transitions. Word has length 39 [2024-09-25 00:02:57,324 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-09-25 00:02:57,324 INFO L474 AbstractCegarLoop]: Abstraction has 45 states and 49 transitions. [2024-09-25 00:02:57,324 INFO L475 AbstractCegarLoop]: INTERPOLANT automaton has has 15 states, 11 states have (on average 2.3636363636363638) internal successors, (26), 12 states have internal predecessors, (26), 9 states have call successors, (12), 2 states have call predecessors, (12), 2 states have return successors, (9), 7 states have call predecessors, (9), 7 states have call successors, (9) [2024-09-25 00:02:57,325 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-25 00:02:57,325 INFO L276 IsEmpty]: Start isEmpty. Operand 45 states and 49 transitions. [2024-09-25 00:02:57,326 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 61 [2024-09-25 00:02:57,326 INFO L208 NwaCegarLoop]: Found error trace [2024-09-25 00:02:57,327 INFO L216 NwaCegarLoop]: trace histogram [7, 6, 6, 5, 5, 5, 4, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-09-25 00:02:57,343 INFO L540 MonitoredProcess]: [MP /storage/repos/certificate-witnesses-artifact/automizer/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Forceful destruction successful, exit code 0 [2024-09-25 00:02:57,527 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-25 00:02:57,528 INFO L399 AbstractCegarLoop]: === Iteration 5 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-09-25 00:02:57,528 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-25 00:02:57,528 INFO L85 PathProgramCache]: Analyzing trace with hash -244405920, now seen corresponding path program 2 times [2024-09-25 00:02:57,529 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-09-25 00:02:57,529 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1722497533] [2024-09-25 00:02:57,529 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-09-25 00:02:57,529 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-09-25 00:02:57,598 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unknown [2024-09-25 00:02:57,603 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [154985121] [2024-09-25 00:02:57,603 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2024-09-25 00:02:57,604 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-09-25 00:02:57,604 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/certificate-witnesses-artifact/automizer/z3 [2024-09-25 00:02:57,606 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/certificate-witnesses-artifact/automizer/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-09-25 00:02:57,607 INFO L327 MonitoredProcess]: [MP /storage/repos/certificate-witnesses-artifact/automizer/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2024-09-25 00:02:57,670 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2024-09-25 00:02:57,670 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2024-09-25 00:02:57,671 INFO L262 TraceCheckSpWp]: Trace formula consists of 151 conjuncts, 46 conjuncts are in the unsatisfiable core [2024-09-25 00:02:57,678 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2024-09-25 00:02:58,001 INFO L134 CoverageAnalysis]: Checked inductivity of 106 backedges. 31 proven. 38 refuted. 0 times theorem prover too weak. 37 trivial. 0 not checked. [2024-09-25 00:02:58,002 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2024-09-25 00:03:32,499 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse0 (* c_main_~y~0 c_main_~y~0))) (or (not (= (+ 3 c_main_~c~0) c_main_~k~0)) (not (= (mod (+ (* 10 c_main_~y~0 c_main_~y~0 c_main_~y~0 c_main_~y~0 c_main_~y~0 c_main_~y~0) (* 7 c_main_~y~0 c_main_~y~0 c_main_~y~0 c_main_~y~0) (* 6 c_main_~y~0 c_main_~y~0 c_main_~y~0 c_main_~y~0 c_main_~y~0) .cse0) 12) 0)) (= (+ (* c_main_~y~0 c_main_~k~0) (* 3 c_main_~k~0)) (+ (* 6 c_main_~y~0) 9 .cse0)))) is different from false [2024-09-25 00:04:03,160 INFO L134 CoverageAnalysis]: Checked inductivity of 106 backedges. 26 proven. 19 refuted. 0 times theorem prover too weak. 49 trivial. 12 not checked. [2024-09-25 00:04:03,161 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-09-25 00:04:03,161 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1722497533] [2024-09-25 00:04:03,161 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2024-09-25 00:04:03,161 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [154985121] [2024-09-25 00:04:03,161 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [154985121] provided 0 perfect and 2 imperfect interpolant sequences [2024-09-25 00:04:03,161 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-09-25 00:04:03,162 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [17, 13] total 27 [2024-09-25 00:04:03,162 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [355268705] [2024-09-25 00:04:03,162 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-09-25 00:04:03,162 INFO L551 AbstractCegarLoop]: INTERPOLANT automaton has 27 states [2024-09-25 00:04:03,162 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-09-25 00:04:03,167 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 27 interpolants. [2024-09-25 00:04:03,167 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=100, Invalid=551, Unknown=3, NotChecked=48, Total=702 [2024-09-25 00:04:03,167 INFO L87 Difference]: Start difference. First operand 45 states and 49 transitions. Second operand has 27 states, 23 states have (on average 1.8695652173913044) internal successors, (43), 21 states have internal predecessors, (43), 15 states have call successors, (18), 3 states have call predecessors, (18), 3 states have return successors, (16), 14 states have call predecessors, (16), 13 states have call successors, (16) [2024-09-25 00:04:07,655 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse2 (* c_main_~y~0 c_main_~y~0))) (let ((.cse0 (not (= (+ (* 5 (* c_main_~y~0 c_main_~y~0 c_main_~y~0 c_main_~y~0)) (* (* c_main_~y~0 c_main_~y~0 c_main_~y~0 c_main_~y~0 c_main_~y~0 c_main_~y~0) 2) (* 6 (* c_main_~y~0 c_main_~y~0 c_main_~y~0 c_main_~y~0 c_main_~y~0))) (+ (* 12 c_main_~x~0) .cse2)))) (.cse3 (not (= (mod (+ (* 10 c_main_~y~0 c_main_~y~0 c_main_~y~0 c_main_~y~0 c_main_~y~0 c_main_~y~0) (* 7 c_main_~y~0 c_main_~y~0 c_main_~y~0 c_main_~y~0) (* 6 c_main_~y~0 c_main_~y~0 c_main_~y~0 c_main_~y~0 c_main_~y~0) .cse2) 12) 0))) (.cse1 (* c_main_~y~0 c_main_~k~0))) (and (<= c_main_~k~0 256) (or .cse0 (= (+ .cse1 c_main_~k~0) (+ (* 2 c_main_~y~0) .cse2 1)) (not (= (+ c_main_~c~0 1) c_main_~k~0))) (or (not (= (+ 3 c_main_~c~0) c_main_~k~0)) .cse3 (= (+ .cse1 (* 3 c_main_~k~0)) (+ (* 6 c_main_~y~0) 9 .cse2))) (or .cse0 (< c_main_~c~0 c_main_~k~0) (= .cse1 .cse2)) (or (not (= (+ 2 c_main_~c~0) c_main_~k~0)) .cse3 (= (+ .cse1 (* 2 c_main_~k~0)) (+ (* 4 c_main_~y~0) 4 .cse2)))))) is different from false [2024-09-25 00:04:11,674 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse2 (* c_main_~y~0 c_main_~y~0))) (let ((.cse0 (not (= (+ (* 5 (* c_main_~y~0 c_main_~y~0 c_main_~y~0 c_main_~y~0)) (* (* c_main_~y~0 c_main_~y~0 c_main_~y~0 c_main_~y~0 c_main_~y~0 c_main_~y~0) 2) (* 6 (* c_main_~y~0 c_main_~y~0 c_main_~y~0 c_main_~y~0 c_main_~y~0))) (+ (* 12 c_main_~x~0) .cse2)))) (.cse3 (not (= (mod (+ (* 10 c_main_~y~0 c_main_~y~0 c_main_~y~0 c_main_~y~0 c_main_~y~0 c_main_~y~0) (* 7 c_main_~y~0 c_main_~y~0 c_main_~y~0 c_main_~y~0) (* 6 c_main_~y~0 c_main_~y~0 c_main_~y~0 c_main_~y~0 c_main_~y~0) .cse2) 12) 0))) (.cse1 (* c_main_~y~0 c_main_~k~0))) (and (or .cse0 (= (+ .cse1 c_main_~k~0) (+ (* 2 c_main_~y~0) .cse2 1)) (not (= (+ c_main_~c~0 1) c_main_~k~0))) (or (not (= (+ 3 c_main_~c~0) c_main_~k~0)) .cse3 (= (+ .cse1 (* 3 c_main_~k~0)) (+ (* 6 c_main_~y~0) 9 .cse2))) (or .cse0 (< c_main_~c~0 c_main_~k~0) (= .cse1 .cse2)) (or (not (= (+ 2 c_main_~c~0) c_main_~k~0)) .cse3 (= (+ .cse1 (* 2 c_main_~k~0)) (+ (* 4 c_main_~y~0) 4 .cse2)))))) is different from false [2024-09-25 00:04:33,474 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.67s for a HTC check with result VALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers [] [2024-09-25 00:04:37,484 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse2 (* c_main_~y~0 c_main_~y~0))) (let ((.cse0 (not (= (+ (* 5 (* c_main_~y~0 c_main_~y~0 c_main_~y~0 c_main_~y~0)) (* (* c_main_~y~0 c_main_~y~0 c_main_~y~0 c_main_~y~0 c_main_~y~0 c_main_~y~0) 2) (* 6 (* c_main_~y~0 c_main_~y~0 c_main_~y~0 c_main_~y~0 c_main_~y~0))) (+ (* 12 c_main_~x~0) .cse2)))) (.cse1 (* c_main_~y~0 c_main_~k~0))) (and (or .cse0 (= (+ .cse1 c_main_~k~0) (+ (* 2 c_main_~y~0) .cse2 1)) (not (= (+ c_main_~c~0 1) c_main_~k~0))) (or .cse0 (< c_main_~c~0 c_main_~k~0) (= .cse1 .cse2)) (or (not (= (+ 2 c_main_~c~0) c_main_~k~0)) (not (= (mod (+ (* 10 c_main_~y~0 c_main_~y~0 c_main_~y~0 c_main_~y~0 c_main_~y~0 c_main_~y~0) (* 7 c_main_~y~0 c_main_~y~0 c_main_~y~0 c_main_~y~0) (* 6 c_main_~y~0 c_main_~y~0 c_main_~y~0 c_main_~y~0 c_main_~y~0) .cse2) 12) 0)) (= (+ .cse1 (* 2 c_main_~k~0)) (+ (* 4 c_main_~y~0) 4 .cse2)))))) is different from false [2024-09-25 00:04:37,701 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-09-25 00:04:37,701 INFO L93 Difference]: Finished difference Result 74 states and 88 transitions. [2024-09-25 00:04:37,702 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 26 states. [2024-09-25 00:04:37,702 INFO L78 Accepts]: Start accepts. Automaton has has 27 states, 23 states have (on average 1.8695652173913044) internal successors, (43), 21 states have internal predecessors, (43), 15 states have call successors, (18), 3 states have call predecessors, (18), 3 states have return successors, (16), 14 states have call predecessors, (16), 13 states have call successors, (16) Word has length 60 [2024-09-25 00:04:37,702 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-09-25 00:04:37,703 INFO L225 Difference]: With dead ends: 74 [2024-09-25 00:04:37,703 INFO L226 Difference]: Without dead ends: 66 [2024-09-25 00:04:37,704 INFO L433 NwaCegarLoop]: 0 DeclaredPredicates, 133 GetRequests, 95 SyntacticMatches, 0 SemanticMatches, 38 ConstructedPredicates, 4 IntricatePredicates, 0 DeprecatedPredicates, 244 ImplicationChecksByTransitivity, 64.6s TimeCoverageRelationStatistics Valid=200, Invalid=1068, Unknown=8, NotChecked=284, Total=1560 [2024-09-25 00:04:37,705 INFO L434 NwaCegarLoop]: 25 mSDtfsCounter, 5 mSDsluCounter, 277 mSDsCounter, 0 mSdLazyCounter, 306 mSolverCounterSat, 11 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 6 SdHoareTripleChecker+Valid, 302 SdHoareTripleChecker+Invalid, 495 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 11 IncrementalHoareTripleChecker+Valid, 306 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 178 IncrementalHoareTripleChecker+Unchecked, 2.0s IncrementalHoareTripleChecker+Time [2024-09-25 00:04:37,706 INFO L435 NwaCegarLoop]: SdHoareTripleChecker [6 Valid, 302 Invalid, 495 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [11 Valid, 306 Invalid, 0 Unknown, 178 Unchecked, 2.0s Time] [2024-09-25 00:04:37,707 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 66 states. [2024-09-25 00:04:37,727 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 66 to 64. [2024-09-25 00:04:37,727 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 64 states, 41 states have (on average 1.024390243902439) internal successors, (42), 41 states have internal predecessors, (42), 16 states have call successors, (16), 8 states have call predecessors, (16), 6 states have return successors, (14), 14 states have call predecessors, (14), 14 states have call successors, (14) [2024-09-25 00:04:37,728 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 64 states to 64 states and 72 transitions. [2024-09-25 00:04:37,729 INFO L78 Accepts]: Start accepts. Automaton has 64 states and 72 transitions. Word has length 60 [2024-09-25 00:04:37,729 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-09-25 00:04:37,729 INFO L474 AbstractCegarLoop]: Abstraction has 64 states and 72 transitions. [2024-09-25 00:04:37,730 INFO L475 AbstractCegarLoop]: INTERPOLANT automaton has has 27 states, 23 states have (on average 1.8695652173913044) internal successors, (43), 21 states have internal predecessors, (43), 15 states have call successors, (18), 3 states have call predecessors, (18), 3 states have return successors, (16), 14 states have call predecessors, (16), 13 states have call successors, (16) [2024-09-25 00:04:37,730 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-25 00:04:37,730 INFO L276 IsEmpty]: Start isEmpty. Operand 64 states and 72 transitions. [2024-09-25 00:04:37,733 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 96 [2024-09-25 00:04:37,733 INFO L208 NwaCegarLoop]: Found error trace [2024-09-25 00:04:37,733 INFO L216 NwaCegarLoop]: trace histogram [12, 11, 11, 10, 10, 10, 9, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-09-25 00:04:37,747 INFO L552 MonitoredProcess]: [MP /storage/repos/certificate-witnesses-artifact/automizer/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Ended with exit code 0 [2024-09-25 00:04:37,935 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-25 00:04:37,935 INFO L399 AbstractCegarLoop]: === Iteration 6 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-09-25 00:04:37,935 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-25 00:04:37,936 INFO L85 PathProgramCache]: Analyzing trace with hash -235169010, now seen corresponding path program 3 times [2024-09-25 00:04:37,936 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-09-25 00:04:37,936 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1493028061] [2024-09-25 00:04:37,936 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-09-25 00:04:37,936 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-09-25 00:04:38,014 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unknown [2024-09-25 00:04:38,022 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1340188111] [2024-09-25 00:04:38,022 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2024-09-25 00:04:38,022 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-09-25 00:04:38,024 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/certificate-witnesses-artifact/automizer/z3 [2024-09-25 00:04:38,025 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-25 00:04:38,027 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-25 00:04:38,157 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 10 check-sat command(s) [2024-09-25 00:04:38,157 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2024-09-25 00:04:38,160 INFO L262 TraceCheckSpWp]: Trace formula consists of 236 conjuncts, 54 conjuncts are in the unsatisfiable core [2024-09-25 00:04:38,163 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2024-09-25 00:04:38,427 INFO L134 CoverageAnalysis]: Checked inductivity of 381 backedges. 45 proven. 142 refuted. 0 times theorem prover too weak. 194 trivial. 0 not checked. [2024-09-25 00:04:38,428 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2024-09-25 00:04:46,567 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse0 (* c_main_~y~0 c_main_~y~0))) (or (= (+ c_main_~y~0 .cse0) (+ c_main_~c~0 (* c_main_~c~0 c_main_~y~0))) (not (= (mod (+ (* 10 c_main_~y~0 c_main_~y~0 c_main_~y~0 c_main_~y~0 c_main_~y~0 c_main_~y~0) (* 7 c_main_~y~0 c_main_~y~0 c_main_~y~0 c_main_~y~0) (* 6 c_main_~y~0 c_main_~y~0 c_main_~y~0 c_main_~y~0 c_main_~y~0) .cse0) 12) 0)))) is different from false [2024-09-25 00:04:54,731 WARN L293 SmtUtils]: Spent 8.13s on a formula simplification that was a NOOP. DAG size: 4 (called from [L 731] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2024-09-25 00:05:06,744 WARN L293 SmtUtils]: Spent 8.00s on a formula simplification that was a NOOP. DAG size: 4 (called from [L 731] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2024-09-25 00:05:18,760 WARN L293 SmtUtils]: Spent 8.01s on a formula simplification that was a NOOP. DAG size: 7 (called from [L 731] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2024-09-25 00:05:26,959 WARN L876 $PredicateComparison]: unable to prove that (or (not (= |c___VERIFIER_assert_#in~cond| 0)) (forall ((v_main_~c~0_BEFORE_CALL_26 Int) (v_main_~y~0_BEFORE_CALL_39 Int)) (let ((.cse0 (* v_main_~y~0_BEFORE_CALL_39 v_main_~y~0_BEFORE_CALL_39))) (or (= (+ (* v_main_~y~0_BEFORE_CALL_39 v_main_~c~0_BEFORE_CALL_26) v_main_~c~0_BEFORE_CALL_26) (+ v_main_~y~0_BEFORE_CALL_39 .cse0)) (= (mod (+ (* v_main_~y~0_BEFORE_CALL_39 v_main_~y~0_BEFORE_CALL_39 v_main_~y~0_BEFORE_CALL_39 v_main_~y~0_BEFORE_CALL_39 v_main_~y~0_BEFORE_CALL_39 6) (* v_main_~y~0_BEFORE_CALL_39 v_main_~y~0_BEFORE_CALL_39 v_main_~y~0_BEFORE_CALL_39 v_main_~y~0_BEFORE_CALL_39 v_main_~y~0_BEFORE_CALL_39 v_main_~y~0_BEFORE_CALL_39 10) (* 7 v_main_~y~0_BEFORE_CALL_39 v_main_~y~0_BEFORE_CALL_39 v_main_~y~0_BEFORE_CALL_39 v_main_~y~0_BEFORE_CALL_39) .cse0) 12) 0))))) is different from true [2024-09-25 00:05:38,980 WARN L293 SmtUtils]: Spent 8.01s on a formula simplification that was a NOOP. DAG size: 7 (called from [L 731] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2024-09-25 00:05:55,007 WARN L293 SmtUtils]: Spent 8.01s on a formula simplification that was a NOOP. DAG size: 7 (called from [L 731] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2024-09-25 00:06:03,022 WARN L876 $PredicateComparison]: unable to prove that (or (not (= |c___VERIFIER_assert_#in~cond| 0)) (forall ((v_main_~c~0_BEFORE_CALL_26 Int) (v_main_~y~0_BEFORE_CALL_39 Int)) (let ((.cse0 (* v_main_~y~0_BEFORE_CALL_39 v_main_~y~0_BEFORE_CALL_39))) (or (= (+ (* v_main_~y~0_BEFORE_CALL_39 v_main_~c~0_BEFORE_CALL_26) v_main_~c~0_BEFORE_CALL_26) (+ v_main_~y~0_BEFORE_CALL_39 .cse0)) (= (mod (+ (* v_main_~y~0_BEFORE_CALL_39 v_main_~y~0_BEFORE_CALL_39 v_main_~y~0_BEFORE_CALL_39 v_main_~y~0_BEFORE_CALL_39 v_main_~y~0_BEFORE_CALL_39 6) (* v_main_~y~0_BEFORE_CALL_39 v_main_~y~0_BEFORE_CALL_39 v_main_~y~0_BEFORE_CALL_39 v_main_~y~0_BEFORE_CALL_39 v_main_~y~0_BEFORE_CALL_39 v_main_~y~0_BEFORE_CALL_39 10) (* 7 v_main_~y~0_BEFORE_CALL_39 v_main_~y~0_BEFORE_CALL_39 v_main_~y~0_BEFORE_CALL_39 v_main_~y~0_BEFORE_CALL_39) .cse0) 12) 0)))) (= c___VERIFIER_assert_~cond 0)) is different from true [2024-09-25 00:06:15,051 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse0 (* c_main_~y~0 c_main_~y~0))) (or (= (+ (* 2 c_main_~y~0) .cse0) (+ (* 2 c_main_~c~0) (* c_main_~c~0 c_main_~y~0))) (not (= (mod (+ (* 10 c_main_~y~0 c_main_~y~0 c_main_~y~0 c_main_~y~0 c_main_~y~0 c_main_~y~0) (* 7 c_main_~y~0 c_main_~y~0 c_main_~y~0 c_main_~y~0) (* 6 c_main_~y~0 c_main_~y~0 c_main_~y~0 c_main_~y~0 c_main_~y~0) .cse0) 12) 0)))) is different from false [2024-09-25 00:06:31,154 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse0 (* c_main_~y~0 c_main_~y~0))) (or (= (+ (* 3 c_main_~c~0) (* c_main_~c~0 c_main_~y~0)) (+ (* 3 c_main_~y~0) .cse0)) (not (= (mod (+ (* 10 c_main_~y~0 c_main_~y~0 c_main_~y~0 c_main_~y~0 c_main_~y~0 c_main_~y~0) (* 7 c_main_~y~0 c_main_~y~0 c_main_~y~0 c_main_~y~0) (* 6 c_main_~y~0 c_main_~y~0 c_main_~y~0 c_main_~y~0 c_main_~y~0) .cse0) 12) 0)))) is different from false [2024-09-25 00:06:47,201 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse0 (* c_main_~y~0 c_main_~y~0))) (or (not (= (mod (+ (* 10 c_main_~y~0 c_main_~y~0 c_main_~y~0 c_main_~y~0 c_main_~y~0 c_main_~y~0) (* 7 c_main_~y~0 c_main_~y~0 c_main_~y~0 c_main_~y~0) (* 6 c_main_~y~0 c_main_~y~0 c_main_~y~0 c_main_~y~0 c_main_~y~0) .cse0) 12) 0)) (= (+ (* c_main_~c~0 4) (* c_main_~c~0 c_main_~y~0)) (+ (* 4 c_main_~y~0) .cse0)))) is different from false [2024-09-25 00:07:03,500 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse0 (* c_main_~y~0 c_main_~y~0))) (or (not (= (mod (+ (* 10 c_main_~y~0 c_main_~y~0 c_main_~y~0 c_main_~y~0 c_main_~y~0 c_main_~y~0) (* 7 c_main_~y~0 c_main_~y~0 c_main_~y~0 c_main_~y~0) (* 6 c_main_~y~0 c_main_~y~0 c_main_~y~0 c_main_~y~0 c_main_~y~0) .cse0) 12) 0)) (= (+ (* 5 c_main_~y~0) .cse0) (+ (* 5 c_main_~c~0) (* c_main_~c~0 c_main_~y~0))))) is different from false [2024-09-25 00:07:19,681 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse0 (* c_main_~y~0 c_main_~y~0))) (or (= (+ (* 6 c_main_~y~0) .cse0) (+ (* 6 c_main_~c~0) (* c_main_~c~0 c_main_~y~0))) (not (= (mod (+ (* 10 c_main_~y~0 c_main_~y~0 c_main_~y~0 c_main_~y~0 c_main_~y~0 c_main_~y~0) (* 7 c_main_~y~0 c_main_~y~0 c_main_~y~0 c_main_~y~0) (* 6 c_main_~y~0 c_main_~y~0 c_main_~y~0 c_main_~y~0 c_main_~y~0) .cse0) 12) 0)))) is different from false [2024-09-25 00:07:36,235 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse0 (* c_main_~y~0 c_main_~y~0))) (or (= (+ (* 7 c_main_~c~0) (* c_main_~c~0 c_main_~y~0)) (+ (* 7 c_main_~y~0) .cse0)) (not (= (mod (+ (* 10 c_main_~y~0 c_main_~y~0 c_main_~y~0 c_main_~y~0 c_main_~y~0 c_main_~y~0) (* 7 c_main_~y~0 c_main_~y~0 c_main_~y~0 c_main_~y~0) (* 6 c_main_~y~0 c_main_~y~0 c_main_~y~0 c_main_~y~0 c_main_~y~0) .cse0) 12) 0)))) is different from false