./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/hardness-nfm22/hardness_loopvsstraightlinecode_100-while_file-87.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 023d838f Calling Ultimate with: /root/.sdkman/candidates/java/11.0.12-open/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/hardness-nfm22/hardness_loopvsstraightlinecode_100-while_file-87.i -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux --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 a3cc8f4dc3627ca478516e9ddf056bcaabf24874a2c66b0dbc53cccb617610ef --- Real Ultimate output --- This is Ultimate 0.2.5-tmp.fs.icfgbuilder-eval-023d838-m [2024-11-10 07:19:42,736 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-10 07:19:42,808 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2024-11-10 07:19:42,814 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-10 07:19:42,815 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-10 07:19:42,850 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-10 07:19:42,851 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-10 07:19:42,852 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-10 07:19:42,853 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-11-10 07:19:42,853 INFO L153 SettingsManager]: * Use memory slicer=true [2024-11-10 07:19:42,854 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-10 07:19:42,854 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-10 07:19:42,855 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-10 07:19:42,856 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-10 07:19:42,858 INFO L153 SettingsManager]: * Use SBE=true [2024-11-10 07:19:42,858 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-10 07:19:42,859 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-11-10 07:19:42,859 INFO L153 SettingsManager]: * sizeof long=4 [2024-11-10 07:19:42,859 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-11-10 07:19:42,859 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-11-10 07:19:42,860 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-10 07:19:42,865 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-11-10 07:19:42,865 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-10 07:19:42,865 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-11-10 07:19:42,865 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-10 07:19:42,866 INFO L153 SettingsManager]: * sizeof long double=12 [2024-11-10 07:19:42,866 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-11-10 07:19:42,866 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-10 07:19:42,866 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2024-11-10 07:19:42,867 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-10 07:19:42,867 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-10 07:19:42,867 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-10 07:19:42,867 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-10 07:19:42,868 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-10 07:19:42,868 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-10 07:19:42,870 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-11-10 07:19:42,871 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-11-10 07:19:42,871 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-11-10 07:19:42,871 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-10 07:19:42,871 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-11-10 07:19:42,872 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-11-10 07:19:42,873 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-11-10 07:19:42,873 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/ultimate/releaseScripts/default/UAutomizer-linux/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/ultimate/releaseScripts/default/UAutomizer-linux 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 -> a3cc8f4dc3627ca478516e9ddf056bcaabf24874a2c66b0dbc53cccb617610ef [2024-11-10 07:19:43,125 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-10 07:19:43,160 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-10 07:19:43,165 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-10 07:19:43,166 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-10 07:19:43,166 INFO L274 PluginConnector]: CDTParser initialized [2024-11-10 07:19:43,168 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/hardness-nfm22/hardness_loopvsstraightlinecode_100-while_file-87.i [2024-11-10 07:19:44,730 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-10 07:19:44,968 INFO L384 CDTParser]: Found 1 translation units. [2024-11-10 07:19:44,971 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_loopvsstraightlinecode_100-while_file-87.i [2024-11-10 07:19:44,981 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/5b2e107e4/037d11c0c06644d68dc0590bc82fad03/FLAGa6f06df1c [2024-11-10 07:19:44,995 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/5b2e107e4/037d11c0c06644d68dc0590bc82fad03 [2024-11-10 07:19:44,998 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-10 07:19:44,999 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-10 07:19:45,000 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-10 07:19:45,001 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-10 07:19:45,008 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-10 07:19:45,009 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 10.11 07:19:44" (1/1) ... [2024-11-10 07:19:45,010 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@5212f461 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 07:19:45, skipping insertion in model container [2024-11-10 07:19:45,010 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 10.11 07:19:44" (1/1) ... [2024-11-10 07:19:45,045 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-10 07:19:45,212 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_loopvsstraightlinecode_100-while_file-87.i[916,929] [2024-11-10 07:19:45,289 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-10 07:19:45,311 INFO L200 MainTranslator]: Completed pre-run [2024-11-10 07:19:45,322 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_loopvsstraightlinecode_100-while_file-87.i[916,929] [2024-11-10 07:19:45,359 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-10 07:19:45,388 INFO L204 MainTranslator]: Completed translation [2024-11-10 07:19:45,389 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 07:19:45 WrapperNode [2024-11-10 07:19:45,389 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-10 07:19:45,390 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-10 07:19:45,390 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-10 07:19:45,390 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-10 07:19:45,397 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 07:19:45" (1/1) ... [2024-11-10 07:19:45,409 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 07:19:45" (1/1) ... [2024-11-10 07:19:45,459 INFO L138 Inliner]: procedures = 26, calls = 47, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 215 [2024-11-10 07:19:45,460 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-10 07:19:45,460 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-10 07:19:45,461 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-10 07:19:45,461 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-10 07:19:45,473 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 07:19:45" (1/1) ... [2024-11-10 07:19:45,473 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 07:19:45" (1/1) ... [2024-11-10 07:19:45,478 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 07:19:45" (1/1) ... [2024-11-10 07:19:45,516 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-11-10 07:19:45,517 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 07:19:45" (1/1) ... [2024-11-10 07:19:45,517 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 07:19:45" (1/1) ... [2024-11-10 07:19:45,534 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 07:19:45" (1/1) ... [2024-11-10 07:19:45,536 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 07:19:45" (1/1) ... [2024-11-10 07:19:45,538 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 07:19:45" (1/1) ... [2024-11-10 07:19:45,540 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 07:19:45" (1/1) ... [2024-11-10 07:19:45,545 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-10 07:19:45,546 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2024-11-10 07:19:45,547 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2024-11-10 07:19:45,547 INFO L274 PluginConnector]: IcfgBuilder initialized [2024-11-10 07:19:45,548 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 07:19:45" (1/1) ... [2024-11-10 07:19:45,559 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-10 07:19:45,573 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-10 07:19:45,592 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2024-11-10 07:19:45,597 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2024-11-10 07:19:45,646 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-11-10 07:19:45,647 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2024-11-10 07:19:45,647 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2024-11-10 07:19:45,647 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-11-10 07:19:45,647 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-10 07:19:45,648 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-10 07:19:45,762 INFO L256 CfgBuilder]: Building ICFG [2024-11-10 07:19:45,764 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-10 07:19:46,397 INFO L? ?]: Removed 32 outVars from TransFormulas that were not future-live. [2024-11-10 07:19:46,398 INFO L307 CfgBuilder]: Performing block encoding [2024-11-10 07:19:46,419 INFO L331 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-10 07:19:46,419 INFO L336 CfgBuilder]: Removed 0 assume(true) statements. [2024-11-10 07:19:46,420 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 10.11 07:19:46 BoogieIcfgContainer [2024-11-10 07:19:46,420 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2024-11-10 07:19:46,424 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-11-10 07:19:46,424 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-11-10 07:19:46,428 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-11-10 07:19:46,428 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 10.11 07:19:44" (1/3) ... [2024-11-10 07:19:46,430 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@46e2ccf and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 10.11 07:19:46, skipping insertion in model container [2024-11-10 07:19:46,431 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 07:19:45" (2/3) ... [2024-11-10 07:19:46,431 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@46e2ccf and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 10.11 07:19:46, skipping insertion in model container [2024-11-10 07:19:46,432 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 10.11 07:19:46" (3/3) ... [2024-11-10 07:19:46,434 INFO L112 eAbstractionObserver]: Analyzing ICFG hardness_loopvsstraightlinecode_100-while_file-87.i [2024-11-10 07:19:46,450 INFO L214 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-11-10 07:19:46,450 INFO L154 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-11-10 07:19:46,519 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-10 07:19:46,527 INFO L333 AbstractCegarLoop]: Settings: SEPARATE_VIOLATION_CHECK=true, mInterprocedural=true, mMaxIterations=1000000, mWatchIteration=1000000, mArtifact=RCFG, mInterpolation=FPandBP, mInterpolantAutomaton=STRAIGHT_LINE, mDumpAutomata=false, mAutomataFormat=ATS_NUMERATE, mDumpPath=., mDeterminiation=PREDICATE_ABSTRACTION, mMinimize=MINIMIZE_SEVPA, mAutomataTypeConcurrency=PETRI_NET, mHoareTripleChecks=INCREMENTAL, mHoareAnnotationPositions=LoopHeads, 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;@6056a73b, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-10 07:19:46,527 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-11-10 07:19:46,532 INFO L276 IsEmpty]: Start isEmpty. Operand has 95 states, 58 states have (on average 1.3448275862068966) internal successors, (78), 59 states have internal predecessors, (78), 34 states have call successors, (34), 1 states have call predecessors, (34), 1 states have return successors, (34), 34 states have call predecessors, (34), 34 states have call successors, (34) [2024-11-10 07:19:46,555 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 216 [2024-11-10 07:19:46,555 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 07:19:46,557 INFO L215 NwaCegarLoop]: trace histogram [34, 34, 34, 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, 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, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-10 07:19:46,558 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-10 07:19:46,563 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 07:19:46,564 INFO L85 PathProgramCache]: Analyzing trace with hash 1800835428, now seen corresponding path program 1 times [2024-11-10 07:19:46,574 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 07:19:46,575 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1816010419] [2024-11-10 07:19:46,575 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 07:19:46,576 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 07:19:46,765 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 07:19:47,045 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2024-11-10 07:19:47,048 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 07:19:47,058 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-11-10 07:19:47,062 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 07:19:47,065 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2024-11-10 07:19:47,070 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 07:19:47,075 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 22 [2024-11-10 07:19:47,078 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 07:19:47,082 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2024-11-10 07:19:47,084 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 07:19:47,087 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-11-10 07:19:47,089 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 07:19:47,092 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-11-10 07:19:47,094 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 07:19:47,098 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2024-11-10 07:19:47,100 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 07:19:47,103 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 49 [2024-11-10 07:19:47,104 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 07:19:47,106 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 54 [2024-11-10 07:19:47,107 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 07:19:47,110 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 60 [2024-11-10 07:19:47,111 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 07:19:47,115 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2024-11-10 07:19:47,117 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 07:19:47,121 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2024-11-10 07:19:47,124 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 07:19:47,128 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 76 [2024-11-10 07:19:47,131 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 07:19:47,133 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 82 [2024-11-10 07:19:47,138 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 07:19:47,142 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 87 [2024-11-10 07:19:47,144 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 07:19:47,147 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 93 [2024-11-10 07:19:47,149 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 07:19:47,152 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 98 [2024-11-10 07:19:47,153 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 07:19:47,156 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 104 [2024-11-10 07:19:47,158 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 07:19:47,160 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 110 [2024-11-10 07:19:47,162 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 07:19:47,164 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 116 [2024-11-10 07:19:47,167 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 07:19:47,169 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 121 [2024-11-10 07:19:47,171 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 07:19:47,173 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 127 [2024-11-10 07:19:47,175 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 07:19:47,178 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 132 [2024-11-10 07:19:47,180 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 07:19:47,182 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 138 [2024-11-10 07:19:47,184 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 07:19:47,187 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 143 [2024-11-10 07:19:47,189 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 07:19:47,195 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 149 [2024-11-10 07:19:47,201 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 07:19:47,204 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 154 [2024-11-10 07:19:47,209 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 07:19:47,215 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 160 [2024-11-10 07:19:47,218 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 07:19:47,220 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 165 [2024-11-10 07:19:47,223 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 07:19:47,226 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 171 [2024-11-10 07:19:47,230 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 07:19:47,235 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 176 [2024-11-10 07:19:47,239 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 07:19:47,241 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 182 [2024-11-10 07:19:47,244 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 07:19:47,247 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 187 [2024-11-10 07:19:47,249 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 07:19:47,256 INFO L134 CoverageAnalysis]: Checked inductivity of 2244 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2244 trivial. 0 not checked. [2024-11-10 07:19:47,259 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 07:19:47,260 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1816010419] [2024-11-10 07:19:47,261 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1816010419] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 07:19:47,261 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-10 07:19:47,261 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-10 07:19:47,263 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [489587548] [2024-11-10 07:19:47,265 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 07:19:47,270 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-11-10 07:19:47,271 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 07:19:47,304 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-11-10 07:19:47,305 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-11-10 07:19:47,308 INFO L87 Difference]: Start difference. First operand has 95 states, 58 states have (on average 1.3448275862068966) internal successors, (78), 59 states have internal predecessors, (78), 34 states have call successors, (34), 1 states have call predecessors, (34), 1 states have return successors, (34), 34 states have call predecessors, (34), 34 states have call successors, (34) Second operand has 2 states, 2 states have (on average 24.0) internal successors, (48), 2 states have internal predecessors, (48), 2 states have call successors, (34), 1 states have call predecessors, (34), 1 states have return successors, (34), 1 states have call predecessors, (34), 2 states have call successors, (34) [2024-11-10 07:19:47,368 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-10 07:19:47,369 INFO L93 Difference]: Finished difference Result 182 states and 319 transitions. [2024-11-10 07:19:47,374 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-11-10 07:19:47,376 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 24.0) internal successors, (48), 2 states have internal predecessors, (48), 2 states have call successors, (34), 1 states have call predecessors, (34), 1 states have return successors, (34), 1 states have call predecessors, (34), 2 states have call successors, (34) Word has length 215 [2024-11-10 07:19:47,377 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-10 07:19:47,397 INFO L225 Difference]: With dead ends: 182 [2024-11-10 07:19:47,401 INFO L226 Difference]: Without dead ends: 90 [2024-11-10 07:19:47,412 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 104 GetRequests, 104 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-11-10 07:19:47,443 INFO L432 NwaCegarLoop]: 138 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 0 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 138 SdHoareTripleChecker+Invalid, 0 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 0 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-10 07:19:47,444 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 138 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-10 07:19:47,472 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 90 states. [2024-11-10 07:19:47,505 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 90 to 90. [2024-11-10 07:19:47,508 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 90 states, 54 states have (on average 1.2962962962962963) internal successors, (70), 54 states have internal predecessors, (70), 34 states have call successors, (34), 1 states have call predecessors, (34), 1 states have return successors, (34), 34 states have call predecessors, (34), 34 states have call successors, (34) [2024-11-10 07:19:47,516 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 90 states to 90 states and 138 transitions. [2024-11-10 07:19:47,519 INFO L78 Accepts]: Start accepts. Automaton has 90 states and 138 transitions. Word has length 215 [2024-11-10 07:19:47,519 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-10 07:19:47,519 INFO L471 AbstractCegarLoop]: Abstraction has 90 states and 138 transitions. [2024-11-10 07:19:47,522 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 24.0) internal successors, (48), 2 states have internal predecessors, (48), 2 states have call successors, (34), 1 states have call predecessors, (34), 1 states have return successors, (34), 1 states have call predecessors, (34), 2 states have call successors, (34) [2024-11-10 07:19:47,522 INFO L276 IsEmpty]: Start isEmpty. Operand 90 states and 138 transitions. [2024-11-10 07:19:47,529 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 216 [2024-11-10 07:19:47,530 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 07:19:47,531 INFO L215 NwaCegarLoop]: trace histogram [34, 34, 34, 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, 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, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-10 07:19:47,531 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-11-10 07:19:47,531 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-10 07:19:47,532 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 07:19:47,533 INFO L85 PathProgramCache]: Analyzing trace with hash 1585256008, now seen corresponding path program 1 times [2024-11-10 07:19:47,533 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 07:19:47,534 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1912125430] [2024-11-10 07:19:47,535 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 07:19:47,535 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 07:19:48,060 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 07:19:48,694 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2024-11-10 07:19:48,696 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 07:19:48,700 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-11-10 07:19:48,703 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 07:19:48,705 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2024-11-10 07:19:48,707 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 07:19:48,711 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 22 [2024-11-10 07:19:48,713 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 07:19:48,716 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2024-11-10 07:19:48,717 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 07:19:48,719 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-11-10 07:19:48,723 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 07:19:48,726 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-11-10 07:19:48,728 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 07:19:48,732 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2024-11-10 07:19:48,733 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 07:19:48,735 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 49 [2024-11-10 07:19:48,736 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 07:19:48,738 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 54 [2024-11-10 07:19:48,739 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 07:19:48,741 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 60 [2024-11-10 07:19:48,742 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 07:19:48,743 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2024-11-10 07:19:48,746 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 07:19:48,748 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2024-11-10 07:19:48,752 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 07:19:48,754 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 76 [2024-11-10 07:19:48,756 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 07:19:48,760 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 82 [2024-11-10 07:19:48,761 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 07:19:48,763 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 87 [2024-11-10 07:19:48,766 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 07:19:48,793 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 93 [2024-11-10 07:19:48,795 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 07:19:48,799 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 98 [2024-11-10 07:19:48,803 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 07:19:48,808 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 104 [2024-11-10 07:19:48,810 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 07:19:48,817 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 110 [2024-11-10 07:19:48,820 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 07:19:48,824 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 116 [2024-11-10 07:19:48,828 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 07:19:48,831 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 121 [2024-11-10 07:19:48,834 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 07:19:48,837 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 127 [2024-11-10 07:19:48,840 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 07:19:48,842 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 132 [2024-11-10 07:19:48,846 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 07:19:48,850 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 138 [2024-11-10 07:19:48,855 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 07:19:48,858 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 143 [2024-11-10 07:19:48,862 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 07:19:48,864 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 149 [2024-11-10 07:19:48,866 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 07:19:48,870 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 154 [2024-11-10 07:19:48,872 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 07:19:48,875 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 160 [2024-11-10 07:19:48,877 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 07:19:48,879 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 165 [2024-11-10 07:19:48,882 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 07:19:48,886 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 171 [2024-11-10 07:19:48,888 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 07:19:48,891 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 176 [2024-11-10 07:19:48,893 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 07:19:48,895 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 182 [2024-11-10 07:19:48,899 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 07:19:48,906 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 187 [2024-11-10 07:19:48,908 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 07:19:48,912 INFO L134 CoverageAnalysis]: Checked inductivity of 2244 backedges. 45 proven. 54 refuted. 0 times theorem prover too weak. 2145 trivial. 0 not checked. [2024-11-10 07:19:48,912 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 07:19:48,912 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1912125430] [2024-11-10 07:19:48,912 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1912125430] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-10 07:19:48,913 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1080767999] [2024-11-10 07:19:48,913 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 07:19:48,913 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-10 07:19:48,913 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-10 07:19:48,915 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-10 07:19:48,916 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2024-11-10 07:19:49,135 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 07:19:49,139 INFO L255 TraceCheckSpWp]: Trace formula consists of 511 conjuncts, 6 conjuncts are in the unsatisfiable core [2024-11-10 07:19:49,151 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-10 07:19:49,543 INFO L134 CoverageAnalysis]: Checked inductivity of 2244 backedges. 1143 proven. 54 refuted. 0 times theorem prover too weak. 1047 trivial. 0 not checked. [2024-11-10 07:19:49,544 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-10 07:19:49,902 INFO L134 CoverageAnalysis]: Checked inductivity of 2244 backedges. 45 proven. 54 refuted. 0 times theorem prover too weak. 2145 trivial. 0 not checked. [2024-11-10 07:19:49,904 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1080767999] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-10 07:19:49,905 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-10 07:19:49,905 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5] total 7 [2024-11-10 07:19:49,906 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1966527194] [2024-11-10 07:19:49,907 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-10 07:19:49,909 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-11-10 07:19:49,910 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 07:19:49,912 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-11-10 07:19:49,913 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2024-11-10 07:19:49,914 INFO L87 Difference]: Start difference. First operand 90 states and 138 transitions. Second operand has 7 states, 7 states have (on average 8.142857142857142) internal successors, (57), 7 states have internal predecessors, (57), 2 states have call successors, (52), 2 states have call predecessors, (52), 4 states have return successors, (53), 2 states have call predecessors, (53), 2 states have call successors, (53) [2024-11-10 07:19:50,228 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-10 07:19:50,228 INFO L93 Difference]: Finished difference Result 185 states and 280 transitions. [2024-11-10 07:19:50,229 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-11-10 07:19:50,230 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 8.142857142857142) internal successors, (57), 7 states have internal predecessors, (57), 2 states have call successors, (52), 2 states have call predecessors, (52), 4 states have return successors, (53), 2 states have call predecessors, (53), 2 states have call successors, (53) Word has length 215 [2024-11-10 07:19:50,231 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-10 07:19:50,233 INFO L225 Difference]: With dead ends: 185 [2024-11-10 07:19:50,233 INFO L226 Difference]: Without dead ends: 98 [2024-11-10 07:19:50,234 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 504 GetRequests, 494 SyntacticMatches, 1 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=45, Invalid=65, Unknown=0, NotChecked=0, Total=110 [2024-11-10 07:19:50,237 INFO L432 NwaCegarLoop]: 99 mSDtfsCounter, 65 mSDsluCounter, 128 mSDsCounter, 0 mSdLazyCounter, 192 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 79 SdHoareTripleChecker+Valid, 227 SdHoareTripleChecker+Invalid, 197 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 192 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-11-10 07:19:50,238 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [79 Valid, 227 Invalid, 197 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 192 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-11-10 07:19:50,239 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 98 states. [2024-11-10 07:19:50,264 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 98 to 94. [2024-11-10 07:19:50,264 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 94 states, 57 states have (on average 1.263157894736842) internal successors, (72), 57 states have internal predecessors, (72), 34 states have call successors, (34), 2 states have call predecessors, (34), 2 states have return successors, (34), 34 states have call predecessors, (34), 34 states have call successors, (34) [2024-11-10 07:19:50,266 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 94 states to 94 states and 140 transitions. [2024-11-10 07:19:50,267 INFO L78 Accepts]: Start accepts. Automaton has 94 states and 140 transitions. Word has length 215 [2024-11-10 07:19:50,268 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-10 07:19:50,268 INFO L471 AbstractCegarLoop]: Abstraction has 94 states and 140 transitions. [2024-11-10 07:19:50,268 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 8.142857142857142) internal successors, (57), 7 states have internal predecessors, (57), 2 states have call successors, (52), 2 states have call predecessors, (52), 4 states have return successors, (53), 2 states have call predecessors, (53), 2 states have call successors, (53) [2024-11-10 07:19:50,268 INFO L276 IsEmpty]: Start isEmpty. Operand 94 states and 140 transitions. [2024-11-10 07:19:50,271 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 216 [2024-11-10 07:19:50,272 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 07:19:50,272 INFO L215 NwaCegarLoop]: trace histogram [34, 34, 34, 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, 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, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-10 07:19:50,291 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2024-11-10 07:19:50,473 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1,2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-10 07:19:50,473 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-10 07:19:50,474 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 07:19:50,474 INFO L85 PathProgramCache]: Analyzing trace with hash -1356401591, now seen corresponding path program 1 times [2024-11-10 07:19:50,474 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 07:19:50,474 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2124697029] [2024-11-10 07:19:50,475 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 07:19:50,475 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 07:19:50,975 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unknown [2024-11-10 07:19:50,980 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1226875349] [2024-11-10 07:19:50,980 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 07:19:50,980 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-10 07:19:50,980 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-10 07:19:50,982 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-10 07:19:50,983 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2024-11-10 07:19:51,191 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 07:19:51,195 INFO L255 TraceCheckSpWp]: Trace formula consists of 510 conjuncts, 34 conjuncts are in the unsatisfiable core [2024-11-10 07:19:51,202 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-10 07:19:57,053 INFO L134 CoverageAnalysis]: Checked inductivity of 2244 backedges. 1345 proven. 261 refuted. 0 times theorem prover too weak. 638 trivial. 0 not checked. [2024-11-10 07:19:57,055 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-10 07:20:02,340 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse1 (= (mod c_~var_1_22~0 c_~var_1_5~0) 0)) (.cse26 (+ c_~var_1_22~0 1))) (let ((.cse7 (+ c_~var_1_5~0 1)) (.cse25 (div c_~var_1_22~0 c_~var_1_5~0)) (.cse8 (+ |c_ULTIMATE.start_step_~stepLocal_0~0#1| 1)) (.cse15 (<= .cse26 0)) (.cse5 (not .cse1))) (let ((.cse13 (< c_~var_1_22~0 0)) (.cse12 (and .cse15 .cse5)) (.cse0 (< 0 .cse26)) (.cse3 (not (= .cse25 .cse8))) (.cse9 (< 0 .cse7)) (.cse6 (not (= |c_ULTIMATE.start_step_~stepLocal_0~0#1| .cse25))) (.cse17 (not (= |c_ULTIMATE.start_step_~stepLocal_0~0#1| (+ .cse25 1)))) (.cse10 (< c_~var_1_5~0 0))) (and (or .cse0 (and (or (let ((.cse2 (forall ((~var_1_6~0 Int)) (or (< c_~var_1_5~0 ~var_1_6~0) (not (= (div c_~var_1_22~0 ~var_1_6~0) .cse8)) (= (mod c_~var_1_22~0 ~var_1_6~0) 0)))) (.cse4 (forall ((~var_1_6~0 Int)) (or (< ~var_1_6~0 .cse7) (< 0 (+ ~var_1_6~0 1)) (= (mod c_~var_1_22~0 ~var_1_6~0) 0))))) (and (or .cse1 (and .cse2 (or .cse3 .cse4))) (or .cse5 (and .cse2 (or .cse6 .cse4))))) .cse9) (or .cse10 (let ((.cse11 (forall ((~var_1_6~0 Int)) (or (not (= (div c_~var_1_22~0 ~var_1_6~0) .cse8)) (< 0 (+ ~var_1_6~0 1)) (= (mod c_~var_1_22~0 ~var_1_6~0) 0))))) (and (or .cse5 .cse11) (or .cse1 .cse11)))))) (or .cse10 (let ((.cse14 (forall ((~var_1_6~0 Int)) (or (< c_~var_1_5~0 ~var_1_6~0) (not (= (mod c_~var_1_22~0 ~var_1_6~0) 0)) (not (= (div c_~var_1_22~0 ~var_1_6~0) |c_ULTIMATE.start_step_~stepLocal_0~0#1|)) (< ~var_1_6~0 0)))) (.cse16 (forall ((~var_1_6~0 Int)) (or (< ~var_1_6~0 .cse7) (not (= (mod c_~var_1_22~0 ~var_1_6~0) 0)))))) (and (or .cse12 (and (or .cse13 (forall ((~var_1_6~0 Int)) (or (< c_~var_1_5~0 ~var_1_6~0) (not (= (div c_~var_1_22~0 ~var_1_6~0) |c_ULTIMATE.start_step_~stepLocal_0~0#1|)) (< ~var_1_6~0 0)))) .cse14 (or .cse6 (and .cse15 .cse16)))) (or .cse0 (and .cse14 (or .cse17 .cse16)) .cse1)))) (or .cse10 (let ((.cse18 (forall ((~var_1_6~0 Int)) (or (not (= (mod c_~var_1_22~0 ~var_1_6~0) 0)) (< 0 (+ ~var_1_6~0 1)) (not (= (div c_~var_1_22~0 ~var_1_6~0) |c_ULTIMATE.start_step_~stepLocal_0~0#1|)))))) (and (or .cse0 .cse18 .cse1) (or (and (or .cse13 (forall ((~var_1_6~0 Int)) (or (< 0 (+ ~var_1_6~0 1)) (not (= (div c_~var_1_22~0 ~var_1_6~0) |c_ULTIMATE.start_step_~stepLocal_0~0#1|))))) .cse18) .cse12)))) (or .cse9 (let ((.cse19 (forall ((~var_1_6~0 Int)) (or (< ~var_1_6~0 .cse7) (not (= (mod c_~var_1_22~0 ~var_1_6~0) 0)) (< 0 (+ ~var_1_6~0 1))))) (.cse20 (forall ((~var_1_6~0 Int)) (or (< c_~var_1_5~0 ~var_1_6~0) (not (= (mod c_~var_1_22~0 ~var_1_6~0) 0)) (not (= (div c_~var_1_22~0 ~var_1_6~0) |c_ULTIMATE.start_step_~stepLocal_0~0#1|)))))) (and (or .cse12 (and (or .cse6 (and (or (= .cse7 0) .cse13) .cse19)) .cse20 (or (forall ((~var_1_6~0 Int)) (or (< c_~var_1_5~0 ~var_1_6~0) (not (= (div c_~var_1_22~0 ~var_1_6~0) |c_ULTIMATE.start_step_~stepLocal_0~0#1|)))) .cse13))) (or .cse0 .cse1 (and (or .cse3 .cse19) .cse20))))) (or .cse9 (let ((.cse21 (forall ((~var_1_6~0 Int)) (or (not (= (mod c_~var_1_22~0 ~var_1_6~0) 0)) (< ~var_1_6~0 0))))) (and (or .cse0 .cse21 .cse3 .cse1) (or .cse6 .cse12 (and .cse15 .cse21))))) (or .cse0 (and (or (let ((.cse22 (forall ((~var_1_6~0 Int)) (or (= (mod c_~var_1_22~0 ~var_1_6~0) 0) (< ~var_1_6~0 0))))) (and (or .cse6 .cse22 .cse5) (or .cse22 .cse3 .cse1))) .cse9) (or (let ((.cse23 (forall ((~var_1_6~0 Int)) (or (< ~var_1_6~0 .cse7) (= (mod c_~var_1_22~0 ~var_1_6~0) 0)))) (.cse24 (forall ((~var_1_6~0 Int)) (or (< c_~var_1_5~0 ~var_1_6~0) (not (= |c_ULTIMATE.start_step_~stepLocal_0~0#1| (+ (div c_~var_1_22~0 ~var_1_6~0) 1))) (= (mod c_~var_1_22~0 ~var_1_6~0) 0) (< ~var_1_6~0 0))))) (and (or .cse5 (and (or .cse6 .cse23) .cse24)) (or .cse1 (and (or .cse17 .cse23) .cse24)))) .cse10))))))) is different from false [2024-11-10 07:20:07,879 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse2 (= (mod c_~var_1_22~0 c_~var_1_5~0) 0)) (.cse27 (+ c_~var_1_22~0 1))) (let ((.cse22 (<= .cse27 0)) (.cse5 (not .cse2)) (.cse10 (+ c_~var_1_25~0 c_~var_1_22~0)) (.cse19 (+ c_~var_1_25~0 c_~var_1_22~0 1)) (.cse26 (div c_~var_1_22~0 c_~var_1_5~0)) (.cse11 (+ c_~var_1_5~0 1))) (let ((.cse6 (< 0 .cse11)) (.cse3 (not (= .cse19 .cse26))) (.cse12 (< c_~var_1_5~0 0)) (.cse0 (< 0 .cse27)) (.cse9 (not (= .cse10 (+ .cse26 1)))) (.cse16 (and .cse22 .cse5)) (.cse4 (not (= .cse10 .cse26))) (.cse15 (< c_~var_1_22~0 0))) (and (or .cse0 (and (or (let ((.cse1 (forall ((~var_1_6~0 Int)) (or (= (mod c_~var_1_22~0 ~var_1_6~0) 0) (< ~var_1_6~0 0))))) (and (or .cse1 .cse2 .cse3) (or .cse1 .cse4 .cse5))) .cse6) (or (let ((.cse7 (forall ((~var_1_6~0 Int)) (or (< ~var_1_6~0 .cse11) (= (mod c_~var_1_22~0 ~var_1_6~0) 0)))) (.cse8 (forall ((~var_1_6~0 Int)) (or (not (= .cse10 (+ (div c_~var_1_22~0 ~var_1_6~0) 1))) (< c_~var_1_5~0 ~var_1_6~0) (= (mod c_~var_1_22~0 ~var_1_6~0) 0) (< ~var_1_6~0 0))))) (and (or .cse5 (and (or .cse4 .cse7) .cse8)) (or .cse2 (and (or .cse9 .cse7) .cse8)))) .cse12))) (or (let ((.cse14 (forall ((~var_1_6~0 Int)) (or (< ~var_1_6~0 .cse11) (not (= (mod c_~var_1_22~0 ~var_1_6~0) 0)) (< 0 (+ ~var_1_6~0 1))))) (.cse13 (forall ((~var_1_6~0 Int)) (or (< c_~var_1_5~0 ~var_1_6~0) (not (= (div c_~var_1_22~0 ~var_1_6~0) .cse10)) (not (= (mod c_~var_1_22~0 ~var_1_6~0) 0)))))) (and (or .cse0 (and .cse13 (or .cse14 .cse3)) .cse2) (or (and (or .cse4 .cse14) .cse13 (or .cse15 (forall ((~var_1_6~0 Int)) (or (< c_~var_1_5~0 ~var_1_6~0) (not (= (div c_~var_1_22~0 ~var_1_6~0) .cse10)))))) .cse16))) .cse6) (or .cse0 (and (or .cse6 (let ((.cse18 (forall ((~var_1_6~0 Int)) (or (< ~var_1_6~0 .cse11) (< 0 (+ ~var_1_6~0 1)) (= (mod c_~var_1_22~0 ~var_1_6~0) 0)))) (.cse17 (forall ((~var_1_6~0 Int)) (or (< c_~var_1_5~0 ~var_1_6~0) (not (= (div c_~var_1_22~0 ~var_1_6~0) .cse19)) (= (mod c_~var_1_22~0 ~var_1_6~0) 0))))) (and (or .cse2 (and .cse17 (or .cse18 .cse3))) (or (and (or .cse4 .cse18) .cse17) .cse5)))) (or (let ((.cse20 (forall ((~var_1_6~0 Int)) (or (not (= (div c_~var_1_22~0 ~var_1_6~0) .cse19)) (< 0 (+ ~var_1_6~0 1)) (= (mod c_~var_1_22~0 ~var_1_6~0) 0))))) (and (or .cse5 .cse20) (or .cse2 .cse20))) .cse12))) (or .cse6 (let ((.cse21 (forall ((~var_1_6~0 Int)) (or (not (= (mod c_~var_1_22~0 ~var_1_6~0) 0)) (< ~var_1_6~0 0))))) (and (or .cse0 .cse21 .cse2 .cse3) (or .cse4 .cse16 (and .cse22 .cse21))))) (or (let ((.cse23 (forall ((~var_1_6~0 Int)) (or (not (= (div c_~var_1_22~0 ~var_1_6~0) .cse10)) (not (= (mod c_~var_1_22~0 ~var_1_6~0) 0)) (< 0 (+ ~var_1_6~0 1)))))) (and (or .cse0 .cse23 .cse2) (or (and .cse23 (or (forall ((~var_1_6~0 Int)) (or (not (= (div c_~var_1_22~0 ~var_1_6~0) .cse10)) (< 0 (+ ~var_1_6~0 1)))) .cse15)) .cse16))) .cse12) (or .cse12 (let ((.cse24 (forall ((~var_1_6~0 Int)) (or (< ~var_1_6~0 .cse11) (not (= (mod c_~var_1_22~0 ~var_1_6~0) 0))))) (.cse25 (forall ((~var_1_6~0 Int)) (or (< c_~var_1_5~0 ~var_1_6~0) (not (= (div c_~var_1_22~0 ~var_1_6~0) .cse10)) (not (= (mod c_~var_1_22~0 ~var_1_6~0) 0)) (< ~var_1_6~0 0))))) (and (or .cse0 (and (or .cse9 .cse24) .cse25) .cse2) (or .cse16 (and (or (and .cse22 .cse24) .cse4) .cse25 (or .cse15 (forall ((~var_1_6~0 Int)) (or (< c_~var_1_5~0 ~var_1_6~0) (not (= (div c_~var_1_22~0 ~var_1_6~0) .cse10)) (< ~var_1_6~0 0))))))))))))) is different from false [2024-11-10 07:20:18,096 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse7 (= (mod c_~var_1_22~0 c_~var_1_5~0) 0)) (.cse44 (+ c_~var_1_22~0 1)) (.cse42 (+ c_~var_1_5~0 1))) (let ((.cse26 (div c_~var_1_22~0 c_~var_1_5~0)) (.cse22 (forall ((~var_1_6~0 Int)) (or (not (= (mod c_~var_1_22~0 ~var_1_6~0) 0)) (< ~var_1_6~0 0)))) (.cse13 (forall ((~var_1_6~0 Int)) (or (< ~var_1_6~0 .cse42) (not (= (mod c_~var_1_22~0 ~var_1_6~0) 0))))) (.cse43 (<= .cse44 0)) (.cse5 (not .cse7))) (let ((.cse30 (mod c_~var_1_28~0 4294967296)) (.cse4 (forall ((~var_1_6~0 Int)) (or (< ~var_1_6~0 .cse42) (< 0 (+ ~var_1_6~0 1)) (= (mod c_~var_1_22~0 ~var_1_6~0) 0)))) (.cse18 (forall ((~var_1_6~0 Int)) (or (< ~var_1_6~0 .cse42) (not (= (mod c_~var_1_22~0 ~var_1_6~0) 0)) (< 0 (+ ~var_1_6~0 1))))) (.cse25 (forall ((~var_1_6~0 Int)) (or (= (mod c_~var_1_22~0 ~var_1_6~0) 0) (< ~var_1_6~0 0)))) (.cse24 (forall ((~var_1_6~0 Int)) (or (< ~var_1_6~0 .cse42) (= (mod c_~var_1_22~0 ~var_1_6~0) 0)))) (.cse17 (and .cse43 .cse5)) (.cse15 (< c_~var_1_22~0 0)) (.cse16 (and .cse43 .cse13)) (.cse0 (< 0 .cse44)) (.cse10 (< c_~var_1_5~0 0)) (.cse21 (and .cse43 .cse22)) (.cse1 (< 0 .cse42)) (.cse27 (+ .cse26 1)) (.cse29 (mod c_~var_1_8~0 256))) (and (or (let ((.cse28 (mod c_~var_1_28~0 65536))) (let ((.cse8 (+ .cse28 c_~var_1_22~0 1)) (.cse14 (+ .cse28 c_~var_1_22~0))) (let ((.cse12 (not (= .cse27 .cse14))) (.cse3 (not (= .cse26 .cse14))) (.cse6 (not (= .cse26 .cse8)))) (and (or .cse0 (and (or .cse1 (let ((.cse2 (forall ((~var_1_6~0 Int)) (or (< c_~var_1_5~0 ~var_1_6~0) (not (= (div c_~var_1_22~0 ~var_1_6~0) .cse8)) (= (mod c_~var_1_22~0 ~var_1_6~0) 0))))) (and (or (and .cse2 (or .cse3 .cse4)) .cse5) (or (and .cse2 (or .cse6 .cse4)) .cse7)))) (or (let ((.cse9 (forall ((~var_1_6~0 Int)) (or (< 0 (+ ~var_1_6~0 1)) (not (= (div c_~var_1_22~0 ~var_1_6~0) .cse8)) (= (mod c_~var_1_22~0 ~var_1_6~0) 0))))) (and (or .cse7 .cse9) (or .cse5 .cse9))) .cse10))) (or .cse10 (let ((.cse11 (forall ((~var_1_6~0 Int)) (or (< c_~var_1_5~0 ~var_1_6~0) (not (= (div c_~var_1_22~0 ~var_1_6~0) .cse14)) (not (= (mod c_~var_1_22~0 ~var_1_6~0) 0)) (< ~var_1_6~0 0))))) (and (or .cse0 .cse7 (and .cse11 (or .cse12 .cse13))) (or (and .cse11 (or (forall ((~var_1_6~0 Int)) (or (< c_~var_1_5~0 ~var_1_6~0) (not (= (div c_~var_1_22~0 ~var_1_6~0) .cse14)) (< ~var_1_6~0 0))) .cse15) (or .cse16 .cse3)) .cse17)))) (or .cse1 (let ((.cse19 (forall ((~var_1_6~0 Int)) (or (< c_~var_1_5~0 ~var_1_6~0) (not (= (div c_~var_1_22~0 ~var_1_6~0) .cse14)) (not (= (mod c_~var_1_22~0 ~var_1_6~0) 0)))))) (and (or .cse0 .cse7 (and (or .cse6 .cse18) .cse19)) (or .cse17 (and (or .cse3 .cse18) .cse19))))) (or .cse10 (let ((.cse20 (forall ((~var_1_6~0 Int)) (or (not (= (div c_~var_1_22~0 ~var_1_6~0) .cse14)) (not (= (mod c_~var_1_22~0 ~var_1_6~0) 0)) (< 0 (+ ~var_1_6~0 1)))))) (and (or (and .cse20 (or .cse15 (forall ((~var_1_6~0 Int)) (or (not (= (div c_~var_1_22~0 ~var_1_6~0) .cse14)) (< 0 (+ ~var_1_6~0 1)))))) .cse17) (or .cse0 .cse20 .cse7)))) (or .cse1 (and (or .cse5 .cse3 .cse21) (or .cse22 .cse7 .cse6))) (or .cse0 (and (or .cse10 (let ((.cse23 (forall ((~var_1_6~0 Int)) (or (< c_~var_1_5~0 ~var_1_6~0) (not (= (+ (div c_~var_1_22~0 ~var_1_6~0) 1) .cse14)) (= (mod c_~var_1_22~0 ~var_1_6~0) 0) (< ~var_1_6~0 0))))) (and (or (and .cse23 (or .cse12 .cse24)) .cse7) (or .cse5 (and (or .cse3 .cse24) .cse23))))) (or (and (or .cse25 .cse5 .cse3) (or .cse25 .cse7 .cse6)) .cse1))))))) (< .cse29 .cse30)) (or (< .cse30 (+ 1 .cse29)) (let ((.cse32 (+ c_~var_1_22~0 1 .cse29)) (.cse37 (+ c_~var_1_22~0 .cse29))) (let ((.cse40 (not (= .cse37 .cse27))) (.cse35 (not (= .cse26 .cse32))) (.cse33 (not (= .cse37 .cse26)))) (and (or .cse0 (and (or .cse10 (let ((.cse31 (forall ((~var_1_6~0 Int)) (or (not (= (div c_~var_1_22~0 ~var_1_6~0) .cse32)) (< 0 (+ ~var_1_6~0 1)) (= (mod c_~var_1_22~0 ~var_1_6~0) 0))))) (and (or .cse31 .cse7) (or .cse31 .cse5)))) (or .cse1 (let ((.cse34 (forall ((~var_1_6~0 Int)) (or (not (= (div c_~var_1_22~0 ~var_1_6~0) .cse32)) (< c_~var_1_5~0 ~var_1_6~0) (= (mod c_~var_1_22~0 ~var_1_6~0) 0))))) (and (or .cse5 (and (or .cse33 .cse4) .cse34)) (or (and .cse34 (or .cse35 .cse4)) .cse7)))))) (or .cse1 (let ((.cse36 (forall ((~var_1_6~0 Int)) (or (< c_~var_1_5~0 ~var_1_6~0) (not (= (div c_~var_1_22~0 ~var_1_6~0) .cse37)) (not (= (mod c_~var_1_22~0 ~var_1_6~0) 0)))))) (and (or .cse0 .cse7 (and (or .cse35 .cse18) .cse36)) (or (and .cse36 (or .cse33 .cse18)) .cse17)))) (or .cse10 (let ((.cse38 (forall ((~var_1_6~0 Int)) (or (not (= (div c_~var_1_22~0 ~var_1_6~0) .cse37)) (not (= (mod c_~var_1_22~0 ~var_1_6~0) 0)) (< 0 (+ ~var_1_6~0 1)))))) (and (or (and (or (forall ((~var_1_6~0 Int)) (or (not (= (div c_~var_1_22~0 ~var_1_6~0) .cse37)) (< 0 (+ ~var_1_6~0 1)))) .cse15) .cse38) .cse17) (or .cse0 .cse7 .cse38)))) (or .cse0 (and (or .cse1 (and (or .cse25 .cse5 .cse33) (or .cse25 .cse35 .cse7))) (or (let ((.cse39 (forall ((~var_1_6~0 Int)) (or (< c_~var_1_5~0 ~var_1_6~0) (not (= .cse37 (+ (div c_~var_1_22~0 ~var_1_6~0) 1))) (= (mod c_~var_1_22~0 ~var_1_6~0) 0) (< ~var_1_6~0 0))))) (and (or .cse7 (and .cse39 (or .cse24 .cse40))) (or .cse5 (and .cse39 (or .cse33 .cse24))))) .cse10))) (or (let ((.cse41 (forall ((~var_1_6~0 Int)) (or (< c_~var_1_5~0 ~var_1_6~0) (not (= (div c_~var_1_22~0 ~var_1_6~0) .cse37)) (not (= (mod c_~var_1_22~0 ~var_1_6~0) 0)) (< ~var_1_6~0 0))))) (and (or .cse17 (and (or .cse15 (forall ((~var_1_6~0 Int)) (or (< c_~var_1_5~0 ~var_1_6~0) (not (= (div c_~var_1_22~0 ~var_1_6~0) .cse37)) (< ~var_1_6~0 0)))) (or .cse16 .cse33) .cse41)) (or .cse0 (and (or .cse13 .cse40) .cse41) .cse7))) .cse10) (or (and (or .cse22 .cse35 .cse7) (or .cse5 .cse33 .cse21)) .cse1))))))))) is different from false [2024-11-10 07:20:54,629 WARN L286 SmtUtils]: Spent 11.20s on a formula simplification. DAG size of input: 237 DAG size of output: 233 (called from [L 388] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate)