./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/nla-digbench-scaling/geo3-ll_unwindbound10.c --full-output --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 a9b967e5 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/geo3-ll_unwindbound10.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 a4125f633efe01ed52ee22c33d3f9d531ac7ff6ac035f88f190008d4d4fb1af8 --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-a9b967e-m [2024-09-11 20:04:18,306 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-09-11 20:04:18,375 INFO L114 SettingsManager]: Loading settings from /storage/repos/certificate-witnesses-artifact/automizer/config/svcomp-Reach-32bit-Automizer_Default.epf [2024-09-11 20:04:18,379 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-09-11 20:04:18,380 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-09-11 20:04:18,400 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-09-11 20:04:18,401 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-09-11 20:04:18,401 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-09-11 20:04:18,402 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-09-11 20:04:18,403 INFO L153 SettingsManager]: * Use memory slicer=true [2024-09-11 20:04:18,403 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-09-11 20:04:18,404 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-09-11 20:04:18,404 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-09-11 20:04:18,404 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-09-11 20:04:18,406 INFO L153 SettingsManager]: * Use SBE=true [2024-09-11 20:04:18,407 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-09-11 20:04:18,407 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-09-11 20:04:18,407 INFO L153 SettingsManager]: * sizeof long=4 [2024-09-11 20:04:18,407 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-09-11 20:04:18,407 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-09-11 20:04:18,408 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-09-11 20:04:18,408 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-09-11 20:04:18,408 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-09-11 20:04:18,409 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-09-11 20:04:18,410 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-09-11 20:04:18,410 INFO L153 SettingsManager]: * sizeof long double=12 [2024-09-11 20:04:18,410 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-09-11 20:04:18,410 INFO L153 SettingsManager]: * Use constant arrays=true [2024-09-11 20:04:18,410 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-09-11 20:04:18,410 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-09-11 20:04:18,411 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-09-11 20:04:18,411 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-09-11 20:04:18,411 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-09-11 20:04:18,411 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-09-11 20:04:18,411 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-09-11 20:04:18,412 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-09-11 20:04:18,412 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-09-11 20:04:18,412 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-09-11 20:04:18,412 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-09-11 20:04:18,412 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-09-11 20:04:18,413 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-09-11 20:04:18,413 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-09-11 20:04:18,414 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 -> a4125f633efe01ed52ee22c33d3f9d531ac7ff6ac035f88f190008d4d4fb1af8 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-11 20:04:18,602 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-09-11 20:04:18,619 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-09-11 20:04:18,621 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-09-11 20:04:18,621 INFO L270 PluginConnector]: Initializing CDTParser... [2024-09-11 20:04:18,622 INFO L274 PluginConnector]: CDTParser initialized [2024-09-11 20:04:18,622 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/certificate-witnesses-artifact/automizer/../sv-benchmarks/c/nla-digbench-scaling/geo3-ll_unwindbound10.c [2024-09-11 20:04:19,769 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-09-11 20:04:19,921 INFO L384 CDTParser]: Found 1 translation units. [2024-09-11 20:04:19,922 INFO L180 CDTParser]: Scanning /storage/repos/certificate-witnesses-artifact/sv-benchmarks/c/nla-digbench-scaling/geo3-ll_unwindbound10.c [2024-09-11 20:04:19,935 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/certificate-witnesses-artifact/automizer/data/e609d460e/28aca08dc37f4ef9b668217d54e80fbc/FLAG6b18b4ace [2024-09-11 20:04:20,349 INFO L435 CDTParser]: Successfully deleted /storage/repos/certificate-witnesses-artifact/automizer/data/e609d460e/28aca08dc37f4ef9b668217d54e80fbc [2024-09-11 20:04:20,351 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-09-11 20:04:20,353 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-09-11 20:04:20,355 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-09-11 20:04:20,355 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-09-11 20:04:20,359 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-09-11 20:04:20,359 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 11.09 08:04:20" (1/1) ... [2024-09-11 20:04:20,361 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@1ae5f7 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.09 08:04:20, skipping insertion in model container [2024-09-11 20:04:20,361 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 11.09 08:04:20" (1/1) ... [2024-09-11 20:04:20,376 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-09-11 20:04:20,477 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/geo3-ll_unwindbound10.c[525,538] [2024-09-11 20:04:20,495 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-09-11 20:04:20,501 INFO L200 MainTranslator]: Completed pre-run [2024-09-11 20:04:20,523 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/geo3-ll_unwindbound10.c[525,538] [2024-09-11 20:04:20,530 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-09-11 20:04:20,559 INFO L204 MainTranslator]: Completed translation [2024-09-11 20:04:20,559 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.09 08:04:20 WrapperNode [2024-09-11 20:04:20,564 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-09-11 20:04:20,564 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-09-11 20:04:20,565 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-09-11 20:04:20,565 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-09-11 20:04:20,570 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.09 08:04:20" (1/1) ... [2024-09-11 20:04:20,574 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.09 08:04:20" (1/1) ... [2024-09-11 20:04:20,588 INFO L138 Inliner]: procedures = 14, calls = 9, calls flagged for inlining = 2, calls inlined = 2, statements flattened = 50 [2024-09-11 20:04:20,589 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-09-11 20:04:20,589 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-09-11 20:04:20,590 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-09-11 20:04:20,590 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-09-11 20:04:20,597 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.09 08:04:20" (1/1) ... [2024-09-11 20:04:20,597 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.09 08:04:20" (1/1) ... [2024-09-11 20:04:20,598 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.09 08:04:20" (1/1) ... [2024-09-11 20:04:20,611 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-11 20:04:20,612 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.09 08:04:20" (1/1) ... [2024-09-11 20:04:20,612 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.09 08:04:20" (1/1) ... [2024-09-11 20:04:20,614 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.09 08:04:20" (1/1) ... [2024-09-11 20:04:20,616 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.09 08:04:20" (1/1) ... [2024-09-11 20:04:20,616 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.09 08:04:20" (1/1) ... [2024-09-11 20:04:20,617 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.09 08:04:20" (1/1) ... [2024-09-11 20:04:20,618 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-09-11 20:04:20,619 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-09-11 20:04:20,619 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-09-11 20:04:20,619 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-09-11 20:04:20,620 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.09 08:04:20" (1/1) ... [2024-09-11 20:04:20,624 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-09-11 20:04:20,633 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/certificate-witnesses-artifact/automizer/z3 [2024-09-11 20:04:20,645 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-11 20:04:20,646 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-11 20:04:20,677 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-09-11 20:04:20,677 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-09-11 20:04:20,677 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-09-11 20:04:20,677 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-09-11 20:04:20,677 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2024-09-11 20:04:20,677 INFO L138 BoogieDeclarations]: Found implementation of procedure __VERIFIER_assert [2024-09-11 20:04:20,722 INFO L242 CfgBuilder]: Building ICFG [2024-09-11 20:04:20,724 INFO L268 CfgBuilder]: Building CFG for each procedure with an implementation [2024-09-11 20:04:20,840 INFO L? ?]: Removed 7 outVars from TransFormulas that were not future-live. [2024-09-11 20:04:20,840 INFO L291 CfgBuilder]: Performing block encoding [2024-09-11 20:04:20,868 INFO L313 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-09-11 20:04:20,869 INFO L318 CfgBuilder]: Removed 1 assume(true) statements. [2024-09-11 20:04:20,869 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 11.09 08:04:20 BoogieIcfgContainer [2024-09-11 20:04:20,869 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-09-11 20:04:20,871 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-09-11 20:04:20,872 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-09-11 20:04:20,875 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-09-11 20:04:20,875 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 11.09 08:04:20" (1/3) ... [2024-09-11 20:04:20,877 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6578515b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 11.09 08:04:20, skipping insertion in model container [2024-09-11 20:04:20,877 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.09 08:04:20" (2/3) ... [2024-09-11 20:04:20,878 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6578515b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 11.09 08:04:20, skipping insertion in model container [2024-09-11 20:04:20,878 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 11.09 08:04:20" (3/3) ... [2024-09-11 20:04:20,879 INFO L112 eAbstractionObserver]: Analyzing ICFG geo3-ll_unwindbound10.c [2024-09-11 20:04:20,891 INFO L209 ceAbstractionStarter]: Automizer settings: Hoare:All NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-09-11 20:04:20,891 INFO L149 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-09-11 20:04:20,939 INFO L335 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-09-11 20:04:20,944 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;@2619e65c, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-09-11 20:04:20,945 INFO L337 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-09-11 20:04:20,948 INFO L276 IsEmpty]: Start isEmpty. Operand has 14 states, 9 states have (on average 1.5555555555555556) internal successors, (14), 10 states have internal predecessors, (14), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2024-09-11 20:04:20,954 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2024-09-11 20:04:20,955 INFO L208 NwaCegarLoop]: Found error trace [2024-09-11 20:04:20,955 INFO L216 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1] [2024-09-11 20:04:20,957 INFO L399 AbstractCegarLoop]: === Iteration 1 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-09-11 20:04:20,960 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-11 20:04:20,961 INFO L85 PathProgramCache]: Analyzing trace with hash 2138246143, now seen corresponding path program 1 times [2024-09-11 20:04:20,967 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-09-11 20:04:20,968 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1554314307] [2024-09-11 20:04:20,968 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-09-11 20:04:20,968 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-09-11 20:04:21,044 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-11 20:04:21,083 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-09-11 20:04:21,083 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-09-11 20:04:21,083 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1554314307] [2024-09-11 20:04:21,084 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1554314307] provided 1 perfect and 0 imperfect interpolant sequences [2024-09-11 20:04:21,084 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-09-11 20:04:21,084 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-09-11 20:04:21,086 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1100923089] [2024-09-11 20:04:21,086 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-09-11 20:04:21,089 INFO L551 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-09-11 20:04:21,090 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-09-11 20:04:21,107 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-09-11 20:04:21,108 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-09-11 20:04:21,109 INFO L87 Difference]: Start difference. First operand has 14 states, 9 states have (on average 1.5555555555555556) internal successors, (14), 10 states have internal predecessors, (14), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Second operand has 2 states, 2 states have (on average 2.5) internal successors, (5), 2 states have internal predecessors, (5), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-09-11 20:04:21,129 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-09-11 20:04:21,130 INFO L93 Difference]: Finished difference Result 27 states and 37 transitions. [2024-09-11 20:04:21,131 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-09-11 20:04:21,132 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 2.5) internal successors, (5), 2 states have internal predecessors, (5), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 6 [2024-09-11 20:04:21,132 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-09-11 20:04:21,137 INFO L225 Difference]: With dead ends: 27 [2024-09-11 20:04:21,137 INFO L226 Difference]: Without dead ends: 12 [2024-09-11 20:04:21,139 INFO L433 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 2 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-11 20:04:21,141 INFO L434 NwaCegarLoop]: 14 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, 14 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-11 20:04:21,145 INFO L435 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 14 Invalid, 2 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 2 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-09-11 20:04:21,158 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 12 states. [2024-09-11 20:04:21,168 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 12 to 12. [2024-09-11 20:04:21,169 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 12 states, 8 states have (on average 1.375) internal successors, (11), 9 states have internal predecessors, (11), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-09-11 20:04:21,170 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 14 transitions. [2024-09-11 20:04:21,172 INFO L78 Accepts]: Start accepts. Automaton has 12 states and 14 transitions. Word has length 6 [2024-09-11 20:04:21,172 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-09-11 20:04:21,172 INFO L474 AbstractCegarLoop]: Abstraction has 12 states and 14 transitions. [2024-09-11 20:04:21,172 INFO L475 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 2.5) internal successors, (5), 2 states have internal predecessors, (5), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-09-11 20:04:21,173 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-11 20:04:21,173 INFO L276 IsEmpty]: Start isEmpty. Operand 12 states and 14 transitions. [2024-09-11 20:04:21,173 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2024-09-11 20:04:21,173 INFO L208 NwaCegarLoop]: Found error trace [2024-09-11 20:04:21,173 INFO L216 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2024-09-11 20:04:21,173 WARN L456 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-09-11 20:04:21,174 INFO L399 AbstractCegarLoop]: === Iteration 2 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-09-11 20:04:21,174 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-11 20:04:21,174 INFO L85 PathProgramCache]: Analyzing trace with hash 1461620770, now seen corresponding path program 1 times [2024-09-11 20:04:21,174 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-09-11 20:04:21,174 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [563999267] [2024-09-11 20:04:21,174 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-09-11 20:04:21,175 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-09-11 20:04:21,190 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-11 20:04:21,296 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-09-11 20:04:21,297 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-09-11 20:04:21,297 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [563999267] [2024-09-11 20:04:21,297 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [563999267] provided 1 perfect and 0 imperfect interpolant sequences [2024-09-11 20:04:21,297 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-09-11 20:04:21,297 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-09-11 20:04:21,297 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2095845959] [2024-09-11 20:04:21,298 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-09-11 20:04:21,298 INFO L551 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-09-11 20:04:21,299 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-09-11 20:04:21,299 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-09-11 20:04:21,299 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-09-11 20:04:21,300 INFO L87 Difference]: Start difference. First operand 12 states and 14 transitions. Second operand has 4 states, 4 states have (on average 1.5) internal successors, (6), 3 states have internal predecessors, (6), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-09-11 20:04:21,320 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-09-11 20:04:21,321 INFO L93 Difference]: Finished difference Result 21 states and 23 transitions. [2024-09-11 20:04:21,322 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-09-11 20:04:21,323 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 1.5) internal successors, (6), 3 states have internal predecessors, (6), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 7 [2024-09-11 20:04:21,323 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-09-11 20:04:21,323 INFO L225 Difference]: With dead ends: 21 [2024-09-11 20:04:21,324 INFO L226 Difference]: Without dead ends: 14 [2024-09-11 20:04:21,324 INFO L433 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-09-11 20:04:21,325 INFO L434 NwaCegarLoop]: 11 mSDtfsCounter, 0 mSDsluCounter, 21 mSDsCounter, 0 mSdLazyCounter, 9 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 32 SdHoareTripleChecker+Invalid, 9 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 9 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-09-11 20:04:21,327 INFO L435 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 32 Invalid, 9 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 9 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-09-11 20:04:21,327 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 14 states. [2024-09-11 20:04:21,331 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 14 to 14. [2024-09-11 20:04:21,332 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 14 states, 10 states have (on average 1.3) internal successors, (13), 11 states have internal predecessors, (13), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-09-11 20:04:21,333 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14 states to 14 states and 16 transitions. [2024-09-11 20:04:21,333 INFO L78 Accepts]: Start accepts. Automaton has 14 states and 16 transitions. Word has length 7 [2024-09-11 20:04:21,333 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-09-11 20:04:21,334 INFO L474 AbstractCegarLoop]: Abstraction has 14 states and 16 transitions. [2024-09-11 20:04:21,334 INFO L475 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 1.5) internal successors, (6), 3 states have internal predecessors, (6), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-09-11 20:04:21,334 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-11 20:04:21,334 INFO L276 IsEmpty]: Start isEmpty. Operand 14 states and 16 transitions. [2024-09-11 20:04:21,335 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2024-09-11 20:04:21,335 INFO L208 NwaCegarLoop]: Found error trace [2024-09-11 20:04:21,335 INFO L216 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2024-09-11 20:04:21,335 WARN L456 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-09-11 20:04:21,335 INFO L399 AbstractCegarLoop]: === Iteration 3 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-09-11 20:04:21,335 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-11 20:04:21,335 INFO L85 PathProgramCache]: Analyzing trace with hash 1463408230, now seen corresponding path program 1 times [2024-09-11 20:04:21,336 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-09-11 20:04:21,336 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1754490639] [2024-09-11 20:04:21,336 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-09-11 20:04:21,336 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-09-11 20:04:21,348 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unknown [2024-09-11 20:04:21,354 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [2057233180] [2024-09-11 20:04:21,354 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-09-11 20:04:21,354 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-09-11 20:04:21,354 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/certificate-witnesses-artifact/automizer/z3 [2024-09-11 20:04:21,355 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-11 20:04:21,356 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-11 20:04:21,398 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-11 20:04:21,400 INFO L262 TraceCheckSpWp]: Trace formula consists of 51 conjuncts, 9 conjuncts are in the unsatisfiable core [2024-09-11 20:04:21,403 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2024-09-11 20:04:21,524 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-09-11 20:04:21,524 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-09-11 20:04:21,524 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-09-11 20:04:21,524 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1754490639] [2024-09-11 20:04:21,525 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2024-09-11 20:04:21,525 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2057233180] [2024-09-11 20:04:21,525 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2057233180] provided 1 perfect and 0 imperfect interpolant sequences [2024-09-11 20:04:21,525 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-09-11 20:04:21,525 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-09-11 20:04:21,525 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [68647443] [2024-09-11 20:04:21,525 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-09-11 20:04:21,526 INFO L551 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-09-11 20:04:21,526 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-09-11 20:04:21,526 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-09-11 20:04:21,526 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-09-11 20:04:21,526 INFO L87 Difference]: Start difference. First operand 14 states and 16 transitions. Second operand has 5 states, 5 states have (on average 1.2) internal successors, (6), 3 states have internal predecessors, (6), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-09-11 20:04:21,599 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-09-11 20:04:21,599 INFO L93 Difference]: Finished difference Result 23 states and 26 transitions. [2024-09-11 20:04:21,600 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-09-11 20:04:21,600 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 1.2) internal successors, (6), 3 states have internal predecessors, (6), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 7 [2024-09-11 20:04:21,600 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-09-11 20:04:21,601 INFO L225 Difference]: With dead ends: 23 [2024-09-11 20:04:21,601 INFO L226 Difference]: Without dead ends: 20 [2024-09-11 20:04:21,601 INFO L433 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 3 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-11 20:04:21,602 INFO L434 NwaCegarLoop]: 9 mSDtfsCounter, 4 mSDsluCounter, 26 mSDsCounter, 0 mSdLazyCounter, 20 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 5 SdHoareTripleChecker+Valid, 35 SdHoareTripleChecker+Invalid, 21 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 20 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-09-11 20:04:21,602 INFO L435 NwaCegarLoop]: SdHoareTripleChecker [5 Valid, 35 Invalid, 21 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 20 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-09-11 20:04:21,603 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 20 states. [2024-09-11 20:04:21,606 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 20 to 20. [2024-09-11 20:04:21,607 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 20 states, 14 states have (on average 1.2142857142857142) internal successors, (17), 15 states have internal predecessors, (17), 3 states have call successors, (3), 2 states have call predecessors, (3), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2024-09-11 20:04:21,607 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20 states to 20 states and 22 transitions. [2024-09-11 20:04:21,607 INFO L78 Accepts]: Start accepts. Automaton has 20 states and 22 transitions. Word has length 7 [2024-09-11 20:04:21,608 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-09-11 20:04:21,608 INFO L474 AbstractCegarLoop]: Abstraction has 20 states and 22 transitions. [2024-09-11 20:04:21,608 INFO L475 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 1.2) internal successors, (6), 3 states have internal predecessors, (6), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-09-11 20:04:21,608 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-11 20:04:21,608 INFO L276 IsEmpty]: Start isEmpty. Operand 20 states and 22 transitions. [2024-09-11 20:04:21,609 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2024-09-11 20:04:21,609 INFO L208 NwaCegarLoop]: Found error trace [2024-09-11 20:04:21,609 INFO L216 NwaCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-09-11 20:04:21,625 INFO L540 MonitoredProcess]: [MP /storage/repos/certificate-witnesses-artifact/automizer/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2024-09-11 20:04:21,811 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-11 20:04:21,812 INFO L399 AbstractCegarLoop]: === Iteration 4 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-09-11 20:04:21,812 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-11 20:04:21,812 INFO L85 PathProgramCache]: Analyzing trace with hash -1726160663, now seen corresponding path program 1 times [2024-09-11 20:04:21,813 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-09-11 20:04:21,813 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1207537646] [2024-09-11 20:04:21,813 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-09-11 20:04:21,813 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-09-11 20:04:21,826 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-11 20:04:21,946 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2024-09-11 20:04:21,956 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-11 20:04:21,969 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 2 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-09-11 20:04:21,969 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-09-11 20:04:21,970 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1207537646] [2024-09-11 20:04:21,970 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1207537646] provided 0 perfect and 1 imperfect interpolant sequences [2024-09-11 20:04:21,972 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [485137064] [2024-09-11 20:04:21,972 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-09-11 20:04:21,972 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-09-11 20:04:21,972 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/certificate-witnesses-artifact/automizer/z3 [2024-09-11 20:04:21,973 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-11 20:04:21,976 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-11 20:04:22,018 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-11 20:04:22,020 INFO L262 TraceCheckSpWp]: Trace formula consists of 72 conjuncts, 5 conjuncts are in the unsatisfiable core [2024-09-11 20:04:22,021 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2024-09-11 20:04:22,051 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 2 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-09-11 20:04:22,051 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2024-09-11 20:04:22,088 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 2 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-09-11 20:04:22,089 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [485137064] provided 0 perfect and 2 imperfect interpolant sequences [2024-09-11 20:04:22,089 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-09-11 20:04:22,089 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 4, 5] total 10 [2024-09-11 20:04:22,089 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [361104021] [2024-09-11 20:04:22,089 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-09-11 20:04:22,090 INFO L551 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-09-11 20:04:22,090 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-09-11 20:04:22,091 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-09-11 20:04:22,091 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=33, Invalid=57, Unknown=0, NotChecked=0, Total=90 [2024-09-11 20:04:22,091 INFO L87 Difference]: Start difference. First operand 20 states and 22 transitions. Second operand has 10 states, 10 states have (on average 2.4) internal successors, (24), 10 states have internal predecessors, (24), 3 states have call successors, (4), 3 states have call predecessors, (4), 2 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2024-09-11 20:04:22,160 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-09-11 20:04:22,160 INFO L93 Difference]: Finished difference Result 51 states and 57 transitions. [2024-09-11 20:04:22,160 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-09-11 20:04:22,161 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 2.4) internal successors, (24), 10 states have internal predecessors, (24), 3 states have call successors, (4), 3 states have call predecessors, (4), 2 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) Word has length 15 [2024-09-11 20:04:22,161 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-09-11 20:04:22,162 INFO L225 Difference]: With dead ends: 51 [2024-09-11 20:04:22,162 INFO L226 Difference]: Without dead ends: 44 [2024-09-11 20:04:22,163 INFO L433 NwaCegarLoop]: 0 DeclaredPredicates, 37 GetRequests, 27 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 15 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=46, Invalid=86, Unknown=0, NotChecked=0, Total=132 [2024-09-11 20:04:22,164 INFO L434 NwaCegarLoop]: 11 mSDtfsCounter, 25 mSDsluCounter, 61 mSDsCounter, 0 mSdLazyCounter, 33 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 25 SdHoareTripleChecker+Valid, 72 SdHoareTripleChecker+Invalid, 36 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 33 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-09-11 20:04:22,165 INFO L435 NwaCegarLoop]: SdHoareTripleChecker [25 Valid, 72 Invalid, 36 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 33 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-09-11 20:04:22,166 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 44 states. [2024-09-11 20:04:22,174 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 44 to 40. [2024-09-11 20:04:22,174 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 40 states, 28 states have (on average 1.25) internal successors, (35), 31 states have internal predecessors, (35), 7 states have call successors, (7), 4 states have call predecessors, (7), 4 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2024-09-11 20:04:22,175 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 40 states to 40 states and 46 transitions. [2024-09-11 20:04:22,175 INFO L78 Accepts]: Start accepts. Automaton has 40 states and 46 transitions. Word has length 15 [2024-09-11 20:04:22,176 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-09-11 20:04:22,176 INFO L474 AbstractCegarLoop]: Abstraction has 40 states and 46 transitions. [2024-09-11 20:04:22,176 INFO L475 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 2.4) internal successors, (24), 10 states have internal predecessors, (24), 3 states have call successors, (4), 3 states have call predecessors, (4), 2 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2024-09-11 20:04:22,176 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-11 20:04:22,176 INFO L276 IsEmpty]: Start isEmpty. Operand 40 states and 46 transitions. [2024-09-11 20:04:22,177 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2024-09-11 20:04:22,177 INFO L208 NwaCegarLoop]: Found error trace [2024-09-11 20:04:22,177 INFO L216 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1] [2024-09-11 20:04:22,188 INFO L540 MonitoredProcess]: [MP /storage/repos/certificate-witnesses-artifact/automizer/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2024-09-11 20:04:22,377 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-11 20:04:22,378 INFO L399 AbstractCegarLoop]: === Iteration 5 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-09-11 20:04:22,378 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-11 20:04:22,378 INFO L85 PathProgramCache]: Analyzing trace with hash -1724373203, now seen corresponding path program 1 times [2024-09-11 20:04:22,378 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-09-11 20:04:22,378 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1282029386] [2024-09-11 20:04:22,379 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-09-11 20:04:22,379 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-09-11 20:04:22,409 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unknown [2024-09-11 20:04:22,410 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [223705053] [2024-09-11 20:04:22,412 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-09-11 20:04:22,413 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-09-11 20:04:22,413 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/certificate-witnesses-artifact/automizer/z3 [2024-09-11 20:04:22,415 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-11 20:04:22,416 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-11 20:04:22,565 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-11 20:04:22,566 INFO L262 TraceCheckSpWp]: Trace formula consists of 72 conjuncts, 18 conjuncts are in the unsatisfiable core [2024-09-11 20:04:22,568 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2024-09-11 20:04:22,713 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 1 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-09-11 20:04:22,714 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2024-09-11 20:04:39,418 WARN L876 $PredicateComparison]: unable to prove that (or (= (mod (+ (* 18446744073709551615 |c_ULTIMATE.start_main_~x~0#1| |c_ULTIMATE.start_main_~z~0#1|) (* |c_ULTIMATE.start_main_~x~0#1| |c_ULTIMATE.start_main_~z~0#1| |c_ULTIMATE.start_main_~z~0#1|) (* |c_ULTIMATE.start_main_~a~0#1| |c_ULTIMATE.start_main_~z~0#1|) (* |c_ULTIMATE.start_main_~y~0#1| 18446744073709551615 |c_ULTIMATE.start_main_~z~0#1| |c_ULTIMATE.start_main_~az~0#1|)) 18446744073709551616) 0) (not (= (mod (+ (* 18446744073709551615 |c_ULTIMATE.start_main_~x~0#1|) |c_ULTIMATE.start_main_~a~0#1| (* |c_ULTIMATE.start_main_~x~0#1| |c_ULTIMATE.start_main_~z~0#1|) (* |c_ULTIMATE.start_main_~y~0#1| 18446744073709551615 |c_ULTIMATE.start_main_~az~0#1|)) 18446744073709551616) 0))) is different from true [2024-09-11 20:04:55,625 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 3 not checked. [2024-09-11 20:04:55,625 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-09-11 20:04:55,625 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1282029386] [2024-09-11 20:04:55,625 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2024-09-11 20:04:55,625 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [223705053] [2024-09-11 20:04:55,625 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [223705053] provided 0 perfect and 2 imperfect interpolant sequences [2024-09-11 20:04:55,625 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-09-11 20:04:55,625 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 9] total 12 [2024-09-11 20:04:55,625 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1079815751] [2024-09-11 20:04:55,625 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-09-11 20:04:55,626 INFO L551 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2024-09-11 20:04:55,626 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-09-11 20:04:55,626 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2024-09-11 20:04:55,626 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=29, Invalid=83, Unknown=2, NotChecked=18, Total=132 [2024-09-11 20:04:55,627 INFO L87 Difference]: Start difference. First operand 40 states and 46 transitions. Second operand has 12 states, 12 states have (on average 1.6666666666666667) internal successors, (20), 9 states have internal predecessors, (20), 4 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2024-09-11 20:05:03,906 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-11 20:05:07,917 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-11 20:05:11,923 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-11 20:05:15,937 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-11 20:05:19,942 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-11 20:05:23,946 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-11 20:05:27,949 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-11 20:05:31,971 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-11 20:05:31,995 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-09-11 20:05:31,996 INFO L93 Difference]: Finished difference Result 48 states and 54 transitions. [2024-09-11 20:05:31,996 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-09-11 20:05:31,996 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 12 states have (on average 1.6666666666666667) internal successors, (20), 9 states have internal predecessors, (20), 4 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Word has length 15 [2024-09-11 20:05:31,996 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-09-11 20:05:31,998 INFO L225 Difference]: With dead ends: 48 [2024-09-11 20:05:31,998 INFO L226 Difference]: Without dead ends: 43 [2024-09-11 20:05:31,999 INFO L433 NwaCegarLoop]: 0 DeclaredPredicates, 31 GetRequests, 16 SyntacticMatches, 3 SemanticMatches, 12 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 10 ImplicationChecksByTransitivity, 12.3s TimeCoverageRelationStatistics Valid=42, Invalid=116, Unknown=2, NotChecked=22, Total=182 [2024-09-11 20:05:31,999 INFO L434 NwaCegarLoop]: 11 mSDtfsCounter, 10 mSDsluCounter, 48 mSDsCounter, 0 mSdLazyCounter, 45 mSolverCounterSat, 13 mSolverCounterUnsat, 8 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 32.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 12 SdHoareTripleChecker+Valid, 59 SdHoareTripleChecker+Invalid, 104 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 13 IncrementalHoareTripleChecker+Valid, 45 IncrementalHoareTripleChecker+Invalid, 8 IncrementalHoareTripleChecker+Unknown, 38 IncrementalHoareTripleChecker+Unchecked, 32.3s IncrementalHoareTripleChecker+Time [2024-09-11 20:05:31,999 INFO L435 NwaCegarLoop]: SdHoareTripleChecker [12 Valid, 59 Invalid, 104 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [13 Valid, 45 Invalid, 8 Unknown, 38 Unchecked, 32.3s Time] [2024-09-11 20:05:32,000 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 43 states. [2024-09-11 20:05:32,016 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 43 to 43. [2024-09-11 20:05:32,016 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 43 states, 31 states have (on average 1.064516129032258) internal successors, (33), 33 states have internal predecessors, (33), 6 states have call successors, (6), 5 states have call predecessors, (6), 5 states have return successors, (5), 4 states have call predecessors, (5), 5 states have call successors, (5) [2024-09-11 20:05:32,017 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 43 states to 43 states and 44 transitions. [2024-09-11 20:05:32,017 INFO L78 Accepts]: Start accepts. Automaton has 43 states and 44 transitions. Word has length 15 [2024-09-11 20:05:32,017 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-09-11 20:05:32,018 INFO L474 AbstractCegarLoop]: Abstraction has 43 states and 44 transitions. [2024-09-11 20:05:32,018 INFO L475 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 1.6666666666666667) internal successors, (20), 9 states have internal predecessors, (20), 4 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2024-09-11 20:05:32,018 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-11 20:05:32,018 INFO L276 IsEmpty]: Start isEmpty. Operand 43 states and 44 transitions. [2024-09-11 20:05:32,019 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 40 [2024-09-11 20:05:32,019 INFO L208 NwaCegarLoop]: Found error trace [2024-09-11 20:05:32,019 INFO L216 NwaCegarLoop]: trace histogram [5, 5, 4, 4, 4, 4, 4, 4, 1, 1, 1, 1, 1] [2024-09-11 20:05:32,027 INFO L552 MonitoredProcess]: [MP /storage/repos/certificate-witnesses-artifact/automizer/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Ended with exit code 0 [2024-09-11 20:05:32,219 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-11 20:05:32,220 INFO L399 AbstractCegarLoop]: === Iteration 6 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-09-11 20:05:32,220 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-11 20:05:32,220 INFO L85 PathProgramCache]: Analyzing trace with hash 1912703294, now seen corresponding path program 2 times [2024-09-11 20:05:32,220 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-09-11 20:05:32,220 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1415711620] [2024-09-11 20:05:32,221 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-09-11 20:05:32,221 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-09-11 20:05:32,245 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-11 20:05:32,427 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2024-09-11 20:05:32,429 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-11 20:05:32,432 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-09-11 20:05:32,435 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-11 20:05:32,437 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 19 [2024-09-11 20:05:32,440 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-11 20:05:32,446 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2024-09-11 20:05:32,447 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-11 20:05:32,450 INFO L134 CoverageAnalysis]: Checked inductivity of 64 backedges. 8 proven. 32 refuted. 0 times theorem prover too weak. 24 trivial. 0 not checked. [2024-09-11 20:05:32,451 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-09-11 20:05:32,451 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1415711620] [2024-09-11 20:05:32,451 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1415711620] provided 0 perfect and 1 imperfect interpolant sequences [2024-09-11 20:05:32,451 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [918566374] [2024-09-11 20:05:32,451 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2024-09-11 20:05:32,452 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-09-11 20:05:32,452 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/certificate-witnesses-artifact/automizer/z3 [2024-09-11 20:05:32,453 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-11 20:05:32,454 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-11 20:05:32,499 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2024-09-11 20:05:32,499 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2024-09-11 20:05:32,500 INFO L262 TraceCheckSpWp]: Trace formula consists of 135 conjuncts, 11 conjuncts are in the unsatisfiable core [2024-09-11 20:05:32,501 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2024-09-11 20:05:32,567 INFO L134 CoverageAnalysis]: Checked inductivity of 64 backedges. 8 proven. 56 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-09-11 20:05:32,568 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2024-09-11 20:05:32,682 INFO L134 CoverageAnalysis]: Checked inductivity of 64 backedges. 8 proven. 32 refuted. 0 times theorem prover too weak. 24 trivial. 0 not checked. [2024-09-11 20:05:32,683 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [918566374] provided 0 perfect and 2 imperfect interpolant sequences [2024-09-11 20:05:32,683 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-09-11 20:05:32,683 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 7, 8] total 16 [2024-09-11 20:05:32,683 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1448777383] [2024-09-11 20:05:32,683 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-09-11 20:05:32,684 INFO L551 AbstractCegarLoop]: INTERPOLANT automaton has 16 states [2024-09-11 20:05:32,684 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-09-11 20:05:32,684 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2024-09-11 20:05:32,685 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=96, Invalid=144, Unknown=0, NotChecked=0, Total=240 [2024-09-11 20:05:32,685 INFO L87 Difference]: Start difference. First operand 43 states and 44 transitions. Second operand has 16 states, 16 states have (on average 3.1875) internal successors, (51), 16 states have internal predecessors, (51), 9 states have call successors, (13), 6 states have call predecessors, (13), 5 states have return successors, (12), 8 states have call predecessors, (12), 8 states have call successors, (12) [2024-09-11 20:05:32,899 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-09-11 20:05:32,899 INFO L93 Difference]: Finished difference Result 103 states and 109 transitions. [2024-09-11 20:05:32,900 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2024-09-11 20:05:32,901 INFO L78 Accepts]: Start accepts. Automaton has has 16 states, 16 states have (on average 3.1875) internal successors, (51), 16 states have internal predecessors, (51), 9 states have call successors, (13), 6 states have call predecessors, (13), 5 states have return successors, (12), 8 states have call predecessors, (12), 8 states have call successors, (12) Word has length 39 [2024-09-11 20:05:32,901 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-09-11 20:05:32,902 INFO L225 Difference]: With dead ends: 103 [2024-09-11 20:05:32,902 INFO L226 Difference]: Without dead ends: 96 [2024-09-11 20:05:32,902 INFO L433 NwaCegarLoop]: 0 DeclaredPredicates, 100 GetRequests, 78 SyntacticMatches, 0 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 75 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=196, Invalid=356, Unknown=0, NotChecked=0, Total=552 [2024-09-11 20:05:32,902 INFO L434 NwaCegarLoop]: 10 mSDtfsCounter, 68 mSDsluCounter, 73 mSDsCounter, 0 mSdLazyCounter, 50 mSolverCounterSat, 8 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 68 SdHoareTripleChecker+Valid, 83 SdHoareTripleChecker+Invalid, 58 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 8 IncrementalHoareTripleChecker+Valid, 50 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-09-11 20:05:32,903 INFO L435 NwaCegarLoop]: SdHoareTripleChecker [68 Valid, 83 Invalid, 58 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [8 Valid, 50 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-09-11 20:05:32,903 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 96 states. [2024-09-11 20:05:32,919 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 96 to 86. [2024-09-11 20:05:32,921 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 86 states, 64 states have (on average 1.109375) internal successors, (71), 65 states have internal predecessors, (71), 11 states have call successors, (11), 10 states have call predecessors, (11), 10 states have return successors, (10), 10 states have call predecessors, (10), 10 states have call successors, (10) [2024-09-11 20:05:32,922 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 86 states to 86 states and 92 transitions. [2024-09-11 20:05:32,923 INFO L78 Accepts]: Start accepts. Automaton has 86 states and 92 transitions. Word has length 39 [2024-09-11 20:05:32,923 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-09-11 20:05:32,923 INFO L474 AbstractCegarLoop]: Abstraction has 86 states and 92 transitions. [2024-09-11 20:05:32,924 INFO L475 AbstractCegarLoop]: INTERPOLANT automaton has has 16 states, 16 states have (on average 3.1875) internal successors, (51), 16 states have internal predecessors, (51), 9 states have call successors, (13), 6 states have call predecessors, (13), 5 states have return successors, (12), 8 states have call predecessors, (12), 8 states have call successors, (12) [2024-09-11 20:05:32,924 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-11 20:05:32,924 INFO L276 IsEmpty]: Start isEmpty. Operand 86 states and 92 transitions. [2024-09-11 20:05:32,925 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 40 [2024-09-11 20:05:32,925 INFO L208 NwaCegarLoop]: Found error trace [2024-09-11 20:05:32,925 INFO L216 NwaCegarLoop]: trace histogram [5, 5, 5, 5, 4, 4, 4, 4, 1, 1, 1] [2024-09-11 20:05:32,940 INFO L540 MonitoredProcess]: [MP /storage/repos/certificate-witnesses-artifact/automizer/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Forceful destruction successful, exit code 0 [2024-09-11 20:05:33,126 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-11 20:05:33,126 INFO L399 AbstractCegarLoop]: === Iteration 7 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-09-11 20:05:33,126 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-11 20:05:33,126 INFO L85 PathProgramCache]: Analyzing trace with hash 1914490754, now seen corresponding path program 2 times [2024-09-11 20:05:33,127 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-09-11 20:05:33,127 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [812488167] [2024-09-11 20:05:33,127 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-09-11 20:05:33,127 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-09-11 20:05:33,164 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unknown [2024-09-11 20:05:33,165 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1095023186] [2024-09-11 20:05:33,165 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2024-09-11 20:05:33,165 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-09-11 20:05:33,165 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/certificate-witnesses-artifact/automizer/z3 [2024-09-11 20:05:33,167 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-11 20:05:33,168 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-11 20:05:33,354 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2024-09-11 20:05:33,355 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2024-09-11 20:05:33,360 INFO L262 TraceCheckSpWp]: Trace formula consists of 135 conjuncts, 49 conjuncts are in the unsatisfiable core [2024-09-11 20:05:33,363 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2024-09-11 20:05:33,846 INFO L134 CoverageAnalysis]: Checked inductivity of 68 backedges. 4 proven. 40 refuted. 0 times theorem prover too weak. 24 trivial. 0 not checked. [2024-09-11 20:05:33,846 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2024-09-11 20:05:50,442 WARN L876 $PredicateComparison]: unable to prove that (or (= (mod (+ (* 18446744073709551615 |c_ULTIMATE.start_main_~x~0#1| |c_ULTIMATE.start_main_~z~0#1|) (* |c_ULTIMATE.start_main_~x~0#1| |c_ULTIMATE.start_main_~z~0#1| |c_ULTIMATE.start_main_~z~0#1|) (* |c_ULTIMATE.start_main_~a~0#1| |c_ULTIMATE.start_main_~z~0#1|) (* |c_ULTIMATE.start_main_~y~0#1| 18446744073709551615 |c_ULTIMATE.start_main_~z~0#1| |c_ULTIMATE.start_main_~az~0#1|)) 18446744073709551616) 0) (not (= (mod (+ (* 18446744073709551615 |c_ULTIMATE.start_main_~x~0#1|) |c_ULTIMATE.start_main_~a~0#1| (* |c_ULTIMATE.start_main_~x~0#1| |c_ULTIMATE.start_main_~z~0#1|) (* |c_ULTIMATE.start_main_~y~0#1| 18446744073709551615 |c_ULTIMATE.start_main_~az~0#1|)) 18446744073709551616) 0))) is different from true [2024-09-11 20:06:19,266 WARN L293 SmtUtils]: Spent 8.03s on a formula simplification that was a NOOP. DAG size: 15 (called from [L 731] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2024-09-11 20:06:23,276 WARN L876 $PredicateComparison]: unable to prove that (or (= (mod (+ (* 18446744073709551615 |c_ULTIMATE.start_main_~x~0#1| |c_ULTIMATE.start_main_~z~0#1| |c_ULTIMATE.start_main_~z~0#1|) (* |c_ULTIMATE.start_main_~a~0#1| |c_ULTIMATE.start_main_~z~0#1| |c_ULTIMATE.start_main_~z~0#1|) (* |c_ULTIMATE.start_main_~y~0#1| 18446744073709551615 |c_ULTIMATE.start_main_~z~0#1| |c_ULTIMATE.start_main_~z~0#1| |c_ULTIMATE.start_main_~az~0#1|) (* |c_ULTIMATE.start_main_~x~0#1| |c_ULTIMATE.start_main_~z~0#1| |c_ULTIMATE.start_main_~z~0#1| |c_ULTIMATE.start_main_~z~0#1|)) 18446744073709551616) 0) (not (= (mod (+ (* 18446744073709551615 |c_ULTIMATE.start_main_~x~0#1| |c_ULTIMATE.start_main_~z~0#1|) (* |c_ULTIMATE.start_main_~x~0#1| |c_ULTIMATE.start_main_~z~0#1| |c_ULTIMATE.start_main_~z~0#1|) (* |c_ULTIMATE.start_main_~a~0#1| |c_ULTIMATE.start_main_~z~0#1|) (* |c_ULTIMATE.start_main_~y~0#1| 18446744073709551615 |c_ULTIMATE.start_main_~z~0#1| |c_ULTIMATE.start_main_~az~0#1|)) 18446744073709551616) 0))) is different from true [2024-09-11 20:06:35,338 WARN L293 SmtUtils]: Spent 12.02s on a formula simplification that was a NOOP. DAG size: 16 (called from [L 731] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2024-09-11 20:06:51,377 WARN L293 SmtUtils]: Spent 12.03s on a formula simplification that was a NOOP. DAG size: 15 (called from [L 731] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2024-09-11 20:06:55,510 WARN L876 $PredicateComparison]: unable to prove that (or (not (= (mod (+ (* 18446744073709551615 |c_ULTIMATE.start_main_~x~0#1|) |c_ULTIMATE.start_main_~a~0#1| (* |c_ULTIMATE.start_main_~x~0#1| |c_ULTIMATE.start_main_~z~0#1|) (* |c_ULTIMATE.start_main_~y~0#1| 18446744073709551615 |c_ULTIMATE.start_main_~az~0#1|)) 18446744073709551616) 0)) (= (mod (+ (* 18446744073709551615 |c_ULTIMATE.start_main_~x~0#1| |c_ULTIMATE.start_main_~z~0#1| |c_ULTIMATE.start_main_~z~0#1|) (* |c_ULTIMATE.start_main_~a~0#1| |c_ULTIMATE.start_main_~z~0#1| |c_ULTIMATE.start_main_~z~0#1|) (* |c_ULTIMATE.start_main_~y~0#1| 18446744073709551615 |c_ULTIMATE.start_main_~z~0#1| |c_ULTIMATE.start_main_~z~0#1| |c_ULTIMATE.start_main_~az~0#1|) (* |c_ULTIMATE.start_main_~x~0#1| |c_ULTIMATE.start_main_~z~0#1| |c_ULTIMATE.start_main_~z~0#1| |c_ULTIMATE.start_main_~z~0#1|)) 18446744073709551616) 0) (not (= (mod (+ (* 18446744073709551615 |c_ULTIMATE.start_main_~x~0#1| |c_ULTIMATE.start_main_~z~0#1|) (* |c_ULTIMATE.start_main_~x~0#1| |c_ULTIMATE.start_main_~z~0#1| |c_ULTIMATE.start_main_~z~0#1|) (* |c_ULTIMATE.start_main_~a~0#1| |c_ULTIMATE.start_main_~z~0#1|) (* |c_ULTIMATE.start_main_~y~0#1| 18446744073709551615 |c_ULTIMATE.start_main_~z~0#1| |c_ULTIMATE.start_main_~az~0#1|)) 18446744073709551616) 0))) is different from true [2024-09-11 20:07:11,604 WARN L293 SmtUtils]: Spent 8.01s on a formula simplification that was a NOOP. DAG size: 3 (called from [L 731] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2024-09-11 20:07:23,625 WARN L293 SmtUtils]: Spent 12.02s on a formula simplification that was a NOOP. DAG size: 14 (called from [L 731] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2024-09-11 20:07:31,632 WARN L293 SmtUtils]: Spent 8.01s on a formula simplification that was a NOOP. DAG size: 3 (called from [L 731] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2024-09-11 20:07:51,945 WARN L293 SmtUtils]: Spent 12.06s on a formula simplification that was a NOOP. DAG size: 15 (called from [L 731] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2024-09-11 20:07:55,958 WARN L876 $PredicateComparison]: unable to prove that (or (not (= |c___VERIFIER_assert_#in~cond| 0)) (forall ((|v_ULTIMATE.start_main_~y~0#1_BEFORE_CALL_11| Int) (|v_ULTIMATE.start_main_~x~0#1_BEFORE_CALL_11| Int) (|v_ULTIMATE.start_main_~az~0#1_BEFORE_CALL_11| Int) (v_z_1 Int) (|v_ULTIMATE.start_main_~z~0#1_BEFORE_CALL_11| Int)) (let ((.cse0 (+ (mod (+ (* |v_ULTIMATE.start_main_~z~0#1_BEFORE_CALL_11| |v_ULTIMATE.start_main_~x~0#1_BEFORE_CALL_11|) (* 18446744073709551615 |v_ULTIMATE.start_main_~x~0#1_BEFORE_CALL_11|) (* |v_ULTIMATE.start_main_~y~0#1_BEFORE_CALL_11| 18446744073709551615 |v_ULTIMATE.start_main_~az~0#1_BEFORE_CALL_11|)) 18446744073709551616) v_z_1))) (or (< v_z_1 0) (= 18446744073709551616 .cse0) (< 18446744073709551615 v_z_1) (not (= (mod (+ (* |v_ULTIMATE.start_main_~z~0#1_BEFORE_CALL_11| |v_ULTIMATE.start_main_~z~0#1_BEFORE_CALL_11| |v_ULTIMATE.start_main_~x~0#1_BEFORE_CALL_11|) (* |v_ULTIMATE.start_main_~z~0#1_BEFORE_CALL_11| v_z_1) (* |v_ULTIMATE.start_main_~z~0#1_BEFORE_CALL_11| |v_ULTIMATE.start_main_~y~0#1_BEFORE_CALL_11| 18446744073709551615 |v_ULTIMATE.start_main_~az~0#1_BEFORE_CALL_11|) (* |v_ULTIMATE.start_main_~z~0#1_BEFORE_CALL_11| 18446744073709551615 |v_ULTIMATE.start_main_~x~0#1_BEFORE_CALL_11|)) 18446744073709551616) 0)) (= (mod (+ (* |v_ULTIMATE.start_main_~z~0#1_BEFORE_CALL_11| |v_ULTIMATE.start_main_~z~0#1_BEFORE_CALL_11| |v_ULTIMATE.start_main_~y~0#1_BEFORE_CALL_11| 18446744073709551615 |v_ULTIMATE.start_main_~az~0#1_BEFORE_CALL_11|) (* |v_ULTIMATE.start_main_~z~0#1_BEFORE_CALL_11| |v_ULTIMATE.start_main_~z~0#1_BEFORE_CALL_11| v_z_1) (* |v_ULTIMATE.start_main_~z~0#1_BEFORE_CALL_11| |v_ULTIMATE.start_main_~z~0#1_BEFORE_CALL_11| 18446744073709551615 |v_ULTIMATE.start_main_~x~0#1_BEFORE_CALL_11|) (* |v_ULTIMATE.start_main_~z~0#1_BEFORE_CALL_11| |v_ULTIMATE.start_main_~z~0#1_BEFORE_CALL_11| |v_ULTIMATE.start_main_~z~0#1_BEFORE_CALL_11| |v_ULTIMATE.start_main_~x~0#1_BEFORE_CALL_11|)) 18446744073709551616) 0) (= .cse0 0))))) is different from true [2024-09-11 20:08:08,007 WARN L293 SmtUtils]: Spent 8.02s on a formula simplification that was a NOOP. DAG size: 3 (called from [L 731] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2024-09-11 20:08:20,043 WARN L293 SmtUtils]: Spent 12.04s on a formula simplification that was a NOOP. DAG size: 14 (called from [L 731] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2024-09-11 20:08:28,074 WARN L293 SmtUtils]: Spent 8.03s on a formula simplification that was a NOOP. DAG size: 3 (called from [L 731] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2024-09-11 20:08:38,679 WARN L293 SmtUtils]: Spent 6.49s on a formula simplification that was a NOOP. DAG size: 15 (called from [L 731] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2024-09-11 20:08:50,708 WARN L293 SmtUtils]: Spent 12.03s on a formula simplification that was a NOOP. DAG size: 15 (called from [L 731] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2024-09-11 20:09:02,767 WARN L293 SmtUtils]: Spent 8.03s on a formula simplification that was a NOOP. DAG size: 3 (called from [L 731] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify)