./Ultimate.py --spec /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/properties/unreach-call.prp --file /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodesize_ps-cn-50_file-59.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 4a390ef5 Calling Ultimate with: /root/.sdkman/candidates/java/current/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 /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodesize_ps-cn-50_file-59.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 60abcfb910222ed2fbb6950de4d87076e559bee1f898e234a2e9cc0109e44a67 --- Real Ultimate output --- This is Ultimate 0.2.5-dev-4a390ef-m [2024-10-24 06:46:05,036 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-10-24 06:46:05,094 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2024-10-24 06:46:05,101 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-10-24 06:46:05,103 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-10-24 06:46:05,126 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-10-24 06:46:05,126 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-10-24 06:46:05,126 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-10-24 06:46:05,127 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-10-24 06:46:05,127 INFO L153 SettingsManager]: * Use memory slicer=true [2024-10-24 06:46:05,127 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-10-24 06:46:05,128 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-10-24 06:46:05,128 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-10-24 06:46:05,128 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-10-24 06:46:05,129 INFO L153 SettingsManager]: * Use SBE=true [2024-10-24 06:46:05,129 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-10-24 06:46:05,129 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-10-24 06:46:05,133 INFO L153 SettingsManager]: * sizeof long=4 [2024-10-24 06:46:05,133 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-10-24 06:46:05,134 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-10-24 06:46:05,134 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-10-24 06:46:05,134 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-10-24 06:46:05,135 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-10-24 06:46:05,135 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-10-24 06:46:05,135 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-10-24 06:46:05,135 INFO L153 SettingsManager]: * sizeof long double=12 [2024-10-24 06:46:05,136 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-10-24 06:46:05,136 INFO L153 SettingsManager]: * Use constant arrays=true [2024-10-24 06:46:05,136 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-10-24 06:46:05,136 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-10-24 06:46:05,137 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-10-24 06:46:05,137 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-10-24 06:46:05,137 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-24 06:46:05,137 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-10-24 06:46:05,138 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-10-24 06:46:05,138 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-10-24 06:46:05,138 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-10-24 06:46:05,138 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-10-24 06:46:05,138 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-10-24 06:46:05,139 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-10-24 06:46:05,139 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-10-24 06:46:05,139 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-10-24 06:46:05,140 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 -> 60abcfb910222ed2fbb6950de4d87076e559bee1f898e234a2e9cc0109e44a67 [2024-10-24 06:46:05,331 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-10-24 06:46:05,357 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-10-24 06:46:05,360 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-10-24 06:46:05,361 INFO L270 PluginConnector]: Initializing CDTParser... [2024-10-24 06:46:05,361 INFO L274 PluginConnector]: CDTParser initialized [2024-10-24 06:46:05,363 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodesize_ps-cn-50_file-59.i [2024-10-24 06:46:06,827 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-10-24 06:46:06,994 INFO L384 CDTParser]: Found 1 translation units. [2024-10-24 06:46:06,995 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodesize_ps-cn-50_file-59.i [2024-10-24 06:46:07,011 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/41778a827/ee73810482b74b20903787ff082bd6ca/FLAG90cce2ed8 [2024-10-24 06:46:07,381 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/41778a827/ee73810482b74b20903787ff082bd6ca [2024-10-24 06:46:07,383 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-10-24 06:46:07,385 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-10-24 06:46:07,386 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-10-24 06:46:07,386 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-10-24 06:46:07,391 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-10-24 06:46:07,391 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 24.10 06:46:07" (1/1) ... [2024-10-24 06:46:07,392 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@5ba09aad and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 06:46:07, skipping insertion in model container [2024-10-24 06:46:07,392 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 24.10 06:46:07" (1/1) ... [2024-10-24 06:46:07,416 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-10-24 06:46:07,549 WARN L248 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_fillercode_fillercodesize_ps-cn-50_file-59.i[915,928] [2024-10-24 06:46:07,614 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-24 06:46:07,632 INFO L200 MainTranslator]: Completed pre-run [2024-10-24 06:46:07,644 WARN L248 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_fillercode_fillercodesize_ps-cn-50_file-59.i[915,928] [2024-10-24 06:46:07,687 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-24 06:46:07,711 INFO L204 MainTranslator]: Completed translation [2024-10-24 06:46:07,712 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 06:46:07 WrapperNode [2024-10-24 06:46:07,712 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-10-24 06:46:07,712 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-10-24 06:46:07,713 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-10-24 06:46:07,713 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-10-24 06:46:07,744 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 06:46:07" (1/1) ... [2024-10-24 06:46:07,778 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 06:46:07" (1/1) ... [2024-10-24 06:46:07,838 INFO L138 Inliner]: procedures = 26, calls = 47, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 242 [2024-10-24 06:46:07,839 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-10-24 06:46:07,839 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-10-24 06:46:07,840 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-10-24 06:46:07,840 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-10-24 06:46:07,849 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 06:46:07" (1/1) ... [2024-10-24 06:46:07,849 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 06:46:07" (1/1) ... [2024-10-24 06:46:07,852 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 06:46:07" (1/1) ... [2024-10-24 06:46:07,871 INFO L175 MemorySlicer]: Split 2 memory accesses to 1 slices as follows [2]. 100 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2]. The 0 writes are split as follows [0]. [2024-10-24 06:46:07,874 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 06:46:07" (1/1) ... [2024-10-24 06:46:07,874 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 06:46:07" (1/1) ... [2024-10-24 06:46:07,892 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 06:46:07" (1/1) ... [2024-10-24 06:46:07,895 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 06:46:07" (1/1) ... [2024-10-24 06:46:07,902 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 06:46:07" (1/1) ... [2024-10-24 06:46:07,908 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 06:46:07" (1/1) ... [2024-10-24 06:46:07,920 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-10-24 06:46:07,922 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-10-24 06:46:07,923 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-10-24 06:46:07,923 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-10-24 06:46:07,923 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 06:46:07" (1/1) ... [2024-10-24 06:46:07,928 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-24 06:46:07,940 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-24 06:46:07,967 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-10-24 06:46:07,976 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-10-24 06:46:08,007 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-10-24 06:46:08,007 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2024-10-24 06:46:08,008 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2024-10-24 06:46:08,008 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-10-24 06:46:08,008 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-10-24 06:46:08,008 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-10-24 06:46:08,081 INFO L238 CfgBuilder]: Building ICFG [2024-10-24 06:46:08,084 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-10-24 06:46:08,463 INFO L? ?]: Removed 20 outVars from TransFormulas that were not future-live. [2024-10-24 06:46:08,463 INFO L287 CfgBuilder]: Performing block encoding [2024-10-24 06:46:08,500 INFO L309 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-10-24 06:46:08,500 INFO L314 CfgBuilder]: Removed 1 assume(true) statements. [2024-10-24 06:46:08,501 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 24.10 06:46:08 BoogieIcfgContainer [2024-10-24 06:46:08,501 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-10-24 06:46:08,502 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-10-24 06:46:08,502 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-10-24 06:46:08,505 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-10-24 06:46:08,505 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 24.10 06:46:07" (1/3) ... [2024-10-24 06:46:08,507 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@778105d8 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 24.10 06:46:08, skipping insertion in model container [2024-10-24 06:46:08,507 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 06:46:07" (2/3) ... [2024-10-24 06:46:08,508 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@778105d8 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 24.10 06:46:08, skipping insertion in model container [2024-10-24 06:46:08,508 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 24.10 06:46:08" (3/3) ... [2024-10-24 06:46:08,509 INFO L112 eAbstractionObserver]: Analyzing ICFG hardness_fillercode_fillercodesize_ps-cn-50_file-59.i [2024-10-24 06:46:08,522 INFO L209 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-10-24 06:46:08,522 INFO L149 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-10-24 06:46:08,588 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-10-24 06:46:08,594 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;@3dfc7f25, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-10-24 06:46:08,598 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-10-24 06:46:08,602 INFO L276 IsEmpty]: Start isEmpty. Operand has 98 states, 61 states have (on average 1.5081967213114753) internal successors, (92), 62 states have internal predecessors, (92), 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-10-24 06:46:08,619 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 212 [2024-10-24 06:46:08,619 INFO L207 NwaCegarLoop]: Found error trace [2024-10-24 06:46:08,620 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] [2024-10-24 06:46:08,620 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-24 06:46:08,625 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 06:46:08,625 INFO L85 PathProgramCache]: Analyzing trace with hash 1555441975, now seen corresponding path program 1 times [2024-10-24 06:46:08,632 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-24 06:46:08,632 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [558900747] [2024-10-24 06:46:08,632 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 06:46:08,633 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-24 06:46:08,750 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 06:46:08,929 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-24 06:46:08,932 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 06:46:08,939 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2024-10-24 06:46:08,941 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 06:46:08,942 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2024-10-24 06:46:08,946 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 06:46:08,948 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2024-10-24 06:46:08,952 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 06:46:08,954 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2024-10-24 06:46:08,959 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 06:46:08,961 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-10-24 06:46:08,964 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 06:46:08,966 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 34 [2024-10-24 06:46:08,967 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 06:46:08,970 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2024-10-24 06:46:08,972 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 06:46:08,976 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 46 [2024-10-24 06:46:08,979 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 06:46:08,981 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 52 [2024-10-24 06:46:08,983 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 06:46:08,985 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 58 [2024-10-24 06:46:08,987 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 06:46:08,992 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 63 [2024-10-24 06:46:08,993 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 06:46:08,994 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 69 [2024-10-24 06:46:08,997 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 06:46:08,998 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2024-10-24 06:46:08,999 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 06:46:09,001 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 80 [2024-10-24 06:46:09,003 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 06:46:09,004 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 86 [2024-10-24 06:46:09,006 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 06:46:09,008 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 92 [2024-10-24 06:46:09,010 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 06:46:09,011 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 97 [2024-10-24 06:46:09,012 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 06:46:09,016 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 103 [2024-10-24 06:46:09,017 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 06:46:09,021 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 108 [2024-10-24 06:46:09,022 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 06:46:09,023 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 113 [2024-10-24 06:46:09,026 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 06:46:09,028 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 119 [2024-10-24 06:46:09,029 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 06:46:09,031 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 124 [2024-10-24 06:46:09,034 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 06:46:09,035 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 130 [2024-10-24 06:46:09,037 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 06:46:09,041 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 135 [2024-10-24 06:46:09,042 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 06:46:09,044 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 141 [2024-10-24 06:46:09,047 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 06:46:09,050 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 147 [2024-10-24 06:46:09,051 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 06:46:09,054 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 152 [2024-10-24 06:46:09,055 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 06:46:09,057 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 158 [2024-10-24 06:46:09,059 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 06:46:09,060 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 163 [2024-10-24 06:46:09,064 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 06:46:09,066 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 169 [2024-10-24 06:46:09,067 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 06:46:09,068 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 174 [2024-10-24 06:46:09,070 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 06:46:09,072 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 180 [2024-10-24 06:46:09,073 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 06:46:09,075 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 185 [2024-10-24 06:46:09,077 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 06:46:09,080 INFO L134 CoverageAnalysis]: Checked inductivity of 2244 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2244 trivial. 0 not checked. [2024-10-24 06:46:09,082 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-24 06:46:09,082 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [558900747] [2024-10-24 06:46:09,083 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [558900747] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-24 06:46:09,083 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-24 06:46:09,083 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-24 06:46:09,085 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [597210435] [2024-10-24 06:46:09,085 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-24 06:46:09,090 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-10-24 06:46:09,090 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-24 06:46:09,152 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-10-24 06:46:09,152 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-10-24 06:46:09,155 INFO L87 Difference]: Start difference. First operand has 98 states, 61 states have (on average 1.5081967213114753) internal successors, (92), 62 states have internal predecessors, (92), 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 22.0) internal successors, (44), 2 states have internal predecessors, (44), 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-10-24 06:46:09,198 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-24 06:46:09,199 INFO L93 Difference]: Finished difference Result 193 states and 352 transitions. [2024-10-24 06:46:09,200 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-10-24 06:46:09,201 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 22.0) internal successors, (44), 2 states have internal predecessors, (44), 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 211 [2024-10-24 06:46:09,201 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-24 06:46:09,211 INFO L225 Difference]: With dead ends: 193 [2024-10-24 06:46:09,211 INFO L226 Difference]: Without dead ends: 96 [2024-10-24 06:46:09,215 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-10-24 06:46:09,218 INFO L432 NwaCegarLoop]: 151 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 3 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 151 SdHoareTripleChecker+Invalid, 3 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 3 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-24 06:46:09,220 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 151 Invalid, 3 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 3 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-24 06:46:09,233 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 96 states. [2024-10-24 06:46:09,261 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 96 to 96. [2024-10-24 06:46:09,263 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 96 states, 60 states have (on average 1.4333333333333333) internal successors, (86), 60 states have internal predecessors, (86), 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-10-24 06:46:09,265 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 96 states to 96 states and 154 transitions. [2024-10-24 06:46:09,267 INFO L78 Accepts]: Start accepts. Automaton has 96 states and 154 transitions. Word has length 211 [2024-10-24 06:46:09,267 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-24 06:46:09,267 INFO L471 AbstractCegarLoop]: Abstraction has 96 states and 154 transitions. [2024-10-24 06:46:09,267 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 22.0) internal successors, (44), 2 states have internal predecessors, (44), 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-10-24 06:46:09,268 INFO L276 IsEmpty]: Start isEmpty. Operand 96 states and 154 transitions. [2024-10-24 06:46:09,270 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 212 [2024-10-24 06:46:09,271 INFO L207 NwaCegarLoop]: Found error trace [2024-10-24 06:46:09,271 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] [2024-10-24 06:46:09,271 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-10-24 06:46:09,271 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-24 06:46:09,272 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 06:46:09,272 INFO L85 PathProgramCache]: Analyzing trace with hash 1949372287, now seen corresponding path program 1 times [2024-10-24 06:46:09,272 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-24 06:46:09,272 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1834371897] [2024-10-24 06:46:09,272 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 06:46:09,273 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-24 06:46:09,324 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 06:46:09,519 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-24 06:46:09,520 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 06:46:09,528 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2024-10-24 06:46:09,529 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 06:46:09,533 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2024-10-24 06:46:09,535 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 06:46:09,537 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2024-10-24 06:46:09,539 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 06:46:09,542 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2024-10-24 06:46:09,543 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 06:46:09,545 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-10-24 06:46:09,546 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 06:46:09,548 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 34 [2024-10-24 06:46:09,551 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 06:46:09,552 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2024-10-24 06:46:09,556 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 06:46:09,558 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 46 [2024-10-24 06:46:09,559 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 06:46:09,563 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 52 [2024-10-24 06:46:09,569 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 06:46:09,571 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 58 [2024-10-24 06:46:09,576 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 06:46:09,578 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 63 [2024-10-24 06:46:09,583 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 06:46:09,585 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 69 [2024-10-24 06:46:09,589 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 06:46:09,591 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2024-10-24 06:46:09,596 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 06:46:09,598 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 80 [2024-10-24 06:46:09,600 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 06:46:09,604 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 86 [2024-10-24 06:46:09,606 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 06:46:09,608 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 92 [2024-10-24 06:46:09,610 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 06:46:09,611 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 97 [2024-10-24 06:46:09,614 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 06:46:09,620 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 103 [2024-10-24 06:46:09,621 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 06:46:09,623 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 108 [2024-10-24 06:46:09,627 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 06:46:09,629 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 113 [2024-10-24 06:46:09,632 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 06:46:09,637 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 119 [2024-10-24 06:46:09,639 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 06:46:09,642 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 124 [2024-10-24 06:46:09,644 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 06:46:09,646 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 130 [2024-10-24 06:46:09,647 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 06:46:09,649 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 135 [2024-10-24 06:46:09,650 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 06:46:09,652 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 141 [2024-10-24 06:46:09,654 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 06:46:09,656 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 147 [2024-10-24 06:46:09,661 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 06:46:09,665 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 152 [2024-10-24 06:46:09,667 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 06:46:09,670 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 158 [2024-10-24 06:46:09,672 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 06:46:09,678 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 163 [2024-10-24 06:46:09,680 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 06:46:09,683 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 169 [2024-10-24 06:46:09,685 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 06:46:09,686 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 174 [2024-10-24 06:46:09,688 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 06:46:09,694 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 180 [2024-10-24 06:46:09,700 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 06:46:09,702 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 185 [2024-10-24 06:46:09,707 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 06:46:09,710 INFO L134 CoverageAnalysis]: Checked inductivity of 2244 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2244 trivial. 0 not checked. [2024-10-24 06:46:09,710 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-24 06:46:09,710 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1834371897] [2024-10-24 06:46:09,711 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1834371897] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-24 06:46:09,711 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-24 06:46:09,711 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-10-24 06:46:09,711 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1903064869] [2024-10-24 06:46:09,711 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-24 06:46:09,729 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-10-24 06:46:09,729 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-24 06:46:09,730 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-10-24 06:46:09,730 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2024-10-24 06:46:09,731 INFO L87 Difference]: Start difference. First operand 96 states and 154 transitions. Second operand has 4 states, 4 states have (on average 11.0) internal successors, (44), 4 states have internal predecessors, (44), 1 states have call successors, (34), 1 states have call predecessors, (34), 1 states have return successors, (34), 1 states have call predecessors, (34), 1 states have call successors, (34) [2024-10-24 06:46:09,863 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-24 06:46:09,863 INFO L93 Difference]: Finished difference Result 286 states and 460 transitions. [2024-10-24 06:46:09,864 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-24 06:46:09,864 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 11.0) internal successors, (44), 4 states have internal predecessors, (44), 1 states have call successors, (34), 1 states have call predecessors, (34), 1 states have return successors, (34), 1 states have call predecessors, (34), 1 states have call successors, (34) Word has length 211 [2024-10-24 06:46:09,866 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-24 06:46:09,870 INFO L225 Difference]: With dead ends: 286 [2024-10-24 06:46:09,871 INFO L226 Difference]: Without dead ends: 191 [2024-10-24 06:46:09,872 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 71 GetRequests, 69 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2024-10-24 06:46:09,875 INFO L432 NwaCegarLoop]: 179 mSDtfsCounter, 149 mSDsluCounter, 131 mSDsCounter, 0 mSdLazyCounter, 33 mSolverCounterSat, 35 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 149 SdHoareTripleChecker+Valid, 310 SdHoareTripleChecker+Invalid, 68 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 35 IncrementalHoareTripleChecker+Valid, 33 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-24 06:46:09,875 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [149 Valid, 310 Invalid, 68 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [35 Valid, 33 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-24 06:46:09,876 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 191 states. [2024-10-24 06:46:09,912 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 191 to 189. [2024-10-24 06:46:09,914 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 189 states, 118 states have (on average 1.423728813559322) internal successors, (168), 118 states have internal predecessors, (168), 68 states have call successors, (68), 2 states have call predecessors, (68), 2 states have return successors, (68), 68 states have call predecessors, (68), 68 states have call successors, (68) [2024-10-24 06:46:09,916 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 189 states to 189 states and 304 transitions. [2024-10-24 06:46:09,919 INFO L78 Accepts]: Start accepts. Automaton has 189 states and 304 transitions. Word has length 211 [2024-10-24 06:46:09,920 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-24 06:46:09,920 INFO L471 AbstractCegarLoop]: Abstraction has 189 states and 304 transitions. [2024-10-24 06:46:09,920 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 11.0) internal successors, (44), 4 states have internal predecessors, (44), 1 states have call successors, (34), 1 states have call predecessors, (34), 1 states have return successors, (34), 1 states have call predecessors, (34), 1 states have call successors, (34) [2024-10-24 06:46:09,921 INFO L276 IsEmpty]: Start isEmpty. Operand 189 states and 304 transitions. [2024-10-24 06:46:09,924 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 212 [2024-10-24 06:46:09,927 INFO L207 NwaCegarLoop]: Found error trace [2024-10-24 06:46:09,927 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] [2024-10-24 06:46:09,928 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-10-24 06:46:09,928 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-24 06:46:09,928 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 06:46:09,929 INFO L85 PathProgramCache]: Analyzing trace with hash -656651267, now seen corresponding path program 1 times [2024-10-24 06:46:09,929 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-24 06:46:09,929 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1503064755] [2024-10-24 06:46:09,929 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 06:46:09,929 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-24 06:46:09,983 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 06:46:10,221 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-24 06:46:10,222 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 06:46:10,225 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2024-10-24 06:46:10,228 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 06:46:10,229 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2024-10-24 06:46:10,230 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 06:46:10,233 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2024-10-24 06:46:10,235 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 06:46:10,237 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2024-10-24 06:46:10,238 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 06:46:10,240 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-10-24 06:46:10,242 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 06:46:10,246 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 34 [2024-10-24 06:46:10,247 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 06:46:10,249 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2024-10-24 06:46:10,251 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 06:46:10,252 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 46 [2024-10-24 06:46:10,253 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 06:46:10,254 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 52 [2024-10-24 06:46:10,259 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 06:46:10,261 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 58 [2024-10-24 06:46:10,268 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 06:46:10,269 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 63 [2024-10-24 06:46:10,270 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 06:46:10,273 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 69 [2024-10-24 06:46:10,275 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 06:46:10,278 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2024-10-24 06:46:10,279 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 06:46:10,282 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 80 [2024-10-24 06:46:10,283 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 06:46:10,284 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 86 [2024-10-24 06:46:10,287 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 06:46:10,288 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 92 [2024-10-24 06:46:10,291 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 06:46:10,293 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 97 [2024-10-24 06:46:10,295 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 06:46:10,297 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 103 [2024-10-24 06:46:10,298 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 06:46:10,299 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 108 [2024-10-24 06:46:10,300 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 06:46:10,301 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 113 [2024-10-24 06:46:10,302 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 06:46:10,303 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 119 [2024-10-24 06:46:10,304 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 06:46:10,305 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 124 [2024-10-24 06:46:10,306 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 06:46:10,307 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 130 [2024-10-24 06:46:10,308 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 06:46:10,309 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 135 [2024-10-24 06:46:10,310 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 06:46:10,311 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 141 [2024-10-24 06:46:10,312 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 06:46:10,313 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 147 [2024-10-24 06:46:10,314 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 06:46:10,315 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 152 [2024-10-24 06:46:10,316 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 06:46:10,317 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 158 [2024-10-24 06:46:10,318 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 06:46:10,319 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 163 [2024-10-24 06:46:10,320 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 06:46:10,322 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 169 [2024-10-24 06:46:10,322 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 06:46:10,323 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 174 [2024-10-24 06:46:10,324 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 06:46:10,326 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 180 [2024-10-24 06:46:10,341 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 06:46:10,343 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 185 [2024-10-24 06:46:10,344 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 06:46:10,347 INFO L134 CoverageAnalysis]: Checked inductivity of 2244 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2244 trivial. 0 not checked. [2024-10-24 06:46:10,347 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-24 06:46:10,347 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1503064755] [2024-10-24 06:46:10,347 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1503064755] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-24 06:46:10,347 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-24 06:46:10,348 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-10-24 06:46:10,348 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [413238503] [2024-10-24 06:46:10,348 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-24 06:46:10,349 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-10-24 06:46:10,349 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-24 06:46:10,349 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-10-24 06:46:10,350 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-10-24 06:46:10,350 INFO L87 Difference]: Start difference. First operand 189 states and 304 transitions. Second operand has 4 states, 4 states have (on average 11.0) internal successors, (44), 4 states have internal predecessors, (44), 1 states have call successors, (34), 1 states have call predecessors, (34), 1 states have return successors, (34), 1 states have call predecessors, (34), 1 states have call successors, (34) [2024-10-24 06:46:10,538 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-24 06:46:10,539 INFO L93 Difference]: Finished difference Result 507 states and 817 transitions. [2024-10-24 06:46:10,539 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-10-24 06:46:10,540 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 11.0) internal successors, (44), 4 states have internal predecessors, (44), 1 states have call successors, (34), 1 states have call predecessors, (34), 1 states have return successors, (34), 1 states have call predecessors, (34), 1 states have call successors, (34) Word has length 211 [2024-10-24 06:46:10,540 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-24 06:46:10,547 INFO L225 Difference]: With dead ends: 507 [2024-10-24 06:46:10,547 INFO L226 Difference]: Without dead ends: 319 [2024-10-24 06:46:10,548 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 74 GetRequests, 71 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2024-10-24 06:46:10,549 INFO L432 NwaCegarLoop]: 150 mSDtfsCounter, 117 mSDsluCounter, 299 mSDsCounter, 0 mSdLazyCounter, 11 mSolverCounterSat, 103 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 117 SdHoareTripleChecker+Valid, 449 SdHoareTripleChecker+Invalid, 114 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 103 IncrementalHoareTripleChecker+Valid, 11 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-24 06:46:10,550 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [117 Valid, 449 Invalid, 114 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [103 Valid, 11 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-24 06:46:10,551 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 319 states. [2024-10-24 06:46:10,604 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 319 to 285. [2024-10-24 06:46:10,608 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 285 states, 179 states have (on average 1.4245810055865922) internal successors, (255), 179 states have internal predecessors, (255), 102 states have call successors, (102), 3 states have call predecessors, (102), 3 states have return successors, (102), 102 states have call predecessors, (102), 102 states have call successors, (102) [2024-10-24 06:46:10,610 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 285 states to 285 states and 459 transitions. [2024-10-24 06:46:10,613 INFO L78 Accepts]: Start accepts. Automaton has 285 states and 459 transitions. Word has length 211 [2024-10-24 06:46:10,614 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-24 06:46:10,614 INFO L471 AbstractCegarLoop]: Abstraction has 285 states and 459 transitions. [2024-10-24 06:46:10,615 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 11.0) internal successors, (44), 4 states have internal predecessors, (44), 1 states have call successors, (34), 1 states have call predecessors, (34), 1 states have return successors, (34), 1 states have call predecessors, (34), 1 states have call successors, (34) [2024-10-24 06:46:10,615 INFO L276 IsEmpty]: Start isEmpty. Operand 285 states and 459 transitions. [2024-10-24 06:46:10,618 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 213 [2024-10-24 06:46:10,618 INFO L207 NwaCegarLoop]: Found error trace [2024-10-24 06:46:10,618 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] [2024-10-24 06:46:10,619 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-10-24 06:46:10,619 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-24 06:46:10,619 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 06:46:10,619 INFO L85 PathProgramCache]: Analyzing trace with hash 890353917, now seen corresponding path program 1 times [2024-10-24 06:46:10,620 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-24 06:46:10,620 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [106893875] [2024-10-24 06:46:10,620 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 06:46:10,620 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-24 06:46:10,740 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 06:46:11,082 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-24 06:46:11,083 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 06:46:11,085 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2024-10-24 06:46:11,086 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 06:46:11,087 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2024-10-24 06:46:11,087 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 06:46:11,089 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2024-10-24 06:46:11,089 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 06:46:11,091 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2024-10-24 06:46:11,091 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 06:46:11,093 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-10-24 06:46:11,093 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 06:46:11,095 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 34 [2024-10-24 06:46:11,096 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 06:46:11,097 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2024-10-24 06:46:11,098 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 06:46:11,099 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 46 [2024-10-24 06:46:11,100 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 06:46:11,101 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 52 [2024-10-24 06:46:11,102 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 06:46:11,103 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 58 [2024-10-24 06:46:11,104 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 06:46:11,105 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 63 [2024-10-24 06:46:11,106 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 06:46:11,107 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 69 [2024-10-24 06:46:11,108 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 06:46:11,109 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2024-10-24 06:46:11,110 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 06:46:11,112 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 80 [2024-10-24 06:46:11,113 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 06:46:11,115 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 86 [2024-10-24 06:46:11,116 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 06:46:11,117 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 92 [2024-10-24 06:46:11,118 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 06:46:11,119 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 97 [2024-10-24 06:46:11,121 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 06:46:11,122 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 103 [2024-10-24 06:46:11,123 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 06:46:11,124 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 108 [2024-10-24 06:46:11,125 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 06:46:11,126 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 113 [2024-10-24 06:46:11,128 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 06:46:11,129 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 119 [2024-10-24 06:46:11,130 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 06:46:11,132 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 124 [2024-10-24 06:46:11,133 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 06:46:11,134 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 130 [2024-10-24 06:46:11,135 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 06:46:11,136 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 135 [2024-10-24 06:46:11,137 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 06:46:11,139 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 141 [2024-10-24 06:46:11,140 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 06:46:11,141 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 147 [2024-10-24 06:46:11,142 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 06:46:11,144 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 152 [2024-10-24 06:46:11,145 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 06:46:11,146 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 158 [2024-10-24 06:46:11,147 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 06:46:11,148 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 163 [2024-10-24 06:46:11,150 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 06:46:11,151 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 169 [2024-10-24 06:46:11,152 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 06:46:11,153 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 174 [2024-10-24 06:46:11,154 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 06:46:11,155 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 180 [2024-10-24 06:46:11,157 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 06:46:11,158 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 185 [2024-10-24 06:46:11,159 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 06:46:11,161 INFO L134 CoverageAnalysis]: Checked inductivity of 2244 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2244 trivial. 0 not checked. [2024-10-24 06:46:11,161 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-24 06:46:11,161 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [106893875] [2024-10-24 06:46:11,161 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [106893875] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-24 06:46:11,161 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-24 06:46:11,162 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-10-24 06:46:11,162 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1366691900] [2024-10-24 06:46:11,162 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-24 06:46:11,162 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-10-24 06:46:11,162 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-24 06:46:11,163 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-10-24 06:46:11,163 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2024-10-24 06:46:11,163 INFO L87 Difference]: Start difference. First operand 285 states and 459 transitions. Second operand has 6 states, 6 states have (on average 7.5) internal successors, (45), 6 states have internal predecessors, (45), 1 states have call successors, (34), 1 states have call predecessors, (34), 1 states have return successors, (34), 1 states have call predecessors, (34), 1 states have call successors, (34) [2024-10-24 06:46:11,458 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-24 06:46:11,458 INFO L93 Difference]: Finished difference Result 677 states and 1086 transitions. [2024-10-24 06:46:11,459 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-10-24 06:46:11,459 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 7.5) internal successors, (45), 6 states have internal predecessors, (45), 1 states have call successors, (34), 1 states have call predecessors, (34), 1 states have return successors, (34), 1 states have call predecessors, (34), 1 states have call successors, (34) Word has length 212 [2024-10-24 06:46:11,460 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-24 06:46:11,463 INFO L225 Difference]: With dead ends: 677 [2024-10-24 06:46:11,463 INFO L226 Difference]: Without dead ends: 489 [2024-10-24 06:46:11,464 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 78 GetRequests, 72 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=23, Invalid=33, Unknown=0, NotChecked=0, Total=56 [2024-10-24 06:46:11,464 INFO L432 NwaCegarLoop]: 150 mSDtfsCounter, 163 mSDsluCounter, 515 mSDsCounter, 0 mSdLazyCounter, 122 mSolverCounterSat, 139 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 163 SdHoareTripleChecker+Valid, 665 SdHoareTripleChecker+Invalid, 261 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 139 IncrementalHoareTripleChecker+Valid, 122 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-10-24 06:46:11,465 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [163 Valid, 665 Invalid, 261 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [139 Valid, 122 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-10-24 06:46:11,466 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 489 states. [2024-10-24 06:46:11,503 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 489 to 471. [2024-10-24 06:46:11,504 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 471 states, 295 states have (on average 1.4135593220338982) internal successors, (417), 295 states have internal predecessors, (417), 170 states have call successors, (170), 5 states have call predecessors, (170), 5 states have return successors, (170), 170 states have call predecessors, (170), 170 states have call successors, (170) [2024-10-24 06:46:11,506 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 471 states to 471 states and 757 transitions. [2024-10-24 06:46:11,507 INFO L78 Accepts]: Start accepts. Automaton has 471 states and 757 transitions. Word has length 212 [2024-10-24 06:46:11,508 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-24 06:46:11,508 INFO L471 AbstractCegarLoop]: Abstraction has 471 states and 757 transitions. [2024-10-24 06:46:11,508 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 7.5) internal successors, (45), 6 states have internal predecessors, (45), 1 states have call successors, (34), 1 states have call predecessors, (34), 1 states have return successors, (34), 1 states have call predecessors, (34), 1 states have call successors, (34) [2024-10-24 06:46:11,508 INFO L276 IsEmpty]: Start isEmpty. Operand 471 states and 757 transitions. [2024-10-24 06:46:11,509 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 214 [2024-10-24 06:46:11,510 INFO L207 NwaCegarLoop]: Found error trace [2024-10-24 06:46:11,510 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] [2024-10-24 06:46:11,510 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2024-10-24 06:46:11,510 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-24 06:46:11,510 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 06:46:11,510 INFO L85 PathProgramCache]: Analyzing trace with hash -816328344, now seen corresponding path program 1 times [2024-10-24 06:46:11,511 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-24 06:46:11,511 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1948353806] [2024-10-24 06:46:11,511 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 06:46:11,511 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-24 06:46:11,640 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unknown [2024-10-24 06:46:11,643 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [2144834872] [2024-10-24 06:46:11,643 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 06:46:11,643 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-24 06:46:11,644 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-24 06:46:11,645 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-10-24 06:46:11,647 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-10-24 06:46:11,914 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 06:46:11,922 INFO L255 TraceCheckSpWp]: Trace formula consists of 498 conjuncts, 37 conjuncts are in the unsatisfiable core [2024-10-24 06:46:11,935 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-24 06:46:14,530 INFO L134 CoverageAnalysis]: Checked inductivity of 2244 backedges. 429 proven. 405 refuted. 0 times theorem prover too weak. 1410 trivial. 0 not checked. [2024-10-24 06:46:14,531 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-24 06:46:27,981 WARN L286 SmtUtils]: Spent 7.31s on a formula simplification that was a NOOP. DAG size: 45 (called from [L 388] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2024-10-24 06:46:51,772 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse3 (mod c_~var_1_4~0 256)) (.cse4 (mod c_~var_1_19~0 4294967296))) (let ((.cse1 (+ .cse4 1)) (.cse2 (div (mod c_~var_1_6~0 65536) .cse3)) (.cse0 (mod (+ .cse3 c_~var_1_7~0) 65536))) (and (or (< .cse0 .cse1) (< 65535 (mod (* .cse2 .cse0) 4294967296))) (forall ((v_z_7 Int)) (or (< 65535 (mod (* v_z_7 .cse2) 4294967296)) (< (mod c_~var_1_17~0 65536) v_z_7) (< v_z_7 .cse1) (< v_z_7 (+ (mod c_~var_1_7~0 65536) .cse3 1)))) (or (< 65535 (mod (* c_~var_1_19~0 .cse2) 4294967296)) (< .cse4 .cse0))))) is different from false