./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/nla-digbench-scaling/ps6-ll_valuebound10.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 e378df2c 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_valuebound10.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 1c9e40c4fcbf0a2270c810eae17f30e2b9a539f72a78b9b7061997095813940b --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.5-wip.dk.contract-modifies-e378df2-m [2024-10-15 15:07:29,028 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-10-15 15:07:29,089 INFO L114 SettingsManager]: Loading settings from /storage/repos/certificate-witnesses-artifact/automizer/config/svcomp-Reach-32bit-Automizer_Default.epf [2024-10-15 15:07:29,092 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-10-15 15:07:29,092 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-10-15 15:07:29,117 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-10-15 15:07:29,117 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-10-15 15:07:29,118 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-10-15 15:07:29,118 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-10-15 15:07:29,118 INFO L153 SettingsManager]: * Use memory slicer=true [2024-10-15 15:07:29,119 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-10-15 15:07:29,119 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-10-15 15:07:29,119 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-10-15 15:07:29,119 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-10-15 15:07:29,120 INFO L153 SettingsManager]: * Use SBE=true [2024-10-15 15:07:29,120 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-10-15 15:07:29,120 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-10-15 15:07:29,121 INFO L153 SettingsManager]: * sizeof long=4 [2024-10-15 15:07:29,121 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-10-15 15:07:29,121 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-10-15 15:07:29,121 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-10-15 15:07:29,122 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-10-15 15:07:29,122 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-10-15 15:07:29,122 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-10-15 15:07:29,123 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-10-15 15:07:29,123 INFO L153 SettingsManager]: * sizeof long double=12 [2024-10-15 15:07:29,123 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-10-15 15:07:29,123 INFO L153 SettingsManager]: * Use constant arrays=true [2024-10-15 15:07:29,124 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-10-15 15:07:29,124 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-10-15 15:07:29,124 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-10-15 15:07:29,124 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-10-15 15:07:29,124 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-15 15:07:29,125 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-10-15 15:07:29,125 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-10-15 15:07:29,125 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-10-15 15:07:29,125 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-10-15 15:07:29,125 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-10-15 15:07:29,126 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-10-15 15:07:29,126 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-10-15 15:07:29,126 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-10-15 15:07:29,126 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-10-15 15:07:29,126 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 -> 1c9e40c4fcbf0a2270c810eae17f30e2b9a539f72a78b9b7061997095813940b 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-10-15 15:07:29,341 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-10-15 15:07:29,371 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-10-15 15:07:29,373 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-10-15 15:07:29,374 INFO L270 PluginConnector]: Initializing CDTParser... [2024-10-15 15:07:29,375 INFO L274 PluginConnector]: CDTParser initialized [2024-10-15 15:07:29,376 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/certificate-witnesses-artifact/automizer/../sv-benchmarks/c/nla-digbench-scaling/ps6-ll_valuebound10.c [2024-10-15 15:07:30,761 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-10-15 15:07:30,899 INFO L384 CDTParser]: Found 1 translation units. [2024-10-15 15:07:30,899 INFO L180 CDTParser]: Scanning /storage/repos/certificate-witnesses-artifact/sv-benchmarks/c/nla-digbench-scaling/ps6-ll_valuebound10.c [2024-10-15 15:07:30,904 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/certificate-witnesses-artifact/automizer/data/a816ac063/69612877ea16458da3c89f8bb21f4890/FLAG8be605751 [2024-10-15 15:07:30,914 INFO L435 CDTParser]: Successfully deleted /storage/repos/certificate-witnesses-artifact/automizer/data/a816ac063/69612877ea16458da3c89f8bb21f4890 [2024-10-15 15:07:30,916 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-10-15 15:07:30,917 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-10-15 15:07:30,918 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-10-15 15:07:30,918 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-10-15 15:07:30,922 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-10-15 15:07:30,923 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 15.10 03:07:30" (1/1) ... [2024-10-15 15:07:30,923 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@5593b00b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.10 03:07:30, skipping insertion in model container [2024-10-15 15:07:30,924 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 15.10 03:07:30" (1/1) ... [2024-10-15 15:07:30,937 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-10-15 15:07:31,072 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_valuebound10.c[458,471] [2024-10-15 15:07:31,086 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-15 15:07:31,092 INFO L200 MainTranslator]: Completed pre-run [2024-10-15 15:07:31,100 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_valuebound10.c[458,471] [2024-10-15 15:07:31,105 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-15 15:07:31,116 INFO L204 MainTranslator]: Completed translation [2024-10-15 15:07:31,116 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.10 03:07:31 WrapperNode [2024-10-15 15:07:31,117 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-10-15 15:07:31,117 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-10-15 15:07:31,117 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-10-15 15:07:31,118 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-10-15 15:07:31,122 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.10 03:07:31" (1/1) ... [2024-10-15 15:07:31,126 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.10 03:07:31" (1/1) ... [2024-10-15 15:07:31,130 INFO L138 Inliner]: procedures = 14, calls = 12, calls flagged for inlining = 0, calls inlined = 0, statements flattened = 0 [2024-10-15 15:07:31,130 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-10-15 15:07:31,131 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-10-15 15:07:31,131 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-10-15 15:07:31,131 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-10-15 15:07:31,137 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.10 03:07:31" (1/1) ... [2024-10-15 15:07:31,138 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.10 03:07:31" (1/1) ... [2024-10-15 15:07:31,138 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.10 03:07:31" (1/1) ... [2024-10-15 15:07:31,146 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-10-15 15:07:31,146 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.10 03:07:31" (1/1) ... [2024-10-15 15:07:31,146 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.10 03:07:31" (1/1) ... [2024-10-15 15:07:31,147 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.10 03:07:31" (1/1) ... [2024-10-15 15:07:31,153 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.10 03:07:31" (1/1) ... [2024-10-15 15:07:31,154 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.10 03:07:31" (1/1) ... [2024-10-15 15:07:31,154 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.10 03:07:31" (1/1) ... [2024-10-15 15:07:31,155 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-10-15 15:07:31,156 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-10-15 15:07:31,156 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-10-15 15:07:31,156 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-10-15 15:07:31,156 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.10 03:07:31" (1/1) ... [2024-10-15 15:07:31,166 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-15 15:07:31,177 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/certificate-witnesses-artifact/automizer/z3 [2024-10-15 15:07:31,193 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-10-15 15:07:31,197 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-10-15 15:07:31,235 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-10-15 15:07:31,236 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2024-10-15 15:07:31,236 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2024-10-15 15:07:31,236 INFO L130 BoogieDeclarations]: Found specification of procedure main [2024-10-15 15:07:31,236 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2024-10-15 15:07:31,236 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-10-15 15:07:31,236 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2024-10-15 15:07:31,236 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2024-10-15 15:07:31,236 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-10-15 15:07:31,236 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-10-15 15:07:31,236 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2024-10-15 15:07:31,237 INFO L138 BoogieDeclarations]: Found implementation of procedure __VERIFIER_assert [2024-10-15 15:07:31,287 INFO L238 CfgBuilder]: Building ICFG [2024-10-15 15:07:31,289 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-10-15 15:07:31,392 INFO L? ?]: Removed 5 outVars from TransFormulas that were not future-live. [2024-10-15 15:07:31,392 INFO L287 CfgBuilder]: Performing block encoding [2024-10-15 15:07:31,407 INFO L309 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-10-15 15:07:31,408 INFO L314 CfgBuilder]: Removed 1 assume(true) statements. [2024-10-15 15:07:31,408 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 15.10 03:07:31 BoogieIcfgContainer [2024-10-15 15:07:31,408 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-10-15 15:07:31,410 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-10-15 15:07:31,410 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-10-15 15:07:31,413 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-10-15 15:07:31,413 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 15.10 03:07:30" (1/3) ... [2024-10-15 15:07:31,413 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@255a6455 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 15.10 03:07:31, skipping insertion in model container [2024-10-15 15:07:31,414 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.10 03:07:31" (2/3) ... [2024-10-15 15:07:31,414 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@255a6455 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 15.10 03:07:31, skipping insertion in model container [2024-10-15 15:07:31,414 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 15.10 03:07:31" (3/3) ... [2024-10-15 15:07:31,415 INFO L112 eAbstractionObserver]: Analyzing ICFG ps6-ll_valuebound10.c [2024-10-15 15:07:31,428 INFO L209 ceAbstractionStarter]: Automizer settings: Hoare:All NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-10-15 15:07:31,429 INFO L149 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-10-15 15:07:31,476 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-10-15 15:07:31,481 INFO L333 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;@1452c27e, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-10-15 15:07:31,481 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-10-15 15:07:31,485 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-10-15 15:07:31,491 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2024-10-15 15:07:31,491 INFO L207 NwaCegarLoop]: Found error trace [2024-10-15 15:07:31,491 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-15 15:07:31,492 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-15 15:07:31,496 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-15 15:07:31,496 INFO L85 PathProgramCache]: Analyzing trace with hash -620791457, now seen corresponding path program 1 times [2024-10-15 15:07:31,504 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-15 15:07:31,504 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1126997987] [2024-10-15 15:07:31,504 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-15 15:07:31,505 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-15 15:07:31,597 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-15 15:07:31,639 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2024-10-15 15:07:31,642 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-15 15:07:31,647 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-10-15 15:07:31,649 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-15 15:07:31,652 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-10-15 15:07:31,654 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-15 15:07:31,657 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2024-10-15 15:07:31,658 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-15 15:07:31,658 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1126997987] [2024-10-15 15:07:31,659 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1126997987] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-15 15:07:31,659 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-15 15:07:31,659 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-15 15:07:31,668 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1232173988] [2024-10-15 15:07:31,668 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-15 15:07:31,672 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-10-15 15:07:31,673 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-15 15:07:31,692 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-10-15 15:07:31,693 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-10-15 15:07:31,694 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-10-15 15:07:31,718 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-15 15:07:31,718 INFO L93 Difference]: Finished difference Result 48 states and 66 transitions. [2024-10-15 15:07:31,719 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-10-15 15:07:31,721 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-10-15 15:07:31,721 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-15 15:07:31,726 INFO L225 Difference]: With dead ends: 48 [2024-10-15 15:07:31,726 INFO L226 Difference]: Without dead ends: 23 [2024-10-15 15:07:31,728 INFO L431 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-10-15 15:07:31,731 INFO L432 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-10-15 15:07:31,732 INFO L433 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-10-15 15:07:31,744 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 23 states. [2024-10-15 15:07:31,756 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 23 to 23. [2024-10-15 15:07:31,757 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-10-15 15:07:31,758 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 23 states to 23 states and 26 transitions. [2024-10-15 15:07:31,759 INFO L78 Accepts]: Start accepts. Automaton has 23 states and 26 transitions. Word has length 21 [2024-10-15 15:07:31,760 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-15 15:07:31,760 INFO L471 AbstractCegarLoop]: Abstraction has 23 states and 26 transitions. [2024-10-15 15:07:31,760 INFO L472 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-10-15 15:07:31,761 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-15 15:07:31,761 INFO L276 IsEmpty]: Start isEmpty. Operand 23 states and 26 transitions. [2024-10-15 15:07:31,762 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2024-10-15 15:07:31,762 INFO L207 NwaCegarLoop]: Found error trace [2024-10-15 15:07:31,762 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-15 15:07:31,762 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-10-15 15:07:31,763 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-15 15:07:31,763 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-15 15:07:31,763 INFO L85 PathProgramCache]: Analyzing trace with hash -959298087, now seen corresponding path program 1 times [2024-10-15 15:07:31,763 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-15 15:07:31,764 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1396564218] [2024-10-15 15:07:31,764 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-15 15:07:31,764 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-15 15:07:31,784 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unknown [2024-10-15 15:07:31,786 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1181515366] [2024-10-15 15:07:31,787 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-15 15:07:31,787 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-15 15:07:31,787 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/certificate-witnesses-artifact/automizer/z3 [2024-10-15 15:07:31,789 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-10-15 15:07:31,791 INFO L327 MonitoredProcess]: [MP /storage/repos/certificate-witnesses-artifact/automizer/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2024-10-15 15:07:31,850 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-15 15:07:31,853 INFO L255 TraceCheckSpWp]: Trace formula consists of 64 conjuncts, 7 conjuncts are in the unsatisfiable core [2024-10-15 15:07:31,874 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-15 15:07:31,994 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2024-10-15 15:07:31,995 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-15 15:07:31,995 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-15 15:07:31,995 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1396564218] [2024-10-15 15:07:31,996 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2024-10-15 15:07:31,996 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1181515366] [2024-10-15 15:07:31,996 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1181515366] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-15 15:07:31,996 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-15 15:07:31,996 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-10-15 15:07:31,997 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1148254667] [2024-10-15 15:07:31,997 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-15 15:07:31,997 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-10-15 15:07:31,998 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-15 15:07:31,998 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-10-15 15:07:31,998 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-10-15 15:07:31,998 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-10-15 15:07:32,056 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-15 15:07:32,056 INFO L93 Difference]: Finished difference Result 34 states and 39 transitions. [2024-10-15 15:07:32,057 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-10-15 15:07:32,057 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-10-15 15:07:32,057 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-15 15:07:32,058 INFO L225 Difference]: With dead ends: 34 [2024-10-15 15:07:32,058 INFO L226 Difference]: Without dead ends: 30 [2024-10-15 15:07:32,059 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 17 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2024-10-15 15:07:32,060 INFO L432 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.0s IncrementalHoareTripleChecker+Time [2024-10-15 15:07:32,061 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [6 Valid, 77 Invalid, 28 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 26 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-15 15:07:32,062 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 30 states. [2024-10-15 15:07:32,071 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 30 to 30. [2024-10-15 15:07:32,073 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-10-15 15:07:32,074 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 30 states to 30 states and 33 transitions. [2024-10-15 15:07:32,074 INFO L78 Accepts]: Start accepts. Automaton has 30 states and 33 transitions. Word has length 21 [2024-10-15 15:07:32,074 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-15 15:07:32,075 INFO L471 AbstractCegarLoop]: Abstraction has 30 states and 33 transitions. [2024-10-15 15:07:32,075 INFO L472 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-10-15 15:07:32,075 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-15 15:07:32,076 INFO L276 IsEmpty]: Start isEmpty. Operand 30 states and 33 transitions. [2024-10-15 15:07:32,076 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2024-10-15 15:07:32,077 INFO L207 NwaCegarLoop]: Found error trace [2024-10-15 15:07:32,077 INFO L215 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-10-15 15:07:32,090 INFO L552 MonitoredProcess]: [MP /storage/repos/certificate-witnesses-artifact/automizer/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2024-10-15 15:07:32,278 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1,2 /storage/repos/certificate-witnesses-artifact/automizer/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-15 15:07:32,278 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-15 15:07:32,279 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-15 15:07:32,279 INFO L85 PathProgramCache]: Analyzing trace with hash 1544704875, now seen corresponding path program 1 times [2024-10-15 15:07:32,279 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-15 15:07:32,280 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2107364899] [2024-10-15 15:07:32,280 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-15 15:07:32,280 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-15 15:07:32,301 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unknown [2024-10-15 15:07:32,302 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1988482863] [2024-10-15 15:07:32,302 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-15 15:07:32,303 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-15 15:07:32,303 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/certificate-witnesses-artifact/automizer/z3 [2024-10-15 15:07:32,307 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-10-15 15:07:32,312 INFO L327 MonitoredProcess]: [MP /storage/repos/certificate-witnesses-artifact/automizer/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2024-10-15 15:07:32,349 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-15 15:07:32,350 INFO L255 TraceCheckSpWp]: Trace formula consists of 81 conjuncts, 11 conjuncts are in the unsatisfiable core [2024-10-15 15:07:32,352 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-15 15:07:32,416 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 2 proven. 2 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2024-10-15 15:07:32,417 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-15 15:07:32,504 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2024-10-15 15:07:32,504 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-15 15:07:32,504 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2107364899] [2024-10-15 15:07:32,504 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2024-10-15 15:07:32,504 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1988482863] [2024-10-15 15:07:32,504 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1988482863] provided 1 perfect and 1 imperfect interpolant sequences [2024-10-15 15:07:32,504 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-10-15 15:07:32,504 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [6] total 7 [2024-10-15 15:07:32,505 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1540227538] [2024-10-15 15:07:32,505 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-15 15:07:32,506 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-10-15 15:07:32,506 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-15 15:07:32,506 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-10-15 15:07:32,506 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2024-10-15 15:07:32,507 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-10-15 15:07:32,542 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-15 15:07:32,542 INFO L93 Difference]: Finished difference Result 36 states and 38 transitions. [2024-10-15 15:07:32,542 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-10-15 15:07:32,542 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-10-15 15:07:32,542 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-15 15:07:32,543 INFO L225 Difference]: With dead ends: 36 [2024-10-15 15:07:32,543 INFO L226 Difference]: Without dead ends: 32 [2024-10-15 15:07:32,543 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 56 GetRequests, 48 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-10-15 15:07:32,544 INFO L432 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-10-15 15:07:32,544 INFO L433 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-10-15 15:07:32,545 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 32 states. [2024-10-15 15:07:32,552 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 32 to 32. [2024-10-15 15:07:32,552 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-10-15 15:07:32,553 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 32 states to 32 states and 34 transitions. [2024-10-15 15:07:32,553 INFO L78 Accepts]: Start accepts. Automaton has 32 states and 34 transitions. Word has length 28 [2024-10-15 15:07:32,553 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-15 15:07:32,553 INFO L471 AbstractCegarLoop]: Abstraction has 32 states and 34 transitions. [2024-10-15 15:07:32,554 INFO L472 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-10-15 15:07:32,554 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-15 15:07:32,554 INFO L276 IsEmpty]: Start isEmpty. Operand 32 states and 34 transitions. [2024-10-15 15:07:32,555 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 40 [2024-10-15 15:07:32,555 INFO L207 NwaCegarLoop]: Found error trace [2024-10-15 15:07:32,555 INFO L215 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-10-15 15:07:32,568 INFO L552 MonitoredProcess]: [MP /storage/repos/certificate-witnesses-artifact/automizer/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Ended with exit code 0 [2024-10-15 15:07:32,759 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2,3 /storage/repos/certificate-witnesses-artifact/automizer/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-15 15:07:32,760 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-15 15:07:32,761 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-15 15:07:32,761 INFO L85 PathProgramCache]: Analyzing trace with hash 21814286, now seen corresponding path program 1 times [2024-10-15 15:07:32,761 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-15 15:07:32,761 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2045025344] [2024-10-15 15:07:32,762 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-15 15:07:32,762 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-15 15:07:32,780 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unknown [2024-10-15 15:07:32,783 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [42014268] [2024-10-15 15:07:32,785 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-15 15:07:32,785 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-15 15:07:32,786 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/certificate-witnesses-artifact/automizer/z3 [2024-10-15 15:07:32,787 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-10-15 15:07:32,789 INFO L327 MonitoredProcess]: [MP /storage/repos/certificate-witnesses-artifact/automizer/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2024-10-15 15:07:32,836 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-15 15:07:32,838 INFO L255 TraceCheckSpWp]: Trace formula consists of 100 conjuncts, 26 conjuncts are in the unsatisfiable core [2024-10-15 15:07:32,840 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-15 15:07:32,968 INFO L134 CoverageAnalysis]: Checked inductivity of 25 backedges. 7 proven. 8 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2024-10-15 15:07:32,969 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-15 15:07:33,392 INFO L134 CoverageAnalysis]: Checked inductivity of 25 backedges. 11 proven. 4 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2024-10-15 15:07:33,392 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-15 15:07:33,392 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2045025344] [2024-10-15 15:07:33,393 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2024-10-15 15:07:33,393 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [42014268] [2024-10-15 15:07:33,393 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [42014268] provided 0 perfect and 2 imperfect interpolant sequences [2024-10-15 15:07:33,393 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-10-15 15:07:33,393 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 10] total 15 [2024-10-15 15:07:33,393 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1644107625] [2024-10-15 15:07:33,393 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-10-15 15:07:33,394 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 15 states [2024-10-15 15:07:33,394 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-15 15:07:33,395 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2024-10-15 15:07:33,396 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=46, Invalid=164, Unknown=0, NotChecked=0, Total=210 [2024-10-15 15:07:33,396 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-10-15 15:07:33,696 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-15 15:07:33,697 INFO L93 Difference]: Finished difference Result 53 states and 61 transitions. [2024-10-15 15:07:33,697 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2024-10-15 15:07:33,697 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-10-15 15:07:33,698 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-15 15:07:33,698 INFO L225 Difference]: With dead ends: 53 [2024-10-15 15:07:33,698 INFO L226 Difference]: Without dead ends: 45 [2024-10-15 15:07:33,699 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 80 GetRequests, 62 SyntacticMatches, 2 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 26 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=64, Invalid=242, Unknown=0, NotChecked=0, Total=306 [2024-10-15 15:07:33,700 INFO L432 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.2s IncrementalHoareTripleChecker+Time [2024-10-15 15:07:33,700 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [5 Valid, 178 Invalid, 122 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [11 Valid, 111 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-10-15 15:07:33,701 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 45 states. [2024-10-15 15:07:33,710 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 45 to 45. [2024-10-15 15:07:33,711 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-10-15 15:07:33,712 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 45 states to 45 states and 49 transitions. [2024-10-15 15:07:33,712 INFO L78 Accepts]: Start accepts. Automaton has 45 states and 49 transitions. Word has length 39 [2024-10-15 15:07:33,712 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-15 15:07:33,712 INFO L471 AbstractCegarLoop]: Abstraction has 45 states and 49 transitions. [2024-10-15 15:07:33,712 INFO L472 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-10-15 15:07:33,713 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-15 15:07:33,713 INFO L276 IsEmpty]: Start isEmpty. Operand 45 states and 49 transitions. [2024-10-15 15:07:33,714 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 61 [2024-10-15 15:07:33,714 INFO L207 NwaCegarLoop]: Found error trace [2024-10-15 15:07:33,714 INFO L215 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-10-15 15:07:33,731 INFO L552 MonitoredProcess]: [MP /storage/repos/certificate-witnesses-artifact/automizer/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Ended with exit code 0 [2024-10-15 15:07:33,918 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3,4 /storage/repos/certificate-witnesses-artifact/automizer/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-15 15:07:33,919 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-15 15:07:33,919 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-15 15:07:33,919 INFO L85 PathProgramCache]: Analyzing trace with hash -244405920, now seen corresponding path program 2 times [2024-10-15 15:07:33,920 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-15 15:07:33,920 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1835899487] [2024-10-15 15:07:33,920 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-15 15:07:33,920 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-15 15:07:33,943 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unknown [2024-10-15 15:07:33,945 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [550044870] [2024-10-15 15:07:33,945 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2024-10-15 15:07:33,945 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-15 15:07:33,945 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/certificate-witnesses-artifact/automizer/z3 [2024-10-15 15:07:33,947 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-10-15 15:07:33,954 INFO L327 MonitoredProcess]: [MP /storage/repos/certificate-witnesses-artifact/automizer/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2024-10-15 15:07:34,005 INFO L227 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2024-10-15 15:07:34,005 INFO L228 tOrderPrioritization]: Conjunction of SSA is unsat [2024-10-15 15:07:34,006 INFO L255 TraceCheckSpWp]: Trace formula consists of 151 conjuncts, 46 conjuncts are in the unsatisfiable core [2024-10-15 15:07:34,012 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-15 15:07:34,261 INFO L134 CoverageAnalysis]: Checked inductivity of 106 backedges. 31 proven. 38 refuted. 0 times theorem prover too weak. 37 trivial. 0 not checked. [2024-10-15 15:07:34,261 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-15 15:08:58,350 INFO L134 CoverageAnalysis]: Checked inductivity of 106 backedges. 26 proven. 31 refuted. 0 times theorem prover too weak. 49 trivial. 0 not checked. [2024-10-15 15:08:58,351 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-15 15:08:58,351 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1835899487] [2024-10-15 15:08:58,351 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2024-10-15 15:08:58,351 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [550044870] [2024-10-15 15:08:58,351 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [550044870] provided 0 perfect and 2 imperfect interpolant sequences [2024-10-15 15:08:58,351 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-10-15 15:08:58,351 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [17, 13] total 27 [2024-10-15 15:08:58,351 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1126596450] [2024-10-15 15:08:58,351 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-10-15 15:08:58,352 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 27 states [2024-10-15 15:08:58,352 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-15 15:08:58,353 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 27 interpolants. [2024-10-15 15:08:58,353 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=105, Invalid=596, Unknown=1, NotChecked=0, Total=702 [2024-10-15 15:08:58,353 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-10-15 15:09:02,693 WARN L851 $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-10-15 15:09:06,708 WARN L851 $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-10-15 15:09:10,724 WARN L851 $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 (not (= (+ 2 c_main_~c~0) c_main_~k~0)) (= (+ .cse1 (* 2 c_main_~k~0)) (+ (* 4 c_main_~y~0) 4 .cse2))) (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)) (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 (* 3 c_main_~k~0)) (+ (* 6 c_main_~y~0) 9 .cse2))) (or .cse0 (< c_main_~c~0 c_main_~k~0) (= .cse1 .cse2))))) is different from false [2024-10-15 15:09:14,768 WARN L851 $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-10-15 15:09:14,954 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-15 15:09:14,954 INFO L93 Difference]: Finished difference Result 74 states and 88 transitions. [2024-10-15 15:09:14,954 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 26 states. [2024-10-15 15:09:14,954 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-10-15 15:09:14,955 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-15 15:09:14,956 INFO L225 Difference]: With dead ends: 74 [2024-10-15 15:09:14,956 INFO L226 Difference]: Without dead ends: 66 [2024-10-15 15:09:14,957 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 132 GetRequests, 94 SyntacticMatches, 0 SemanticMatches, 38 ConstructedPredicates, 4 IntricatePredicates, 0 DeprecatedPredicates, 245 ImplicationChecksByTransitivity, 67.8s TimeCoverageRelationStatistics Valid=199, Invalid=1072, Unknown=5, NotChecked=284, Total=1560 [2024-10-15 15:09:14,961 INFO L432 NwaCegarLoop]: 25 mSDtfsCounter, 5 mSDsluCounter, 280 mSDsCounter, 0 mSdLazyCounter, 321 mSolverCounterSat, 8 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 6 SdHoareTripleChecker+Valid, 305 SdHoareTripleChecker+Invalid, 519 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 8 IncrementalHoareTripleChecker+Valid, 321 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 190 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2024-10-15 15:09:14,961 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [6 Valid, 305 Invalid, 519 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [8 Valid, 321 Invalid, 0 Unknown, 190 Unchecked, 0.3s Time] [2024-10-15 15:09:14,962 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 66 states. [2024-10-15 15:09:14,990 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 66 to 64. [2024-10-15 15:09:14,991 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-10-15 15:09:14,992 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 64 states to 64 states and 72 transitions. [2024-10-15 15:09:14,992 INFO L78 Accepts]: Start accepts. Automaton has 64 states and 72 transitions. Word has length 60 [2024-10-15 15:09:14,992 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-15 15:09:14,993 INFO L471 AbstractCegarLoop]: Abstraction has 64 states and 72 transitions. [2024-10-15 15:09:14,994 INFO L472 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-10-15 15:09:14,994 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-15 15:09:14,995 INFO L276 IsEmpty]: Start isEmpty. Operand 64 states and 72 transitions. [2024-10-15 15:09:14,997 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 96 [2024-10-15 15:09:14,997 INFO L207 NwaCegarLoop]: Found error trace [2024-10-15 15:09:14,998 INFO L215 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-10-15 15:09:15,011 INFO L552 MonitoredProcess]: [MP /storage/repos/certificate-witnesses-artifact/automizer/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Ended with exit code 0 [2024-10-15 15:09:15,202 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4,5 /storage/repos/certificate-witnesses-artifact/automizer/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-15 15:09:15,203 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-15 15:09:15,203 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-15 15:09:15,203 INFO L85 PathProgramCache]: Analyzing trace with hash -235169010, now seen corresponding path program 3 times [2024-10-15 15:09:15,204 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-15 15:09:15,204 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1065972157] [2024-10-15 15:09:15,204 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-15 15:09:15,204 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-15 15:09:15,269 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unknown [2024-10-15 15:09:15,272 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1733215155] [2024-10-15 15:09:15,272 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2024-10-15 15:09:15,272 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-15 15:09:15,273 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/certificate-witnesses-artifact/automizer/z3 [2024-10-15 15:09:15,274 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-10-15 15:09:15,275 INFO L327 MonitoredProcess]: [MP /storage/repos/certificate-witnesses-artifact/automizer/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2024-10-15 15:09:15,364 INFO L227 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 10 check-sat command(s) [2024-10-15 15:09:15,364 INFO L228 tOrderPrioritization]: Conjunction of SSA is unsat [2024-10-15 15:09:15,365 INFO L255 TraceCheckSpWp]: Trace formula consists of 236 conjuncts, 54 conjuncts are in the unsatisfiable core [2024-10-15 15:09:15,368 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-15 15:09:15,594 INFO L134 CoverageAnalysis]: Checked inductivity of 381 backedges. 45 proven. 142 refuted. 0 times theorem prover too weak. 194 trivial. 0 not checked. [2024-10-15 15:09:15,594 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-15 15:09:23,709 WARN L851 $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-10-15 15:09:31,738 WARN L286 SmtUtils]: Spent 8.01s on a formula simplification that was a NOOP. DAG size: 4 (called from [L 728] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2024-10-15 15:09:44,345 WARN L286 SmtUtils]: Spent 8.56s on a formula simplification that was a NOOP. DAG size: 4 (called from [L 728] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2024-10-15 15:09:56,357 WARN L286 SmtUtils]: Spent 8.00s on a formula simplification that was a NOOP. DAG size: 7 (called from [L 728] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2024-10-15 15:10:04,370 WARN L873 $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-10-15 15:10:16,384 WARN L286 SmtUtils]: Spent 8.01s on a formula simplification that was a NOOP. DAG size: 7 (called from [L 728] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2024-10-15 15:10:32,409 WARN L286 SmtUtils]: Spent 8.01s on a formula simplification that was a NOOP. DAG size: 7 (called from [L 728] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2024-10-15 15:10:40,431 WARN L873 $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-10-15 15:10:52,467 WARN L851 $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-10-15 15:11:08,522 WARN L851 $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-10-15 15:11:25,871 WARN L851 $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-10-15 15:11:42,288 WARN L851 $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