./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_variablewrapping_wrapper-sp_file-92.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_variablewrapping_wrapper-sp_file-92.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 34a7e7e1117c68f092f781b8dcc8b7b6859e863c3fe77a01a5acd93b0a231d14 --- Real Ultimate output --- This is Ultimate 0.2.5-dev-4a390ef-m [2024-10-24 12:04:39,014 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-10-24 12:04:39,082 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2024-10-24 12:04:39,088 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-10-24 12:04:39,088 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-10-24 12:04:39,107 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-10-24 12:04:39,108 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-10-24 12:04:39,108 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-10-24 12:04:39,108 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-10-24 12:04:39,109 INFO L153 SettingsManager]: * Use memory slicer=true [2024-10-24 12:04:39,109 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-10-24 12:04:39,109 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-10-24 12:04:39,110 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-10-24 12:04:39,110 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-10-24 12:04:39,110 INFO L153 SettingsManager]: * Use SBE=true [2024-10-24 12:04:39,111 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-10-24 12:04:39,111 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-10-24 12:04:39,111 INFO L153 SettingsManager]: * sizeof long=4 [2024-10-24 12:04:39,112 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-10-24 12:04:39,112 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-10-24 12:04:39,112 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-10-24 12:04:39,113 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-10-24 12:04:39,113 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-10-24 12:04:39,113 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-10-24 12:04:39,114 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-10-24 12:04:39,114 INFO L153 SettingsManager]: * sizeof long double=12 [2024-10-24 12:04:39,114 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-10-24 12:04:39,114 INFO L153 SettingsManager]: * Use constant arrays=true [2024-10-24 12:04:39,115 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-10-24 12:04:39,115 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-10-24 12:04:39,115 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-10-24 12:04:39,115 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-10-24 12:04:39,116 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-24 12:04:39,116 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-10-24 12:04:39,116 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-10-24 12:04:39,116 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-10-24 12:04:39,117 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-10-24 12:04:39,117 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-10-24 12:04:39,117 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-10-24 12:04:39,117 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-10-24 12:04:39,118 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-10-24 12:04:39,118 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-10-24 12:04:39,118 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 -> 34a7e7e1117c68f092f781b8dcc8b7b6859e863c3fe77a01a5acd93b0a231d14 [2024-10-24 12:04:39,311 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-10-24 12:04:39,329 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-10-24 12:04:39,332 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-10-24 12:04:39,334 INFO L270 PluginConnector]: Initializing CDTParser... [2024-10-24 12:04:39,334 INFO L274 PluginConnector]: CDTParser initialized [2024-10-24 12:04:39,336 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-sp_file-92.i [2024-10-24 12:04:41,153 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-10-24 12:04:41,450 INFO L384 CDTParser]: Found 1 translation units. [2024-10-24 12:04:41,453 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-sp_file-92.i [2024-10-24 12:04:41,465 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/99ab14529/7f06888154a6404c95d177f7eb1b7960/FLAGb5f054b13 [2024-10-24 12:04:41,481 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/99ab14529/7f06888154a6404c95d177f7eb1b7960 [2024-10-24 12:04:41,484 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-10-24 12:04:41,485 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-10-24 12:04:41,488 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-10-24 12:04:41,488 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-10-24 12:04:41,494 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-10-24 12:04:41,494 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 24.10 12:04:41" (1/1) ... [2024-10-24 12:04:41,496 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@4007c8cd and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 12:04:41, skipping insertion in model container [2024-10-24 12:04:41,497 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 24.10 12:04:41" (1/1) ... [2024-10-24 12:04:41,529 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-10-24 12:04:41,702 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_variablewrapping_wrapper-sp_file-92.i[917,930] [2024-10-24 12:04:41,781 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-24 12:04:41,794 INFO L200 MainTranslator]: Completed pre-run [2024-10-24 12:04:41,805 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_variablewrapping_wrapper-sp_file-92.i[917,930] [2024-10-24 12:04:41,843 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-24 12:04:41,869 INFO L204 MainTranslator]: Completed translation [2024-10-24 12:04:41,869 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 12:04:41 WrapperNode [2024-10-24 12:04:41,870 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-10-24 12:04:41,872 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-10-24 12:04:41,872 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-10-24 12:04:41,873 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-10-24 12:04:41,878 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 12:04:41" (1/1) ... [2024-10-24 12:04:41,926 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 12:04:41" (1/1) ... [2024-10-24 12:04:42,031 INFO L138 Inliner]: procedures = 29, calls = 154, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 463 [2024-10-24 12:04:42,032 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-10-24 12:04:42,033 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-10-24 12:04:42,033 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-10-24 12:04:42,033 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-10-24 12:04:42,046 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 12:04:41" (1/1) ... [2024-10-24 12:04:42,046 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 12:04:41" (1/1) ... [2024-10-24 12:04:42,056 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 12:04:41" (1/1) ... [2024-10-24 12:04:42,099 INFO L175 MemorySlicer]: Split 123 memory accesses to 2 slices as follows [2, 121]. 98 percent of accesses are in the largest equivalence class. The 18 initializations are split as follows [2, 16]. The 18 writes are split as follows [0, 18]. [2024-10-24 12:04:42,100 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 12:04:41" (1/1) ... [2024-10-24 12:04:42,103 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 12:04:41" (1/1) ... [2024-10-24 12:04:42,124 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 12:04:41" (1/1) ... [2024-10-24 12:04:42,129 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 12:04:41" (1/1) ... [2024-10-24 12:04:42,132 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 12:04:41" (1/1) ... [2024-10-24 12:04:42,134 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 12:04:41" (1/1) ... [2024-10-24 12:04:42,139 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-10-24 12:04:42,140 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-10-24 12:04:42,140 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-10-24 12:04:42,140 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-10-24 12:04:42,141 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 12:04:41" (1/1) ... [2024-10-24 12:04:42,147 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-24 12:04:42,159 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-24 12:04:42,177 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 12:04:42,181 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 12:04:42,222 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-10-24 12:04:42,223 INFO L130 BoogieDeclarations]: Found specification of procedure read~real#0 [2024-10-24 12:04:42,223 INFO L130 BoogieDeclarations]: Found specification of procedure read~real#1 [2024-10-24 12:04:42,223 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#0 [2024-10-24 12:04:42,223 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#1 [2024-10-24 12:04:42,224 INFO L130 BoogieDeclarations]: Found specification of procedure write~real#0 [2024-10-24 12:04:42,224 INFO L130 BoogieDeclarations]: Found specification of procedure write~real#1 [2024-10-24 12:04:42,224 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#0 [2024-10-24 12:04:42,224 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#1 [2024-10-24 12:04:42,224 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~real#0 [2024-10-24 12:04:42,224 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~real#1 [2024-10-24 12:04:42,225 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2024-10-24 12:04:42,225 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2024-10-24 12:04:42,225 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-10-24 12:04:42,225 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#1 [2024-10-24 12:04:42,225 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-10-24 12:04:42,225 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-10-24 12:04:42,384 INFO L238 CfgBuilder]: Building ICFG [2024-10-24 12:04:42,387 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-10-24 12:04:42,904 INFO L? ?]: Removed 116 outVars from TransFormulas that were not future-live. [2024-10-24 12:04:42,904 INFO L287 CfgBuilder]: Performing block encoding [2024-10-24 12:04:42,935 INFO L309 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-10-24 12:04:42,936 INFO L314 CfgBuilder]: Removed 1 assume(true) statements. [2024-10-24 12:04:42,936 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 24.10 12:04:42 BoogieIcfgContainer [2024-10-24 12:04:42,936 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-10-24 12:04:42,938 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-10-24 12:04:42,939 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-10-24 12:04:42,942 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-10-24 12:04:42,942 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 24.10 12:04:41" (1/3) ... [2024-10-24 12:04:42,943 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@326b50db and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 24.10 12:04:42, skipping insertion in model container [2024-10-24 12:04:42,943 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 12:04:41" (2/3) ... [2024-10-24 12:04:42,944 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@326b50db and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 24.10 12:04:42, skipping insertion in model container [2024-10-24 12:04:42,944 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 24.10 12:04:42" (3/3) ... [2024-10-24 12:04:42,945 INFO L112 eAbstractionObserver]: Analyzing ICFG hardness_variablewrapping_wrapper-sp_file-92.i [2024-10-24 12:04:42,962 INFO L209 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-10-24 12:04:42,963 INFO L149 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-10-24 12:04:43,025 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-10-24 12:04:43,032 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;@b2fb20b, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-10-24 12:04:43,033 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-10-24 12:04:43,038 INFO L276 IsEmpty]: Start isEmpty. Operand has 106 states, 84 states have (on average 1.4047619047619047) internal successors, (118), 85 states have internal predecessors, (118), 19 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 19 states have call predecessors, (19), 19 states have call successors, (19) [2024-10-24 12:04:43,051 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 149 [2024-10-24 12:04:43,052 INFO L207 NwaCegarLoop]: Found error trace [2024-10-24 12:04:43,053 INFO L215 NwaCegarLoop]: trace histogram [19, 19, 19, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 12:04:43,053 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-24 12:04:43,059 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 12:04:43,059 INFO L85 PathProgramCache]: Analyzing trace with hash -1340131898, now seen corresponding path program 1 times [2024-10-24 12:04:43,068 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-24 12:04:43,069 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [832748718] [2024-10-24 12:04:43,069 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 12:04:43,070 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-24 12:04:43,286 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 12:04:43,508 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-24 12:04:43,511 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 12:04:43,523 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2024-10-24 12:04:43,530 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 12:04:43,537 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2024-10-24 12:04:43,543 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 12:04:43,546 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2024-10-24 12:04:43,551 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 12:04:43,556 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2024-10-24 12:04:43,560 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 12:04:43,563 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-10-24 12:04:43,566 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 12:04:43,569 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-10-24 12:04:43,572 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 12:04:43,579 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2024-10-24 12:04:43,584 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 12:04:43,590 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2024-10-24 12:04:43,595 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 12:04:43,604 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2024-10-24 12:04:43,607 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 12:04:43,614 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2024-10-24 12:04:43,621 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 12:04:43,628 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2024-10-24 12:04:43,635 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 12:04:43,643 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 80 [2024-10-24 12:04:43,648 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 12:04:43,656 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 86 [2024-10-24 12:04:43,659 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 12:04:43,662 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 92 [2024-10-24 12:04:43,664 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 12:04:43,672 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 98 [2024-10-24 12:04:43,679 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 12:04:43,682 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 104 [2024-10-24 12:04:43,687 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 12:04:43,691 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 110 [2024-10-24 12:04:43,697 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 12:04:43,700 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 116 [2024-10-24 12:04:43,703 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 12:04:43,709 INFO L134 CoverageAnalysis]: Checked inductivity of 684 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 684 trivial. 0 not checked. [2024-10-24 12:04:43,712 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-24 12:04:43,713 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [832748718] [2024-10-24 12:04:43,714 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [832748718] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-24 12:04:43,715 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-24 12:04:43,715 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-24 12:04:43,717 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1905065672] [2024-10-24 12:04:43,717 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-24 12:04:43,723 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-10-24 12:04:43,725 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-24 12:04:43,752 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-10-24 12:04:43,753 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-10-24 12:04:43,757 INFO L87 Difference]: Start difference. First operand has 106 states, 84 states have (on average 1.4047619047619047) internal successors, (118), 85 states have internal predecessors, (118), 19 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 19 states have call predecessors, (19), 19 states have call successors, (19) Second operand has 2 states, 2 states have (on average 28.0) internal successors, (56), 2 states have internal predecessors, (56), 2 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 1 states have call predecessors, (19), 2 states have call successors, (19) [2024-10-24 12:04:43,823 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-24 12:04:43,823 INFO L93 Difference]: Finished difference Result 209 states and 329 transitions. [2024-10-24 12:04:43,825 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-10-24 12:04:43,830 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 28.0) internal successors, (56), 2 states have internal predecessors, (56), 2 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 1 states have call predecessors, (19), 2 states have call successors, (19) Word has length 148 [2024-10-24 12:04:43,831 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-24 12:04:43,840 INFO L225 Difference]: With dead ends: 209 [2024-10-24 12:04:43,841 INFO L226 Difference]: Without dead ends: 104 [2024-10-24 12:04:43,846 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 59 GetRequests, 59 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 12:04:43,849 INFO L432 NwaCegarLoop]: 147 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 4 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 147 SdHoareTripleChecker+Invalid, 4 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 4 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-24 12:04:43,851 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 147 Invalid, 4 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 4 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-24 12:04:43,865 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 104 states. [2024-10-24 12:04:43,893 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 104 to 104. [2024-10-24 12:04:43,897 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 104 states, 83 states have (on average 1.3614457831325302) internal successors, (113), 83 states have internal predecessors, (113), 19 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 19 states have call predecessors, (19), 19 states have call successors, (19) [2024-10-24 12:04:43,899 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 104 states to 104 states and 151 transitions. [2024-10-24 12:04:43,901 INFO L78 Accepts]: Start accepts. Automaton has 104 states and 151 transitions. Word has length 148 [2024-10-24 12:04:43,901 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-24 12:04:43,902 INFO L471 AbstractCegarLoop]: Abstraction has 104 states and 151 transitions. [2024-10-24 12:04:43,929 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 28.0) internal successors, (56), 2 states have internal predecessors, (56), 2 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 1 states have call predecessors, (19), 2 states have call successors, (19) [2024-10-24 12:04:43,929 INFO L276 IsEmpty]: Start isEmpty. Operand 104 states and 151 transitions. [2024-10-24 12:04:43,932 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 149 [2024-10-24 12:04:43,932 INFO L207 NwaCegarLoop]: Found error trace [2024-10-24 12:04:43,932 INFO L215 NwaCegarLoop]: trace histogram [19, 19, 19, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 12:04:43,932 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-10-24 12:04:43,936 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-24 12:04:43,938 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 12:04:43,938 INFO L85 PathProgramCache]: Analyzing trace with hash 86622116, now seen corresponding path program 1 times [2024-10-24 12:04:43,938 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-24 12:04:43,939 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1615340447] [2024-10-24 12:04:43,939 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 12:04:43,940 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-24 12:04:44,029 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 12:04:44,290 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-24 12:04:44,292 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 12:04:44,295 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2024-10-24 12:04:44,297 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 12:04:44,298 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2024-10-24 12:04:44,299 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 12:04:44,302 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2024-10-24 12:04:44,303 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 12:04:44,304 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2024-10-24 12:04:44,309 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 12:04:44,311 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-10-24 12:04:44,314 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 12:04:44,316 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-10-24 12:04:44,317 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 12:04:44,318 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2024-10-24 12:04:44,320 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 12:04:44,322 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2024-10-24 12:04:44,326 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 12:04:44,328 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2024-10-24 12:04:44,330 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 12:04:44,331 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2024-10-24 12:04:44,333 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 12:04:44,335 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2024-10-24 12:04:44,338 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 12:04:44,341 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 80 [2024-10-24 12:04:44,346 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 12:04:44,347 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 86 [2024-10-24 12:04:44,352 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 12:04:44,354 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 92 [2024-10-24 12:04:44,357 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 12:04:44,360 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 98 [2024-10-24 12:04:44,361 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 12:04:44,365 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 104 [2024-10-24 12:04:44,366 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 12:04:44,368 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 110 [2024-10-24 12:04:44,369 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 12:04:44,372 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 116 [2024-10-24 12:04:44,374 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 12:04:44,377 INFO L134 CoverageAnalysis]: Checked inductivity of 684 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 684 trivial. 0 not checked. [2024-10-24 12:04:44,378 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-24 12:04:44,378 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1615340447] [2024-10-24 12:04:44,379 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1615340447] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-24 12:04:44,379 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-24 12:04:44,379 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-10-24 12:04:44,379 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [737886771] [2024-10-24 12:04:44,380 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-24 12:04:44,381 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-10-24 12:04:44,382 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-24 12:04:44,383 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-10-24 12:04:44,384 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-10-24 12:04:44,384 INFO L87 Difference]: Start difference. First operand 104 states and 151 transitions. Second operand has 4 states, 4 states have (on average 14.0) internal successors, (56), 4 states have internal predecessors, (56), 2 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 2 states have call predecessors, (19), 2 states have call successors, (19) [2024-10-24 12:04:44,433 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-24 12:04:44,437 INFO L93 Difference]: Finished difference Result 209 states and 304 transitions. [2024-10-24 12:04:44,437 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-10-24 12:04:44,437 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 14.0) internal successors, (56), 4 states have internal predecessors, (56), 2 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 2 states have call predecessors, (19), 2 states have call successors, (19) Word has length 148 [2024-10-24 12:04:44,438 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-24 12:04:44,440 INFO L225 Difference]: With dead ends: 209 [2024-10-24 12:04:44,441 INFO L226 Difference]: Without dead ends: 106 [2024-10-24 12:04:44,442 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 42 GetRequests, 40 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-10-24 12:04:44,444 INFO L432 NwaCegarLoop]: 145 mSDtfsCounter, 0 mSDsluCounter, 283 mSDsCounter, 0 mSdLazyCounter, 24 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 428 SdHoareTripleChecker+Invalid, 24 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 24 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-24 12:04:44,444 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 428 Invalid, 24 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 24 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-24 12:04:44,445 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 106 states. [2024-10-24 12:04:44,457 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 106 to 106. [2024-10-24 12:04:44,458 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 106 states, 85 states have (on average 1.3529411764705883) internal successors, (115), 85 states have internal predecessors, (115), 19 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 19 states have call predecessors, (19), 19 states have call successors, (19) [2024-10-24 12:04:44,460 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 106 states to 106 states and 153 transitions. [2024-10-24 12:04:44,461 INFO L78 Accepts]: Start accepts. Automaton has 106 states and 153 transitions. Word has length 148 [2024-10-24 12:04:44,462 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-24 12:04:44,462 INFO L471 AbstractCegarLoop]: Abstraction has 106 states and 153 transitions. [2024-10-24 12:04:44,463 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 14.0) internal successors, (56), 4 states have internal predecessors, (56), 2 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 2 states have call predecessors, (19), 2 states have call successors, (19) [2024-10-24 12:04:44,463 INFO L276 IsEmpty]: Start isEmpty. Operand 106 states and 153 transitions. [2024-10-24 12:04:44,466 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 149 [2024-10-24 12:04:44,467 INFO L207 NwaCegarLoop]: Found error trace [2024-10-24 12:04:44,467 INFO L215 NwaCegarLoop]: trace histogram [19, 19, 19, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 12:04:44,467 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-10-24 12:04:44,468 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-24 12:04:44,468 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 12:04:44,468 INFO L85 PathProgramCache]: Analyzing trace with hash 2045196902, now seen corresponding path program 1 times [2024-10-24 12:04:44,468 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-24 12:04:44,469 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1804939381] [2024-10-24 12:04:44,469 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 12:04:44,469 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-24 12:04:44,543 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 12:04:44,692 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-24 12:04:44,694 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 12:04:44,695 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2024-10-24 12:04:44,696 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 12:04:44,697 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2024-10-24 12:04:44,698 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 12:04:44,699 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2024-10-24 12:04:44,700 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 12:04:44,701 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2024-10-24 12:04:44,702 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 12:04:44,703 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-10-24 12:04:44,704 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 12:04:44,705 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-10-24 12:04:44,706 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 12:04:44,707 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2024-10-24 12:04:44,708 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 12:04:44,709 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2024-10-24 12:04:44,710 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 12:04:44,711 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2024-10-24 12:04:44,712 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 12:04:44,713 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2024-10-24 12:04:44,714 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 12:04:44,716 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2024-10-24 12:04:44,717 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 12:04:44,718 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 80 [2024-10-24 12:04:44,719 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 12:04:44,720 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 86 [2024-10-24 12:04:44,720 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 12:04:44,721 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 92 [2024-10-24 12:04:44,723 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 12:04:44,724 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 98 [2024-10-24 12:04:44,725 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 12:04:44,726 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 104 [2024-10-24 12:04:44,726 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 12:04:44,728 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 110 [2024-10-24 12:04:44,728 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 12:04:44,729 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 116 [2024-10-24 12:04:44,730 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 12:04:44,732 INFO L134 CoverageAnalysis]: Checked inductivity of 684 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 684 trivial. 0 not checked. [2024-10-24 12:04:44,732 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-24 12:04:44,733 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1804939381] [2024-10-24 12:04:44,733 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1804939381] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-24 12:04:44,733 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-24 12:04:44,733 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-10-24 12:04:44,733 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1018064113] [2024-10-24 12:04:44,733 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-24 12:04:44,734 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-10-24 12:04:44,734 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-24 12:04:44,735 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-10-24 12:04:44,735 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-10-24 12:04:44,736 INFO L87 Difference]: Start difference. First operand 106 states and 153 transitions. Second operand has 4 states, 4 states have (on average 14.0) internal successors, (56), 4 states have internal predecessors, (56), 1 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 1 states have call predecessors, (19), 1 states have call successors, (19) [2024-10-24 12:04:44,765 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-24 12:04:44,766 INFO L93 Difference]: Finished difference Result 214 states and 309 transitions. [2024-10-24 12:04:44,766 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-10-24 12:04:44,766 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 14.0) internal successors, (56), 4 states have internal predecessors, (56), 1 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 1 states have call predecessors, (19), 1 states have call successors, (19) Word has length 148 [2024-10-24 12:04:44,767 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-24 12:04:44,768 INFO L225 Difference]: With dead ends: 214 [2024-10-24 12:04:44,768 INFO L226 Difference]: Without dead ends: 109 [2024-10-24 12:04:44,769 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 42 GetRequests, 40 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-10-24 12:04:44,770 INFO L432 NwaCegarLoop]: 145 mSDtfsCounter, 1 mSDsluCounter, 283 mSDsCounter, 0 mSdLazyCounter, 23 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 428 SdHoareTripleChecker+Invalid, 24 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 23 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-24 12:04:44,770 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1 Valid, 428 Invalid, 24 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 23 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-24 12:04:44,771 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 109 states. [2024-10-24 12:04:44,776 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 109 to 108. [2024-10-24 12:04:44,777 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 108 states, 87 states have (on average 1.3448275862068966) internal successors, (117), 87 states have internal predecessors, (117), 19 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 19 states have call predecessors, (19), 19 states have call successors, (19) [2024-10-24 12:04:44,777 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 108 states to 108 states and 155 transitions. [2024-10-24 12:04:44,778 INFO L78 Accepts]: Start accepts. Automaton has 108 states and 155 transitions. Word has length 148 [2024-10-24 12:04:44,778 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-24 12:04:44,778 INFO L471 AbstractCegarLoop]: Abstraction has 108 states and 155 transitions. [2024-10-24 12:04:44,779 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 14.0) internal successors, (56), 4 states have internal predecessors, (56), 1 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 1 states have call predecessors, (19), 1 states have call successors, (19) [2024-10-24 12:04:44,779 INFO L276 IsEmpty]: Start isEmpty. Operand 108 states and 155 transitions. [2024-10-24 12:04:44,780 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 149 [2024-10-24 12:04:44,780 INFO L207 NwaCegarLoop]: Found error trace [2024-10-24 12:04:44,781 INFO L215 NwaCegarLoop]: trace histogram [19, 19, 19, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 12:04:44,781 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-10-24 12:04:44,781 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-24 12:04:44,781 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 12:04:44,782 INFO L85 PathProgramCache]: Analyzing trace with hash 2045256484, now seen corresponding path program 1 times [2024-10-24 12:04:44,782 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-24 12:04:44,782 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [889406011] [2024-10-24 12:04:44,782 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 12:04:44,782 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-24 12:04:45,039 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 12:04:47,323 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-24 12:04:47,327 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 12:04:47,358 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2024-10-24 12:04:47,360 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 12:04:47,366 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2024-10-24 12:04:47,368 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 12:04:47,374 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2024-10-24 12:04:47,376 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 12:04:47,380 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2024-10-24 12:04:47,382 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 12:04:47,387 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-10-24 12:04:47,389 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 12:04:47,395 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-10-24 12:04:47,397 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 12:04:47,403 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2024-10-24 12:04:47,405 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 12:04:47,412 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2024-10-24 12:04:47,414 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 12:04:47,422 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2024-10-24 12:04:47,424 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 12:04:47,431 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2024-10-24 12:04:47,433 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 12:04:47,445 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2024-10-24 12:04:47,447 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 12:04:47,453 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 80 [2024-10-24 12:04:47,456 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 12:04:47,498 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 86 [2024-10-24 12:04:47,500 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 12:04:47,516 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 92 [2024-10-24 12:04:47,522 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 12:04:47,529 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 98 [2024-10-24 12:04:47,532 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 12:04:47,537 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 104 [2024-10-24 12:04:47,538 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 12:04:47,544 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 110 [2024-10-24 12:04:47,545 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 12:04:47,548 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 116 [2024-10-24 12:04:47,549 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 12:04:47,555 INFO L134 CoverageAnalysis]: Checked inductivity of 684 backedges. 0 proven. 54 refuted. 0 times theorem prover too weak. 630 trivial. 0 not checked. [2024-10-24 12:04:47,555 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-24 12:04:47,555 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [889406011] [2024-10-24 12:04:47,555 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [889406011] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-24 12:04:47,556 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [222473957] [2024-10-24 12:04:47,556 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 12:04:47,556 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-24 12:04:47,556 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-24 12:04:47,558 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 12:04:47,559 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 12:04:47,758 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 12:04:47,763 INFO L255 TraceCheckSpWp]: Trace formula consists of 552 conjuncts, 53 conjuncts are in the unsatisfiable core [2024-10-24 12:04:47,780 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-24 12:04:47,891 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 1 [2024-10-24 12:04:48,288 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 11 [2024-10-24 12:04:48,598 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 11 [2024-10-24 12:04:48,842 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 11 [2024-10-24 12:04:49,106 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 11 [2024-10-24 12:04:49,411 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 11 [2024-10-24 12:04:49,614 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 11 [2024-10-24 12:04:49,782 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 11 [2024-10-24 12:04:50,196 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 11 [2024-10-24 12:04:50,440 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 11 [2024-10-24 12:04:50,637 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 11 [2024-10-24 12:04:50,681 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-10-24 12:04:50,682 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 11 [2024-10-24 12:04:50,703 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 7 [2024-10-24 12:04:50,710 INFO L134 CoverageAnalysis]: Checked inductivity of 684 backedges. 52 proven. 193 refuted. 0 times theorem prover too weak. 439 trivial. 0 not checked. [2024-10-24 12:04:50,711 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-24 12:04:50,805 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [222473957] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-24 12:04:50,805 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-10-24 12:04:50,805 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 12] total 20 [2024-10-24 12:04:50,805 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [195330100] [2024-10-24 12:04:50,805 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-10-24 12:04:50,806 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 20 states [2024-10-24 12:04:50,806 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-24 12:04:50,807 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2024-10-24 12:04:50,807 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=109, Invalid=353, Unknown=0, NotChecked=0, Total=462 [2024-10-24 12:04:50,807 INFO L87 Difference]: Start difference. First operand 108 states and 155 transitions. Second operand has 20 states, 18 states have (on average 5.777777777777778) internal successors, (104), 20 states have internal predecessors, (104), 6 states have call successors, (38), 4 states have call predecessors, (38), 6 states have return successors, (38), 4 states have call predecessors, (38), 6 states have call successors, (38) [2024-10-24 12:04:51,347 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-24 12:04:51,347 INFO L93 Difference]: Finished difference Result 222 states and 315 transitions. [2024-10-24 12:04:51,348 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2024-10-24 12:04:51,348 INFO L78 Accepts]: Start accepts. Automaton has has 20 states, 18 states have (on average 5.777777777777778) internal successors, (104), 20 states have internal predecessors, (104), 6 states have call successors, (38), 4 states have call predecessors, (38), 6 states have return successors, (38), 4 states have call predecessors, (38), 6 states have call successors, (38) Word has length 148 [2024-10-24 12:04:51,349 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-24 12:04:51,349 INFO L225 Difference]: With dead ends: 222 [2024-10-24 12:04:51,350 INFO L226 Difference]: Without dead ends: 115 [2024-10-24 12:04:51,350 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 235 GetRequests, 209 SyntacticMatches, 3 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 164 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=157, Invalid=443, Unknown=0, NotChecked=0, Total=600 [2024-10-24 12:04:51,351 INFO L432 NwaCegarLoop]: 89 mSDtfsCounter, 253 mSDsluCounter, 509 mSDsCounter, 0 mSdLazyCounter, 740 mSolverCounterSat, 33 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 256 SdHoareTripleChecker+Valid, 598 SdHoareTripleChecker+Invalid, 773 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 33 IncrementalHoareTripleChecker+Valid, 740 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2024-10-24 12:04:51,351 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [256 Valid, 598 Invalid, 773 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [33 Valid, 740 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2024-10-24 12:04:51,352 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 115 states. [2024-10-24 12:04:51,363 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 115 to 112. [2024-10-24 12:04:51,364 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 112 states, 90 states have (on average 1.3222222222222222) internal successors, (119), 90 states have internal predecessors, (119), 19 states have call successors, (19), 2 states have call predecessors, (19), 2 states have return successors, (19), 19 states have call predecessors, (19), 19 states have call successors, (19) [2024-10-24 12:04:51,365 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 112 states to 112 states and 157 transitions. [2024-10-24 12:04:51,365 INFO L78 Accepts]: Start accepts. Automaton has 112 states and 157 transitions. Word has length 148 [2024-10-24 12:04:51,366 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-24 12:04:51,366 INFO L471 AbstractCegarLoop]: Abstraction has 112 states and 157 transitions. [2024-10-24 12:04:51,366 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 20 states, 18 states have (on average 5.777777777777778) internal successors, (104), 20 states have internal predecessors, (104), 6 states have call successors, (38), 4 states have call predecessors, (38), 6 states have return successors, (38), 4 states have call predecessors, (38), 6 states have call successors, (38) [2024-10-24 12:04:51,367 INFO L276 IsEmpty]: Start isEmpty. Operand 112 states and 157 transitions. [2024-10-24 12:04:51,368 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 149 [2024-10-24 12:04:51,368 INFO L207 NwaCegarLoop]: Found error trace [2024-10-24 12:04:51,368 INFO L215 NwaCegarLoop]: trace histogram [19, 19, 19, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 12:04:51,386 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2024-10-24 12:04:51,572 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3,2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-24 12:04:51,573 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-24 12:04:51,574 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 12:04:51,574 INFO L85 PathProgramCache]: Analyzing trace with hash 1227608034, now seen corresponding path program 1 times [2024-10-24 12:04:51,574 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-24 12:04:51,574 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1605699356] [2024-10-24 12:04:51,575 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 12:04:51,576 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-24 12:04:51,751 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 12:04:59,062 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-24 12:04:59,066 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 12:04:59,083 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2024-10-24 12:04:59,085 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 12:04:59,103 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2024-10-24 12:04:59,105 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 12:04:59,122 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2024-10-24 12:04:59,124 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 12:04:59,141 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2024-10-24 12:04:59,143 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 12:04:59,161 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-10-24 12:04:59,163 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 12:04:59,181 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-10-24 12:04:59,184 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 12:04:59,208 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2024-10-24 12:04:59,211 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 12:04:59,253 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2024-10-24 12:04:59,254 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 12:04:59,271 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2024-10-24 12:04:59,273 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 12:04:59,291 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2024-10-24 12:04:59,293 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 12:04:59,322 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2024-10-24 12:04:59,324 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 12:04:59,344 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 80 [2024-10-24 12:04:59,346 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 12:04:59,360 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 86 [2024-10-24 12:04:59,362 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 12:04:59,378 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 92 [2024-10-24 12:04:59,380 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 12:04:59,398 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 98 [2024-10-24 12:04:59,400 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 12:04:59,415 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 104 [2024-10-24 12:04:59,417 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 12:04:59,439 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 110 [2024-10-24 12:04:59,441 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 12:04:59,464 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 116 [2024-10-24 12:04:59,466 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 12:04:59,493 INFO L134 CoverageAnalysis]: Checked inductivity of 684 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 684 trivial. 0 not checked. [2024-10-24 12:04:59,494 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-24 12:04:59,494 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1605699356] [2024-10-24 12:04:59,494 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1605699356] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-24 12:04:59,494 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-24 12:04:59,494 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [15] imperfect sequences [] total 15 [2024-10-24 12:04:59,495 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [896565958] [2024-10-24 12:04:59,495 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-24 12:04:59,496 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 15 states [2024-10-24 12:04:59,496 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-24 12:04:59,496 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2024-10-24 12:04:59,497 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=41, Invalid=169, Unknown=0, NotChecked=0, Total=210 [2024-10-24 12:04:59,497 INFO L87 Difference]: Start difference. First operand 112 states and 157 transitions. Second operand has 15 states, 15 states have (on average 3.7333333333333334) internal successors, (56), 15 states have internal predecessors, (56), 3 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 3 states have call predecessors, (19), 3 states have call successors, (19) [2024-10-24 12:05:02,062 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-24 12:05:02,063 INFO L93 Difference]: Finished difference Result 277 states and 389 transitions. [2024-10-24 12:05:02,064 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-10-24 12:05:02,064 INFO L78 Accepts]: Start accepts. Automaton has has 15 states, 15 states have (on average 3.7333333333333334) internal successors, (56), 15 states have internal predecessors, (56), 3 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 3 states have call predecessors, (19), 3 states have call successors, (19) Word has length 148 [2024-10-24 12:05:02,065 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-24 12:05:02,066 INFO L225 Difference]: With dead ends: 277 [2024-10-24 12:05:02,066 INFO L226 Difference]: Without dead ends: 166 [2024-10-24 12:05:02,067 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 69 GetRequests, 48 SyntacticMatches, 1 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 77 ImplicationChecksByTransitivity, 2.5s TimeCoverageRelationStatistics Valid=108, Invalid=354, Unknown=0, NotChecked=0, Total=462 [2024-10-24 12:05:02,069 INFO L432 NwaCegarLoop]: 86 mSDtfsCounter, 461 mSDsluCounter, 495 mSDsCounter, 0 mSdLazyCounter, 844 mSolverCounterSat, 30 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 461 SdHoareTripleChecker+Valid, 581 SdHoareTripleChecker+Invalid, 874 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 30 IncrementalHoareTripleChecker+Valid, 844 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.1s IncrementalHoareTripleChecker+Time [2024-10-24 12:05:02,069 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [461 Valid, 581 Invalid, 874 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [30 Valid, 844 Invalid, 0 Unknown, 0 Unchecked, 1.1s Time] [2024-10-24 12:05:02,070 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 166 states. [2024-10-24 12:05:02,087 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 166 to 130. [2024-10-24 12:05:02,088 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 130 states, 108 states have (on average 1.3333333333333333) internal successors, (144), 108 states have internal predecessors, (144), 19 states have call successors, (19), 2 states have call predecessors, (19), 2 states have return successors, (19), 19 states have call predecessors, (19), 19 states have call successors, (19) [2024-10-24 12:05:02,089 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 130 states to 130 states and 182 transitions. [2024-10-24 12:05:02,090 INFO L78 Accepts]: Start accepts. Automaton has 130 states and 182 transitions. Word has length 148 [2024-10-24 12:05:02,090 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-24 12:05:02,090 INFO L471 AbstractCegarLoop]: Abstraction has 130 states and 182 transitions. [2024-10-24 12:05:02,090 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 15 states, 15 states have (on average 3.7333333333333334) internal successors, (56), 15 states have internal predecessors, (56), 3 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 3 states have call predecessors, (19), 3 states have call successors, (19) [2024-10-24 12:05:02,091 INFO L276 IsEmpty]: Start isEmpty. Operand 130 states and 182 transitions. [2024-10-24 12:05:02,092 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 149 [2024-10-24 12:05:02,092 INFO L207 NwaCegarLoop]: Found error trace [2024-10-24 12:05:02,092 INFO L215 NwaCegarLoop]: trace histogram [19, 19, 19, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 12:05:02,093 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2024-10-24 12:05:02,093 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-24 12:05:02,093 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 12:05:02,093 INFO L85 PathProgramCache]: Analyzing trace with hash 216490784, now seen corresponding path program 1 times [2024-10-24 12:05:02,094 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-24 12:05:02,094 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [23497421] [2024-10-24 12:05:02,094 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 12:05:02,094 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-24 12:05:02,175 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 12:05:05,340 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-24 12:05:05,342 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 12:05:05,358 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2024-10-24 12:05:05,360 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 12:05:05,375 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2024-10-24 12:05:05,377 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 12:05:05,392 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2024-10-24 12:05:05,394 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 12:05:05,411 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2024-10-24 12:05:05,414 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 12:05:05,428 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-10-24 12:05:05,430 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 12:05:05,447 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-10-24 12:05:05,449 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 12:05:05,461 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2024-10-24 12:05:05,463 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 12:05:05,475 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2024-10-24 12:05:05,477 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 12:05:05,489 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2024-10-24 12:05:05,491 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 12:05:05,504 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2024-10-24 12:05:05,507 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 12:05:05,518 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2024-10-24 12:05:05,521 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 12:05:05,531 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 80 [2024-10-24 12:05:05,532 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 12:05:05,544 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 86 [2024-10-24 12:05:05,545 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 12:05:05,555 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 92 [2024-10-24 12:05:05,557 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 12:05:05,569 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 98 [2024-10-24 12:05:05,571 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 12:05:05,581 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 104 [2024-10-24 12:05:05,583 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 12:05:05,594 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 110 [2024-10-24 12:05:05,596 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 12:05:05,604 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 116 [2024-10-24 12:05:05,606 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 12:05:05,619 INFO L134 CoverageAnalysis]: Checked inductivity of 684 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 684 trivial. 0 not checked. [2024-10-24 12:05:05,619 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-24 12:05:05,619 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [23497421] [2024-10-24 12:05:05,619 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [23497421] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-24 12:05:05,619 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-24 12:05:05,619 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2024-10-24 12:05:05,619 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [878392888] [2024-10-24 12:05:05,620 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-24 12:05:05,620 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2024-10-24 12:05:05,620 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-24 12:05:05,621 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2024-10-24 12:05:05,621 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=36, Invalid=96, Unknown=0, NotChecked=0, Total=132 [2024-10-24 12:05:05,622 INFO L87 Difference]: Start difference. First operand 130 states and 182 transitions. Second operand has 12 states, 11 states have (on average 5.090909090909091) internal successors, (56), 12 states have internal predecessors, (56), 3 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 2 states have call predecessors, (19), 3 states have call successors, (19) [2024-10-24 12:05:06,425 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-24 12:05:06,425 INFO L93 Difference]: Finished difference Result 293 states and 410 transitions. [2024-10-24 12:05:06,426 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-10-24 12:05:06,426 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 11 states have (on average 5.090909090909091) internal successors, (56), 12 states have internal predecessors, (56), 3 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 2 states have call predecessors, (19), 3 states have call successors, (19) Word has length 148 [2024-10-24 12:05:06,427 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-24 12:05:06,428 INFO L225 Difference]: With dead ends: 293 [2024-10-24 12:05:06,428 INFO L226 Difference]: Without dead ends: 164 [2024-10-24 12:05:06,428 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 60 GetRequests, 46 SyntacticMatches, 1 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 36 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=61, Invalid=149, Unknown=0, NotChecked=0, Total=210 [2024-10-24 12:05:06,429 INFO L432 NwaCegarLoop]: 109 mSDtfsCounter, 260 mSDsluCounter, 394 mSDsCounter, 0 mSdLazyCounter, 676 mSolverCounterSat, 13 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 261 SdHoareTripleChecker+Valid, 503 SdHoareTripleChecker+Invalid, 689 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 13 IncrementalHoareTripleChecker+Valid, 676 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2024-10-24 12:05:06,429 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [261 Valid, 503 Invalid, 689 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [13 Valid, 676 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2024-10-24 12:05:06,430 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 164 states. [2024-10-24 12:05:06,449 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 164 to 130. [2024-10-24 12:05:06,449 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 130 states, 108 states have (on average 1.3240740740740742) internal successors, (143), 108 states have internal predecessors, (143), 19 states have call successors, (19), 2 states have call predecessors, (19), 2 states have return successors, (19), 19 states have call predecessors, (19), 19 states have call successors, (19) [2024-10-24 12:05:06,450 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 130 states to 130 states and 181 transitions. [2024-10-24 12:05:06,450 INFO L78 Accepts]: Start accepts. Automaton has 130 states and 181 transitions. Word has length 148 [2024-10-24 12:05:06,451 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-24 12:05:06,451 INFO L471 AbstractCegarLoop]: Abstraction has 130 states and 181 transitions. [2024-10-24 12:05:06,451 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 11 states have (on average 5.090909090909091) internal successors, (56), 12 states have internal predecessors, (56), 3 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 2 states have call predecessors, (19), 3 states have call successors, (19) [2024-10-24 12:05:06,451 INFO L276 IsEmpty]: Start isEmpty. Operand 130 states and 181 transitions. [2024-10-24 12:05:06,452 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 149 [2024-10-24 12:05:06,452 INFO L207 NwaCegarLoop]: Found error trace [2024-10-24 12:05:06,453 INFO L215 NwaCegarLoop]: trace histogram [19, 19, 19, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 12:05:06,453 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2024-10-24 12:05:06,453 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-24 12:05:06,453 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 12:05:06,453 INFO L85 PathProgramCache]: Analyzing trace with hash 1289647648, now seen corresponding path program 1 times [2024-10-24 12:05:06,454 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-24 12:05:06,454 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2109917681] [2024-10-24 12:05:06,454 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 12:05:06,454 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-24 12:05:06,504 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 12:05:09,778 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-24 12:05:09,782 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 12:05:09,801 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2024-10-24 12:05:09,803 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 12:05:09,817 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2024-10-24 12:05:09,818 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 12:05:09,833 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2024-10-24 12:05:09,835 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 12:05:09,854 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2024-10-24 12:05:09,857 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 12:05:09,876 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-10-24 12:05:09,878 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 12:05:09,897 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-10-24 12:05:09,900 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 12:05:09,921 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2024-10-24 12:05:09,923 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 12:05:09,942 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2024-10-24 12:05:09,945 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 12:05:09,964 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2024-10-24 12:05:09,966 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 12:05:09,986 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2024-10-24 12:05:09,988 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 12:05:10,007 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2024-10-24 12:05:10,010 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 12:05:10,029 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 80 [2024-10-24 12:05:10,032 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 12:05:10,049 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 86 [2024-10-24 12:05:10,052 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 12:05:10,068 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 92 [2024-10-24 12:05:10,071 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 12:05:10,091 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 98 [2024-10-24 12:05:10,094 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 12:05:10,112 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 104 [2024-10-24 12:05:10,115 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 12:05:10,135 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 110 [2024-10-24 12:05:10,138 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 12:05:10,153 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 116 [2024-10-24 12:05:10,156 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 12:05:10,174 INFO L134 CoverageAnalysis]: Checked inductivity of 684 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 684 trivial. 0 not checked. [2024-10-24 12:05:10,174 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-24 12:05:10,174 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2109917681] [2024-10-24 12:05:10,175 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2109917681] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-24 12:05:10,175 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-24 12:05:10,175 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2024-10-24 12:05:10,175 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [834869716] [2024-10-24 12:05:10,175 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-24 12:05:10,176 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2024-10-24 12:05:10,176 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-24 12:05:10,177 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2024-10-24 12:05:10,177 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=36, Invalid=96, Unknown=0, NotChecked=0, Total=132 [2024-10-24 12:05:10,177 INFO L87 Difference]: Start difference. First operand 130 states and 181 transitions. Second operand has 12 states, 12 states have (on average 4.666666666666667) internal successors, (56), 12 states have internal predecessors, (56), 3 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 3 states have call predecessors, (19), 3 states have call successors, (19) [2024-10-24 12:05:11,182 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-24 12:05:11,182 INFO L93 Difference]: Finished difference Result 297 states and 414 transitions. [2024-10-24 12:05:11,183 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-10-24 12:05:11,183 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 12 states have (on average 4.666666666666667) internal successors, (56), 12 states have internal predecessors, (56), 3 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 3 states have call predecessors, (19), 3 states have call successors, (19) Word has length 148 [2024-10-24 12:05:11,184 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-24 12:05:11,185 INFO L225 Difference]: With dead ends: 297 [2024-10-24 12:05:11,185 INFO L226 Difference]: Without dead ends: 168 [2024-10-24 12:05:11,185 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 59 GetRequests, 45 SyntacticMatches, 1 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 34 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=64, Invalid=146, Unknown=0, NotChecked=0, Total=210 [2024-10-24 12:05:11,186 INFO L432 NwaCegarLoop]: 107 mSDtfsCounter, 322 mSDsluCounter, 367 mSDsCounter, 0 mSdLazyCounter, 675 mSolverCounterSat, 27 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 322 SdHoareTripleChecker+Valid, 474 SdHoareTripleChecker+Invalid, 702 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 27 IncrementalHoareTripleChecker+Valid, 675 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2024-10-24 12:05:11,186 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [322 Valid, 474 Invalid, 702 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [27 Valid, 675 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2024-10-24 12:05:11,186 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 168 states. [2024-10-24 12:05:11,212 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 168 to 132. [2024-10-24 12:05:11,214 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 132 states, 110 states have (on average 1.3181818181818181) internal successors, (145), 110 states have internal predecessors, (145), 19 states have call successors, (19), 2 states have call predecessors, (19), 2 states have return successors, (19), 19 states have call predecessors, (19), 19 states have call successors, (19) [2024-10-24 12:05:11,215 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 132 states to 132 states and 183 transitions. [2024-10-24 12:05:11,215 INFO L78 Accepts]: Start accepts. Automaton has 132 states and 183 transitions. Word has length 148 [2024-10-24 12:05:11,216 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-24 12:05:11,216 INFO L471 AbstractCegarLoop]: Abstraction has 132 states and 183 transitions. [2024-10-24 12:05:11,216 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 4.666666666666667) internal successors, (56), 12 states have internal predecessors, (56), 3 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 3 states have call predecessors, (19), 3 states have call successors, (19) [2024-10-24 12:05:11,217 INFO L276 IsEmpty]: Start isEmpty. Operand 132 states and 183 transitions. [2024-10-24 12:05:11,217 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 149 [2024-10-24 12:05:11,218 INFO L207 NwaCegarLoop]: Found error trace [2024-10-24 12:05:11,218 INFO L215 NwaCegarLoop]: trace histogram [19, 19, 19, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 12:05:11,218 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2024-10-24 12:05:11,218 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-24 12:05:11,218 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 12:05:11,218 INFO L85 PathProgramCache]: Analyzing trace with hash 278530398, now seen corresponding path program 1 times [2024-10-24 12:05:11,219 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-24 12:05:11,219 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1309116136] [2024-10-24 12:05:11,219 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 12:05:11,219 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-24 12:05:11,373 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 12:05:19,261 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-24 12:05:19,264 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 12:05:19,287 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2024-10-24 12:05:19,289 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 12:05:19,366 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2024-10-24 12:05:19,368 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 12:05:19,390 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2024-10-24 12:05:19,392 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 12:05:19,424 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2024-10-24 12:05:19,426 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 12:05:19,450 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-10-24 12:05:19,452 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 12:05:19,474 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-10-24 12:05:19,477 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 12:05:19,499 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2024-10-24 12:05:19,501 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 12:05:19,525 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2024-10-24 12:05:19,527 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 12:05:19,549 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2024-10-24 12:05:19,551 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 12:05:19,575 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2024-10-24 12:05:19,581 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 12:05:19,606 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2024-10-24 12:05:19,609 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 12:05:19,634 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 80 [2024-10-24 12:05:19,637 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 12:05:19,659 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 86 [2024-10-24 12:05:19,661 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 12:05:19,682 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 92 [2024-10-24 12:05:19,684 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 12:05:19,707 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 98 [2024-10-24 12:05:19,710 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 12:05:19,730 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 104 [2024-10-24 12:05:19,732 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 12:05:19,755 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 110 [2024-10-24 12:05:19,757 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 12:05:19,775 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 116 [2024-10-24 12:05:19,778 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 12:05:19,800 INFO L134 CoverageAnalysis]: Checked inductivity of 684 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 684 trivial. 0 not checked. [2024-10-24 12:05:19,801 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-24 12:05:19,801 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1309116136] [2024-10-24 12:05:19,801 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1309116136] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-24 12:05:19,801 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-24 12:05:19,801 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [14] imperfect sequences [] total 14 [2024-10-24 12:05:19,801 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1881656151] [2024-10-24 12:05:19,802 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-24 12:05:19,802 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2024-10-24 12:05:19,802 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-24 12:05:19,803 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2024-10-24 12:05:19,803 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=37, Invalid=145, Unknown=0, NotChecked=0, Total=182 [2024-10-24 12:05:19,803 INFO L87 Difference]: Start difference. First operand 132 states and 183 transitions. Second operand has 14 states, 14 states have (on average 4.0) internal successors, (56), 14 states have internal predecessors, (56), 2 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 2 states have call predecessors, (19), 2 states have call successors, (19) [2024-10-24 12:05:23,081 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-24 12:05:23,082 INFO L93 Difference]: Finished difference Result 299 states and 415 transitions. [2024-10-24 12:05:23,083 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-10-24 12:05:23,083 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 14 states have (on average 4.0) internal successors, (56), 14 states have internal predecessors, (56), 2 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 2 states have call predecessors, (19), 2 states have call successors, (19) Word has length 148 [2024-10-24 12:05:23,083 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-24 12:05:23,090 INFO L225 Difference]: With dead ends: 299 [2024-10-24 12:05:23,090 INFO L226 Difference]: Without dead ends: 168 [2024-10-24 12:05:23,091 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 66 GetRequests, 46 SyntacticMatches, 1 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 67 ImplicationChecksByTransitivity, 3.4s TimeCoverageRelationStatistics Valid=95, Invalid=325, Unknown=0, NotChecked=0, Total=420 [2024-10-24 12:05:23,091 INFO L432 NwaCegarLoop]: 128 mSDtfsCounter, 253 mSDsluCounter, 677 mSDsCounter, 0 mSdLazyCounter, 1021 mSolverCounterSat, 25 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 253 SdHoareTripleChecker+Valid, 805 SdHoareTripleChecker+Invalid, 1046 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 25 IncrementalHoareTripleChecker+Valid, 1021 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.3s IncrementalHoareTripleChecker+Time [2024-10-24 12:05:23,092 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [253 Valid, 805 Invalid, 1046 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [25 Valid, 1021 Invalid, 0 Unknown, 0 Unchecked, 1.3s Time] [2024-10-24 12:05:23,092 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 168 states. [2024-10-24 12:05:23,171 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 168 to 132. [2024-10-24 12:05:23,171 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 132 states, 110 states have (on average 1.3181818181818181) internal successors, (145), 110 states have internal predecessors, (145), 19 states have call successors, (19), 2 states have call predecessors, (19), 2 states have return successors, (19), 19 states have call predecessors, (19), 19 states have call successors, (19) [2024-10-24 12:05:23,177 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 132 states to 132 states and 183 transitions. [2024-10-24 12:05:23,177 INFO L78 Accepts]: Start accepts. Automaton has 132 states and 183 transitions. Word has length 148 [2024-10-24 12:05:23,183 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-24 12:05:23,183 INFO L471 AbstractCegarLoop]: Abstraction has 132 states and 183 transitions. [2024-10-24 12:05:23,184 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 14 states have (on average 4.0) internal successors, (56), 14 states have internal predecessors, (56), 2 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 2 states have call predecessors, (19), 2 states have call successors, (19) [2024-10-24 12:05:23,184 INFO L276 IsEmpty]: Start isEmpty. Operand 132 states and 183 transitions. [2024-10-24 12:05:23,185 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 151 [2024-10-24 12:05:23,186 INFO L207 NwaCegarLoop]: Found error trace [2024-10-24 12:05:23,186 INFO L215 NwaCegarLoop]: trace histogram [19, 19, 19, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 12:05:23,186 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2024-10-24 12:05:23,187 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-24 12:05:23,191 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 12:05:23,192 INFO L85 PathProgramCache]: Analyzing trace with hash 826996775, now seen corresponding path program 1 times [2024-10-24 12:05:23,192 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-24 12:05:23,192 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [127839631] [2024-10-24 12:05:23,192 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 12:05:23,192 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-24 12:05:23,366 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 12:05:24,524 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-24 12:05:24,526 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 12:05:24,531 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2024-10-24 12:05:24,534 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 12:05:24,540 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2024-10-24 12:05:24,541 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 12:05:24,545 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2024-10-24 12:05:24,546 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 12:05:24,549 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2024-10-24 12:05:24,550 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 12:05:24,554 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-10-24 12:05:24,555 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 12:05:24,559 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-10-24 12:05:24,560 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 12:05:24,564 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2024-10-24 12:05:24,565 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 12:05:24,568 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2024-10-24 12:05:24,569 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 12:05:24,573 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2024-10-24 12:05:24,574 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 12:05:24,577 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2024-10-24 12:05:24,578 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 12:05:24,583 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2024-10-24 12:05:24,585 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 12:05:24,589 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 80 [2024-10-24 12:05:24,589 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 12:05:24,593 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 86 [2024-10-24 12:05:24,593 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 12:05:24,597 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 92 [2024-10-24 12:05:24,598 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 12:05:24,602 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 98 [2024-10-24 12:05:24,604 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 12:05:24,607 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 104 [2024-10-24 12:05:24,609 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 12:05:24,641 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 110 [2024-10-24 12:05:24,643 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 12:05:24,647 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 116 [2024-10-24 12:05:24,648 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 12:05:24,653 INFO L134 CoverageAnalysis]: Checked inductivity of 684 backedges. 48 proven. 6 refuted. 0 times theorem prover too weak. 630 trivial. 0 not checked. [2024-10-24 12:05:24,653 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-24 12:05:24,653 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [127839631] [2024-10-24 12:05:24,653 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [127839631] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-24 12:05:24,653 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1922872963] [2024-10-24 12:05:24,653 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 12:05:24,653 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-24 12:05:24,653 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-24 12:05:24,657 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-10-24 12:05:24,658 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-10-24 12:05:24,831 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 12:05:24,838 INFO L255 TraceCheckSpWp]: Trace formula consists of 570 conjuncts, 55 conjuncts are in the unsatisfiable core [2024-10-24 12:05:24,848 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-24 12:05:27,979 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 1 [2024-10-24 12:05:28,533 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 13 [2024-10-24 12:05:28,923 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-10-24 12:05:28,924 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 13 [2024-10-24 12:05:29,023 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-10-24 12:05:29,025 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 13 [2024-10-24 12:05:29,117 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 57 treesize of output 43 [2024-10-24 12:05:29,121 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-10-24 12:05:29,122 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 2 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 43 treesize of output 63 [2024-10-24 12:05:29,165 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-10-24 12:05:29,166 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 22 [2024-10-24 12:05:29,283 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 110 treesize of output 82 [2024-10-24 12:05:29,288 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-10-24 12:05:29,325 INFO L349 Elim1Store]: treesize reduction 74, result has 26.7 percent of original size [2024-10-24 12:05:29,326 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 2 stores, 3 select indices, 3 select index equivalence classes, 2 disjoint index pairs (out of 3 index pairs), introduced 5 new quantified variables, introduced 7 case distinctions, treesize of input 82 treesize of output 114 [2024-10-24 12:05:29,571 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-10-24 12:05:29,573 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-10-24 12:05:29,660 INFO L349 Elim1Store]: treesize reduction 128, result has 37.6 percent of original size [2024-10-24 12:05:29,661 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 6 select indices, 6 select index equivalence classes, 1 disjoint index pairs (out of 15 index pairs), introduced 6 new quantified variables, introduced 18 case distinctions, treesize of input 82 treesize of output 144 [2024-10-24 12:05:30,512 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 271 treesize of output 209 [2024-10-24 12:05:30,526 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-10-24 12:05:30,532 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-10-24 12:05:32,443 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-10-24 12:05:32,445 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 19 select indices, 19 select index equivalence classes, 1 disjoint index pairs (out of 171 index pairs), introduced 19 new quantified variables, introduced 170 case distinctions, treesize of input 206 treesize of output 1504 [2024-10-24 12:05:32,658 INFO L134 CoverageAnalysis]: Checked inductivity of 684 backedges. 48 proven. 136 refuted. 0 times theorem prover too weak. 500 trivial. 0 not checked. [2024-10-24 12:05:32,660 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-24 12:05:33,098 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse0 (select |c_#memory_int#1| c_~WrapperStruct00_var_1_10_Pointer~0.base))) (and (forall ((v_ArrVal_697 (Array Int Int))) (let ((.cse1 (select v_ArrVal_697 c_~WrapperStruct00_var_1_10_Pointer~0.offset)) (.cse2 (store |c_#memory_int#1| c_~WrapperStruct00_var_1_10_Pointer~0.base v_ArrVal_697))) (or (not (= v_ArrVal_697 (store .cse0 c_~WrapperStruct00_var_1_10_Pointer~0.offset .cse1))) (< .cse1 0) (not (= (mod (select (select .cse2 c_~WrapperStruct00_var_1_15_Pointer~0.base) c_~WrapperStruct00_var_1_15_Pointer~0.offset) 256) 0)) (< 32767 .cse1) (forall ((v_ArrVal_699 Int)) (< 0 (mod (select (select (let ((.cse3 (store .cse2 c_~WrapperStruct00_var_1_13_Pointer~0.base (store (select .cse2 c_~WrapperStruct00_var_1_13_Pointer~0.base) c_~WrapperStruct00_var_1_13_Pointer~0.offset 1)))) (store .cse3 c_~WrapperStruct00_var_1_17_Pointer~0.base (store (select .cse3 c_~WrapperStruct00_var_1_17_Pointer~0.base) c_~WrapperStruct00_var_1_17_Pointer~0.offset v_ArrVal_699))) c_~WrapperStruct00_var_1_13_Pointer~0.base) c_~WrapperStruct00_var_1_13_Pointer~0.offset) 256)))))) (forall ((v_ArrVal_697 (Array Int Int))) (let ((.cse6 (store |c_#memory_int#1| c_~WrapperStruct00_var_1_10_Pointer~0.base v_ArrVal_697)) (.cse4 (select v_ArrVal_697 c_~WrapperStruct00_var_1_10_Pointer~0.offset))) (or (not (= v_ArrVal_697 (store .cse0 c_~WrapperStruct00_var_1_10_Pointer~0.offset .cse4))) (forall ((v_ArrVal_699 Int)) (< 0 (mod (select (select (let ((.cse5 (store .cse6 c_~WrapperStruct00_var_1_13_Pointer~0.base (store (select .cse6 c_~WrapperStruct00_var_1_13_Pointer~0.base) c_~WrapperStruct00_var_1_13_Pointer~0.offset 0)))) (store .cse5 c_~WrapperStruct00_var_1_17_Pointer~0.base (store (select .cse5 c_~WrapperStruct00_var_1_17_Pointer~0.base) c_~WrapperStruct00_var_1_17_Pointer~0.offset v_ArrVal_699))) c_~WrapperStruct00_var_1_13_Pointer~0.base) c_~WrapperStruct00_var_1_13_Pointer~0.offset) 256))) (< .cse4 0) (= (mod (select (select .cse6 c_~WrapperStruct00_var_1_15_Pointer~0.base) c_~WrapperStruct00_var_1_15_Pointer~0.offset) 256) 0) (< 32767 .cse4)))) (forall ((v_ArrVal_697 (Array Int Int))) (let ((.cse9 (store |c_#memory_int#1| c_~WrapperStruct00_var_1_10_Pointer~0.base v_ArrVal_697)) (.cse7 (select v_ArrVal_697 c_~WrapperStruct00_var_1_10_Pointer~0.offset))) (or (not (= v_ArrVal_697 (store .cse0 c_~WrapperStruct00_var_1_10_Pointer~0.offset .cse7))) (forall ((v_ArrVal_699 Int)) (< 0 (mod (select (select (let ((.cse8 (store .cse9 c_~WrapperStruct00_var_1_13_Pointer~0.base (store (select .cse9 c_~WrapperStruct00_var_1_13_Pointer~0.base) c_~WrapperStruct00_var_1_13_Pointer~0.offset 0)))) (store .cse8 c_~WrapperStruct00_var_1_17_Pointer~0.base (store (select .cse8 c_~WrapperStruct00_var_1_17_Pointer~0.base) c_~WrapperStruct00_var_1_17_Pointer~0.offset v_ArrVal_699))) c_~WrapperStruct00_var_1_13_Pointer~0.base) c_~WrapperStruct00_var_1_13_Pointer~0.offset) 256))) (= (mod (select (select .cse9 c_~WrapperStruct00_var_1_15_Pointer~0.base) c_~WrapperStruct00_var_1_15_Pointer~0.offset) 256) 0) (< 0 (+ .cse7 1)) (< (+ .cse7 32768) 0)))) (forall ((v_ArrVal_697 (Array Int Int))) (let ((.cse10 (select v_ArrVal_697 c_~WrapperStruct00_var_1_10_Pointer~0.offset)) (.cse11 (store |c_#memory_int#1| c_~WrapperStruct00_var_1_10_Pointer~0.base v_ArrVal_697))) (or (not (= v_ArrVal_697 (store .cse0 c_~WrapperStruct00_var_1_10_Pointer~0.offset .cse10))) (not (= (mod (select (select .cse11 c_~WrapperStruct00_var_1_15_Pointer~0.base) c_~WrapperStruct00_var_1_15_Pointer~0.offset) 256) 0)) (< 0 (+ .cse10 1)) (< (+ .cse10 32768) 0) (forall ((v_ArrVal_699 Int)) (< 0 (mod (select (select (let ((.cse12 (store .cse11 c_~WrapperStruct00_var_1_13_Pointer~0.base (store (select .cse11 c_~WrapperStruct00_var_1_13_Pointer~0.base) c_~WrapperStruct00_var_1_13_Pointer~0.offset 1)))) (store .cse12 c_~WrapperStruct00_var_1_17_Pointer~0.base (store (select .cse12 c_~WrapperStruct00_var_1_17_Pointer~0.base) c_~WrapperStruct00_var_1_17_Pointer~0.offset v_ArrVal_699))) c_~WrapperStruct00_var_1_13_Pointer~0.base) c_~WrapperStruct00_var_1_13_Pointer~0.offset) 256)))))))) is different from false [2024-10-24 12:05:33,381 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse4 (select |c_#memory_int#1| c_~WrapperStruct00_var_1_7_Pointer~0.base))) (and (forall ((v_ArrVal_695 Int) (v_ArrVal_697 (Array Int Int))) (let ((.cse0 (store |c_#memory_int#1| c_~WrapperStruct00_var_1_7_Pointer~0.base (store .cse4 c_~WrapperStruct00_var_1_7_Pointer~0.offset v_ArrVal_695)))) (let ((.cse1 (select v_ArrVal_697 c_~WrapperStruct00_var_1_10_Pointer~0.offset)) (.cse3 (store .cse0 c_~WrapperStruct00_var_1_10_Pointer~0.base v_ArrVal_697))) (or (not (= v_ArrVal_697 (store (select .cse0 c_~WrapperStruct00_var_1_10_Pointer~0.base) c_~WrapperStruct00_var_1_10_Pointer~0.offset .cse1))) (forall ((v_ArrVal_699 Int)) (< 0 (mod (select (select (let ((.cse2 (store .cse3 c_~WrapperStruct00_var_1_13_Pointer~0.base (store (select .cse3 c_~WrapperStruct00_var_1_13_Pointer~0.base) c_~WrapperStruct00_var_1_13_Pointer~0.offset 0)))) (store .cse2 c_~WrapperStruct00_var_1_17_Pointer~0.base (store (select .cse2 c_~WrapperStruct00_var_1_17_Pointer~0.base) c_~WrapperStruct00_var_1_17_Pointer~0.offset v_ArrVal_699))) c_~WrapperStruct00_var_1_13_Pointer~0.base) c_~WrapperStruct00_var_1_13_Pointer~0.offset) 256))) (< 0 (+ .cse1 1)) (< (+ .cse1 32768) 0) (= (mod (select (select .cse3 c_~WrapperStruct00_var_1_15_Pointer~0.base) c_~WrapperStruct00_var_1_15_Pointer~0.offset) 256) 0))))) (forall ((v_ArrVal_695 Int) (v_ArrVal_697 (Array Int Int))) (let ((.cse5 (store |c_#memory_int#1| c_~WrapperStruct00_var_1_7_Pointer~0.base (store .cse4 c_~WrapperStruct00_var_1_7_Pointer~0.offset v_ArrVal_695)))) (let ((.cse6 (select v_ArrVal_697 c_~WrapperStruct00_var_1_10_Pointer~0.offset)) (.cse8 (store .cse5 c_~WrapperStruct00_var_1_10_Pointer~0.base v_ArrVal_697))) (or (not (= v_ArrVal_697 (store (select .cse5 c_~WrapperStruct00_var_1_10_Pointer~0.base) c_~WrapperStruct00_var_1_10_Pointer~0.offset .cse6))) (forall ((v_ArrVal_699 Int)) (< 0 (mod (select (select (let ((.cse7 (store .cse8 c_~WrapperStruct00_var_1_13_Pointer~0.base (store (select .cse8 c_~WrapperStruct00_var_1_13_Pointer~0.base) c_~WrapperStruct00_var_1_13_Pointer~0.offset 0)))) (store .cse7 c_~WrapperStruct00_var_1_17_Pointer~0.base (store (select .cse7 c_~WrapperStruct00_var_1_17_Pointer~0.base) c_~WrapperStruct00_var_1_17_Pointer~0.offset v_ArrVal_699))) c_~WrapperStruct00_var_1_13_Pointer~0.base) c_~WrapperStruct00_var_1_13_Pointer~0.offset) 256))) (< .cse6 0) (< 32767 .cse6) (= (mod (select (select .cse8 c_~WrapperStruct00_var_1_15_Pointer~0.base) c_~WrapperStruct00_var_1_15_Pointer~0.offset) 256) 0))))) (forall ((v_ArrVal_695 Int) (v_ArrVal_697 (Array Int Int))) (let ((.cse11 (store |c_#memory_int#1| c_~WrapperStruct00_var_1_7_Pointer~0.base (store .cse4 c_~WrapperStruct00_var_1_7_Pointer~0.offset v_ArrVal_695)))) (let ((.cse12 (select v_ArrVal_697 c_~WrapperStruct00_var_1_10_Pointer~0.offset)) (.cse10 (store .cse11 c_~WrapperStruct00_var_1_10_Pointer~0.base v_ArrVal_697))) (or (forall ((v_ArrVal_699 Int)) (< 0 (mod (select (select (let ((.cse9 (store .cse10 c_~WrapperStruct00_var_1_13_Pointer~0.base (store (select .cse10 c_~WrapperStruct00_var_1_13_Pointer~0.base) c_~WrapperStruct00_var_1_13_Pointer~0.offset 1)))) (store .cse9 c_~WrapperStruct00_var_1_17_Pointer~0.base (store (select .cse9 c_~WrapperStruct00_var_1_17_Pointer~0.base) c_~WrapperStruct00_var_1_17_Pointer~0.offset v_ArrVal_699))) c_~WrapperStruct00_var_1_13_Pointer~0.base) c_~WrapperStruct00_var_1_13_Pointer~0.offset) 256))) (not (= v_ArrVal_697 (store (select .cse11 c_~WrapperStruct00_var_1_10_Pointer~0.base) c_~WrapperStruct00_var_1_10_Pointer~0.offset .cse12))) (< 0 (+ .cse12 1)) (< (+ .cse12 32768) 0) (not (= (mod (select (select .cse10 c_~WrapperStruct00_var_1_15_Pointer~0.base) c_~WrapperStruct00_var_1_15_Pointer~0.offset) 256) 0)))))) (forall ((v_ArrVal_695 Int) (v_ArrVal_697 (Array Int Int))) (let ((.cse15 (store |c_#memory_int#1| c_~WrapperStruct00_var_1_7_Pointer~0.base (store .cse4 c_~WrapperStruct00_var_1_7_Pointer~0.offset v_ArrVal_695)))) (let ((.cse16 (select v_ArrVal_697 c_~WrapperStruct00_var_1_10_Pointer~0.offset)) (.cse14 (store .cse15 c_~WrapperStruct00_var_1_10_Pointer~0.base v_ArrVal_697))) (or (forall ((v_ArrVal_699 Int)) (< 0 (mod (select (select (let ((.cse13 (store .cse14 c_~WrapperStruct00_var_1_13_Pointer~0.base (store (select .cse14 c_~WrapperStruct00_var_1_13_Pointer~0.base) c_~WrapperStruct00_var_1_13_Pointer~0.offset 1)))) (store .cse13 c_~WrapperStruct00_var_1_17_Pointer~0.base (store (select .cse13 c_~WrapperStruct00_var_1_17_Pointer~0.base) c_~WrapperStruct00_var_1_17_Pointer~0.offset v_ArrVal_699))) c_~WrapperStruct00_var_1_13_Pointer~0.base) c_~WrapperStruct00_var_1_13_Pointer~0.offset) 256))) (not (= v_ArrVal_697 (store (select .cse15 c_~WrapperStruct00_var_1_10_Pointer~0.base) c_~WrapperStruct00_var_1_10_Pointer~0.offset .cse16))) (< .cse16 0) (< 32767 .cse16) (not (= (mod (select (select .cse14 c_~WrapperStruct00_var_1_15_Pointer~0.base) c_~WrapperStruct00_var_1_15_Pointer~0.offset) 256) 0)))))))) is different from false [2024-10-24 12:05:33,694 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse5 (select |c_#memory_int#1| c_~WrapperStruct00_var_1_1_Pointer~0.base))) (and (forall ((v_ArrVal_695 Int) (v_ArrVal_694 Int) (v_ArrVal_697 (Array Int Int))) (let ((.cse0 (let ((.cse4 (store |c_#memory_int#1| c_~WrapperStruct00_var_1_1_Pointer~0.base (store .cse5 c_~WrapperStruct00_var_1_1_Pointer~0.offset v_ArrVal_694)))) (store .cse4 c_~WrapperStruct00_var_1_7_Pointer~0.base (store (select .cse4 c_~WrapperStruct00_var_1_7_Pointer~0.base) c_~WrapperStruct00_var_1_7_Pointer~0.offset v_ArrVal_695))))) (let ((.cse2 (store .cse0 c_~WrapperStruct00_var_1_10_Pointer~0.base v_ArrVal_697)) (.cse1 (select v_ArrVal_697 c_~WrapperStruct00_var_1_10_Pointer~0.offset))) (or (not (= v_ArrVal_697 (store (select .cse0 c_~WrapperStruct00_var_1_10_Pointer~0.base) c_~WrapperStruct00_var_1_10_Pointer~0.offset .cse1))) (< .cse1 0) (= (mod (select (select .cse2 c_~WrapperStruct00_var_1_15_Pointer~0.base) c_~WrapperStruct00_var_1_15_Pointer~0.offset) 256) 0) (forall ((v_ArrVal_699 Int)) (< 0 (mod (select (select (let ((.cse3 (store .cse2 c_~WrapperStruct00_var_1_13_Pointer~0.base (store (select .cse2 c_~WrapperStruct00_var_1_13_Pointer~0.base) c_~WrapperStruct00_var_1_13_Pointer~0.offset 0)))) (store .cse3 c_~WrapperStruct00_var_1_17_Pointer~0.base (store (select .cse3 c_~WrapperStruct00_var_1_17_Pointer~0.base) c_~WrapperStruct00_var_1_17_Pointer~0.offset v_ArrVal_699))) c_~WrapperStruct00_var_1_13_Pointer~0.base) c_~WrapperStruct00_var_1_13_Pointer~0.offset) 256))) (< 32767 .cse1))))) (forall ((v_ArrVal_695 Int) (v_ArrVal_694 Int) (v_ArrVal_697 (Array Int Int))) (let ((.cse6 (let ((.cse10 (store |c_#memory_int#1| c_~WrapperStruct00_var_1_1_Pointer~0.base (store .cse5 c_~WrapperStruct00_var_1_1_Pointer~0.offset v_ArrVal_694)))) (store .cse10 c_~WrapperStruct00_var_1_7_Pointer~0.base (store (select .cse10 c_~WrapperStruct00_var_1_7_Pointer~0.base) c_~WrapperStruct00_var_1_7_Pointer~0.offset v_ArrVal_695))))) (let ((.cse8 (store .cse6 c_~WrapperStruct00_var_1_10_Pointer~0.base v_ArrVal_697)) (.cse7 (select v_ArrVal_697 c_~WrapperStruct00_var_1_10_Pointer~0.offset))) (or (not (= v_ArrVal_697 (store (select .cse6 c_~WrapperStruct00_var_1_10_Pointer~0.base) c_~WrapperStruct00_var_1_10_Pointer~0.offset .cse7))) (not (= (mod (select (select .cse8 c_~WrapperStruct00_var_1_15_Pointer~0.base) c_~WrapperStruct00_var_1_15_Pointer~0.offset) 256) 0)) (forall ((v_ArrVal_699 Int)) (< 0 (mod (select (select (let ((.cse9 (store .cse8 c_~WrapperStruct00_var_1_13_Pointer~0.base (store (select .cse8 c_~WrapperStruct00_var_1_13_Pointer~0.base) c_~WrapperStruct00_var_1_13_Pointer~0.offset 1)))) (store .cse9 c_~WrapperStruct00_var_1_17_Pointer~0.base (store (select .cse9 c_~WrapperStruct00_var_1_17_Pointer~0.base) c_~WrapperStruct00_var_1_17_Pointer~0.offset v_ArrVal_699))) c_~WrapperStruct00_var_1_13_Pointer~0.base) c_~WrapperStruct00_var_1_13_Pointer~0.offset) 256))) (< 0 (+ .cse7 1)) (< (+ .cse7 32768) 0))))) (forall ((v_ArrVal_695 Int) (v_ArrVal_694 Int) (v_ArrVal_697 (Array Int Int))) (let ((.cse11 (let ((.cse15 (store |c_#memory_int#1| c_~WrapperStruct00_var_1_1_Pointer~0.base (store .cse5 c_~WrapperStruct00_var_1_1_Pointer~0.offset v_ArrVal_694)))) (store .cse15 c_~WrapperStruct00_var_1_7_Pointer~0.base (store (select .cse15 c_~WrapperStruct00_var_1_7_Pointer~0.base) c_~WrapperStruct00_var_1_7_Pointer~0.offset v_ArrVal_695))))) (let ((.cse13 (store .cse11 c_~WrapperStruct00_var_1_10_Pointer~0.base v_ArrVal_697)) (.cse12 (select v_ArrVal_697 c_~WrapperStruct00_var_1_10_Pointer~0.offset))) (or (not (= v_ArrVal_697 (store (select .cse11 c_~WrapperStruct00_var_1_10_Pointer~0.base) c_~WrapperStruct00_var_1_10_Pointer~0.offset .cse12))) (< .cse12 0) (not (= (mod (select (select .cse13 c_~WrapperStruct00_var_1_15_Pointer~0.base) c_~WrapperStruct00_var_1_15_Pointer~0.offset) 256) 0)) (forall ((v_ArrVal_699 Int)) (< 0 (mod (select (select (let ((.cse14 (store .cse13 c_~WrapperStruct00_var_1_13_Pointer~0.base (store (select .cse13 c_~WrapperStruct00_var_1_13_Pointer~0.base) c_~WrapperStruct00_var_1_13_Pointer~0.offset 1)))) (store .cse14 c_~WrapperStruct00_var_1_17_Pointer~0.base (store (select .cse14 c_~WrapperStruct00_var_1_17_Pointer~0.base) c_~WrapperStruct00_var_1_17_Pointer~0.offset v_ArrVal_699))) c_~WrapperStruct00_var_1_13_Pointer~0.base) c_~WrapperStruct00_var_1_13_Pointer~0.offset) 256))) (< 32767 .cse12))))) (forall ((v_ArrVal_695 Int) (v_ArrVal_694 Int) (v_ArrVal_697 (Array Int Int))) (let ((.cse16 (let ((.cse20 (store |c_#memory_int#1| c_~WrapperStruct00_var_1_1_Pointer~0.base (store .cse5 c_~WrapperStruct00_var_1_1_Pointer~0.offset v_ArrVal_694)))) (store .cse20 c_~WrapperStruct00_var_1_7_Pointer~0.base (store (select .cse20 c_~WrapperStruct00_var_1_7_Pointer~0.base) c_~WrapperStruct00_var_1_7_Pointer~0.offset v_ArrVal_695))))) (let ((.cse17 (select v_ArrVal_697 c_~WrapperStruct00_var_1_10_Pointer~0.offset)) (.cse18 (store .cse16 c_~WrapperStruct00_var_1_10_Pointer~0.base v_ArrVal_697))) (or (not (= v_ArrVal_697 (store (select .cse16 c_~WrapperStruct00_var_1_10_Pointer~0.base) c_~WrapperStruct00_var_1_10_Pointer~0.offset .cse17))) (= (mod (select (select .cse18 c_~WrapperStruct00_var_1_15_Pointer~0.base) c_~WrapperStruct00_var_1_15_Pointer~0.offset) 256) 0) (< 0 (+ .cse17 1)) (< (+ .cse17 32768) 0) (forall ((v_ArrVal_699 Int)) (< 0 (mod (select (select (let ((.cse19 (store .cse18 c_~WrapperStruct00_var_1_13_Pointer~0.base (store (select .cse18 c_~WrapperStruct00_var_1_13_Pointer~0.base) c_~WrapperStruct00_var_1_13_Pointer~0.offset 0)))) (store .cse19 c_~WrapperStruct00_var_1_17_Pointer~0.base (store (select .cse19 c_~WrapperStruct00_var_1_17_Pointer~0.base) c_~WrapperStruct00_var_1_17_Pointer~0.offset v_ArrVal_699))) c_~WrapperStruct00_var_1_13_Pointer~0.base) c_~WrapperStruct00_var_1_13_Pointer~0.offset) 256))))))))) is different from false [2024-10-24 12:05:33,999 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1922872963] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-24 12:05:33,999 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-10-24 12:05:33,999 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [15, 12] total 26 [2024-10-24 12:05:33,999 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1988005747] [2024-10-24 12:05:34,000 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-10-24 12:05:34,000 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 26 states [2024-10-24 12:05:34,000 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-24 12:05:34,001 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 26 interpolants. [2024-10-24 12:05:34,002 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=137, Invalid=684, Unknown=3, NotChecked=168, Total=992 [2024-10-24 12:05:34,003 INFO L87 Difference]: Start difference. First operand 132 states and 183 transitions. Second operand has 26 states, 24 states have (on average 4.5) internal successors, (108), 24 states have internal predecessors, (108), 7 states have call successors, (38), 3 states have call predecessors, (38), 5 states have return successors, (38), 7 states have call predecessors, (38), 7 states have call successors, (38) [2024-10-24 12:05:38,454 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Real, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-10-24 12:05:42,636 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Real, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-10-24 12:05:46,709 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Real, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-10-24 12:05:50,984 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Real, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-10-24 12:05:55,095 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Real, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0]