./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/nla-digbench-scaling/dijkstra-u_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 --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 5189fb62 Calling Ultimate with: /root/.sdkman/candidates/java/current/bin/java -Dosgi.configuration.area=/storage/repos/certificate-witnesses-artifact/automizer/data/config -Xmx15G -Xms4m -jar /storage/repos/certificate-witnesses-artifact/automizer/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/certificate-witnesses-artifact/automizer/data -tc /storage/repos/certificate-witnesses-artifact/automizer/config/AutomizerReach.xml -i ../sv-benchmarks/c/nla-digbench-scaling/dijkstra-u_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 7ab48dd793c80bfdca8b2cb012b1dd7cd8eda625223788e3f60486b3a2e166d4 --procedureinliner.inline.calls.to.implemented.procedures NEVER --traceabstraction.positions.where.we.compute.the.hoare.annotation All --witnessprinter.yaml.format.version 2.1 --- Real Ultimate output --- This is Ultimate 0.2.4-dev-5189fb6-m [2024-09-12 23:42:06,470 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-09-12 23:42:06,516 INFO L114 SettingsManager]: Loading settings from /storage/repos/certificate-witnesses-artifact/automizer/config/svcomp-Reach-32bit-Automizer_Default.epf [2024-09-12 23:42:06,520 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-09-12 23:42:06,521 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-09-12 23:42:06,542 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-09-12 23:42:06,543 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-09-12 23:42:06,543 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-09-12 23:42:06,545 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-09-12 23:42:06,547 INFO L153 SettingsManager]: * Use memory slicer=true [2024-09-12 23:42:06,547 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-09-12 23:42:06,548 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-09-12 23:42:06,548 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-09-12 23:42:06,548 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-09-12 23:42:06,548 INFO L153 SettingsManager]: * Use SBE=true [2024-09-12 23:42:06,549 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-09-12 23:42:06,549 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-09-12 23:42:06,549 INFO L153 SettingsManager]: * sizeof long=4 [2024-09-12 23:42:06,549 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-09-12 23:42:06,550 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-09-12 23:42:06,550 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-09-12 23:42:06,551 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-09-12 23:42:06,551 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-09-12 23:42:06,551 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-09-12 23:42:06,552 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-09-12 23:42:06,552 INFO L153 SettingsManager]: * sizeof long double=12 [2024-09-12 23:42:06,552 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-09-12 23:42:06,552 INFO L153 SettingsManager]: * Use constant arrays=true [2024-09-12 23:42:06,552 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-09-12 23:42:06,553 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-09-12 23:42:06,553 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-09-12 23:42:06,553 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-09-12 23:42:06,553 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-09-12 23:42:06,554 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-09-12 23:42:06,554 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-09-12 23:42:06,554 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-09-12 23:42:06,554 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-09-12 23:42:06,555 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-09-12 23:42:06,555 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-09-12 23:42:06,555 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-09-12 23:42:06,555 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-09-12 23:42:06,555 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-09-12 23:42:06,555 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 -> 7ab48dd793c80bfdca8b2cb012b1dd7cd8eda625223788e3f60486b3a2e166d4 Applying setting for plugin de.uni_freiburg.informatik.ultimate.boogie.procedureinliner: Inline calls to implemented procedures -> NEVER Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: Positions where we compute the Hoare Annotation -> All Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: YAML Format version -> 2.1 [2024-09-12 23:42:06,736 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-09-12 23:42:06,756 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-09-12 23:42:06,758 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-09-12 23:42:06,759 INFO L270 PluginConnector]: Initializing CDTParser... [2024-09-12 23:42:06,759 INFO L274 PluginConnector]: CDTParser initialized [2024-09-12 23:42:06,760 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/certificate-witnesses-artifact/automizer/../sv-benchmarks/c/nla-digbench-scaling/dijkstra-u_valuebound50.c [2024-09-12 23:42:07,987 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-09-12 23:42:08,113 INFO L384 CDTParser]: Found 1 translation units. [2024-09-12 23:42:08,114 INFO L180 CDTParser]: Scanning /storage/repos/certificate-witnesses-artifact/sv-benchmarks/c/nla-digbench-scaling/dijkstra-u_valuebound50.c [2024-09-12 23:42:08,119 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/certificate-witnesses-artifact/automizer/data/c5f77ff33/acbf60b98bff4922a6c7f70d704614b6/FLAG9b5ceb8dc [2024-09-12 23:42:08,535 INFO L435 CDTParser]: Successfully deleted /storage/repos/certificate-witnesses-artifact/automizer/data/c5f77ff33/acbf60b98bff4922a6c7f70d704614b6 [2024-09-12 23:42:08,538 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-09-12 23:42:08,539 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-09-12 23:42:08,540 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-09-12 23:42:08,540 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-09-12 23:42:08,544 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-09-12 23:42:08,544 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 12.09 11:42:08" (1/1) ... [2024-09-12 23:42:08,546 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@5bef90ac and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.09 11:42:08, skipping insertion in model container [2024-09-12 23:42:08,546 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 12.09 11:42:08" (1/1) ... [2024-09-12 23:42:08,563 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-09-12 23:42:08,666 WARN L247 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/certificate-witnesses-artifact/sv-benchmarks/c/nla-digbench-scaling/dijkstra-u_valuebound50.c[525,538] [2024-09-12 23:42:08,685 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-09-12 23:42:08,692 INFO L200 MainTranslator]: Completed pre-run [2024-09-12 23:42:08,712 WARN L247 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/certificate-witnesses-artifact/sv-benchmarks/c/nla-digbench-scaling/dijkstra-u_valuebound50.c[525,538] [2024-09-12 23:42:08,729 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-09-12 23:42:08,747 INFO L204 MainTranslator]: Completed translation [2024-09-12 23:42:08,748 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.09 11:42:08 WrapperNode [2024-09-12 23:42:08,748 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-09-12 23:42:08,748 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-09-12 23:42:08,749 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-09-12 23:42:08,749 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-09-12 23:42:08,753 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.09 11:42:08" (1/1) ... [2024-09-12 23:42:08,760 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.09 11:42:08" (1/1) ... [2024-09-12 23:42:08,766 INFO L138 Inliner]: procedures = 14, calls = 18, calls flagged for inlining = 0, calls inlined = 0, statements flattened = 0 [2024-09-12 23:42:08,766 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-09-12 23:42:08,766 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-09-12 23:42:08,766 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-09-12 23:42:08,766 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-09-12 23:42:08,774 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.09 11:42:08" (1/1) ... [2024-09-12 23:42:08,774 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.09 11:42:08" (1/1) ... [2024-09-12 23:42:08,779 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.09 11:42:08" (1/1) ... [2024-09-12 23:42:08,793 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-12 23:42:08,795 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.09 11:42:08" (1/1) ... [2024-09-12 23:42:08,795 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.09 11:42:08" (1/1) ... [2024-09-12 23:42:08,798 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.09 11:42:08" (1/1) ... [2024-09-12 23:42:08,803 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.09 11:42:08" (1/1) ... [2024-09-12 23:42:08,805 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.09 11:42:08" (1/1) ... [2024-09-12 23:42:08,806 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.09 11:42:08" (1/1) ... [2024-09-12 23:42:08,807 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-09-12 23:42:08,810 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-09-12 23:42:08,810 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-09-12 23:42:08,810 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-09-12 23:42:08,810 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.09 11:42:08" (1/1) ... [2024-09-12 23:42:08,815 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-09-12 23:42:08,824 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/certificate-witnesses-artifact/automizer/z3 [2024-09-12 23:42:08,836 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/certificate-witnesses-artifact/automizer/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2024-09-12 23:42:08,838 INFO L327 MonitoredProcess]: [MP /storage/repos/certificate-witnesses-artifact/automizer/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2024-09-12 23:42:08,872 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-09-12 23:42:08,872 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2024-09-12 23:42:08,872 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2024-09-12 23:42:08,872 INFO L130 BoogieDeclarations]: Found specification of procedure main [2024-09-12 23:42:08,872 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2024-09-12 23:42:08,872 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-09-12 23:42:08,873 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2024-09-12 23:42:08,874 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2024-09-12 23:42:08,874 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-09-12 23:42:08,874 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-09-12 23:42:08,874 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2024-09-12 23:42:08,874 INFO L138 BoogieDeclarations]: Found implementation of procedure __VERIFIER_assert [2024-09-12 23:42:08,926 INFO L242 CfgBuilder]: Building ICFG [2024-09-12 23:42:08,928 INFO L268 CfgBuilder]: Building CFG for each procedure with an implementation [2024-09-12 23:42:09,153 INFO L? ?]: Removed 5 outVars from TransFormulas that were not future-live. [2024-09-12 23:42:09,154 INFO L291 CfgBuilder]: Performing block encoding [2024-09-12 23:42:09,174 INFO L313 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-09-12 23:42:09,175 INFO L318 CfgBuilder]: Removed 2 assume(true) statements. [2024-09-12 23:42:09,175 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 12.09 11:42:09 BoogieIcfgContainer [2024-09-12 23:42:09,176 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-09-12 23:42:09,177 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-09-12 23:42:09,178 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-09-12 23:42:09,181 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-09-12 23:42:09,182 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 12.09 11:42:08" (1/3) ... [2024-09-12 23:42:09,183 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7037d31c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 12.09 11:42:09, skipping insertion in model container [2024-09-12 23:42:09,183 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.09 11:42:08" (2/3) ... [2024-09-12 23:42:09,184 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7037d31c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 12.09 11:42:09, skipping insertion in model container [2024-09-12 23:42:09,184 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 12.09 11:42:09" (3/3) ... [2024-09-12 23:42:09,186 INFO L112 eAbstractionObserver]: Analyzing ICFG dijkstra-u_valuebound50.c [2024-09-12 23:42:09,198 INFO L209 ceAbstractionStarter]: Automizer settings: Hoare:All NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-09-12 23:42:09,198 INFO L149 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-09-12 23:42:09,247 INFO L335 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-09-12 23:42:09,253 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;@53728704, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-09-12 23:42:09,254 INFO L337 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-09-12 23:42:09,257 INFO L276 IsEmpty]: Start isEmpty. Operand has 36 states, 17 states have (on average 1.588235294117647) internal successors, (27), 18 states have internal predecessors, (27), 13 states have call successors, (13), 4 states have call predecessors, (13), 4 states have return successors, (13), 13 states have call predecessors, (13), 13 states have call successors, (13) [2024-09-12 23:42:09,263 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2024-09-12 23:42:09,263 INFO L208 NwaCegarLoop]: Found error trace [2024-09-12 23:42:09,264 INFO L216 NwaCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-09-12 23:42:09,264 INFO L399 AbstractCegarLoop]: === Iteration 1 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-09-12 23:42:09,268 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-12 23:42:09,269 INFO L85 PathProgramCache]: Analyzing trace with hash 570623365, now seen corresponding path program 1 times [2024-09-12 23:42:09,275 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-09-12 23:42:09,275 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [61578606] [2024-09-12 23:42:09,275 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-09-12 23:42:09,276 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-09-12 23:42:09,342 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-12 23:42:09,365 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2024-09-12 23:42:09,367 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-12 23:42:09,371 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-09-12 23:42:09,373 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-12 23:42:09,375 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-09-12 23:42:09,377 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-12 23:42:09,380 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-12 23:42:09,380 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-09-12 23:42:09,381 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [61578606] [2024-09-12 23:42:09,381 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [61578606] provided 1 perfect and 0 imperfect interpolant sequences [2024-09-12 23:42:09,381 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-09-12 23:42:09,381 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-09-12 23:42:09,383 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1763183972] [2024-09-12 23:42:09,383 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-09-12 23:42:09,386 INFO L551 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-09-12 23:42:09,386 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-09-12 23:42:09,400 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-09-12 23:42:09,401 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-09-12 23:42:09,402 INFO L87 Difference]: Start difference. First operand has 36 states, 17 states have (on average 1.588235294117647) internal successors, (27), 18 states have internal predecessors, (27), 13 states have call successors, (13), 4 states have call predecessors, (13), 4 states have return successors, (13), 13 states have call predecessors, (13), 13 states have call successors, (13) Second operand has 2 states, 2 states have (on average 5.5) internal successors, (11), 2 states have internal predecessors, (11), 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-12 23:42:09,422 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-09-12 23:42:09,422 INFO L93 Difference]: Finished difference Result 66 states and 110 transitions. [2024-09-12 23:42:09,423 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-09-12 23:42:09,424 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 5.5) internal successors, (11), 2 states have internal predecessors, (11), 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 22 [2024-09-12 23:42:09,424 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-09-12 23:42:09,429 INFO L225 Difference]: With dead ends: 66 [2024-09-12 23:42:09,429 INFO L226 Difference]: Without dead ends: 32 [2024-09-12 23:42:09,432 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-12 23:42:09,436 INFO L434 NwaCegarLoop]: 45 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, 45 SdHoareTripleChecker+Invalid, 2 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 2 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-09-12 23:42:09,437 INFO L435 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 45 Invalid, 2 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 2 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-09-12 23:42:09,451 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 32 states. [2024-09-12 23:42:09,463 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 32 to 32. [2024-09-12 23:42:09,464 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 32 states, 15 states have (on average 1.2666666666666666) internal successors, (19), 16 states have internal predecessors, (19), 13 states have call successors, (13), 4 states have call predecessors, (13), 3 states have return successors, (11), 11 states have call predecessors, (11), 11 states have call successors, (11) [2024-09-12 23:42:09,465 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 32 states to 32 states and 43 transitions. [2024-09-12 23:42:09,466 INFO L78 Accepts]: Start accepts. Automaton has 32 states and 43 transitions. Word has length 22 [2024-09-12 23:42:09,467 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-09-12 23:42:09,467 INFO L474 AbstractCegarLoop]: Abstraction has 32 states and 43 transitions. [2024-09-12 23:42:09,467 INFO L475 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 5.5) internal successors, (11), 2 states have internal predecessors, (11), 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-12 23:42:09,467 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-12 23:42:09,467 INFO L276 IsEmpty]: Start isEmpty. Operand 32 states and 43 transitions. [2024-09-12 23:42:09,468 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2024-09-12 23:42:09,468 INFO L208 NwaCegarLoop]: Found error trace [2024-09-12 23:42:09,469 INFO L216 NwaCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-09-12 23:42:09,469 WARN L456 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-09-12 23:42:09,469 INFO L399 AbstractCegarLoop]: === Iteration 2 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-09-12 23:42:09,469 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-12 23:42:09,470 INFO L85 PathProgramCache]: Analyzing trace with hash -2095105318, now seen corresponding path program 1 times [2024-09-12 23:42:09,470 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-09-12 23:42:09,470 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1721523047] [2024-09-12 23:42:09,471 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-09-12 23:42:09,471 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-09-12 23:42:09,496 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-12 23:42:09,836 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2024-09-12 23:42:09,837 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-12 23:42:09,839 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-09-12 23:42:09,840 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-12 23:42:09,841 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-09-12 23:42:09,842 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-12 23:42:09,844 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-12 23:42:09,844 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-09-12 23:42:09,845 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1721523047] [2024-09-12 23:42:09,845 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1721523047] provided 1 perfect and 0 imperfect interpolant sequences [2024-09-12 23:42:09,845 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-09-12 23:42:09,845 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-09-12 23:42:09,845 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1274954532] [2024-09-12 23:42:09,845 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-09-12 23:42:09,846 INFO L551 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-09-12 23:42:09,846 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-09-12 23:42:09,847 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-09-12 23:42:09,847 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2024-09-12 23:42:09,847 INFO L87 Difference]: Start difference. First operand 32 states and 43 transitions. Second operand has 6 states, 6 states have (on average 2.0) internal successors, (12), 5 states have internal predecessors, (12), 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-12 23:42:11,040 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.10s for a HTC check with result INVALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers [] [2024-09-12 23:42:15,093 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers [] [2024-09-12 23:42:15,119 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-09-12 23:42:15,119 INFO L93 Difference]: Finished difference Result 64 states and 92 transitions. [2024-09-12 23:42:15,120 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-09-12 23:42:15,120 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 2.0) internal successors, (12), 5 states have internal predecessors, (12), 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 23 [2024-09-12 23:42:15,120 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-09-12 23:42:15,121 INFO L225 Difference]: With dead ends: 64 [2024-09-12 23:42:15,121 INFO L226 Difference]: Without dead ends: 46 [2024-09-12 23:42:15,122 INFO L433 NwaCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 9 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2024-09-12 23:42:15,123 INFO L434 NwaCegarLoop]: 42 mSDtfsCounter, 5 mSDsluCounter, 142 mSDsCounter, 0 mSdLazyCounter, 53 mSolverCounterSat, 13 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 5.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 5 SdHoareTripleChecker+Valid, 184 SdHoareTripleChecker+Invalid, 67 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 13 IncrementalHoareTripleChecker+Valid, 53 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 5.2s IncrementalHoareTripleChecker+Time [2024-09-12 23:42:15,123 INFO L435 NwaCegarLoop]: SdHoareTripleChecker [5 Valid, 184 Invalid, 67 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [13 Valid, 53 Invalid, 1 Unknown, 0 Unchecked, 5.2s Time] [2024-09-12 23:42:15,124 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 46 states. [2024-09-12 23:42:15,141 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 46 to 46. [2024-09-12 23:42:15,141 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 46 states, 22 states have (on average 1.2272727272727273) internal successors, (27), 23 states have internal predecessors, (27), 19 states have call successors, (19), 5 states have call predecessors, (19), 4 states have return successors, (17), 17 states have call predecessors, (17), 17 states have call successors, (17) [2024-09-12 23:42:15,142 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 46 states to 46 states and 63 transitions. [2024-09-12 23:42:15,144 INFO L78 Accepts]: Start accepts. Automaton has 46 states and 63 transitions. Word has length 23 [2024-09-12 23:42:15,144 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-09-12 23:42:15,144 INFO L474 AbstractCegarLoop]: Abstraction has 46 states and 63 transitions. [2024-09-12 23:42:15,144 INFO L475 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 2.0) internal successors, (12), 5 states have internal predecessors, (12), 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-12 23:42:15,145 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-12 23:42:15,146 INFO L276 IsEmpty]: Start isEmpty. Operand 46 states and 63 transitions. [2024-09-12 23:42:15,146 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2024-09-12 23:42:15,146 INFO L208 NwaCegarLoop]: Found error trace [2024-09-12 23:42:15,147 INFO L216 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-09-12 23:42:15,147 WARN L456 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-09-12 23:42:15,147 INFO L399 AbstractCegarLoop]: === Iteration 3 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-09-12 23:42:15,148 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-12 23:42:15,148 INFO L85 PathProgramCache]: Analyzing trace with hash 1429886677, now seen corresponding path program 1 times [2024-09-12 23:42:15,148 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-09-12 23:42:15,149 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [812397057] [2024-09-12 23:42:15,150 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-09-12 23:42:15,150 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-09-12 23:42:15,171 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-12 23:42:15,414 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2024-09-12 23:42:15,415 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-12 23:42:15,417 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-09-12 23:42:15,421 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-12 23:42:15,427 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-09-12 23:42:15,427 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-12 23:42:15,429 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2024-09-12 23:42:15,429 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-09-12 23:42:15,429 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [812397057] [2024-09-12 23:42:15,429 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [812397057] provided 0 perfect and 1 imperfect interpolant sequences [2024-09-12 23:42:15,429 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [972594680] [2024-09-12 23:42:15,429 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-09-12 23:42:15,429 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-09-12 23:42:15,429 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/certificate-witnesses-artifact/automizer/z3 [2024-09-12 23:42:15,432 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/certificate-witnesses-artifact/automizer/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-09-12 23:42:15,433 INFO L327 MonitoredProcess]: [MP /storage/repos/certificate-witnesses-artifact/automizer/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2024-09-12 23:42:15,473 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-12 23:42:15,474 INFO L262 TraceCheckSpWp]: Trace formula consists of 71 conjuncts, 12 conjuncts are in the unsatisfiable core [2024-09-12 23:42:15,478 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2024-09-12 23:42:15,617 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2024-09-12 23:42:15,618 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2024-09-12 23:42:15,775 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2024-09-12 23:42:15,776 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [972594680] provided 0 perfect and 2 imperfect interpolant sequences [2024-09-12 23:42:15,777 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-09-12 23:42:15,777 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7, 7] total 15 [2024-09-12 23:42:15,777 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [330211903] [2024-09-12 23:42:15,777 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-09-12 23:42:15,777 INFO L551 AbstractCegarLoop]: INTERPOLANT automaton has 15 states [2024-09-12 23:42:15,777 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-09-12 23:42:15,778 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2024-09-12 23:42:15,778 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=48, Invalid=162, Unknown=0, NotChecked=0, Total=210 [2024-09-12 23:42:15,778 INFO L87 Difference]: Start difference. First operand 46 states and 63 transitions. Second operand has 15 states, 15 states have (on average 1.8666666666666667) internal successors, (28), 13 states have internal predecessors, (28), 4 states have call successors, (7), 3 states have call predecessors, (7), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2024-09-12 23:42:17,534 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.21s for a HTC check with result INVALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-09-12 23:42:18,495 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-09-12 23:42:18,497 INFO L93 Difference]: Finished difference Result 115 states and 181 transitions. [2024-09-12 23:42:18,497 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2024-09-12 23:42:18,498 INFO L78 Accepts]: Start accepts. Automaton has has 15 states, 15 states have (on average 1.8666666666666667) internal successors, (28), 13 states have internal predecessors, (28), 4 states have call successors, (7), 3 states have call predecessors, (7), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) Word has length 25 [2024-09-12 23:42:18,498 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-09-12 23:42:18,499 INFO L225 Difference]: With dead ends: 115 [2024-09-12 23:42:18,500 INFO L226 Difference]: Without dead ends: 97 [2024-09-12 23:42:18,500 INFO L433 NwaCegarLoop]: 0 DeclaredPredicates, 68 GetRequests, 48 SyntacticMatches, 2 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 84 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=93, Invalid=287, Unknown=0, NotChecked=0, Total=380 [2024-09-12 23:42:18,501 INFO L434 NwaCegarLoop]: 38 mSDtfsCounter, 28 mSDsluCounter, 266 mSDsCounter, 0 mSdLazyCounter, 237 mSolverCounterSat, 113 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 42 SdHoareTripleChecker+Valid, 304 SdHoareTripleChecker+Invalid, 350 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 113 IncrementalHoareTripleChecker+Valid, 237 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.6s IncrementalHoareTripleChecker+Time [2024-09-12 23:42:18,503 INFO L435 NwaCegarLoop]: SdHoareTripleChecker [42 Valid, 304 Invalid, 350 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [113 Valid, 237 Invalid, 0 Unknown, 0 Unchecked, 2.6s Time] [2024-09-12 23:42:18,504 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 97 states. [2024-09-12 23:42:18,524 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 97 to 65. [2024-09-12 23:42:18,525 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 65 states, 32 states have (on average 1.21875) internal successors, (39), 35 states have internal predecessors, (39), 27 states have call successors, (27), 6 states have call predecessors, (27), 5 states have return successors, (25), 23 states have call predecessors, (25), 25 states have call successors, (25) [2024-09-12 23:42:18,526 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 65 states to 65 states and 91 transitions. [2024-09-12 23:42:18,527 INFO L78 Accepts]: Start accepts. Automaton has 65 states and 91 transitions. Word has length 25 [2024-09-12 23:42:18,527 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-09-12 23:42:18,528 INFO L474 AbstractCegarLoop]: Abstraction has 65 states and 91 transitions. [2024-09-12 23:42:18,528 INFO L475 AbstractCegarLoop]: INTERPOLANT automaton has has 15 states, 15 states have (on average 1.8666666666666667) internal successors, (28), 13 states have internal predecessors, (28), 4 states have call successors, (7), 3 states have call predecessors, (7), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2024-09-12 23:42:18,528 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-12 23:42:18,529 INFO L276 IsEmpty]: Start isEmpty. Operand 65 states and 91 transitions. [2024-09-12 23:42:18,531 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 34 [2024-09-12 23:42:18,531 INFO L208 NwaCegarLoop]: Found error trace [2024-09-12 23:42:18,531 INFO L216 NwaCegarLoop]: trace histogram [3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-09-12 23:42:18,545 INFO L552 MonitoredProcess]: [MP /storage/repos/certificate-witnesses-artifact/automizer/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2024-09-12 23:42:18,731 WARN L456 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2,2 /storage/repos/certificate-witnesses-artifact/automizer/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-09-12 23:42:18,732 INFO L399 AbstractCegarLoop]: === Iteration 4 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-09-12 23:42:18,732 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-12 23:42:18,732 INFO L85 PathProgramCache]: Analyzing trace with hash 1189191834, now seen corresponding path program 1 times [2024-09-12 23:42:18,732 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-09-12 23:42:18,732 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1963833872] [2024-09-12 23:42:18,732 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-09-12 23:42:18,732 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-09-12 23:42:18,753 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unknown [2024-09-12 23:42:18,755 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1744968237] [2024-09-12 23:42:18,755 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-09-12 23:42:18,755 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-09-12 23:42:18,755 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/certificate-witnesses-artifact/automizer/z3 [2024-09-12 23:42:18,757 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-12 23:42:18,758 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-12 23:42:18,793 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-12 23:42:18,796 INFO L262 TraceCheckSpWp]: Trace formula consists of 85 conjuncts, 7 conjuncts are in the unsatisfiable core [2024-09-12 23:42:18,797 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2024-09-12 23:42:18,841 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2024-09-12 23:42:18,841 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-09-12 23:42:18,841 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-09-12 23:42:18,841 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1963833872] [2024-09-12 23:42:18,842 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2024-09-12 23:42:18,842 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1744968237] [2024-09-12 23:42:18,842 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1744968237] provided 1 perfect and 0 imperfect interpolant sequences [2024-09-12 23:42:18,843 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-09-12 23:42:18,843 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-09-12 23:42:18,844 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1594750333] [2024-09-12 23:42:18,844 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-09-12 23:42:18,844 INFO L551 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-09-12 23:42:18,844 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-09-12 23:42:18,845 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-09-12 23:42:18,845 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-09-12 23:42:18,845 INFO L87 Difference]: Start difference. First operand 65 states and 91 transitions. Second operand has 5 states, 5 states have (on average 3.0) internal successors, (15), 4 states have internal predecessors, (15), 2 states have call successors, (7), 2 states have call predecessors, (7), 1 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2024-09-12 23:42:18,967 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-09-12 23:42:18,967 INFO L93 Difference]: Finished difference Result 90 states and 127 transitions. [2024-09-12 23:42:18,967 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-09-12 23:42:18,968 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 3.0) internal successors, (15), 4 states have internal predecessors, (15), 2 states have call successors, (7), 2 states have call predecessors, (7), 1 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) Word has length 33 [2024-09-12 23:42:18,968 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-09-12 23:42:18,969 INFO L225 Difference]: With dead ends: 90 [2024-09-12 23:42:18,969 INFO L226 Difference]: Without dead ends: 87 [2024-09-12 23:42:18,969 INFO L433 NwaCegarLoop]: 0 DeclaredPredicates, 33 GetRequests, 29 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-12 23:42:18,970 INFO L434 NwaCegarLoop]: 39 mSDtfsCounter, 5 mSDsluCounter, 99 mSDsCounter, 0 mSdLazyCounter, 38 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 11 SdHoareTripleChecker+Valid, 138 SdHoareTripleChecker+Invalid, 41 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 38 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-09-12 23:42:18,971 INFO L435 NwaCegarLoop]: SdHoareTripleChecker [11 Valid, 138 Invalid, 41 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 38 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-09-12 23:42:18,972 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 87 states. [2024-09-12 23:42:18,991 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 87 to 87. [2024-09-12 23:42:18,991 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 87 states, 40 states have (on average 1.2) internal successors, (48), 42 states have internal predecessors, (48), 39 states have call successors, (39), 8 states have call predecessors, (39), 7 states have return successors, (36), 36 states have call predecessors, (36), 36 states have call successors, (36) [2024-09-12 23:42:18,993 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 87 states to 87 states and 123 transitions. [2024-09-12 23:42:18,993 INFO L78 Accepts]: Start accepts. Automaton has 87 states and 123 transitions. Word has length 33 [2024-09-12 23:42:18,994 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-09-12 23:42:18,994 INFO L474 AbstractCegarLoop]: Abstraction has 87 states and 123 transitions. [2024-09-12 23:42:18,995 INFO L475 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 3.0) internal successors, (15), 4 states have internal predecessors, (15), 2 states have call successors, (7), 2 states have call predecessors, (7), 1 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2024-09-12 23:42:18,995 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-12 23:42:18,995 INFO L276 IsEmpty]: Start isEmpty. Operand 87 states and 123 transitions. [2024-09-12 23:42:18,995 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2024-09-12 23:42:18,996 INFO L208 NwaCegarLoop]: Found error trace [2024-09-12 23:42:18,996 INFO L216 NwaCegarLoop]: trace histogram [3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-09-12 23:42:19,008 INFO L552 MonitoredProcess]: [MP /storage/repos/certificate-witnesses-artifact/automizer/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Ended with exit code 0 [2024-09-12 23:42:19,199 WARN L456 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3,3 /storage/repos/certificate-witnesses-artifact/automizer/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-09-12 23:42:19,200 INFO L399 AbstractCegarLoop]: === Iteration 5 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-09-12 23:42:19,200 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-12 23:42:19,200 INFO L85 PathProgramCache]: Analyzing trace with hash 1682280212, now seen corresponding path program 1 times [2024-09-12 23:42:19,201 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-09-12 23:42:19,201 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [220076687] [2024-09-12 23:42:19,201 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-09-12 23:42:19,201 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-09-12 23:42:19,223 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unknown [2024-09-12 23:42:19,223 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1125272230] [2024-09-12 23:42:19,223 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-09-12 23:42:19,223 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-09-12 23:42:19,224 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/certificate-witnesses-artifact/automizer/z3 [2024-09-12 23:42:19,228 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-12 23:42:19,230 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-12 23:42:19,296 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-12 23:42:19,297 INFO L262 TraceCheckSpWp]: Trace formula consists of 84 conjuncts, 13 conjuncts are in the unsatisfiable core [2024-09-12 23:42:19,298 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2024-09-12 23:42:19,371 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 2 proven. 6 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2024-09-12 23:42:19,372 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2024-09-12 23:42:25,872 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 2 proven. 4 refuted. 2 times theorem prover too weak. 4 trivial. 0 not checked. [2024-09-12 23:42:25,873 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-09-12 23:42:25,873 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [220076687] [2024-09-12 23:42:25,873 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2024-09-12 23:42:25,873 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1125272230] [2024-09-12 23:42:25,873 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1125272230] provided 0 perfect and 2 imperfect interpolant sequences [2024-09-12 23:42:25,873 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-09-12 23:42:25,873 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7] total 10 [2024-09-12 23:42:25,874 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1959402054] [2024-09-12 23:42:25,874 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-09-12 23:42:25,874 INFO L551 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-09-12 23:42:25,874 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-09-12 23:42:25,875 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-09-12 23:42:25,875 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=63, Unknown=1, NotChecked=0, Total=90 [2024-09-12 23:42:25,875 INFO L87 Difference]: Start difference. First operand 87 states and 123 transitions. Second operand has 10 states, 10 states have (on average 2.7) internal successors, (27), 9 states have internal predecessors, (27), 3 states have call successors, (8), 2 states have call predecessors, (8), 1 states have return successors, (5), 3 states have call predecessors, (5), 3 states have call successors, (5) [2024-09-12 23:42:41,017 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers [] [2024-09-12 23:42:45,463 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers [] [2024-09-12 23:42:46,980 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.13s for a HTC check with result INVALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers [] [2024-09-12 23:42:51,451 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.47s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers [] [2024-09-12 23:42:55,465 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers [] [2024-09-12 23:42:59,681 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers [] [2024-09-12 23:43:03,690 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.01s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers [] [2024-09-12 23:43:05,234 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.53s for a HTC check with result INVALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers [] [2024-09-12 23:43:09,339 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 3.80s for a HTC check with result INVALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers [] [2024-09-12 23:43:13,347 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers [] [2024-09-12 23:43:17,357 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.01s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers [] [2024-09-12 23:43:21,374 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.02s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers [] [2024-09-12 23:43:25,380 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers [] [2024-09-12 23:43:28,160 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.78s for a HTC check with result INVALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers [] [2024-09-12 23:43:30,279 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.12s for a HTC check with result INVALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers [] [2024-09-12 23:43:34,281 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers [] [2024-09-12 23:43:38,294 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.01s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers [] [2024-09-12 23:43:42,383 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers [] [2024-09-12 23:43:46,640 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers [] [2024-09-12 23:43:50,645 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers [] [2024-09-12 23:43:54,668 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.01s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers [] [2024-09-12 23:43:54,683 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-09-12 23:43:54,683 INFO L93 Difference]: Finished difference Result 156 states and 226 transitions. [2024-09-12 23:43:54,684 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-09-12 23:43:54,684 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 2.7) internal successors, (27), 9 states have internal predecessors, (27), 3 states have call successors, (8), 2 states have call predecessors, (8), 1 states have return successors, (5), 3 states have call predecessors, (5), 3 states have call successors, (5) Word has length 32 [2024-09-12 23:43:54,684 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-09-12 23:43:54,685 INFO L225 Difference]: With dead ends: 156 [2024-09-12 23:43:54,685 INFO L226 Difference]: Without dead ends: 132 [2024-09-12 23:43:54,686 INFO L433 NwaCegarLoop]: 0 DeclaredPredicates, 66 GetRequests, 54 SyntacticMatches, 2 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 17.1s TimeCoverageRelationStatistics Valid=38, Invalid=92, Unknown=2, NotChecked=0, Total=132 [2024-09-12 23:43:54,686 INFO L434 NwaCegarLoop]: 57 mSDtfsCounter, 19 mSDsluCounter, 240 mSDsCounter, 0 mSdLazyCounter, 199 mSolverCounterSat, 55 mSolverCounterUnsat, 16 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 77.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 36 SdHoareTripleChecker+Valid, 297 SdHoareTripleChecker+Invalid, 270 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 55 IncrementalHoareTripleChecker+Valid, 199 IncrementalHoareTripleChecker+Invalid, 16 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 77.7s IncrementalHoareTripleChecker+Time [2024-09-12 23:43:54,686 INFO L435 NwaCegarLoop]: SdHoareTripleChecker [36 Valid, 297 Invalid, 270 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [55 Valid, 199 Invalid, 16 Unknown, 0 Unchecked, 77.7s Time] [2024-09-12 23:43:54,687 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 132 states. [2024-09-12 23:43:54,710 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 132 to 126. [2024-09-12 23:43:54,710 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 126 states, 58 states have (on average 1.1896551724137931) internal successors, (69), 61 states have internal predecessors, (69), 57 states have call successors, (57), 11 states have call predecessors, (57), 10 states have return successors, (54), 53 states have call predecessors, (54), 54 states have call successors, (54) [2024-09-12 23:43:54,711 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 126 states to 126 states and 180 transitions. [2024-09-12 23:43:54,712 INFO L78 Accepts]: Start accepts. Automaton has 126 states and 180 transitions. Word has length 32 [2024-09-12 23:43:54,712 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-09-12 23:43:54,712 INFO L474 AbstractCegarLoop]: Abstraction has 126 states and 180 transitions. [2024-09-12 23:43:54,712 INFO L475 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 2.7) internal successors, (27), 9 states have internal predecessors, (27), 3 states have call successors, (8), 2 states have call predecessors, (8), 1 states have return successors, (5), 3 states have call predecessors, (5), 3 states have call successors, (5) [2024-09-12 23:43:54,712 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-12 23:43:54,712 INFO L276 IsEmpty]: Start isEmpty. Operand 126 states and 180 transitions. [2024-09-12 23:43:54,713 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 45 [2024-09-12 23:43:54,713 INFO L208 NwaCegarLoop]: Found error trace [2024-09-12 23:43:54,714 INFO L216 NwaCegarLoop]: trace histogram [4, 4, 3, 3, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-09-12 23:43:54,722 INFO L552 MonitoredProcess]: [MP /storage/repos/certificate-witnesses-artifact/automizer/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Ended with exit code 0 [2024-09-12 23:43:54,914 WARN L456 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4,4 /storage/repos/certificate-witnesses-artifact/automizer/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-09-12 23:43:54,918 INFO L399 AbstractCegarLoop]: === Iteration 6 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-09-12 23:43:54,918 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-12 23:43:54,918 INFO L85 PathProgramCache]: Analyzing trace with hash -7962503, now seen corresponding path program 1 times [2024-09-12 23:43:54,918 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-09-12 23:43:54,918 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [965615775] [2024-09-12 23:43:54,919 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-09-12 23:43:54,919 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-09-12 23:43:54,947 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unknown [2024-09-12 23:43:54,951 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1379512522] [2024-09-12 23:43:54,951 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-09-12 23:43:54,951 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-09-12 23:43:54,952 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/certificate-witnesses-artifact/automizer/z3 [2024-09-12 23:43:54,953 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-12 23:43:54,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-09-12 23:43:55,005 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-12 23:43:55,007 INFO L262 TraceCheckSpWp]: Trace formula consists of 106 conjuncts, 11 conjuncts are in the unsatisfiable core [2024-09-12 23:43:55,009 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2024-09-12 23:43:55,112 INFO L134 CoverageAnalysis]: Checked inductivity of 34 backedges. 18 proven. 0 refuted. 0 times theorem prover too weak. 16 trivial. 0 not checked. [2024-09-12 23:43:55,112 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-09-12 23:43:55,112 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-09-12 23:43:55,112 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [965615775] [2024-09-12 23:43:55,112 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2024-09-12 23:43:55,112 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1379512522] [2024-09-12 23:43:55,112 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1379512522] provided 1 perfect and 0 imperfect interpolant sequences [2024-09-12 23:43:55,112 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-09-12 23:43:55,112 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-09-12 23:43:55,112 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1808833800] [2024-09-12 23:43:55,113 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-09-12 23:43:55,113 INFO L551 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-09-12 23:43:55,113 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-09-12 23:43:55,113 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-09-12 23:43:55,113 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=37, Unknown=0, NotChecked=0, Total=56 [2024-09-12 23:43:55,113 INFO L87 Difference]: Start difference. First operand 126 states and 180 transitions. Second operand has 8 states, 8 states have (on average 2.625) internal successors, (21), 7 states have internal predecessors, (21), 2 states have call successors, (8), 2 states have call predecessors, (8), 1 states have return successors, (6), 2 states have call predecessors, (6), 2 states have call successors, (6) [2024-09-12 23:43:55,583 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-09-12 23:43:55,583 INFO L93 Difference]: Finished difference Result 140 states and 191 transitions. [2024-09-12 23:43:55,583 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-09-12 23:43:55,583 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 2.625) internal successors, (21), 7 states have internal predecessors, (21), 2 states have call successors, (8), 2 states have call predecessors, (8), 1 states have return successors, (6), 2 states have call predecessors, (6), 2 states have call successors, (6) Word has length 44 [2024-09-12 23:43:55,584 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-09-12 23:43:55,586 INFO L225 Difference]: With dead ends: 140 [2024-09-12 23:43:55,586 INFO L226 Difference]: Without dead ends: 138 [2024-09-12 23:43:55,586 INFO L433 NwaCegarLoop]: 0 DeclaredPredicates, 44 GetRequests, 37 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=23, Invalid=49, Unknown=0, NotChecked=0, Total=72 [2024-09-12 23:43:55,587 INFO L434 NwaCegarLoop]: 64 mSDtfsCounter, 9 mSDsluCounter, 192 mSDsCounter, 0 mSdLazyCounter, 115 mSolverCounterSat, 8 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 30 SdHoareTripleChecker+Valid, 256 SdHoareTripleChecker+Invalid, 123 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 8 IncrementalHoareTripleChecker+Valid, 115 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2024-09-12 23:43:55,587 INFO L435 NwaCegarLoop]: SdHoareTripleChecker [30 Valid, 256 Invalid, 123 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [8 Valid, 115 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2024-09-12 23:43:55,587 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 138 states. [2024-09-12 23:43:55,604 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 138 to 138. [2024-09-12 23:43:55,605 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 138 states, 67 states have (on average 1.164179104477612) internal successors, (78), 70 states have internal predecessors, (78), 57 states have call successors, (57), 14 states have call predecessors, (57), 13 states have return successors, (54), 53 states have call predecessors, (54), 54 states have call successors, (54) [2024-09-12 23:43:55,606 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 138 states to 138 states and 189 transitions. [2024-09-12 23:43:55,606 INFO L78 Accepts]: Start accepts. Automaton has 138 states and 189 transitions. Word has length 44 [2024-09-12 23:43:55,607 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-09-12 23:43:55,607 INFO L474 AbstractCegarLoop]: Abstraction has 138 states and 189 transitions. [2024-09-12 23:43:55,607 INFO L475 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 2.625) internal successors, (21), 7 states have internal predecessors, (21), 2 states have call successors, (8), 2 states have call predecessors, (8), 1 states have return successors, (6), 2 states have call predecessors, (6), 2 states have call successors, (6) [2024-09-12 23:43:55,607 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-12 23:43:55,607 INFO L276 IsEmpty]: Start isEmpty. Operand 138 states and 189 transitions. [2024-09-12 23:43:55,609 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 60 [2024-09-12 23:43:55,609 INFO L208 NwaCegarLoop]: Found error trace [2024-09-12 23:43:55,609 INFO L216 NwaCegarLoop]: trace histogram [8, 7, 7, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-09-12 23:43:55,621 INFO L552 MonitoredProcess]: [MP /storage/repos/certificate-witnesses-artifact/automizer/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Ended with exit code 0 [2024-09-12 23:43:55,809 WARN L456 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5,5 /storage/repos/certificate-witnesses-artifact/automizer/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-09-12 23:43:55,809 INFO L399 AbstractCegarLoop]: === Iteration 7 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-09-12 23:43:55,810 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-12 23:43:55,810 INFO L85 PathProgramCache]: Analyzing trace with hash -409333978, now seen corresponding path program 1 times [2024-09-12 23:43:55,810 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-09-12 23:43:55,810 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1678837751] [2024-09-12 23:43:55,810 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-09-12 23:43:55,810 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-09-12 23:43:55,851 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unknown [2024-09-12 23:43:55,852 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1905941540] [2024-09-12 23:43:55,852 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-09-12 23:43:55,853 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-09-12 23:43:55,853 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/certificate-witnesses-artifact/automizer/z3 [2024-09-12 23:43:55,856 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-12 23:43:55,857 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-12 23:43:55,902 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-12 23:43:55,904 INFO L262 TraceCheckSpWp]: Trace formula consists of 132 conjuncts, 14 conjuncts are in the unsatisfiable core [2024-09-12 23:43:55,906 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2024-09-12 23:43:56,002 INFO L134 CoverageAnalysis]: Checked inductivity of 102 backedges. 19 proven. 13 refuted. 0 times theorem prover too weak. 70 trivial. 0 not checked. [2024-09-12 23:43:56,002 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2024-09-12 23:44:00,559 WARN L854 $PredicateComparison]: unable to prove that (or (= (mod (+ (* 4294967295 c_main_~n~0) c_main_~r~0 (* c_main_~p~0 c_main_~p~0)) 4294967296) 0) (forall ((main_~q~0 Int)) (not (= (mod (+ (* main_~q~0 main_~q~0 4294967295 c_main_~h~0) (* 4294967292 main_~q~0 main_~q~0 c_main_~p~0) (* main_~q~0 c_main_~r~0 12 c_main_~h~0) (* main_~q~0 16 c_main_~p~0 c_main_~n~0) (* c_main_~h~0 c_main_~h~0 c_main_~h~0) (* main_~q~0 c_main_~n~0 4294967284 c_main_~h~0) (* main_~q~0 c_main_~p~0 c_main_~r~0 4294967280)) 4294967296) 0)))) is different from false [2024-09-12 23:44:00,565 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-09-12 23:44:00,565 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1678837751] [2024-09-12 23:44:00,565 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2024-09-12 23:44:00,565 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1905941540] [2024-09-12 23:44:00,566 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1905941540] provided 0 perfect and 1 imperfect interpolant sequences [2024-09-12 23:44:00,566 INFO L185 FreeRefinementEngine]: Found 0 perfect and 1 imperfect interpolant sequences. [2024-09-12 23:44:00,566 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8] total 8 [2024-09-12 23:44:00,566 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [465343235] [2024-09-12 23:44:00,566 INFO L85 oduleStraightlineAll]: Using 1 imperfect interpolants to construct interpolant automaton [2024-09-12 23:44:00,566 INFO L551 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-09-12 23:44:00,566 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-09-12 23:44:00,567 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-09-12 23:44:00,567 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=54, Unknown=1, NotChecked=14, Total=90 [2024-09-12 23:44:00,567 INFO L87 Difference]: Start difference. First operand 138 states and 189 transitions. Second operand has 8 states, 8 states have (on average 2.375) internal successors, (19), 7 states have internal predecessors, (19), 3 states have call successors, (12), 2 states have call predecessors, (12), 2 states have return successors, (10), 3 states have call predecessors, (10), 3 states have call successors, (10) [2024-09-12 23:44:05,036 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-09-12 23:44:09,044 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.01s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-09-12 23:44:09,083 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-09-12 23:44:09,083 INFO L93 Difference]: Finished difference Result 156 states and 216 transitions. [2024-09-12 23:44:09,084 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-09-12 23:44:09,084 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 2.375) internal successors, (19), 7 states have internal predecessors, (19), 3 states have call successors, (12), 2 states have call predecessors, (12), 2 states have return successors, (10), 3 states have call predecessors, (10), 3 states have call successors, (10) Word has length 59 [2024-09-12 23:44:09,084 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-09-12 23:44:09,085 INFO L225 Difference]: With dead ends: 156 [2024-09-12 23:44:09,085 INFO L226 Difference]: Without dead ends: 138 [2024-09-12 23:44:09,086 INFO L433 NwaCegarLoop]: 0 DeclaredPredicates, 85 GetRequests, 74 SyntacticMatches, 2 SemanticMatches, 9 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 4.4s TimeCoverageRelationStatistics Valid=27, Invalid=66, Unknown=1, NotChecked=16, Total=110 [2024-09-12 23:44:09,086 INFO L434 NwaCegarLoop]: 29 mSDtfsCounter, 9 mSDsluCounter, 91 mSDsCounter, 0 mSdLazyCounter, 120 mSolverCounterSat, 24 mSolverCounterUnsat, 2 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 8.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 18 SdHoareTripleChecker+Valid, 120 SdHoareTripleChecker+Invalid, 146 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 24 IncrementalHoareTripleChecker+Valid, 120 IncrementalHoareTripleChecker+Invalid, 2 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 8.5s IncrementalHoareTripleChecker+Time [2024-09-12 23:44:09,086 INFO L435 NwaCegarLoop]: SdHoareTripleChecker [18 Valid, 120 Invalid, 146 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [24 Valid, 120 Invalid, 2 Unknown, 0 Unchecked, 8.5s Time] [2024-09-12 23:44:09,087 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 138 states. [2024-09-12 23:44:09,114 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 138 to 138. [2024-09-12 23:44:09,114 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 138 states, 68 states have (on average 1.161764705882353) internal successors, (79), 71 states have internal predecessors, (79), 56 states have call successors, (56), 14 states have call predecessors, (56), 13 states have return successors, (53), 52 states have call predecessors, (53), 53 states have call successors, (53) [2024-09-12 23:44:09,116 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 138 states to 138 states and 188 transitions. [2024-09-12 23:44:09,116 INFO L78 Accepts]: Start accepts. Automaton has 138 states and 188 transitions. Word has length 59 [2024-09-12 23:44:09,117 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-09-12 23:44:09,117 INFO L474 AbstractCegarLoop]: Abstraction has 138 states and 188 transitions. [2024-09-12 23:44:09,117 INFO L475 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 2.375) internal successors, (19), 7 states have internal predecessors, (19), 3 states have call successors, (12), 2 states have call predecessors, (12), 2 states have return successors, (10), 3 states have call predecessors, (10), 3 states have call successors, (10) [2024-09-12 23:44:09,117 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-12 23:44:09,117 INFO L276 IsEmpty]: Start isEmpty. Operand 138 states and 188 transitions. [2024-09-12 23:44:09,119 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 59 [2024-09-12 23:44:09,119 INFO L208 NwaCegarLoop]: Found error trace [2024-09-12 23:44:09,120 INFO L216 NwaCegarLoop]: trace histogram [7, 6, 6, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-09-12 23:44:09,135 INFO L540 MonitoredProcess]: [MP /storage/repos/certificate-witnesses-artifact/automizer/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Forceful destruction successful, exit code 0 [2024-09-12 23:44:09,320 WARN L456 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 /storage/repos/certificate-witnesses-artifact/automizer/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable6 [2024-09-12 23:44:09,320 INFO L399 AbstractCegarLoop]: === Iteration 8 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-09-12 23:44:09,320 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-12 23:44:09,321 INFO L85 PathProgramCache]: Analyzing trace with hash 382001091, now seen corresponding path program 1 times [2024-09-12 23:44:09,321 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-09-12 23:44:09,321 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [134722291] [2024-09-12 23:44:09,321 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-09-12 23:44:09,321 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-09-12 23:44:09,345 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-12 23:44:09,803 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2024-09-12 23:44:09,804 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-12 23:44:09,805 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-09-12 23:44:09,806 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-12 23:44:09,807 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-09-12 23:44:09,808 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-12 23:44:09,808 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2024-09-12 23:44:09,809 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-12 23:44:09,814 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2024-09-12 23:44:09,815 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-12 23:44:09,820 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 31 [2024-09-12 23:44:09,821 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-12 23:44:09,840 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 36 [2024-09-12 23:44:09,843 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-12 23:44:09,849 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2024-09-12 23:44:09,850 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-12 23:44:09,857 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 46 [2024-09-12 23:44:09,859 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-12 23:44:09,879 INFO L134 CoverageAnalysis]: Checked inductivity of 80 backedges. 12 proven. 4 refuted. 0 times theorem prover too weak. 64 trivial. 0 not checked. [2024-09-12 23:44:09,880 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-09-12 23:44:09,881 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [134722291] [2024-09-12 23:44:09,881 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [134722291] provided 0 perfect and 1 imperfect interpolant sequences [2024-09-12 23:44:09,881 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1941202779] [2024-09-12 23:44:09,881 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-09-12 23:44:09,881 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-09-12 23:44:09,881 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/certificate-witnesses-artifact/automizer/z3 [2024-09-12 23:44:09,882 INFO L229 MonitoredProcess]: Starting monitored process 7 with /storage/repos/certificate-witnesses-artifact/automizer/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-09-12 23:44:09,884 INFO L327 MonitoredProcess]: [MP /storage/repos/certificate-witnesses-artifact/automizer/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Waiting until timeout for monitored process [2024-09-12 23:44:09,949 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-12 23:44:09,950 INFO L262 TraceCheckSpWp]: Trace formula consists of 138 conjuncts, 33 conjuncts are in the unsatisfiable core [2024-09-12 23:44:09,952 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2024-09-12 23:44:10,373 INFO L134 CoverageAnalysis]: Checked inductivity of 80 backedges. 19 proven. 21 refuted. 0 times theorem prover too weak. 40 trivial. 0 not checked. [2024-09-12 23:44:10,374 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2024-09-12 23:44:32,611 WARN L293 SmtUtils]: Spent 12.07s on a formula simplification that was a NOOP. DAG size: 26 (called from [L 731] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2024-09-12 23:44:48,973 WARN L293 SmtUtils]: Spent 12.13s on a formula simplification that was a NOOP. DAG size: 46 (called from [L 391] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2024-09-12 23:45:09,454 WARN L293 SmtUtils]: Spent 12.08s on a formula simplification that was a NOOP. DAG size: 26 (called from [L 731] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2024-09-12 23:45:29,985 WARN L293 SmtUtils]: Spent 8.24s on a formula simplification that was a NOOP. DAG size: 26 (called from [L 731] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2024-09-12 23:45:42,491 WARN L293 SmtUtils]: Spent 8.03s 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-12 23:45:50,680 WARN L293 SmtUtils]: Spent 8.04s on a formula simplification that was a NOOP. DAG size: 26 (called from [L 731] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2024-09-12 23:46:43,882 WARN L293 SmtUtils]: Spent 24.65s on a formula simplification that was a NOOP. DAG size: 69 (called from [L 391] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2024-09-12 23:46:43,884 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1941202779] provided 0 perfect and 1 imperfect interpolant sequences [2024-09-12 23:46:43,884 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-09-12 23:46:43,884 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 13] total 20 [2024-09-12 23:46:43,884 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1509542060] [2024-09-12 23:46:43,884 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-09-12 23:46:43,884 INFO L551 AbstractCegarLoop]: INTERPOLANT automaton has 20 states [2024-09-12 23:46:43,884 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-09-12 23:46:43,885 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2024-09-12 23:46:43,885 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=88, Invalid=505, Unknown=7, NotChecked=0, Total=600 [2024-09-12 23:46:43,885 INFO L87 Difference]: Start difference. First operand 138 states and 188 transitions. Second operand has 20 states, 19 states have (on average 1.7894736842105263) internal successors, (34), 16 states have internal predecessors, (34), 7 states have call successors, (18), 3 states have call predecessors, (18), 2 states have return successors, (15), 5 states have call predecessors, (15), 5 states have call successors, (15) [2024-09-12 23:46:48,397 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-09-12 23:46:52,410 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.01s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-09-12 23:46:56,458 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.01s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-09-12 23:47:00,472 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.01s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-09-12 23:47:04,483 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.01s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-09-12 23:47:08,501 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.02s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-09-12 23:47:12,534 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.03s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-09-12 23:47:16,588 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.05s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers [] [2024-09-12 23:47:20,633 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-09-12 23:47:24,653 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.02s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-09-12 23:47:28,672 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.02s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-09-12 23:47:32,699 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.03s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-09-12 23:47:36,730 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.03s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-09-12 23:47:40,945 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-09-12 23:47:44,957 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.01s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-09-12 23:47:48,968 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.01s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-09-12 23:47:52,997 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.03s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-09-12 23:47:57,019 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.02s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-09-12 23:48:01,036 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.02s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-09-12 23:48:05,049 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.01s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-09-12 23:48:09,069 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.02s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-09-12 23:48:13,090 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.02s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-09-12 23:48:17,104 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.01s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-09-12 23:48:21,121 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.02s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-09-12 23:48:25,134 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.01s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-09-12 23:48:29,160 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.02s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-09-12 23:48:33,173 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.01s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-09-12 23:48:37,200 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.03s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-09-12 23:48:41,213 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.01s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-09-12 23:48:45,226 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.01s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-09-12 23:48:45,404 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-09-12 23:48:45,404 INFO L93 Difference]: Finished difference Result 182 states and 245 transitions. [2024-09-12 23:48:45,411 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2024-09-12 23:48:45,411 INFO L78 Accepts]: Start accepts. Automaton has has 20 states, 19 states have (on average 1.7894736842105263) internal successors, (34), 16 states have internal predecessors, (34), 7 states have call successors, (18), 3 states have call predecessors, (18), 2 states have return successors, (15), 5 states have call predecessors, (15), 5 states have call successors, (15) Word has length 58 [2024-09-12 23:48:45,413 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-09-12 23:48:45,414 INFO L225 Difference]: With dead ends: 182 [2024-09-12 23:48:45,414 INFO L226 Difference]: Without dead ends: 151 [2024-09-12 23:48:45,415 INFO L433 NwaCegarLoop]: 0 DeclaredPredicates, 123 GetRequests, 92 SyntacticMatches, 3 SemanticMatches, 28 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 141 ImplicationChecksByTransitivity, 75.3s TimeCoverageRelationStatistics Valid=126, Invalid=737, Unknown=7, NotChecked=0, Total=870 [2024-09-12 23:48:45,416 INFO L434 NwaCegarLoop]: 34 mSDtfsCounter, 7 mSDsluCounter, 425 mSDsCounter, 0 mSdLazyCounter, 411 mSolverCounterSat, 21 mSolverCounterUnsat, 30 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 120.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 18 SdHoareTripleChecker+Valid, 459 SdHoareTripleChecker+Invalid, 462 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 21 IncrementalHoareTripleChecker+Valid, 411 IncrementalHoareTripleChecker+Invalid, 30 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 121.3s IncrementalHoareTripleChecker+Time [2024-09-12 23:48:45,416 INFO L435 NwaCegarLoop]: SdHoareTripleChecker [18 Valid, 459 Invalid, 462 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [21 Valid, 411 Invalid, 30 Unknown, 0 Unchecked, 121.3s Time] [2024-09-12 23:48:45,417 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 151 states. [2024-09-12 23:48:45,438 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 151 to 151. [2024-09-12 23:48:45,438 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 151 states, 78 states have (on average 1.1282051282051282) internal successors, (88), 80 states have internal predecessors, (88), 56 states have call successors, (56), 17 states have call predecessors, (56), 16 states have return successors, (53), 53 states have call predecessors, (53), 53 states have call successors, (53) [2024-09-12 23:48:45,439 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 151 states to 151 states and 197 transitions. [2024-09-12 23:48:45,442 INFO L78 Accepts]: Start accepts. Automaton has 151 states and 197 transitions. Word has length 58 [2024-09-12 23:48:45,442 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-09-12 23:48:45,442 INFO L474 AbstractCegarLoop]: Abstraction has 151 states and 197 transitions. [2024-09-12 23:48:45,442 INFO L475 AbstractCegarLoop]: INTERPOLANT automaton has has 20 states, 19 states have (on average 1.7894736842105263) internal successors, (34), 16 states have internal predecessors, (34), 7 states have call successors, (18), 3 states have call predecessors, (18), 2 states have return successors, (15), 5 states have call predecessors, (15), 5 states have call successors, (15) [2024-09-12 23:48:45,442 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-12 23:48:45,442 INFO L276 IsEmpty]: Start isEmpty. Operand 151 states and 197 transitions. [2024-09-12 23:48:45,443 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 61 [2024-09-12 23:48:45,443 INFO L208 NwaCegarLoop]: Found error trace [2024-09-12 23:48:45,444 INFO L216 NwaCegarLoop]: trace histogram [7, 6, 6, 3, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-09-12 23:48:45,461 INFO L540 MonitoredProcess]: [MP /storage/repos/certificate-witnesses-artifact/automizer/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Forceful destruction successful, exit code 0 [2024-09-12 23:48:45,644 WARN L456 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7,7 /storage/repos/certificate-witnesses-artifact/automizer/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-09-12 23:48:45,644 INFO L399 AbstractCegarLoop]: === Iteration 9 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-09-12 23:48:45,645 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-12 23:48:45,645 INFO L85 PathProgramCache]: Analyzing trace with hash -1682429464, now seen corresponding path program 2 times [2024-09-12 23:48:45,645 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-09-12 23:48:45,645 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1607365437] [2024-09-12 23:48:45,645 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-09-12 23:48:45,645 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-09-12 23:48:45,684 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-12 23:48:46,581 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2024-09-12 23:48:46,582 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-12 23:48:46,583 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-09-12 23:48:46,584 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-12 23:48:46,584 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-09-12 23:48:46,585 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-12 23:48:46,586 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2024-09-12 23:48:46,587 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-12 23:48:46,593 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28 [2024-09-12 23:48:46,595 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-12 23:48:46,600 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2024-09-12 23:48:46,601 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-12 23:48:46,608 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-09-12 23:48:46,609 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-12 23:48:46,616 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2024-09-12 23:48:46,617 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-12 23:48:46,622 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 48 [2024-09-12 23:48:46,623 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-12 23:48:46,628 INFO L134 CoverageAnalysis]: Checked inductivity of 84 backedges. 12 proven. 8 refuted. 0 times theorem prover too weak. 64 trivial. 0 not checked. [2024-09-12 23:48:46,628 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-09-12 23:48:46,628 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1607365437] [2024-09-12 23:48:46,628 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1607365437] provided 0 perfect and 1 imperfect interpolant sequences [2024-09-12 23:48:46,628 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1562644376] [2024-09-12 23:48:46,629 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2024-09-12 23:48:46,629 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-09-12 23:48:46,629 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/certificate-witnesses-artifact/automizer/z3 [2024-09-12 23:48:46,630 INFO L229 MonitoredProcess]: Starting monitored process 8 with /storage/repos/certificate-witnesses-artifact/automizer/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-09-12 23:48:46,631 INFO L327 MonitoredProcess]: [MP /storage/repos/certificate-witnesses-artifact/automizer/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Waiting until timeout for monitored process [2024-09-12 23:48:46,765 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2024-09-12 23:48:46,765 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2024-09-12 23:48:46,766 INFO L262 TraceCheckSpWp]: Trace formula consists of 142 conjuncts, 33 conjuncts are in the unsatisfiable core [2024-09-12 23:48:46,767 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2024-09-12 23:48:48,734 INFO L134 CoverageAnalysis]: Checked inductivity of 84 backedges. 23 proven. 12 refuted. 0 times theorem prover too weak. 49 trivial. 0 not checked. [2024-09-12 23:48:48,734 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2024-09-12 23:49:13,738 WARN L293 SmtUtils]: Spent 8.04s on a formula simplification that was a NOOP. DAG size: 20 (called from [L 731] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2024-09-12 23:49:47,244 WARN L293 SmtUtils]: Spent 8.03s on a formula simplification that was a NOOP. DAG size: 26 (called from [L 731] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2024-09-12 23:49:55,333 WARN L293 SmtUtils]: Spent 8.05s on a formula simplification that was a NOOP. DAG size: 26 (called from [L 731] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2024-09-12 23:50:48,802 WARN L293 SmtUtils]: Spent 28.22s on a formula simplification that was a NOOP. DAG size: 48 (called from [L 391] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2024-09-12 23:50:56,965 WARN L293 SmtUtils]: Spent 8.15s on a formula simplification that was a NOOP. DAG size: 26 (called from [L 731] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2024-09-12 23:51:09,084 WARN L293 SmtUtils]: Spent 8.05s on a formula simplification that was a NOOP. DAG size: 20 (called from [L 731] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2024-09-12 23:51:21,187 WARN L293 SmtUtils]: Spent 12.10s on a formula simplification that was a NOOP. DAG size: 9 (called from [L 731] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2024-09-12 23:51:36,289 WARN L293 SmtUtils]: Spent 8.29s on a formula simplification that was a NOOP. DAG size: 54 (called from [L 391] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2024-09-12 23:51:48,376 WARN L293 SmtUtils]: Spent 12.08s on a formula simplification that was a NOOP. DAG size: 11 (called from [L 731] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2024-09-12 23:52:00,480 WARN L293 SmtUtils]: Spent 8.05s on a formula simplification that was a NOOP. DAG size: 9 (called from [L 731] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2024-09-12 23:52:00,500 INFO L134 CoverageAnalysis]: Checked inductivity of 84 backedges. 23 proven. 12 refuted. 0 times theorem prover too weak. 49 trivial. 0 not checked. [2024-09-12 23:52:00,501 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1562644376] provided 0 perfect and 2 imperfect interpolant sequences [2024-09-12 23:52:00,501 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-09-12 23:52:00,501 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 13, 13] total 27 [2024-09-12 23:52:00,501 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1908472045] [2024-09-12 23:52:00,501 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-09-12 23:52:00,501 INFO L551 AbstractCegarLoop]: INTERPOLANT automaton has 27 states [2024-09-12 23:52:00,501 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-09-12 23:52:00,502 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 27 interpolants. [2024-09-12 23:52:00,502 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=107, Invalid=590, Unknown=5, NotChecked=0, Total=702 [2024-09-12 23:52:00,502 INFO L87 Difference]: Start difference. First operand 151 states and 197 transitions. Second operand has 27 states, 27 states have (on average 1.8518518518518519) internal successors, (50), 24 states have internal predecessors, (50), 8 states have call successors, (25), 3 states have call predecessors, (25), 2 states have return successors, (21), 6 states have call predecessors, (21), 6 states have call successors, (21) [2024-09-12 23:52:04,515 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=true, quantifiers [] [2024-09-12 23:52:08,579 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers [] [2024-09-12 23:52:12,829 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse8 (mod c_main_~n~0 4294967296)) (.cse6 (mod c_main_~q~0 1073741824)) (.cse9 (div (mod c_main_~p~0 4294967296) 2))) (let ((.cse0 (mod c_main_~q~0 4294967296)) (.cse5 (* (- 1) c_main_~p~0)) (.cse4 (* 2 .cse9)) (.cse2 (* c_main_~p~0 c_main_~h~0 c_main_~h~0)) (.cse7 (* 4 .cse6)) (.cse1 (+ .cse8 1))) (and (or (< .cse0 .cse1) (not (= (mod (+ (* c_main_~q~0 c_main_~q~0 4294967295 c_main_~p~0) (* c_main_~q~0 c_main_~r~0 4 c_main_~h~0) .cse2 (* c_main_~q~0 c_main_~p~0 c_main_~n~0 4) (* 4294967292 c_main_~q~0 c_main_~p~0 c_main_~r~0) (* 4294967292 c_main_~q~0 c_main_~n~0 c_main_~h~0)) 4294967296) 0)) (let ((.cse3 (div .cse0 4))) (< (+ (* (div (+ (* 3 .cse3) .cse4) 4294967296) 4294967296) c_main_~r~0) (+ (* 4 .cse3) (* 4294967296 (div (+ (* (- 1) .cse3) .cse5 c_main_~r~0) 4294967296)) c_main_~p~0 .cse4))) (= .cse0 1)) (or (not (= (mod (+ (* c_main_~q~0 c_main_~q~0 c_main_~p~0 4294967280) (* c_main_~q~0 c_main_~p~0 c_main_~r~0 4294967280) (* c_main_~q~0 c_main_~n~0 4294967280 c_main_~h~0) (* c_main_~q~0 16 c_main_~r~0 c_main_~h~0) .cse2 (* c_main_~q~0 16 c_main_~p~0 c_main_~n~0)) 4294967296) 0)) (< (+ (* (div (+ (* 3 .cse6) .cse4) 4294967296) 4294967296) c_main_~r~0) (+ .cse7 c_main_~p~0 (* (div (+ (* (- 1) .cse6) .cse5 c_main_~r~0) 4294967296) 4294967296) .cse4)) (< .cse8 .cse0) (< .cse7 .cse1)) (let ((.cse10 (mod c_main_~q~0 268435456))) (let ((.cse11 (* .cse10 16))) (or (< (+ (* (div (+ .cse9 (* .cse10 6)) 2147483648) 4294967296) c_main_~r~0) (+ (* (div (+ (* .cse10 (- 4)) .cse5 c_main_~r~0) 4294967296) 4294967296) .cse11 c_main_~p~0 .cse4)) (not (= (mod (+ (* c_main_~q~0 c_main_~q~0 c_main_~p~0 4294967040) (* c_main_~q~0 4294967232 c_main_~p~0 c_main_~r~0) (* c_main_~q~0 64 c_main_~p~0 c_main_~n~0) .cse2 (* c_main_~q~0 64 c_main_~r~0 c_main_~h~0) (* c_main_~q~0 4294967232 c_main_~n~0 c_main_~h~0)) 4294967296) 0)) (< .cse8 .cse7) (< .cse11 .cse1))))))) is different from false [2024-09-12 23:52:16,887 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers [] [2024-09-12 23:53:23,011 WARN L293 SmtUtils]: Spent 53.03s on a formula simplification that was a NOOP. DAG size: 76 (called from [L 391] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2024-09-12 23:53:27,018 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers [] [2024-09-12 23:53:31,068 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.05s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers [] [2024-09-12 23:53:35,121 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers [] [2024-09-12 23:53:39,152 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers [] [2024-09-12 23:53:43,166 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers [] [2024-09-12 23:54:11,402 WARN L293 SmtUtils]: Spent 15.96s on a formula simplification that was a NOOP. DAG size: 75 (called from [L 391] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2024-09-12 23:54:15,500 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers [] [2024-09-12 23:54:19,554 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers [] [2024-09-12 23:54:23,600 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers [] [2024-09-12 23:54:27,620 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.01s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers [] [2024-09-12 23:54:31,663 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers [] [2024-09-12 23:54:35,696 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers [] [2024-09-12 23:54:39,720 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.02s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers [] [2024-09-12 23:54:43,746 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers [] [2024-09-12 23:54:47,775 WARN L854 $PredicateComparison]: unable to prove that (and (let ((.cse0 (* 2 c_main_~p~0))) (< (+ (* 4294967296 (div (+ .cse0 c_main_~q~0) 4294967296)) c_main_~r~0) (+ .cse0 c_main_~q~0 (* (div c_main_~r~0 4294967296) 4294967296)))) (let ((.cse3 (mod c_main_~q~0 4294967296))) (or (not (= (mod (+ (* c_main_~q~0 c_main_~q~0 4294967295 c_main_~p~0) (* c_main_~q~0 c_main_~r~0 4 c_main_~h~0) (* c_main_~p~0 c_main_~h~0 c_main_~h~0) (* c_main_~q~0 c_main_~p~0 c_main_~n~0 4) (* 4294967292 c_main_~q~0 c_main_~p~0 c_main_~r~0) (* 4294967292 c_main_~q~0 c_main_~n~0 c_main_~h~0)) 4294967296) 0)) (let ((.cse1 (div .cse3 4)) (.cse2 (* 2 (div (mod c_main_~p~0 4294967296) 2)))) (< (+ (* (div (+ (* 3 .cse1) .cse2) 4294967296) 4294967296) c_main_~r~0) (+ (* 4 .cse1) (* 4294967296 (div (+ (* (- 1) .cse1) (* (- 1) c_main_~p~0) c_main_~r~0) 4294967296)) c_main_~p~0 .cse2))) (= .cse3 1)))) is different from false [2024-09-12 23:54:52,679 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers [] [2024-09-12 23:54:54,581 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.90s for a HTC check with result INVALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers [] [2024-09-12 23:54:58,602 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.02s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers [] [2024-09-12 23:55:02,621 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.02s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers [] [2024-09-12 23:55:06,660 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.04s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers [] [2024-09-12 23:55:10,981 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers [] [2024-09-12 23:55:15,010 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.03s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers [] [2024-09-12 23:55:19,062 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers [] [2024-09-12 23:55:23,067 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers [] [2024-09-12 23:55:27,122 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.01s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers [] [2024-09-12 23:55:31,142 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.02s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers [] [2024-09-12 23:55:35,157 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.01s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers [] [2024-09-12 23:55:39,498 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers [] [2024-09-12 23:55:43,652 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers [] Killed by 15