./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-ap_file-90.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version fca748b1 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-ap_file-90.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 d7249a4084734468a9df38189de6441ee3548af581a8047a10bfcd263bdf18bd --- Real Ultimate output --- This is Ultimate 0.2.5-wip.dd.update-z3-fca748b-m [2024-11-20 08:41:21,764 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-20 08:41:21,812 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2024-11-20 08:41:21,818 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-20 08:41:21,819 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-20 08:41:21,840 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-20 08:41:21,841 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-20 08:41:21,841 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-20 08:41:21,842 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-11-20 08:41:21,843 INFO L153 SettingsManager]: * Use memory slicer=true [2024-11-20 08:41:21,844 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-20 08:41:21,844 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-20 08:41:21,845 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-20 08:41:21,845 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-20 08:41:21,845 INFO L153 SettingsManager]: * Use SBE=true [2024-11-20 08:41:21,845 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-20 08:41:21,845 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-11-20 08:41:21,846 INFO L153 SettingsManager]: * sizeof long=4 [2024-11-20 08:41:21,846 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-11-20 08:41:21,850 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-11-20 08:41:21,850 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-20 08:41:21,850 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-11-20 08:41:21,851 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-20 08:41:21,851 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-11-20 08:41:21,851 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-20 08:41:21,851 INFO L153 SettingsManager]: * sizeof long double=12 [2024-11-20 08:41:21,851 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-11-20 08:41:21,852 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-20 08:41:21,852 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-11-20 08:41:21,852 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-20 08:41:21,852 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-20 08:41:21,852 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-20 08:41:21,852 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-20 08:41:21,853 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-20 08:41:21,853 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-20 08:41:21,853 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-11-20 08:41:21,853 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-11-20 08:41:21,853 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-11-20 08:41:21,853 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-20 08:41:21,853 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-11-20 08:41:21,854 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-11-20 08:41:21,854 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-11-20 08:41:21,856 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 -> d7249a4084734468a9df38189de6441ee3548af581a8047a10bfcd263bdf18bd [2024-11-20 08:41:22,058 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-20 08:41:22,074 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-20 08:41:22,077 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-20 08:41:22,078 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-20 08:41:22,078 INFO L274 PluginConnector]: CDTParser initialized [2024-11-20 08:41:22,079 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-ap_file-90.i [2024-11-20 08:41:23,338 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-20 08:41:23,491 INFO L384 CDTParser]: Found 1 translation units. [2024-11-20 08:41:23,492 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-ap_file-90.i [2024-11-20 08:41:23,501 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/79e1cd3d8/3e117a8264dc4f8fb733309e2ae7cf59/FLAG09b4ebba5 [2024-11-20 08:41:23,898 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/79e1cd3d8/3e117a8264dc4f8fb733309e2ae7cf59 [2024-11-20 08:41:23,900 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-20 08:41:23,901 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-20 08:41:23,902 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-20 08:41:23,902 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-20 08:41:23,906 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-20 08:41:23,906 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 20.11 08:41:23" (1/1) ... [2024-11-20 08:41:23,907 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@75548c9a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 08:41:23, skipping insertion in model container [2024-11-20 08:41:23,907 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 20.11 08:41:23" (1/1) ... [2024-11-20 08:41:23,931 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-20 08:41:24,061 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-ap_file-90.i[917,930] [2024-11-20 08:41:24,119 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-20 08:41:24,137 INFO L200 MainTranslator]: Completed pre-run [2024-11-20 08:41:24,147 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-ap_file-90.i[917,930] [2024-11-20 08:41:24,187 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-20 08:41:24,210 INFO L204 MainTranslator]: Completed translation [2024-11-20 08:41:24,211 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 08:41:24 WrapperNode [2024-11-20 08:41:24,211 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-20 08:41:24,213 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-20 08:41:24,213 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-20 08:41:24,213 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-20 08:41:24,219 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 08:41:24" (1/1) ... [2024-11-20 08:41:24,231 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 08:41:24" (1/1) ... [2024-11-20 08:41:24,265 INFO L138 Inliner]: procedures = 26, calls = 165, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 484 [2024-11-20 08:41:24,266 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-20 08:41:24,266 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-20 08:41:24,267 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-20 08:41:24,269 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-20 08:41:24,278 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 08:41:24" (1/1) ... [2024-11-20 08:41:24,278 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 08:41:24" (1/1) ... [2024-11-20 08:41:24,283 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 08:41:24" (1/1) ... [2024-11-20 08:41:24,307 INFO L175 MemorySlicer]: Split 130 memory accesses to 5 slices as follows [2, 34, 4, 55, 35]. 42 percent of accesses are in the largest equivalence class. The 17 initializations are split as follows [2, 5, 1, 6, 3]. The 19 writes are split as follows [0, 6, 1, 6, 6]. [2024-11-20 08:41:24,307 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 08:41:24" (1/1) ... [2024-11-20 08:41:24,308 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 08:41:24" (1/1) ... [2024-11-20 08:41:24,318 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 08:41:24" (1/1) ... [2024-11-20 08:41:24,321 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 08:41:24" (1/1) ... [2024-11-20 08:41:24,323 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 08:41:24" (1/1) ... [2024-11-20 08:41:24,324 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 08:41:24" (1/1) ... [2024-11-20 08:41:24,327 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-20 08:41:24,333 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-11-20 08:41:24,333 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-11-20 08:41:24,334 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-11-20 08:41:24,334 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 08:41:24" (1/1) ... [2024-11-20 08:41:24,339 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-20 08:41:24,352 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-20 08:41:24,368 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2024-11-20 08:41:24,371 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2024-11-20 08:41:24,411 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-11-20 08:41:24,412 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#0 [2024-11-20 08:41:24,412 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#1 [2024-11-20 08:41:24,412 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#2 [2024-11-20 08:41:24,412 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#3 [2024-11-20 08:41:24,412 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#4 [2024-11-20 08:41:24,412 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#0 [2024-11-20 08:41:24,412 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#1 [2024-11-20 08:41:24,412 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#2 [2024-11-20 08:41:24,412 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#3 [2024-11-20 08:41:24,412 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#4 [2024-11-20 08:41:24,413 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2024-11-20 08:41:24,413 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2024-11-20 08:41:24,413 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-11-20 08:41:24,413 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#1 [2024-11-20 08:41:24,413 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#2 [2024-11-20 08:41:24,413 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#3 [2024-11-20 08:41:24,413 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#4 [2024-11-20 08:41:24,413 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-20 08:41:24,413 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-20 08:41:24,541 INFO L238 CfgBuilder]: Building ICFG [2024-11-20 08:41:24,543 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-20 08:41:24,922 INFO L? ?]: Removed 112 outVars from TransFormulas that were not future-live. [2024-11-20 08:41:24,922 INFO L287 CfgBuilder]: Performing block encoding [2024-11-20 08:41:24,933 INFO L311 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-20 08:41:24,934 INFO L316 CfgBuilder]: Removed 1 assume(true) statements. [2024-11-20 08:41:24,934 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 20.11 08:41:24 BoogieIcfgContainer [2024-11-20 08:41:24,934 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-11-20 08:41:24,935 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-11-20 08:41:24,936 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-11-20 08:41:24,939 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-11-20 08:41:24,939 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 20.11 08:41:23" (1/3) ... [2024-11-20 08:41:24,940 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@23c55c14 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 20.11 08:41:24, skipping insertion in model container [2024-11-20 08:41:24,940 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 08:41:24" (2/3) ... [2024-11-20 08:41:24,940 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@23c55c14 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 20.11 08:41:24, skipping insertion in model container [2024-11-20 08:41:24,940 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 20.11 08:41:24" (3/3) ... [2024-11-20 08:41:24,941 INFO L112 eAbstractionObserver]: Analyzing ICFG hardness_variablewrapping_wrapper-ap_file-90.i [2024-11-20 08:41:24,953 INFO L214 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-11-20 08:41:24,953 INFO L154 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-11-20 08:41:24,997 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-20 08:41:25,002 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;@5144b92f, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-20 08:41:25,003 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-11-20 08:41:25,006 INFO L276 IsEmpty]: Start isEmpty. Operand has 111 states, 88 states have (on average 1.375) internal successors, (121), 89 states have internal predecessors, (121), 20 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 20 states have call predecessors, (20), 20 states have call successors, (20) [2024-11-20 08:41:25,016 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 154 [2024-11-20 08:41:25,016 INFO L207 NwaCegarLoop]: Found error trace [2024-11-20 08:41:25,017 INFO L215 NwaCegarLoop]: trace histogram [20, 20, 20, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-20 08:41:25,017 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-20 08:41:25,021 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-20 08:41:25,021 INFO L85 PathProgramCache]: Analyzing trace with hash -803015530, now seen corresponding path program 1 times [2024-11-20 08:41:25,028 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-20 08:41:25,028 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2120497379] [2024-11-20 08:41:25,029 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-20 08:41:25,029 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-20 08:41:25,194 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 08:41:25,321 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-20 08:41:25,324 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 08:41:25,328 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-11-20 08:41:25,332 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 08:41:25,336 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-11-20 08:41:25,338 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 08:41:25,344 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2024-11-20 08:41:25,345 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 08:41:25,347 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-11-20 08:41:25,350 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 08:41:25,352 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2024-11-20 08:41:25,356 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 08:41:25,358 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2024-11-20 08:41:25,361 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 08:41:25,363 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2024-11-20 08:41:25,366 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 08:41:25,368 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 53 [2024-11-20 08:41:25,371 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 08:41:25,372 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2024-11-20 08:41:25,374 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 08:41:25,380 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2024-11-20 08:41:25,381 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 08:41:25,383 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2024-11-20 08:41:25,384 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 08:41:25,386 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2024-11-20 08:41:25,388 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 08:41:25,390 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2024-11-20 08:41:25,393 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 08:41:25,395 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 89 [2024-11-20 08:41:25,397 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 08:41:25,400 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 95 [2024-11-20 08:41:25,404 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 08:41:25,405 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 101 [2024-11-20 08:41:25,406 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 08:41:25,407 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 107 [2024-11-20 08:41:25,408 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 08:41:25,410 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 113 [2024-11-20 08:41:25,414 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 08:41:25,416 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 119 [2024-11-20 08:41:25,417 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 08:41:25,422 INFO L134 CoverageAnalysis]: Checked inductivity of 760 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 760 trivial. 0 not checked. [2024-11-20 08:41:25,422 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-20 08:41:25,423 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2120497379] [2024-11-20 08:41:25,423 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2120497379] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-20 08:41:25,423 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-20 08:41:25,424 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-20 08:41:25,425 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1076568113] [2024-11-20 08:41:25,426 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-20 08:41:25,430 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-11-20 08:41:25,430 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-20 08:41:25,450 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-11-20 08:41:25,451 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-11-20 08:41:25,453 INFO L87 Difference]: Start difference. First operand has 111 states, 88 states have (on average 1.375) internal successors, (121), 89 states have internal predecessors, (121), 20 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 20 states have call predecessors, (20), 20 states have call successors, (20) 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, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 1 states have call predecessors, (20), 2 states have call successors, (20) [2024-11-20 08:41:25,481 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-20 08:41:25,483 INFO L93 Difference]: Finished difference Result 215 states and 336 transitions. [2024-11-20 08:41:25,484 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-11-20 08:41:25,485 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, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 1 states have call predecessors, (20), 2 states have call successors, (20) Word has length 153 [2024-11-20 08:41:25,485 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-20 08:41:25,492 INFO L225 Difference]: With dead ends: 215 [2024-11-20 08:41:25,492 INFO L226 Difference]: Without dead ends: 107 [2024-11-20 08:41:25,495 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 62 GetRequests, 62 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-11-20 08:41:25,497 INFO L432 NwaCegarLoop]: 154 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 0 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 154 SdHoareTripleChecker+Invalid, 0 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 0 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-20 08:41:25,498 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 154 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-20 08:41:25,509 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 107 states. [2024-11-20 08:41:25,537 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 107 to 107. [2024-11-20 08:41:25,538 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 107 states, 85 states have (on average 1.3411764705882352) internal successors, (114), 85 states have internal predecessors, (114), 20 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 20 states have call predecessors, (20), 20 states have call successors, (20) [2024-11-20 08:41:25,541 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 107 states to 107 states and 154 transitions. [2024-11-20 08:41:25,542 INFO L78 Accepts]: Start accepts. Automaton has 107 states and 154 transitions. Word has length 153 [2024-11-20 08:41:25,542 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-20 08:41:25,543 INFO L471 AbstractCegarLoop]: Abstraction has 107 states and 154 transitions. [2024-11-20 08:41:25,543 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, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 1 states have call predecessors, (20), 2 states have call successors, (20) [2024-11-20 08:41:25,543 INFO L276 IsEmpty]: Start isEmpty. Operand 107 states and 154 transitions. [2024-11-20 08:41:25,545 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 154 [2024-11-20 08:41:25,545 INFO L207 NwaCegarLoop]: Found error trace [2024-11-20 08:41:25,546 INFO L215 NwaCegarLoop]: trace histogram [20, 20, 20, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-20 08:41:25,546 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-11-20 08:41:25,546 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-20 08:41:25,546 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-20 08:41:25,547 INFO L85 PathProgramCache]: Analyzing trace with hash 82058350, now seen corresponding path program 1 times [2024-11-20 08:41:25,547 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-20 08:41:25,547 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1421957846] [2024-11-20 08:41:25,547 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-20 08:41:25,547 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-20 08:41:25,623 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 08:41:25,865 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-20 08:41:25,867 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 08:41:25,868 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-11-20 08:41:25,870 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 08:41:25,871 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-11-20 08:41:25,872 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 08:41:25,873 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2024-11-20 08:41:25,874 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 08:41:25,876 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-11-20 08:41:25,877 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 08:41:25,879 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2024-11-20 08:41:25,880 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 08:41:25,882 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2024-11-20 08:41:25,882 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 08:41:25,883 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2024-11-20 08:41:25,884 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 08:41:25,887 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 53 [2024-11-20 08:41:25,888 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 08:41:25,889 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2024-11-20 08:41:25,890 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 08:41:25,893 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2024-11-20 08:41:25,894 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 08:41:25,895 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2024-11-20 08:41:25,896 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 08:41:25,897 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2024-11-20 08:41:25,898 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 08:41:25,900 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2024-11-20 08:41:25,901 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 08:41:25,902 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 89 [2024-11-20 08:41:25,903 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 08:41:25,904 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 95 [2024-11-20 08:41:25,905 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 08:41:25,906 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 101 [2024-11-20 08:41:25,907 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 08:41:25,908 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 107 [2024-11-20 08:41:25,909 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 08:41:25,910 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 113 [2024-11-20 08:41:25,911 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 08:41:25,913 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 119 [2024-11-20 08:41:25,914 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 08:41:25,916 INFO L134 CoverageAnalysis]: Checked inductivity of 760 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 760 trivial. 0 not checked. [2024-11-20 08:41:25,917 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-20 08:41:25,917 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1421957846] [2024-11-20 08:41:25,918 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1421957846] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-20 08:41:25,918 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-20 08:41:25,918 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-20 08:41:25,918 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1369811523] [2024-11-20 08:41:25,918 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-20 08:41:25,919 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-20 08:41:25,919 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-20 08:41:25,920 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-20 08:41:25,920 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-20 08:41:25,920 INFO L87 Difference]: Start difference. First operand 107 states and 154 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, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 1 states have call predecessors, (20), 1 states have call successors, (20) [2024-11-20 08:41:25,962 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-20 08:41:25,962 INFO L93 Difference]: Finished difference Result 213 states and 308 transitions. [2024-11-20 08:41:25,962 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-20 08:41:25,962 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, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 1 states have call predecessors, (20), 1 states have call successors, (20) Word has length 153 [2024-11-20 08:41:25,963 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-20 08:41:25,964 INFO L225 Difference]: With dead ends: 213 [2024-11-20 08:41:25,964 INFO L226 Difference]: Without dead ends: 109 [2024-11-20 08:41:25,965 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 45 GetRequests, 43 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-11-20 08:41:25,966 INFO L432 NwaCegarLoop]: 152 mSDtfsCounter, 0 mSDsluCounter, 293 mSDsCounter, 0 mSdLazyCounter, 16 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 445 SdHoareTripleChecker+Invalid, 16 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 16 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-20 08:41:25,966 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 445 Invalid, 16 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 16 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-20 08:41:25,967 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 109 states. [2024-11-20 08:41:25,973 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 109 to 109. [2024-11-20 08:41:25,973 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 109 states, 87 states have (on average 1.3333333333333333) internal successors, (116), 87 states have internal predecessors, (116), 20 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 20 states have call predecessors, (20), 20 states have call successors, (20) [2024-11-20 08:41:25,974 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 109 states to 109 states and 156 transitions. [2024-11-20 08:41:25,975 INFO L78 Accepts]: Start accepts. Automaton has 109 states and 156 transitions. Word has length 153 [2024-11-20 08:41:25,976 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-20 08:41:25,976 INFO L471 AbstractCegarLoop]: Abstraction has 109 states and 156 transitions. [2024-11-20 08:41:25,976 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, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 1 states have call predecessors, (20), 1 states have call successors, (20) [2024-11-20 08:41:25,976 INFO L276 IsEmpty]: Start isEmpty. Operand 109 states and 156 transitions. [2024-11-20 08:41:25,978 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 156 [2024-11-20 08:41:25,978 INFO L207 NwaCegarLoop]: Found error trace [2024-11-20 08:41:25,978 INFO L215 NwaCegarLoop]: trace histogram [20, 20, 20, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-20 08:41:25,978 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-11-20 08:41:25,978 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-20 08:41:25,979 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-20 08:41:25,979 INFO L85 PathProgramCache]: Analyzing trace with hash 1318528233, now seen corresponding path program 1 times [2024-11-20 08:41:25,979 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-20 08:41:25,979 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [752791612] [2024-11-20 08:41:25,979 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-20 08:41:25,979 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-20 08:41:26,029 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 08:41:26,300 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-20 08:41:26,301 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 08:41:26,302 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-11-20 08:41:26,303 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 08:41:26,308 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-11-20 08:41:26,308 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 08:41:26,309 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2024-11-20 08:41:26,310 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 08:41:26,311 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-11-20 08:41:26,313 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 08:41:26,314 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2024-11-20 08:41:26,315 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 08:41:26,316 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2024-11-20 08:41:26,316 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 08:41:26,317 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2024-11-20 08:41:26,318 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 08:41:26,320 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 53 [2024-11-20 08:41:26,322 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 08:41:26,323 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2024-11-20 08:41:26,325 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 08:41:26,325 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2024-11-20 08:41:26,326 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 08:41:26,327 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2024-11-20 08:41:26,328 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 08:41:26,329 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2024-11-20 08:41:26,330 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 08:41:26,331 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2024-11-20 08:41:26,332 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 08:41:26,333 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 89 [2024-11-20 08:41:26,334 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 08:41:26,335 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 95 [2024-11-20 08:41:26,337 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 08:41:26,338 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 101 [2024-11-20 08:41:26,339 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 08:41:26,340 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 107 [2024-11-20 08:41:26,343 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 08:41:26,344 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 113 [2024-11-20 08:41:26,344 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 08:41:26,345 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 119 [2024-11-20 08:41:26,346 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 08:41:26,347 INFO L134 CoverageAnalysis]: Checked inductivity of 760 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 760 trivial. 0 not checked. [2024-11-20 08:41:26,347 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-20 08:41:26,347 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [752791612] [2024-11-20 08:41:26,348 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [752791612] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-20 08:41:26,348 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-20 08:41:26,348 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-20 08:41:26,348 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1815671315] [2024-11-20 08:41:26,348 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-20 08:41:26,349 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-20 08:41:26,349 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-20 08:41:26,349 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-20 08:41:26,349 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-11-20 08:41:26,350 INFO L87 Difference]: Start difference. First operand 109 states and 156 transitions. Second operand has 5 states, 5 states have (on average 11.6) internal successors, (58), 5 states have internal predecessors, (58), 1 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 1 states have call predecessors, (20), 1 states have call successors, (20) [2024-11-20 08:41:26,447 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-20 08:41:26,448 INFO L93 Difference]: Finished difference Result 263 states and 376 transitions. [2024-11-20 08:41:26,449 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-20 08:41:26,450 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 11.6) internal successors, (58), 5 states have internal predecessors, (58), 1 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 1 states have call predecessors, (20), 1 states have call successors, (20) Word has length 155 [2024-11-20 08:41:26,450 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-20 08:41:26,451 INFO L225 Difference]: With dead ends: 263 [2024-11-20 08:41:26,451 INFO L226 Difference]: Without dead ends: 157 [2024-11-20 08:41:26,452 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 46 GetRequests, 42 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2024-11-20 08:41:26,453 INFO L432 NwaCegarLoop]: 198 mSDtfsCounter, 60 mSDsluCounter, 518 mSDsCounter, 0 mSdLazyCounter, 65 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 60 SdHoareTripleChecker+Valid, 716 SdHoareTripleChecker+Invalid, 65 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 65 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-20 08:41:26,453 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [60 Valid, 716 Invalid, 65 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 65 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-20 08:41:26,457 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 157 states. [2024-11-20 08:41:26,465 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 157 to 114. [2024-11-20 08:41:26,469 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 114 states, 92 states have (on average 1.326086956521739) internal successors, (122), 92 states have internal predecessors, (122), 20 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 20 states have call predecessors, (20), 20 states have call successors, (20) [2024-11-20 08:41:26,469 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 114 states to 114 states and 162 transitions. [2024-11-20 08:41:26,472 INFO L78 Accepts]: Start accepts. Automaton has 114 states and 162 transitions. Word has length 155 [2024-11-20 08:41:26,472 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-20 08:41:26,472 INFO L471 AbstractCegarLoop]: Abstraction has 114 states and 162 transitions. [2024-11-20 08:41:26,472 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 11.6) internal successors, (58), 5 states have internal predecessors, (58), 1 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 1 states have call predecessors, (20), 1 states have call successors, (20) [2024-11-20 08:41:26,472 INFO L276 IsEmpty]: Start isEmpty. Operand 114 states and 162 transitions. [2024-11-20 08:41:26,474 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 156 [2024-11-20 08:41:26,474 INFO L207 NwaCegarLoop]: Found error trace [2024-11-20 08:41:26,476 INFO L215 NwaCegarLoop]: trace histogram [20, 20, 20, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-20 08:41:26,476 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-11-20 08:41:26,477 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-20 08:41:26,477 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-20 08:41:26,477 INFO L85 PathProgramCache]: Analyzing trace with hash 1537382951, now seen corresponding path program 1 times [2024-11-20 08:41:26,477 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-20 08:41:26,477 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [809433697] [2024-11-20 08:41:26,477 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-20 08:41:26,478 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-20 08:41:26,547 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 08:41:26,972 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-20 08:41:26,973 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 08:41:26,978 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-11-20 08:41:26,979 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 08:41:26,980 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-11-20 08:41:26,985 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 08:41:26,986 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2024-11-20 08:41:26,987 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 08:41:26,988 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-11-20 08:41:26,989 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 08:41:26,990 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2024-11-20 08:41:26,991 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 08:41:26,992 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2024-11-20 08:41:26,993 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 08:41:26,994 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2024-11-20 08:41:26,996 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 08:41:26,997 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 53 [2024-11-20 08:41:26,998 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 08:41:27,000 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2024-11-20 08:41:27,001 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 08:41:27,002 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2024-11-20 08:41:27,003 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 08:41:27,004 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2024-11-20 08:41:27,004 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 08:41:27,005 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2024-11-20 08:41:27,007 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 08:41:27,008 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2024-11-20 08:41:27,009 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 08:41:27,009 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 89 [2024-11-20 08:41:27,011 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 08:41:27,012 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 95 [2024-11-20 08:41:27,013 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 08:41:27,014 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 101 [2024-11-20 08:41:27,015 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 08:41:27,016 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 107 [2024-11-20 08:41:27,017 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 08:41:27,018 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 113 [2024-11-20 08:41:27,020 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 08:41:27,025 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 119 [2024-11-20 08:41:27,026 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 08:41:27,027 INFO L134 CoverageAnalysis]: Checked inductivity of 760 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 760 trivial. 0 not checked. [2024-11-20 08:41:27,027 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-20 08:41:27,027 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [809433697] [2024-11-20 08:41:27,027 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [809433697] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-20 08:41:27,028 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-20 08:41:27,028 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-11-20 08:41:27,028 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1094094773] [2024-11-20 08:41:27,028 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-20 08:41:27,028 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-20 08:41:27,028 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-20 08:41:27,029 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-20 08:41:27,029 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2024-11-20 08:41:27,029 INFO L87 Difference]: Start difference. First operand 114 states and 162 transitions. Second operand has 6 states, 6 states have (on average 9.666666666666666) internal successors, (58), 6 states have internal predecessors, (58), 1 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 1 states have call predecessors, (20), 1 states have call successors, (20) [2024-11-20 08:41:27,128 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-20 08:41:27,129 INFO L93 Difference]: Finished difference Result 262 states and 372 transitions. [2024-11-20 08:41:27,129 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-20 08:41:27,129 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 9.666666666666666) internal successors, (58), 6 states have internal predecessors, (58), 1 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 1 states have call predecessors, (20), 1 states have call successors, (20) Word has length 155 [2024-11-20 08:41:27,130 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-20 08:41:27,131 INFO L225 Difference]: With dead ends: 262 [2024-11-20 08:41:27,133 INFO L226 Difference]: Without dead ends: 151 [2024-11-20 08:41:27,133 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 48 GetRequests, 42 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=19, Invalid=37, Unknown=0, NotChecked=0, Total=56 [2024-11-20 08:41:27,134 INFO L432 NwaCegarLoop]: 142 mSDtfsCounter, 162 mSDsluCounter, 391 mSDsCounter, 0 mSdLazyCounter, 78 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 162 SdHoareTripleChecker+Valid, 533 SdHoareTripleChecker+Invalid, 81 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 78 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-20 08:41:27,134 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [162 Valid, 533 Invalid, 81 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 78 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-20 08:41:27,135 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 151 states. [2024-11-20 08:41:27,141 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 151 to 116. [2024-11-20 08:41:27,145 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 116 states, 94 states have (on average 1.3191489361702127) internal successors, (124), 94 states have internal predecessors, (124), 20 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 20 states have call predecessors, (20), 20 states have call successors, (20) [2024-11-20 08:41:27,145 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 116 states to 116 states and 164 transitions. [2024-11-20 08:41:27,146 INFO L78 Accepts]: Start accepts. Automaton has 116 states and 164 transitions. Word has length 155 [2024-11-20 08:41:27,147 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-20 08:41:27,147 INFO L471 AbstractCegarLoop]: Abstraction has 116 states and 164 transitions. [2024-11-20 08:41:27,147 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 9.666666666666666) internal successors, (58), 6 states have internal predecessors, (58), 1 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 1 states have call predecessors, (20), 1 states have call successors, (20) [2024-11-20 08:41:27,147 INFO L276 IsEmpty]: Start isEmpty. Operand 116 states and 164 transitions. [2024-11-20 08:41:27,149 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 157 [2024-11-20 08:41:27,150 INFO L207 NwaCegarLoop]: Found error trace [2024-11-20 08:41:27,150 INFO L215 NwaCegarLoop]: trace histogram [20, 20, 20, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-20 08:41:27,150 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2024-11-20 08:41:27,151 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-20 08:41:27,151 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-20 08:41:27,151 INFO L85 PathProgramCache]: Analyzing trace with hash -963382957, now seen corresponding path program 1 times [2024-11-20 08:41:27,151 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-20 08:41:27,151 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [964477050] [2024-11-20 08:41:27,151 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-20 08:41:27,151 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-20 08:41:27,217 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 08:41:28,265 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-20 08:41:28,266 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 08:41:28,269 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-11-20 08:41:28,271 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 08:41:28,274 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-11-20 08:41:28,276 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 08:41:28,279 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2024-11-20 08:41:28,281 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 08:41:28,284 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-11-20 08:41:28,285 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 08:41:28,287 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2024-11-20 08:41:28,289 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 08:41:28,292 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2024-11-20 08:41:28,293 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 08:41:28,296 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2024-11-20 08:41:28,297 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 08:41:28,300 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 53 [2024-11-20 08:41:28,302 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 08:41:28,304 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2024-11-20 08:41:28,306 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 08:41:28,308 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2024-11-20 08:41:28,310 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 08:41:28,316 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2024-11-20 08:41:28,318 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 08:41:28,325 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2024-11-20 08:41:28,326 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 08:41:28,330 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2024-11-20 08:41:28,335 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 08:41:28,341 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 89 [2024-11-20 08:41:28,343 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 08:41:28,345 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 95 [2024-11-20 08:41:28,348 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 08:41:28,352 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 101 [2024-11-20 08:41:28,355 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 08:41:28,357 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 107 [2024-11-20 08:41:28,359 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 08:41:28,363 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 113 [2024-11-20 08:41:28,368 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 08:41:28,374 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 119 [2024-11-20 08:41:28,375 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 08:41:28,378 INFO L134 CoverageAnalysis]: Checked inductivity of 760 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 760 trivial. 0 not checked. [2024-11-20 08:41:28,378 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-20 08:41:28,379 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [964477050] [2024-11-20 08:41:28,379 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [964477050] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-20 08:41:28,379 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-20 08:41:28,379 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2024-11-20 08:41:28,379 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [998373692] [2024-11-20 08:41:28,379 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-20 08:41:28,380 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-11-20 08:41:28,380 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-20 08:41:28,380 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-11-20 08:41:28,380 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=69, Unknown=0, NotChecked=0, Total=90 [2024-11-20 08:41:28,381 INFO L87 Difference]: Start difference. First operand 116 states and 164 transitions. Second operand has 10 states, 9 states have (on average 6.555555555555555) internal successors, (59), 10 states have internal predecessors, (59), 3 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 2 states have call predecessors, (20), 3 states have call successors, (20) [2024-11-20 08:41:28,665 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-20 08:41:28,666 INFO L93 Difference]: Finished difference Result 236 states and 332 transitions. [2024-11-20 08:41:28,666 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-11-20 08:41:28,666 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 9 states have (on average 6.555555555555555) internal successors, (59), 10 states have internal predecessors, (59), 3 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 2 states have call predecessors, (20), 3 states have call successors, (20) Word has length 156 [2024-11-20 08:41:28,666 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-20 08:41:28,667 INFO L225 Difference]: With dead ends: 236 [2024-11-20 08:41:28,667 INFO L226 Difference]: Without dead ends: 123 [2024-11-20 08:41:28,668 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 58 GetRequests, 45 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 21 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=54, Invalid=156, Unknown=0, NotChecked=0, Total=210 [2024-11-20 08:41:28,668 INFO L432 NwaCegarLoop]: 131 mSDtfsCounter, 189 mSDsluCounter, 566 mSDsCounter, 0 mSdLazyCounter, 245 mSolverCounterSat, 53 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 190 SdHoareTripleChecker+Valid, 697 SdHoareTripleChecker+Invalid, 298 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 53 IncrementalHoareTripleChecker+Valid, 245 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-11-20 08:41:28,669 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [190 Valid, 697 Invalid, 298 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [53 Valid, 245 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-11-20 08:41:28,669 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 123 states. [2024-11-20 08:41:28,686 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 123 to 123. [2024-11-20 08:41:28,687 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 123 states, 100 states have (on average 1.3) internal successors, (130), 100 states have internal predecessors, (130), 20 states have call successors, (20), 2 states have call predecessors, (20), 2 states have return successors, (20), 20 states have call predecessors, (20), 20 states have call successors, (20) [2024-11-20 08:41:28,688 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 123 states to 123 states and 170 transitions. [2024-11-20 08:41:28,689 INFO L78 Accepts]: Start accepts. Automaton has 123 states and 170 transitions. Word has length 156 [2024-11-20 08:41:28,689 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-20 08:41:28,689 INFO L471 AbstractCegarLoop]: Abstraction has 123 states and 170 transitions. [2024-11-20 08:41:28,689 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 9 states have (on average 6.555555555555555) internal successors, (59), 10 states have internal predecessors, (59), 3 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 2 states have call predecessors, (20), 3 states have call successors, (20) [2024-11-20 08:41:28,689 INFO L276 IsEmpty]: Start isEmpty. Operand 123 states and 170 transitions. [2024-11-20 08:41:28,690 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 158 [2024-11-20 08:41:28,691 INFO L207 NwaCegarLoop]: Found error trace [2024-11-20 08:41:28,691 INFO L215 NwaCegarLoop]: trace histogram [20, 20, 20, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-20 08:41:28,691 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2024-11-20 08:41:28,691 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-20 08:41:28,692 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-20 08:41:28,692 INFO L85 PathProgramCache]: Analyzing trace with hash -842790620, now seen corresponding path program 1 times [2024-11-20 08:41:28,692 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-20 08:41:28,692 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2143554705] [2024-11-20 08:41:28,692 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-20 08:41:28,692 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-20 08:41:28,777 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 08:41:31,313 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-20 08:41:31,316 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 08:41:31,323 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-11-20 08:41:31,325 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 08:41:31,332 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-11-20 08:41:31,333 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 08:41:31,341 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2024-11-20 08:41:31,342 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 08:41:31,350 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-11-20 08:41:31,351 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 08:41:31,358 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2024-11-20 08:41:31,359 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 08:41:31,366 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2024-11-20 08:41:31,367 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 08:41:31,373 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2024-11-20 08:41:31,374 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 08:41:31,381 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 53 [2024-11-20 08:41:31,383 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 08:41:31,389 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2024-11-20 08:41:31,390 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 08:41:31,395 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2024-11-20 08:41:31,397 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 08:41:31,402 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2024-11-20 08:41:31,404 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 08:41:31,410 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2024-11-20 08:41:31,411 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 08:41:31,463 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2024-11-20 08:41:31,464 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 08:41:31,471 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 89 [2024-11-20 08:41:31,472 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 08:41:31,488 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 95 [2024-11-20 08:41:31,492 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 08:41:31,497 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 101 [2024-11-20 08:41:31,499 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 08:41:31,503 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 107 [2024-11-20 08:41:31,504 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 08:41:31,509 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 113 [2024-11-20 08:41:31,510 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 08:41:31,515 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 119 [2024-11-20 08:41:31,516 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 08:41:31,523 INFO L134 CoverageAnalysis]: Checked inductivity of 760 backedges. 36 proven. 21 refuted. 0 times theorem prover too weak. 703 trivial. 0 not checked. [2024-11-20 08:41:31,523 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-20 08:41:31,523 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2143554705] [2024-11-20 08:41:31,523 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2143554705] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-20 08:41:31,523 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [998172524] [2024-11-20 08:41:31,524 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-20 08:41:31,524 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-20 08:41:31,524 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-20 08:41:31,527 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-20 08:41:31,528 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2024-11-20 08:41:31,677 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 08:41:31,681 INFO L255 TraceCheckSpWp]: Trace formula consists of 539 conjuncts, 72 conjuncts are in the unsatisfiable core [2024-11-20 08:41:31,696 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-20 08:41:33,717 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-11-20 08:41:34,005 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-11-20 08:41:34,928 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-11-20 08:41:34,935 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-20 08:41:34,936 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-11-20 08:41:34,979 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-20 08:41:34,981 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-20 08:41:34,981 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 18 [2024-11-20 08:41:35,293 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-20 08:41:35,294 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-20 08:41:35,323 INFO L349 Elim1Store]: treesize reduction 72, result has 24.2 percent of original size [2024-11-20 08:41:35,324 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 3 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 7 case distinctions, treesize of input 132 treesize of output 113 [2024-11-20 08:41:35,790 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-20 08:41:35,791 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 6 select indices, 6 select index equivalence classes, 1 disjoint index pairs (out of 15 index pairs), introduced 6 new quantified variables, introduced 14 case distinctions, treesize of input 146 treesize of output 198 [2024-11-20 08:41:37,148 INFO L134 CoverageAnalysis]: Checked inductivity of 760 backedges. 0 proven. 375 refuted. 0 times theorem prover too weak. 385 trivial. 0 not checked. [2024-11-20 08:41:37,149 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-20 08:41:41,715 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse1 (select |c_#memory_int#3| c_~signed_short_int_Array_0_arraysigned_short_int_Array_0Var0_Pointer~0.base))) (and (forall ((v_ArrVal_189 (Array Int Int))) (let ((.cse0 (select v_ArrVal_189 c_~signed_short_int_Array_0_arraysigned_short_int_Array_0Var0_Pointer~0.offset))) (or (< 0 (+ .cse0 1)) (not (= v_ArrVal_189 (store .cse1 c_~signed_short_int_Array_0_arraysigned_short_int_Array_0Var0_Pointer~0.offset .cse0))) (< (+ .cse0 32768) 0) (let ((.cse4 (store |c_#memory_int#3| c_~signed_short_int_Array_0_arraysigned_short_int_Array_0Var0_Pointer~0.base v_ArrVal_189))) (let ((.cse2 (mod (+ (select (select .cse4 c_~signed_short_int_Array_0_arraysigned_short_int_Array_0Var3_Pointer~0.base) c_~signed_short_int_Array_0_arraysigned_short_int_Array_0Var3_Pointer~0.offset) (select (select .cse4 c_~signed_short_int_Array_0_arraysigned_short_int_Array_0Var4_Pointer~0.base) c_~signed_short_int_Array_0_arraysigned_short_int_Array_0Var4_Pointer~0.offset)) 65536))) (= .cse2 (mod (let ((.cse3 (store .cse4 c_~signed_short_int_Array_0_arraysigned_short_int_Array_0Var5_Pointer~0.base (store (select .cse4 c_~signed_short_int_Array_0_arraysigned_short_int_Array_0Var5_Pointer~0.base) c_~signed_short_int_Array_0_arraysigned_short_int_Array_0Var5_Pointer~0.offset (+ .cse2 (- 65536)))))) (+ (select (select .cse3 c_~signed_short_int_Array_0_arraysigned_short_int_Array_0Var4_Pointer~0.base) c_~signed_short_int_Array_0_arraysigned_short_int_Array_0Var4_Pointer~0.offset) (select (select .cse3 c_~signed_short_int_Array_0_arraysigned_short_int_Array_0Var3_Pointer~0.base) c_~signed_short_int_Array_0_arraysigned_short_int_Array_0Var3_Pointer~0.offset))) 65536))))))) (forall ((v_ArrVal_189 (Array Int Int))) (let ((.cse5 (select v_ArrVal_189 c_~signed_short_int_Array_0_arraysigned_short_int_Array_0Var0_Pointer~0.offset))) (or (< 32767 .cse5) (< .cse5 0) (not (= v_ArrVal_189 (store .cse1 c_~signed_short_int_Array_0_arraysigned_short_int_Array_0Var0_Pointer~0.offset .cse5))) (let ((.cse8 (store |c_#memory_int#3| c_~signed_short_int_Array_0_arraysigned_short_int_Array_0Var0_Pointer~0.base v_ArrVal_189))) (let ((.cse6 (mod (+ (select (select .cse8 c_~signed_short_int_Array_0_arraysigned_short_int_Array_0Var3_Pointer~0.base) c_~signed_short_int_Array_0_arraysigned_short_int_Array_0Var3_Pointer~0.offset) (select (select .cse8 c_~signed_short_int_Array_0_arraysigned_short_int_Array_0Var4_Pointer~0.base) c_~signed_short_int_Array_0_arraysigned_short_int_Array_0Var4_Pointer~0.offset)) 65536))) (= .cse6 (mod (let ((.cse7 (store .cse8 c_~signed_short_int_Array_0_arraysigned_short_int_Array_0Var5_Pointer~0.base (store (select .cse8 c_~signed_short_int_Array_0_arraysigned_short_int_Array_0Var5_Pointer~0.base) c_~signed_short_int_Array_0_arraysigned_short_int_Array_0Var5_Pointer~0.offset (+ .cse6 (- 65536)))))) (+ (select (select .cse7 c_~signed_short_int_Array_0_arraysigned_short_int_Array_0Var4_Pointer~0.base) c_~signed_short_int_Array_0_arraysigned_short_int_Array_0Var4_Pointer~0.offset) (select (select .cse7 c_~signed_short_int_Array_0_arraysigned_short_int_Array_0Var3_Pointer~0.base) c_~signed_short_int_Array_0_arraysigned_short_int_Array_0Var3_Pointer~0.offset))) 65536))))))))) is different from false [2024-11-20 08:41:43,457 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [998172524] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-20 08:41:43,457 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-11-20 08:41:43,457 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [24, 16] total 37 [2024-11-20 08:41:43,457 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1851840225] [2024-11-20 08:41:43,457 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-11-20 08:41:43,458 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 37 states [2024-11-20 08:41:43,458 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-20 08:41:43,459 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 37 interpolants. [2024-11-20 08:41:43,459 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=226, Invalid=1669, Unknown=1, NotChecked=84, Total=1980 [2024-11-20 08:41:43,460 INFO L87 Difference]: Start difference. First operand 123 states and 170 transitions. Second operand has 37 states, 36 states have (on average 3.2777777777777777) internal successors, (118), 37 states have internal predecessors, (118), 8 states have call successors, (40), 3 states have call predecessors, (40), 5 states have return successors, (40), 7 states have call predecessors, (40), 8 states have call successors, (40) [2024-11-20 08:41:55,843 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-20 08:41:55,843 INFO L93 Difference]: Finished difference Result 564 states and 771 transitions. [2024-11-20 08:41:55,843 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 48 states. [2024-11-20 08:41:55,844 INFO L78 Accepts]: Start accepts. Automaton has has 37 states, 36 states have (on average 3.2777777777777777) internal successors, (118), 37 states have internal predecessors, (118), 8 states have call successors, (40), 3 states have call predecessors, (40), 5 states have return successors, (40), 7 states have call predecessors, (40), 8 states have call successors, (40) Word has length 157 [2024-11-20 08:41:55,844 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-20 08:41:55,846 INFO L225 Difference]: With dead ends: 564 [2024-11-20 08:41:55,846 INFO L226 Difference]: Without dead ends: 444 [2024-11-20 08:41:55,851 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 297 GetRequests, 211 SyntacticMatches, 1 SemanticMatches, 85 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 1599 ImplicationChecksByTransitivity, 12.4s TimeCoverageRelationStatistics Valid=1118, Invalid=6195, Unknown=1, NotChecked=168, Total=7482 [2024-11-20 08:41:55,851 INFO L432 NwaCegarLoop]: 143 mSDtfsCounter, 1624 mSDsluCounter, 3342 mSDsCounter, 0 mSdLazyCounter, 3116 mSolverCounterSat, 391 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 5.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1624 SdHoareTripleChecker+Valid, 3485 SdHoareTripleChecker+Invalid, 3507 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 391 IncrementalHoareTripleChecker+Valid, 3116 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 6.2s IncrementalHoareTripleChecker+Time [2024-11-20 08:41:55,852 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1624 Valid, 3485 Invalid, 3507 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [391 Valid, 3116 Invalid, 0 Unknown, 0 Unchecked, 6.2s Time] [2024-11-20 08:41:55,852 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 444 states. [2024-11-20 08:41:55,882 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 444 to 273. [2024-11-20 08:41:55,882 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 273 states, 217 states have (on average 1.2764976958525345) internal successors, (277), 218 states have internal predecessors, (277), 48 states have call successors, (48), 7 states have call predecessors, (48), 7 states have return successors, (48), 47 states have call predecessors, (48), 48 states have call successors, (48) [2024-11-20 08:41:55,883 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 273 states to 273 states and 373 transitions. [2024-11-20 08:41:55,883 INFO L78 Accepts]: Start accepts. Automaton has 273 states and 373 transitions. Word has length 157 [2024-11-20 08:41:55,884 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-20 08:41:55,884 INFO L471 AbstractCegarLoop]: Abstraction has 273 states and 373 transitions. [2024-11-20 08:41:55,886 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 37 states, 36 states have (on average 3.2777777777777777) internal successors, (118), 37 states have internal predecessors, (118), 8 states have call successors, (40), 3 states have call predecessors, (40), 5 states have return successors, (40), 7 states have call predecessors, (40), 8 states have call successors, (40) [2024-11-20 08:41:55,886 INFO L276 IsEmpty]: Start isEmpty. Operand 273 states and 373 transitions. [2024-11-20 08:41:55,887 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 158 [2024-11-20 08:41:55,887 INFO L207 NwaCegarLoop]: Found error trace [2024-11-20 08:41:55,887 INFO L215 NwaCegarLoop]: trace histogram [20, 20, 20, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-20 08:41:55,895 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2024-11-20 08:41:56,088 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable5 [2024-11-20 08:41:56,089 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-20 08:41:56,089 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-20 08:41:56,089 INFO L85 PathProgramCache]: Analyzing trace with hash -1853907870, now seen corresponding path program 1 times [2024-11-20 08:41:56,089 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-20 08:41:56,089 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2102358097] [2024-11-20 08:41:56,089 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-20 08:41:56,089 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-20 08:41:56,123 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 08:41:57,357 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-20 08:41:57,359 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 08:41:57,372 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-11-20 08:41:57,373 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 08:41:57,379 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-11-20 08:41:57,381 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 08:41:57,386 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2024-11-20 08:41:57,387 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 08:41:57,392 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-11-20 08:41:57,393 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 08:41:57,397 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2024-11-20 08:41:57,398 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 08:41:57,402 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2024-11-20 08:41:57,403 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 08:41:57,407 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2024-11-20 08:41:57,408 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 08:41:57,412 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 53 [2024-11-20 08:41:57,414 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 08:41:57,418 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2024-11-20 08:41:57,420 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 08:41:57,424 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2024-11-20 08:41:57,427 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 08:41:57,431 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2024-11-20 08:41:57,432 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 08:41:57,438 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2024-11-20 08:41:57,439 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 08:41:57,444 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2024-11-20 08:41:57,445 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 08:41:57,449 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 89 [2024-11-20 08:41:57,450 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 08:41:57,456 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 95 [2024-11-20 08:41:57,457 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 08:41:57,462 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 101 [2024-11-20 08:41:57,464 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 08:41:57,466 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 107 [2024-11-20 08:41:57,468 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 08:41:57,471 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 113 [2024-11-20 08:41:57,473 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 08:41:57,478 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 119 [2024-11-20 08:41:57,479 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 08:41:57,483 INFO L134 CoverageAnalysis]: Checked inductivity of 760 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 760 trivial. 0 not checked. [2024-11-20 08:41:57,483 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-20 08:41:57,483 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2102358097] [2024-11-20 08:41:57,483 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2102358097] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-20 08:41:57,484 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-20 08:41:57,484 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2024-11-20 08:41:57,485 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [685758816] [2024-11-20 08:41:57,485 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-20 08:41:57,486 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2024-11-20 08:41:57,486 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-20 08:41:57,487 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2024-11-20 08:41:57,487 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=39, Invalid=93, Unknown=0, NotChecked=0, Total=132 [2024-11-20 08:41:57,488 INFO L87 Difference]: Start difference. First operand 273 states and 373 transitions. Second operand has 12 states, 11 states have (on average 5.454545454545454) internal successors, (60), 12 states have internal predecessors, (60), 4 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 3 states have call predecessors, (20), 4 states have call successors, (20) [2024-11-20 08:41:58,550 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-20 08:41:58,551 INFO L93 Difference]: Finished difference Result 573 states and 785 transitions. [2024-11-20 08:41:58,551 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-11-20 08:41:58,551 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 11 states have (on average 5.454545454545454) internal successors, (60), 12 states have internal predecessors, (60), 4 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 3 states have call predecessors, (20), 4 states have call successors, (20) Word has length 157 [2024-11-20 08:41:58,552 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-20 08:41:58,554 INFO L225 Difference]: With dead ends: 573 [2024-11-20 08:41:58,555 INFO L226 Difference]: Without dead ends: 397 [2024-11-20 08:41:58,555 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 56 GetRequests, 43 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 35 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=67, Invalid=143, Unknown=0, NotChecked=0, Total=210 [2024-11-20 08:41:58,556 INFO L432 NwaCegarLoop]: 167 mSDtfsCounter, 279 mSDsluCounter, 556 mSDsCounter, 0 mSdLazyCounter, 386 mSolverCounterSat, 55 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 280 SdHoareTripleChecker+Valid, 723 SdHoareTripleChecker+Invalid, 441 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 55 IncrementalHoareTripleChecker+Valid, 386 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time [2024-11-20 08:41:58,556 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [280 Valid, 723 Invalid, 441 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [55 Valid, 386 Invalid, 0 Unknown, 0 Unchecked, 0.8s Time] [2024-11-20 08:41:58,557 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 397 states. [2024-11-20 08:41:58,585 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 397 to 281. [2024-11-20 08:41:58,586 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 281 states, 224 states have (on average 1.2678571428571428) internal successors, (284), 225 states have internal predecessors, (284), 48 states have call successors, (48), 8 states have call predecessors, (48), 8 states have return successors, (48), 47 states have call predecessors, (48), 48 states have call successors, (48) [2024-11-20 08:41:58,587 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 281 states to 281 states and 380 transitions. [2024-11-20 08:41:58,587 INFO L78 Accepts]: Start accepts. Automaton has 281 states and 380 transitions. Word has length 157 [2024-11-20 08:41:58,587 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-20 08:41:58,587 INFO L471 AbstractCegarLoop]: Abstraction has 281 states and 380 transitions. [2024-11-20 08:41:58,588 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 11 states have (on average 5.454545454545454) internal successors, (60), 12 states have internal predecessors, (60), 4 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 3 states have call predecessors, (20), 4 states have call successors, (20) [2024-11-20 08:41:58,588 INFO L276 IsEmpty]: Start isEmpty. Operand 281 states and 380 transitions. [2024-11-20 08:41:58,589 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 158 [2024-11-20 08:41:58,589 INFO L207 NwaCegarLoop]: Found error trace [2024-11-20 08:41:58,589 INFO L215 NwaCegarLoop]: trace histogram [20, 20, 20, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-20 08:41:58,589 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2024-11-20 08:41:58,590 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-20 08:41:58,590 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-20 08:41:58,590 INFO L85 PathProgramCache]: Analyzing trace with hash 1458031970, now seen corresponding path program 1 times [2024-11-20 08:41:58,590 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-20 08:41:58,590 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1542776736] [2024-11-20 08:41:58,590 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-20 08:41:58,590 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-20 08:41:58,614 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 08:41:59,962 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-20 08:41:59,964 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 08:41:59,969 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-11-20 08:41:59,970 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 08:41:59,975 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-11-20 08:41:59,976 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 08:41:59,981 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2024-11-20 08:41:59,982 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 08:41:59,987 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-11-20 08:41:59,988 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 08:41:59,995 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2024-11-20 08:41:59,996 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 08:42:00,001 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2024-11-20 08:42:00,002 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 08:42:00,006 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2024-11-20 08:42:00,008 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 08:42:00,012 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 53 [2024-11-20 08:42:00,014 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 08:42:00,018 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2024-11-20 08:42:00,020 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 08:42:00,025 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2024-11-20 08:42:00,026 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 08:42:00,031 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2024-11-20 08:42:00,032 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 08:42:00,037 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2024-11-20 08:42:00,038 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 08:42:00,043 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2024-11-20 08:42:00,045 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 08:42:00,049 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 89 [2024-11-20 08:42:00,050 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 08:42:00,054 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 95 [2024-11-20 08:42:00,055 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 08:42:00,058 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 101 [2024-11-20 08:42:00,059 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 08:42:00,062 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 107 [2024-11-20 08:42:00,063 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 08:42:00,067 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 113 [2024-11-20 08:42:00,068 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 08:42:00,074 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 119 [2024-11-20 08:42:00,076 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 08:42:00,083 INFO L134 CoverageAnalysis]: Checked inductivity of 760 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 760 trivial. 0 not checked. [2024-11-20 08:42:00,083 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-20 08:42:00,083 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1542776736] [2024-11-20 08:42:00,083 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1542776736] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-20 08:42:00,083 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-20 08:42:00,084 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2024-11-20 08:42:00,084 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1043617] [2024-11-20 08:42:00,084 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-20 08:42:00,084 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2024-11-20 08:42:00,084 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-20 08:42:00,085 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2024-11-20 08:42:00,085 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=37, Invalid=95, Unknown=0, NotChecked=0, Total=132 [2024-11-20 08:42:00,085 INFO L87 Difference]: Start difference. First operand 281 states and 380 transitions. Second operand has 12 states, 12 states have (on average 5.0) internal successors, (60), 12 states have internal predecessors, (60), 3 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 3 states have call predecessors, (20), 3 states have call successors, (20) [2024-11-20 08:42:01,243 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-20 08:42:01,243 INFO L93 Difference]: Finished difference Result 579 states and 790 transitions. [2024-11-20 08:42:01,244 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-11-20 08:42:01,244 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 12 states have (on average 5.0) internal successors, (60), 12 states have internal predecessors, (60), 3 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 3 states have call predecessors, (20), 3 states have call successors, (20) Word has length 157 [2024-11-20 08:42:01,245 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-20 08:42:01,247 INFO L225 Difference]: With dead ends: 579 [2024-11-20 08:42:01,247 INFO L226 Difference]: Without dead ends: 397 [2024-11-20 08:42:01,248 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 58 GetRequests, 44 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 36 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=73, Invalid=167, Unknown=0, NotChecked=0, Total=240 [2024-11-20 08:42:01,248 INFO L432 NwaCegarLoop]: 175 mSDtfsCounter, 209 mSDsluCounter, 556 mSDsCounter, 0 mSdLazyCounter, 420 mSolverCounterSat, 17 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 209 SdHoareTripleChecker+Valid, 731 SdHoareTripleChecker+Invalid, 437 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 17 IncrementalHoareTripleChecker+Valid, 420 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.9s IncrementalHoareTripleChecker+Time [2024-11-20 08:42:01,249 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [209 Valid, 731 Invalid, 437 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [17 Valid, 420 Invalid, 0 Unknown, 0 Unchecked, 0.9s Time] [2024-11-20 08:42:01,250 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 397 states. [2024-11-20 08:42:01,286 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 397 to 274. [2024-11-20 08:42:01,286 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 274 states, 217 states have (on average 1.2580645161290323) internal successors, (273), 218 states have internal predecessors, (273), 48 states have call successors, (48), 8 states have call predecessors, (48), 8 states have return successors, (48), 47 states have call predecessors, (48), 48 states have call successors, (48) [2024-11-20 08:42:01,287 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 274 states to 274 states and 369 transitions. [2024-11-20 08:42:01,288 INFO L78 Accepts]: Start accepts. Automaton has 274 states and 369 transitions. Word has length 157 [2024-11-20 08:42:01,289 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-20 08:42:01,289 INFO L471 AbstractCegarLoop]: Abstraction has 274 states and 369 transitions. [2024-11-20 08:42:01,289 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 5.0) internal successors, (60), 12 states have internal predecessors, (60), 3 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 3 states have call predecessors, (20), 3 states have call successors, (20) [2024-11-20 08:42:01,290 INFO L276 IsEmpty]: Start isEmpty. Operand 274 states and 369 transitions. [2024-11-20 08:42:01,290 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 158 [2024-11-20 08:42:01,291 INFO L207 NwaCegarLoop]: Found error trace [2024-11-20 08:42:01,291 INFO L215 NwaCegarLoop]: trace histogram [20, 20, 20, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-20 08:42:01,291 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2024-11-20 08:42:01,291 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-20 08:42:01,291 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-20 08:42:01,292 INFO L85 PathProgramCache]: Analyzing trace with hash 446914720, now seen corresponding path program 1 times [2024-11-20 08:42:01,292 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-20 08:42:01,292 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [670006647] [2024-11-20 08:42:01,292 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-20 08:42:01,292 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-20 08:42:01,373 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 08:42:05,621 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-20 08:42:05,623 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 08:42:05,632 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-11-20 08:42:05,633 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 08:42:05,640 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-11-20 08:42:05,641 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 08:42:05,648 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2024-11-20 08:42:05,649 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 08:42:05,655 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-11-20 08:42:05,656 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 08:42:05,661 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2024-11-20 08:42:05,662 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 08:42:05,669 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2024-11-20 08:42:05,670 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 08:42:05,676 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2024-11-20 08:42:05,677 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 08:42:05,685 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 53 [2024-11-20 08:42:05,687 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 08:42:05,692 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2024-11-20 08:42:05,693 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 08:42:05,699 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2024-11-20 08:42:05,700 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 08:42:05,706 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2024-11-20 08:42:05,708 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 08:42:05,714 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2024-11-20 08:42:05,716 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 08:42:05,726 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2024-11-20 08:42:05,728 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 08:42:05,916 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 89 [2024-11-20 08:42:05,919 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 08:42:05,925 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 95 [2024-11-20 08:42:05,927 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 08:42:05,933 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 101 [2024-11-20 08:42:05,935 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 08:42:05,940 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 107 [2024-11-20 08:42:05,942 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 08:42:05,948 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 113 [2024-11-20 08:42:05,949 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 08:42:05,955 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 119 [2024-11-20 08:42:05,957 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 08:42:05,963 INFO L134 CoverageAnalysis]: Checked inductivity of 760 backedges. 39 proven. 18 refuted. 0 times theorem prover too weak. 703 trivial. 0 not checked. [2024-11-20 08:42:05,964 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-20 08:42:05,964 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [670006647] [2024-11-20 08:42:05,964 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [670006647] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-20 08:42:05,964 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [739460094] [2024-11-20 08:42:05,964 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-20 08:42:05,964 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-20 08:42:05,964 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-20 08:42:05,970 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-20 08:42:05,971 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2024-11-20 08:42:06,120 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 08:42:06,123 INFO L255 TraceCheckSpWp]: Trace formula consists of 535 conjuncts, 37 conjuncts are in the unsatisfiable core [2024-11-20 08:42:06,129 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-20 08:42:08,710 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 8 treesize of output 1 [2024-11-20 08:42:08,900 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-20 08:42:08,901 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 65 treesize of output 41 [2024-11-20 08:42:09,249 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-20 08:42:09,249 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 81 treesize of output 69 [2024-11-20 08:42:09,453 INFO L134 CoverageAnalysis]: Checked inductivity of 760 backedges. 0 proven. 57 refuted. 0 times theorem prover too weak. 703 trivial. 0 not checked. [2024-11-20 08:42:09,453 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-20 08:42:10,086 INFO L134 CoverageAnalysis]: Checked inductivity of 760 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 760 trivial. 0 not checked. [2024-11-20 08:42:10,087 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [739460094] provided 1 perfect and 1 imperfect interpolant sequences [2024-11-20 08:42:10,087 INFO L185 FreeRefinementEngine]: Found 1 perfect and 2 imperfect interpolant sequences. [2024-11-20 08:42:10,087 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [27, 11] total 38 [2024-11-20 08:42:10,087 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1570191409] [2024-11-20 08:42:10,087 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-20 08:42:10,087 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-11-20 08:42:10,087 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-20 08:42:10,088 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-11-20 08:42:10,088 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=104, Invalid=1302, Unknown=0, NotChecked=0, Total=1406 [2024-11-20 08:42:10,088 INFO L87 Difference]: Start difference. First operand 274 states and 369 transitions. Second operand has 8 states, 8 states have (on average 7.5) internal successors, (60), 8 states have internal predecessors, (60), 1 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 1 states have call predecessors, (20), 1 states have call successors, (20) [2024-11-20 08:42:11,196 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-20 08:42:11,197 INFO L93 Difference]: Finished difference Result 516 states and 700 transitions. [2024-11-20 08:42:11,197 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-11-20 08:42:11,197 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 7.5) internal successors, (60), 8 states have internal predecessors, (60), 1 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 1 states have call predecessors, (20), 1 states have call successors, (20) Word has length 157 [2024-11-20 08:42:11,197 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-20 08:42:11,199 INFO L225 Difference]: With dead ends: 516 [2024-11-20 08:42:11,199 INFO L226 Difference]: Without dead ends: 337 [2024-11-20 08:42:11,199 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 381 GetRequests, 339 SyntacticMatches, 2 SemanticMatches, 40 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 409 ImplicationChecksByTransitivity, 3.5s TimeCoverageRelationStatistics Valid=122, Invalid=1600, Unknown=0, NotChecked=0, Total=1722 [2024-11-20 08:42:11,200 INFO L432 NwaCegarLoop]: 217 mSDtfsCounter, 79 mSDsluCounter, 1070 mSDsCounter, 0 mSdLazyCounter, 263 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 79 SdHoareTripleChecker+Valid, 1287 SdHoareTripleChecker+Invalid, 264 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 263 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2024-11-20 08:42:11,200 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [79 Valid, 1287 Invalid, 264 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 263 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2024-11-20 08:42:11,201 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 337 states. [2024-11-20 08:42:11,234 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 337 to 274. [2024-11-20 08:42:11,235 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 274 states, 217 states have (on average 1.2580645161290323) internal successors, (273), 218 states have internal predecessors, (273), 48 states have call successors, (48), 8 states have call predecessors, (48), 8 states have return successors, (48), 47 states have call predecessors, (48), 48 states have call successors, (48) [2024-11-20 08:42:11,238 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 274 states to 274 states and 369 transitions. [2024-11-20 08:42:11,239 INFO L78 Accepts]: Start accepts. Automaton has 274 states and 369 transitions. Word has length 157 [2024-11-20 08:42:11,240 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-20 08:42:11,240 INFO L471 AbstractCegarLoop]: Abstraction has 274 states and 369 transitions. [2024-11-20 08:42:11,241 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 7.5) internal successors, (60), 8 states have internal predecessors, (60), 1 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 1 states have call predecessors, (20), 1 states have call successors, (20) [2024-11-20 08:42:11,241 INFO L276 IsEmpty]: Start isEmpty. Operand 274 states and 369 transitions. [2024-11-20 08:42:11,241 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 158 [2024-11-20 08:42:11,241 INFO L207 NwaCegarLoop]: Found error trace [2024-11-20 08:42:11,241 INFO L215 NwaCegarLoop]: trace histogram [20, 20, 20, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-20 08:42:11,251 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2024-11-20 08:42:11,442 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable8 [2024-11-20 08:42:11,442 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-20 08:42:11,442 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-20 08:42:11,443 INFO L85 PathProgramCache]: Analyzing trace with hash -141190746, now seen corresponding path program 1 times [2024-11-20 08:42:11,443 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-20 08:42:11,443 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1738366468] [2024-11-20 08:42:11,443 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-20 08:42:11,443 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-20 08:42:11,505 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 08:42:14,670 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-20 08:42:14,673 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 08:42:14,678 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-11-20 08:42:14,680 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 08:42:14,686 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-11-20 08:42:14,687 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 08:42:14,693 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2024-11-20 08:42:14,694 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 08:42:14,701 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-11-20 08:42:14,702 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 08:42:14,707 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2024-11-20 08:42:14,708 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 08:42:14,715 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2024-11-20 08:42:14,716 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 08:42:14,722 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2024-11-20 08:42:14,723 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 08:42:14,731 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 53 [2024-11-20 08:42:14,732 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 08:42:14,738 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2024-11-20 08:42:14,739 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 08:42:14,744 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2024-11-20 08:42:14,746 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 08:42:14,751 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2024-11-20 08:42:14,752 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 08:42:14,763 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2024-11-20 08:42:14,764 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 08:42:14,773 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2024-11-20 08:42:14,778 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 08:42:14,784 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 89 [2024-11-20 08:42:14,785 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 08:42:14,790 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 95 [2024-11-20 08:42:14,791 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 08:42:14,796 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 101 [2024-11-20 08:42:14,797 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 08:42:14,801 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 107 [2024-11-20 08:42:14,802 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 08:42:14,807 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 113 [2024-11-20 08:42:14,808 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 08:42:14,813 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 119 [2024-11-20 08:42:14,814 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 08:42:14,820 INFO L134 CoverageAnalysis]: Checked inductivity of 760 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 760 trivial. 0 not checked. [2024-11-20 08:42:14,820 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-20 08:42:14,820 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1738366468] [2024-11-20 08:42:14,820 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1738366468] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-20 08:42:14,820 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-20 08:42:14,820 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [21] imperfect sequences [] total 21 [2024-11-20 08:42:14,820 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2075296163] [2024-11-20 08:42:14,820 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-20 08:42:14,821 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 21 states [2024-11-20 08:42:14,822 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-20 08:42:14,822 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2024-11-20 08:42:14,822 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=48, Invalid=372, Unknown=0, NotChecked=0, Total=420 [2024-11-20 08:42:14,822 INFO L87 Difference]: Start difference. First operand 274 states and 369 transitions. Second operand has 21 states, 21 states have (on average 2.857142857142857) internal successors, (60), 21 states have internal predecessors, (60), 5 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 5 states have call predecessors, (20), 5 states have call successors, (20) [2024-11-20 08:42:20,801 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-20 08:42:20,801 INFO L93 Difference]: Finished difference Result 712 states and 968 transitions. [2024-11-20 08:42:20,802 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2024-11-20 08:42:20,802 INFO L78 Accepts]: Start accepts. Automaton has has 21 states, 21 states have (on average 2.857142857142857) internal successors, (60), 21 states have internal predecessors, (60), 5 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 5 states have call predecessors, (20), 5 states have call successors, (20) Word has length 157 [2024-11-20 08:42:20,802 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-20 08:42:20,804 INFO L225 Difference]: With dead ends: 712 [2024-11-20 08:42:20,804 INFO L226 Difference]: Without dead ends: 532 [2024-11-20 08:42:20,805 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 79 GetRequests, 42 SyntacticMatches, 0 SemanticMatches, 37 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 234 ImplicationChecksByTransitivity, 3.3s TimeCoverageRelationStatistics Valid=250, Invalid=1232, Unknown=0, NotChecked=0, Total=1482 [2024-11-20 08:42:20,806 INFO L432 NwaCegarLoop]: 249 mSDtfsCounter, 613 mSDsluCounter, 2808 mSDsCounter, 0 mSdLazyCounter, 1985 mSolverCounterSat, 196 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 3.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 613 SdHoareTripleChecker+Valid, 3057 SdHoareTripleChecker+Invalid, 2181 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 196 IncrementalHoareTripleChecker+Valid, 1985 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 3.7s IncrementalHoareTripleChecker+Time [2024-11-20 08:42:20,806 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [613 Valid, 3057 Invalid, 2181 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [196 Valid, 1985 Invalid, 0 Unknown, 0 Unchecked, 3.7s Time] [2024-11-20 08:42:20,807 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 532 states. [2024-11-20 08:42:20,843 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 532 to 274. [2024-11-20 08:42:20,843 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 274 states, 217 states have (on average 1.2580645161290323) internal successors, (273), 218 states have internal predecessors, (273), 48 states have call successors, (48), 8 states have call predecessors, (48), 8 states have return successors, (48), 47 states have call predecessors, (48), 48 states have call successors, (48) [2024-11-20 08:42:20,844 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 274 states to 274 states and 369 transitions. [2024-11-20 08:42:20,844 INFO L78 Accepts]: Start accepts. Automaton has 274 states and 369 transitions. Word has length 157 [2024-11-20 08:42:20,845 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-20 08:42:20,845 INFO L471 AbstractCegarLoop]: Abstraction has 274 states and 369 transitions. [2024-11-20 08:42:20,845 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 21 states, 21 states have (on average 2.857142857142857) internal successors, (60), 21 states have internal predecessors, (60), 5 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 5 states have call predecessors, (20), 5 states have call successors, (20) [2024-11-20 08:42:20,845 INFO L276 IsEmpty]: Start isEmpty. Operand 274 states and 369 transitions. [2024-11-20 08:42:20,846 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 159 [2024-11-20 08:42:20,846 INFO L207 NwaCegarLoop]: Found error trace [2024-11-20 08:42:20,846 INFO L215 NwaCegarLoop]: trace histogram [20, 20, 20, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-20 08:42:20,846 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2024-11-20 08:42:20,846 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-20 08:42:20,846 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-20 08:42:20,847 INFO L85 PathProgramCache]: Analyzing trace with hash 252308769, now seen corresponding path program 1 times [2024-11-20 08:42:20,847 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-20 08:42:20,847 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1583103772] [2024-11-20 08:42:20,847 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-20 08:42:20,847 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-20 08:42:20,866 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 08:42:21,323 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-20 08:42:21,325 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 08:42:21,327 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-11-20 08:42:21,328 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 08:42:21,329 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-11-20 08:42:21,330 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 08:42:21,332 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2024-11-20 08:42:21,333 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 08:42:21,335 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-11-20 08:42:21,336 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 08:42:21,337 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2024-11-20 08:42:21,338 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 08:42:21,340 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2024-11-20 08:42:21,341 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 08:42:21,342 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2024-11-20 08:42:21,343 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 08:42:21,344 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 53 [2024-11-20 08:42:21,345 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 08:42:21,347 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2024-11-20 08:42:21,347 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 08:42:21,348 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2024-11-20 08:42:21,349 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 08:42:21,350 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2024-11-20 08:42:21,351 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 08:42:21,352 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2024-11-20 08:42:21,353 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 08:42:21,354 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2024-11-20 08:42:21,355 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 08:42:21,356 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 89 [2024-11-20 08:42:21,358 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 08:42:21,360 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 95 [2024-11-20 08:42:21,361 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 08:42:21,362 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 101 [2024-11-20 08:42:21,362 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 08:42:21,363 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 107 [2024-11-20 08:42:21,364 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 08:42:21,365 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 113 [2024-11-20 08:42:21,366 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 08:42:21,367 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 119 [2024-11-20 08:42:21,368 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 08:42:21,370 INFO L134 CoverageAnalysis]: Checked inductivity of 760 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 760 trivial. 0 not checked. [2024-11-20 08:42:21,370 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-20 08:42:21,371 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1583103772] [2024-11-20 08:42:21,371 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1583103772] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-20 08:42:21,371 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-20 08:42:21,371 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2024-11-20 08:42:21,371 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1386797161] [2024-11-20 08:42:21,371 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-20 08:42:21,371 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-11-20 08:42:21,371 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-20 08:42:21,372 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-11-20 08:42:21,372 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=52, Unknown=0, NotChecked=0, Total=72 [2024-11-20 08:42:21,372 INFO L87 Difference]: Start difference. First operand 274 states and 369 transitions. Second operand has 9 states, 9 states have (on average 6.777777777777778) internal successors, (61), 9 states have internal predecessors, (61), 2 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 2 states have call predecessors, (20), 2 states have call successors, (20) [2024-11-20 08:42:22,131 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-20 08:42:22,132 INFO L93 Difference]: Finished difference Result 577 states and 789 transitions. [2024-11-20 08:42:22,132 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-11-20 08:42:22,132 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 6.777777777777778) internal successors, (61), 9 states have internal predecessors, (61), 2 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 2 states have call predecessors, (20), 2 states have call successors, (20) Word has length 158 [2024-11-20 08:42:22,133 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-20 08:42:22,134 INFO L225 Difference]: With dead ends: 577 [2024-11-20 08:42:22,134 INFO L226 Difference]: Without dead ends: 397 [2024-11-20 08:42:22,135 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 52 GetRequests, 41 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 17 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=44, Invalid=112, Unknown=0, NotChecked=0, Total=156 [2024-11-20 08:42:22,135 INFO L432 NwaCegarLoop]: 118 mSDtfsCounter, 466 mSDsluCounter, 337 mSDsCounter, 0 mSdLazyCounter, 319 mSolverCounterSat, 21 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 466 SdHoareTripleChecker+Valid, 455 SdHoareTripleChecker+Invalid, 340 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 21 IncrementalHoareTripleChecker+Valid, 319 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2024-11-20 08:42:22,135 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [466 Valid, 455 Invalid, 340 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [21 Valid, 319 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2024-11-20 08:42:22,139 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 397 states. [2024-11-20 08:42:22,184 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 397 to 316. [2024-11-20 08:42:22,185 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 316 states, 259 states have (on average 1.2857142857142858) internal successors, (333), 260 states have internal predecessors, (333), 48 states have call successors, (48), 8 states have call predecessors, (48), 8 states have return successors, (48), 47 states have call predecessors, (48), 48 states have call successors, (48) [2024-11-20 08:42:22,186 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 316 states to 316 states and 429 transitions. [2024-11-20 08:42:22,186 INFO L78 Accepts]: Start accepts. Automaton has 316 states and 429 transitions. Word has length 158 [2024-11-20 08:42:22,188 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-20 08:42:22,188 INFO L471 AbstractCegarLoop]: Abstraction has 316 states and 429 transitions. [2024-11-20 08:42:22,188 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 6.777777777777778) internal successors, (61), 9 states have internal predecessors, (61), 2 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 2 states have call predecessors, (20), 2 states have call successors, (20) [2024-11-20 08:42:22,188 INFO L276 IsEmpty]: Start isEmpty. Operand 316 states and 429 transitions. [2024-11-20 08:42:22,189 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 159 [2024-11-20 08:42:22,189 INFO L207 NwaCegarLoop]: Found error trace [2024-11-20 08:42:22,190 INFO L215 NwaCegarLoop]: trace histogram [20, 20, 20, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-20 08:42:22,190 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2024-11-20 08:42:22,190 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-20 08:42:22,190 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-20 08:42:22,190 INFO L85 PathProgramCache]: Analyzing trace with hash -1027554909, now seen corresponding path program 1 times [2024-11-20 08:42:22,190 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-20 08:42:22,191 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1731198038] [2024-11-20 08:42:22,191 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-20 08:42:22,191 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-20 08:42:22,212 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 08:42:22,882 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-20 08:42:22,884 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 08:42:22,886 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-11-20 08:42:22,886 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 08:42:22,888 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-11-20 08:42:22,889 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 08:42:22,891 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2024-11-20 08:42:22,892 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 08:42:22,897 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-11-20 08:42:22,898 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 08:42:22,899 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2024-11-20 08:42:22,900 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 08:42:22,902 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2024-11-20 08:42:22,903 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 08:42:22,905 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2024-11-20 08:42:22,905 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 08:42:22,908 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 53 [2024-11-20 08:42:22,909 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 08:42:22,911 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2024-11-20 08:42:22,911 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 08:42:22,914 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2024-11-20 08:42:22,915 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 08:42:22,916 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2024-11-20 08:42:22,917 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 08:42:22,921 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2024-11-20 08:42:22,922 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 08:42:22,924 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2024-11-20 08:42:22,925 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 08:42:22,927 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 89 [2024-11-20 08:42:22,928 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 08:42:22,929 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 95 [2024-11-20 08:42:22,930 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 08:42:22,931 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 101 [2024-11-20 08:42:22,932 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 08:42:22,934 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 107 [2024-11-20 08:42:22,934 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 08:42:22,936 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 113 [2024-11-20 08:42:22,937 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 08:42:22,938 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 119 [2024-11-20 08:42:22,939 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 08:42:22,941 INFO L134 CoverageAnalysis]: Checked inductivity of 760 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 760 trivial. 0 not checked. [2024-11-20 08:42:22,942 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-20 08:42:22,942 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1731198038] [2024-11-20 08:42:22,942 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1731198038] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-20 08:42:22,942 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-20 08:42:22,942 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-11-20 08:42:22,942 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [398484844] [2024-11-20 08:42:22,942 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-20 08:42:22,943 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-11-20 08:42:22,943 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-20 08:42:22,943 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-11-20 08:42:22,944 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2024-11-20 08:42:22,944 INFO L87 Difference]: Start difference. First operand 316 states and 429 transitions. Second operand has 8 states, 8 states have (on average 7.625) internal successors, (61), 8 states have internal predecessors, (61), 2 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 2 states have call predecessors, (20), 2 states have call successors, (20) [2024-11-20 08:42:23,845 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-20 08:42:23,845 INFO L93 Difference]: Finished difference Result 651 states and 890 transitions. [2024-11-20 08:42:23,846 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-20 08:42:23,846 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 7.625) internal successors, (61), 8 states have internal predecessors, (61), 2 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 2 states have call predecessors, (20), 2 states have call successors, (20) Word has length 158 [2024-11-20 08:42:23,846 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-20 08:42:23,848 INFO L225 Difference]: With dead ends: 651 [2024-11-20 08:42:23,848 INFO L226 Difference]: Without dead ends: 450 [2024-11-20 08:42:23,849 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 54 GetRequests, 45 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 11 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=36, Invalid=74, Unknown=0, NotChecked=0, Total=110 [2024-11-20 08:42:23,849 INFO L432 NwaCegarLoop]: 148 mSDtfsCounter, 455 mSDsluCounter, 323 mSDsCounter, 0 mSdLazyCounter, 227 mSolverCounterSat, 71 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 455 SdHoareTripleChecker+Valid, 471 SdHoareTripleChecker+Invalid, 298 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 71 IncrementalHoareTripleChecker+Valid, 227 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2024-11-20 08:42:23,850 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [455 Valid, 471 Invalid, 298 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [71 Valid, 227 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2024-11-20 08:42:23,850 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 450 states. [2024-11-20 08:42:23,892 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 450 to 330. [2024-11-20 08:42:23,893 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 330 states, 273 states have (on average 1.2967032967032968) internal successors, (354), 274 states have internal predecessors, (354), 48 states have call successors, (48), 8 states have call predecessors, (48), 8 states have return successors, (48), 47 states have call predecessors, (48), 48 states have call successors, (48) [2024-11-20 08:42:23,894 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 330 states to 330 states and 450 transitions. [2024-11-20 08:42:23,894 INFO L78 Accepts]: Start accepts. Automaton has 330 states and 450 transitions. Word has length 158 [2024-11-20 08:42:23,895 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-20 08:42:23,895 INFO L471 AbstractCegarLoop]: Abstraction has 330 states and 450 transitions. [2024-11-20 08:42:23,895 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 7.625) internal successors, (61), 8 states have internal predecessors, (61), 2 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 2 states have call predecessors, (20), 2 states have call successors, (20) [2024-11-20 08:42:23,895 INFO L276 IsEmpty]: Start isEmpty. Operand 330 states and 450 transitions. [2024-11-20 08:42:23,897 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 159 [2024-11-20 08:42:23,897 INFO L207 NwaCegarLoop]: Found error trace [2024-11-20 08:42:23,897 INFO L215 NwaCegarLoop]: trace histogram [20, 20, 20, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-20 08:42:23,897 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2024-11-20 08:42:23,897 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-20 08:42:23,897 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-20 08:42:23,897 INFO L85 PathProgramCache]: Analyzing trace with hash 1887476210, now seen corresponding path program 1 times [2024-11-20 08:42:23,897 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-20 08:42:23,898 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [675002863] [2024-11-20 08:42:23,898 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-20 08:42:23,898 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-20 08:42:23,952 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 08:42:27,992 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-20 08:42:27,994 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 08:42:27,999 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-11-20 08:42:28,000 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 08:42:28,005 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-11-20 08:42:28,006 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 08:42:28,013 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2024-11-20 08:42:28,015 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 08:42:28,019 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-11-20 08:42:28,020 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 08:42:28,024 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2024-11-20 08:42:28,025 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 08:42:28,030 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2024-11-20 08:42:28,031 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 08:42:28,035 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2024-11-20 08:42:28,036 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 08:42:28,045 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 53 [2024-11-20 08:42:28,046 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 08:42:28,050 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2024-11-20 08:42:28,052 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 08:42:28,056 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2024-11-20 08:42:28,057 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 08:42:28,062 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2024-11-20 08:42:28,063 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 08:42:28,199 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2024-11-20 08:42:28,201 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 08:42:28,220 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2024-11-20 08:42:28,222 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 08:42:28,228 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 89 [2024-11-20 08:42:28,231 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 08:42:28,250 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 95 [2024-11-20 08:42:28,252 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 08:42:28,258 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 101 [2024-11-20 08:42:28,259 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 08:42:28,266 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 107 [2024-11-20 08:42:28,267 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 08:42:28,271 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 113 [2024-11-20 08:42:28,273 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 08:42:28,277 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 119 [2024-11-20 08:42:28,278 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 08:42:28,282 INFO L134 CoverageAnalysis]: Checked inductivity of 760 backedges. 102 proven. 51 refuted. 0 times theorem prover too weak. 607 trivial. 0 not checked. [2024-11-20 08:42:28,282 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-20 08:42:28,282 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [675002863] [2024-11-20 08:42:28,282 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [675002863] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-20 08:42:28,282 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [155114927] [2024-11-20 08:42:28,283 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-20 08:42:28,283 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-20 08:42:28,283 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-20 08:42:28,285 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-20 08:42:28,286 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2024-11-20 08:42:28,423 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 08:42:28,425 INFO L255 TraceCheckSpWp]: Trace formula consists of 539 conjuncts, 25 conjuncts are in the unsatisfiable core [2024-11-20 08:42:28,429 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-20 08:42:28,721 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-11-20 08:42:29,243 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-11-20 08:42:29,437 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-11-20 08:42:30,351 INFO L134 CoverageAnalysis]: Checked inductivity of 760 backedges. 33 proven. 345 refuted. 0 times theorem prover too weak. 382 trivial. 0 not checked. [2024-11-20 08:42:30,352 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-20 08:42:30,870 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [155114927] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-20 08:42:30,870 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-11-20 08:42:30,870 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [23, 8] total 30 [2024-11-20 08:42:30,871 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [835034193] [2024-11-20 08:42:30,871 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-11-20 08:42:30,871 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 30 states [2024-11-20 08:42:30,871 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-20 08:42:30,872 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 30 interpolants. [2024-11-20 08:42:30,872 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=87, Invalid=905, Unknown=0, NotChecked=0, Total=992 [2024-11-20 08:42:30,872 INFO L87 Difference]: Start difference. First operand 330 states and 450 transitions. Second operand has 30 states, 25 states have (on average 4.96) internal successors, (124), 28 states have internal predecessors, (124), 11 states have call successors, (40), 4 states have call predecessors, (40), 6 states have return successors, (40), 8 states have call predecessors, (40), 11 states have call successors, (40) [2024-11-20 08:42:42,659 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-20 08:42:42,659 INFO L93 Difference]: Finished difference Result 736 states and 974 transitions. [2024-11-20 08:42:42,659 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 57 states. [2024-11-20 08:42:42,660 INFO L78 Accepts]: Start accepts. Automaton has has 30 states, 25 states have (on average 4.96) internal successors, (124), 28 states have internal predecessors, (124), 11 states have call successors, (40), 4 states have call predecessors, (40), 6 states have return successors, (40), 8 states have call predecessors, (40), 11 states have call successors, (40) Word has length 158 [2024-11-20 08:42:42,660 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-20 08:42:42,662 INFO L225 Difference]: With dead ends: 736 [2024-11-20 08:42:42,663 INFO L226 Difference]: Without dead ends: 505 [2024-11-20 08:42:42,665 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 403 GetRequests, 318 SyntacticMatches, 0 SemanticMatches, 85 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1811 ImplicationChecksByTransitivity, 9.7s TimeCoverageRelationStatistics Valid=1023, Invalid=6459, Unknown=0, NotChecked=0, Total=7482 [2024-11-20 08:42:42,665 INFO L432 NwaCegarLoop]: 128 mSDtfsCounter, 647 mSDsluCounter, 1953 mSDsCounter, 0 mSdLazyCounter, 2552 mSolverCounterSat, 227 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 4.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 647 SdHoareTripleChecker+Valid, 2081 SdHoareTripleChecker+Invalid, 2779 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 227 IncrementalHoareTripleChecker+Valid, 2552 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 4.2s IncrementalHoareTripleChecker+Time [2024-11-20 08:42:42,665 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [647 Valid, 2081 Invalid, 2779 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [227 Valid, 2552 Invalid, 0 Unknown, 0 Unchecked, 4.2s Time] [2024-11-20 08:42:42,667 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 505 states. [2024-11-20 08:42:42,737 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 505 to 393. [2024-11-20 08:42:42,738 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 393 states, 316 states have (on average 1.2468354430379747) internal successors, (394), 318 states have internal predecessors, (394), 58 states have call successors, (58), 18 states have call predecessors, (58), 18 states have return successors, (58), 56 states have call predecessors, (58), 58 states have call successors, (58) [2024-11-20 08:42:42,739 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 393 states to 393 states and 510 transitions. [2024-11-20 08:42:42,740 INFO L78 Accepts]: Start accepts. Automaton has 393 states and 510 transitions. Word has length 158 [2024-11-20 08:42:42,740 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-20 08:42:42,740 INFO L471 AbstractCegarLoop]: Abstraction has 393 states and 510 transitions. [2024-11-20 08:42:42,741 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 30 states, 25 states have (on average 4.96) internal successors, (124), 28 states have internal predecessors, (124), 11 states have call successors, (40), 4 states have call predecessors, (40), 6 states have return successors, (40), 8 states have call predecessors, (40), 11 states have call successors, (40) [2024-11-20 08:42:42,741 INFO L276 IsEmpty]: Start isEmpty. Operand 393 states and 510 transitions. [2024-11-20 08:42:42,741 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 159 [2024-11-20 08:42:42,741 INFO L207 NwaCegarLoop]: Found error trace [2024-11-20 08:42:42,742 INFO L215 NwaCegarLoop]: trace histogram [20, 20, 20, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-20 08:42:42,753 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Ended with exit code 0 [2024-11-20 08:42:42,942 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-20 08:42:42,942 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-20 08:42:42,942 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-20 08:42:42,943 INFO L85 PathProgramCache]: Analyzing trace with hash 527068383, now seen corresponding path program 1 times [2024-11-20 08:42:42,943 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-20 08:42:42,943 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1202148749] [2024-11-20 08:42:42,943 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-20 08:42:42,943 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-20 08:42:42,961 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 08:42:43,397 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-20 08:42:43,398 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 08:42:43,400 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-11-20 08:42:43,401 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 08:42:43,402 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-11-20 08:42:43,403 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 08:42:43,404 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2024-11-20 08:42:43,405 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 08:42:43,406 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-11-20 08:42:43,407 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 08:42:43,409 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2024-11-20 08:42:43,409 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 08:42:43,411 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2024-11-20 08:42:43,411 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 08:42:43,413 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2024-11-20 08:42:43,413 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 08:42:43,415 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 53 [2024-11-20 08:42:43,415 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 08:42:43,417 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2024-11-20 08:42:43,418 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 08:42:43,419 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2024-11-20 08:42:43,420 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 08:42:43,421 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2024-11-20 08:42:43,422 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 08:42:43,424 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2024-11-20 08:42:43,424 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 08:42:43,426 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2024-11-20 08:42:43,426 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 08:42:43,428 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 89 [2024-11-20 08:42:43,428 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 08:42:43,430 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 95 [2024-11-20 08:42:43,430 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 08:42:43,432 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 101 [2024-11-20 08:42:43,432 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 08:42:43,433 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 107 [2024-11-20 08:42:43,434 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 08:42:43,435 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 113 [2024-11-20 08:42:43,435 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 08:42:43,437 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 119 [2024-11-20 08:42:43,437 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 08:42:43,439 INFO L134 CoverageAnalysis]: Checked inductivity of 760 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 760 trivial. 0 not checked. [2024-11-20 08:42:43,439 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-20 08:42:43,439 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1202148749] [2024-11-20 08:42:43,439 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1202148749] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-20 08:42:43,439 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-20 08:42:43,439 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-11-20 08:42:43,439 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [25832773] [2024-11-20 08:42:43,440 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-20 08:42:43,440 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-11-20 08:42:43,440 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-20 08:42:43,440 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-11-20 08:42:43,441 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2024-11-20 08:42:43,441 INFO L87 Difference]: Start difference. First operand 393 states and 510 transitions. Second operand has 8 states, 8 states have (on average 7.625) internal successors, (61), 8 states have internal predecessors, (61), 2 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 2 states have call predecessors, (20), 2 states have call successors, (20) [2024-11-20 08:42:44,267 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-20 08:42:44,268 INFO L93 Difference]: Finished difference Result 759 states and 992 transitions. [2024-11-20 08:42:44,268 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-20 08:42:44,268 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 7.625) internal successors, (61), 8 states have internal predecessors, (61), 2 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 2 states have call predecessors, (20), 2 states have call successors, (20) Word has length 158 [2024-11-20 08:42:44,269 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-20 08:42:44,270 INFO L225 Difference]: With dead ends: 759 [2024-11-20 08:42:44,270 INFO L226 Difference]: Without dead ends: 462 [2024-11-20 08:42:44,271 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 51 GetRequests, 42 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 11 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=36, Invalid=74, Unknown=0, NotChecked=0, Total=110 [2024-11-20 08:42:44,271 INFO L432 NwaCegarLoop]: 185 mSDtfsCounter, 411 mSDsluCounter, 379 mSDsCounter, 0 mSdLazyCounter, 268 mSolverCounterSat, 53 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 411 SdHoareTripleChecker+Valid, 564 SdHoareTripleChecker+Invalid, 321 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 53 IncrementalHoareTripleChecker+Valid, 268 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2024-11-20 08:42:44,272 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [411 Valid, 564 Invalid, 321 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [53 Valid, 268 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2024-11-20 08:42:44,272 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 462 states. [2024-11-20 08:42:44,339 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 462 to 309. [2024-11-20 08:42:44,340 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 309 states, 246 states have (on average 1.2276422764227641) internal successors, (302), 248 states have internal predecessors, (302), 46 states have call successors, (46), 16 states have call predecessors, (46), 16 states have return successors, (46), 44 states have call predecessors, (46), 46 states have call successors, (46) [2024-11-20 08:42:44,341 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 309 states to 309 states and 394 transitions. [2024-11-20 08:42:44,341 INFO L78 Accepts]: Start accepts. Automaton has 309 states and 394 transitions. Word has length 158 [2024-11-20 08:42:44,342 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-20 08:42:44,342 INFO L471 AbstractCegarLoop]: Abstraction has 309 states and 394 transitions. [2024-11-20 08:42:44,343 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 7.625) internal successors, (61), 8 states have internal predecessors, (61), 2 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 2 states have call predecessors, (20), 2 states have call successors, (20) [2024-11-20 08:42:44,343 INFO L276 IsEmpty]: Start isEmpty. Operand 309 states and 394 transitions. [2024-11-20 08:42:44,343 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 159 [2024-11-20 08:42:44,343 INFO L207 NwaCegarLoop]: Found error trace [2024-11-20 08:42:44,344 INFO L215 NwaCegarLoop]: trace histogram [20, 20, 20, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-20 08:42:44,344 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2024-11-20 08:42:44,344 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-20 08:42:44,344 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-20 08:42:44,344 INFO L85 PathProgramCache]: Analyzing trace with hash -752795295, now seen corresponding path program 1 times [2024-11-20 08:42:44,344 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-20 08:42:44,344 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1974159088] [2024-11-20 08:42:44,344 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-20 08:42:44,344 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-20 08:42:44,360 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 08:42:44,656 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-20 08:42:44,657 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 08:42:44,658 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-11-20 08:42:44,659 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 08:42:44,660 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-11-20 08:42:44,660 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 08:42:44,661 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2024-11-20 08:42:44,662 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 08:42:44,663 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-11-20 08:42:44,664 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 08:42:44,665 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2024-11-20 08:42:44,666 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 08:42:44,667 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2024-11-20 08:42:44,668 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 08:42:44,668 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2024-11-20 08:42:44,669 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 08:42:44,670 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 53 [2024-11-20 08:42:44,671 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 08:42:44,672 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2024-11-20 08:42:44,674 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 08:42:44,675 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2024-11-20 08:42:44,676 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 08:42:44,677 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2024-11-20 08:42:44,678 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 08:42:44,679 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2024-11-20 08:42:44,679 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 08:42:44,680 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2024-11-20 08:42:44,681 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 08:42:44,682 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 89 [2024-11-20 08:42:44,682 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 08:42:44,683 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 95 [2024-11-20 08:42:44,684 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 08:42:44,684 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 101 [2024-11-20 08:42:44,685 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 08:42:44,685 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 107 [2024-11-20 08:42:44,686 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 08:42:44,687 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 113 [2024-11-20 08:42:44,687 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 08:42:44,688 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 119 [2024-11-20 08:42:44,689 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 08:42:44,690 INFO L134 CoverageAnalysis]: Checked inductivity of 760 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 760 trivial. 0 not checked. [2024-11-20 08:42:44,690 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-20 08:42:44,690 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1974159088] [2024-11-20 08:42:44,690 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1974159088] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-20 08:42:44,690 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-20 08:42:44,690 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2024-11-20 08:42:44,690 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [483066054] [2024-11-20 08:42:44,690 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-20 08:42:44,691 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-11-20 08:42:44,691 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-20 08:42:44,691 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-11-20 08:42:44,691 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=52, Unknown=0, NotChecked=0, Total=72 [2024-11-20 08:42:44,691 INFO L87 Difference]: Start difference. First operand 309 states and 394 transitions. Second operand has 9 states, 9 states have (on average 6.777777777777778) internal successors, (61), 9 states have internal predecessors, (61), 2 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 2 states have call predecessors, (20), 2 states have call successors, (20) [2024-11-20 08:42:45,521 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-20 08:42:45,521 INFO L93 Difference]: Finished difference Result 602 states and 779 transitions. [2024-11-20 08:42:45,522 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-11-20 08:42:45,522 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 6.777777777777778) internal successors, (61), 9 states have internal predecessors, (61), 2 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 2 states have call predecessors, (20), 2 states have call successors, (20) Word has length 158 [2024-11-20 08:42:45,522 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-20 08:42:45,523 INFO L225 Difference]: With dead ends: 602 [2024-11-20 08:42:45,523 INFO L226 Difference]: Without dead ends: 357 [2024-11-20 08:42:45,524 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 52 GetRequests, 41 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 17 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=44, Invalid=112, Unknown=0, NotChecked=0, Total=156 [2024-11-20 08:42:45,524 INFO L432 NwaCegarLoop]: 176 mSDtfsCounter, 170 mSDsluCounter, 546 mSDsCounter, 0 mSdLazyCounter, 452 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 170 SdHoareTripleChecker+Valid, 722 SdHoareTripleChecker+Invalid, 453 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 452 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2024-11-20 08:42:45,524 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [170 Valid, 722 Invalid, 453 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 452 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2024-11-20 08:42:45,525 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 357 states. [2024-11-20 08:42:45,590 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 357 to 327. [2024-11-20 08:42:45,591 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 327 states, 264 states have (on average 1.2348484848484849) internal successors, (326), 266 states have internal predecessors, (326), 46 states have call successors, (46), 16 states have call predecessors, (46), 16 states have return successors, (46), 44 states have call predecessors, (46), 46 states have call successors, (46) [2024-11-20 08:42:45,591 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 327 states to 327 states and 418 transitions. [2024-11-20 08:42:45,592 INFO L78 Accepts]: Start accepts. Automaton has 327 states and 418 transitions. Word has length 158 [2024-11-20 08:42:45,592 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-20 08:42:45,592 INFO L471 AbstractCegarLoop]: Abstraction has 327 states and 418 transitions. [2024-11-20 08:42:45,592 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 6.777777777777778) internal successors, (61), 9 states have internal predecessors, (61), 2 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 2 states have call predecessors, (20), 2 states have call successors, (20) [2024-11-20 08:42:45,592 INFO L276 IsEmpty]: Start isEmpty. Operand 327 states and 418 transitions. [2024-11-20 08:42:45,593 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 160 [2024-11-20 08:42:45,593 INFO L207 NwaCegarLoop]: Found error trace [2024-11-20 08:42:45,593 INFO L215 NwaCegarLoop]: trace histogram [20, 20, 20, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-20 08:42:45,593 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2024-11-20 08:42:45,593 INFO L396 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-20 08:42:45,593 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-20 08:42:45,594 INFO L85 PathProgramCache]: Analyzing trace with hash -1008765421, now seen corresponding path program 1 times [2024-11-20 08:42:45,594 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-20 08:42:45,594 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [895373745] [2024-11-20 08:42:45,594 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-20 08:42:45,594 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-20 08:42:45,644 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat